The double traveling salesman problem with multiple stacks: A variable neighborhood search approach-Reference-Cited by-同舟云学术

The double traveling salesman problem with multiple stacks: A variable neighborhood search approach

Published:2009-11 Issue:11 Volume:36 Page:2983-2993
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Felipe Ángel,Ortuño M. Teresa,Tirado Gregorio

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference24 articles.

1. Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery;Bianchessi;Computers & Operations Research,2007

2. Carrabs F, Cerulli R, Cordeau J-F. An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with lifo loading. INFORMS Journal on Computing 2007;19:618–32.

3. Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading;Carrabs;INFORMS Journal on Computing,2007

4. Cassani L. Righini G. Heuristic algorithms for the TSP with rear-loading. In: 35th Annual Conference of the Italian Operational Research Society, AIRO XXXV, Lecce, Italy; 2004.

5. Scheduling of vehicles from a central depot to a number of delivery points;Clarke;Operations Research,1964

Cited by 40 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 vehicle routing problem of intercity ride-sharing between two cities;Transportation Research Part B: Methodological;2022-04

3. Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks;European Journal of Operational Research;2021-08

4. Approximation of the Double Traveling Salesman Problem with Multiple Stacks;Theoretical Computer Science;2021-07

5. Additive Bounds for the Double Traveling Salesman Problem with Multiple Stacks;AIRO Springer Series;2021