The Travelling Salesman Problem with pick-up and delivery-Reference-Cited by-同舟云学术

The Travelling Salesman Problem with pick-up and delivery

Published:1994-12 Issue:2 Volume:79 Page:299-310
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Mosheiov Gur

Publisher

Elsevier BV

Subject

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

Reference9 articles.

1. The shortest path through many points;Beardwood,1959

2. Routing and scheduling of vehicle and crews — State of the art;Bodin;Computers & Operations Research,1983

3. Vehicle routing with backhauls: Models algorithms and case studies;Casco,1988

4. Worst-case analysis of a new heuristic for the Travelling Salesman Problem;Christofides,1976

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

1. Solving pick-up and delivery problems via deep reinforcement learning based symmetric neural optimization;Expert Systems with Applications;2024-12

2. Pickup and delivery problem with electric vehicles and time windows considering queues;Transportation Research Part C: Emerging Technologies;2024-10

3. A TSP-based continuous path planning for additive manufacturing of concrete;Progress in Additive Manufacturing;2024-08-27

4. A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem;Computers & Operations Research;2024-01

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