Improved exact method for the double TSP with multiple stacks-Reference-Cited by-同舟云学术

Improved exact method for the double TSP with multiple stacks

Published:2011-10-29 Issue:4 Volume:58 Page:290-300
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Lusby Richard M.,Larsen Jesper

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1002/net.20473/fullpdf

Reference11 articles.

1. D. Appelgate R. Bixby V. Chvátal W. Cook Concorde tsp solver 2003 www.tsp.gatech.edu/concorde

2. An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with lifo or fifo loading;Carrabs;INFOR Inform Syst Oper Res,2007

3. A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with lifo loading;Cordeau;Networks,2010

4. The double traveling salesman problem with multiple stacks: A variable neighborhood search approach;Felipe;Comput Oper Res, Cambridge, Massachusetts,2009

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints;International Transactions in Operational Research;2022-08-02

2. The pickup and delivery problem with time windows, multiple stacks, and handling operations;European Journal of Operational Research;2021-11

3. A Double Traveling Salesman Problem With Three-Dimensional Loading Constraints for Bulky Item Delivery;IEEE Access;2021

4. The Double Traveling Salesman Problem with Multiple Stacks and a Choice of Container Types;Mathematics;2020-06-16

5. Iterated local search for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints;Networks;2017-03-13