Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
Authors:
- Brenda CheangBCBrenda Cheang
- Xiang GaoXGXiang Gao
- Andrew LimALAndrew Lim
- Hu QinHQHu Qin
- Wenbin ZhuWZWenbin Zhu
- 1 November 2012
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 223 (1) , 60-75
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loadingEuropean Journal of Operational Research, 2011
- Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraintsEuropean Journal of Operational Research, 2011
- Exact solutions to the double travelling salesman problem with multiple stacksNetworks, 2010
- An exact method for the double TSP with multiple stacksInternational Transactions in Operational Research, 2010
- A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loadingNetworks, 2009
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approachComputers & Operations Research, 2009
- The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithmMathematical Programming, 2008
- A heuristic for the pickup and delivery traveling salesman problemComputers & Operations Research, 2000
- Variable neighborhood searchComputers & Operations Research, 1997
- Optimal routing of a single vehicle with loading and unloading constraintsTransportation Planning and Technology, 1984