General solutions to the single vehicle routing problem with pickups and deliveries-Reference-Cited by-同舟云学术

General solutions to the single vehicle routing problem with pickups and deliveries

Published:2007-07 Issue:2 Volume:180 Page:568-584
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Gribkovskaia Irina,Halskau Øyvind,Laporte Gilbert,Vlček Martin

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference28 articles.

1. The vehicle routing problem with time windows and simultaneous pick-up and delivery;Angelelli,2002

2. A tabu search algorithm for periodic and multi-depot vehicle routing problems;Cordeau;Networks,1997

3. A unified tabu search algorithm for vehicle routing problems with time windows;Cordeau;Journal of the Operational Research Society,2001

4. Cordeau, J.-F., Laporte, G., Potvin, J.-Y., Savelsbergh, M.W.P., in press. Transportation on demand. In: Barnhart, C., Laporte, G. (Eds.), Transportation, Elsevier, Amsterdam.

5. Solutions of a large-scale traveling-salesman problem;Dantzig;Operations Research,1954

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

1. An Exact Approach for Solving Pickup-and-Delivery Traveling Salesman Problems with Neighborhoods;Transportation Science;2023-08-31

2. Optimization of emergency supplies paths based on dynamic real-time split deliver;International Journal of Industrial Engineering Computations;2023

3. 2-Trees: Structural insights and the study of Hamiltonian paths;Discrete Mathematics, Algorithms and Applications;2022-08-27

4. Analysis of the selective traveling salesman problem with time-dependent profits;TOP;2022-04-22

5. Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy;International Journal of Foundations of Computer Science;2021-10-20