Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem-Reference-Cited by-同舟云学术

Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem

Published:2005 Issue:4 Volume:45 Page:195-198
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Beraldi Patrizia,Ghiani Gianpaolo,Laporte Gilbert,Musmanno Roberto

Publisher

Wiley

Subject

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

Reference13 articles.

1. Computational experiments with a novel neighborhood search procedure for the probabilistic pickup and delivery travelling salesman problem, Technical Report 2003-14, Center for High Performance Computing, Universtiy of Calabria, Rende (CS), Italy.

2. Introduction to stochastic programming, Springer-Verlag, New York, 1997.

3. A Tabu Search Heuristic for the Vehicle Routing Problem

4. Stochastic vehicle routing

5. A new extension of local search applied to the Dial-A-Ride Problem

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

1. A scalable combinatorial benders decomposition for the Stochastic Dial-a-Ride Problem;Transportation Research Part C: Emerging Technologies;2024-06

2. The Traveling Salesman Problem with Stochastic and Correlated Customers;Transportation Science;2023-09

3. The Probabilistic Travelling Salesman Problem with Crowdsourcing;Computers & Operations Research;2022-06

4. The Bi-objective Minimum Latency Problem with Profit Collection and Uncertain Travel Times;Proceedings of the 9th International Conference on Operations Research and Enterprise Systems;2020

5. The probabilistic pickup-and-delivery travelling salesman problem;Expert Systems with Applications;2019-05