EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM
From MaRDI portal
Publication:3580197
DOI10.1142/S0217595910002715zbMath1200.90017OpenAlexW2051276846MaRDI QIDQ3580197
Francesca Vocaturo, Gianpaolo Ghiani, Roberto Musmanno, Patrizia Beraldi
Publication date: 11 August 2010
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595910002715
Related Items
Inequity averse optimization in operational research ⋮ Arc routing under uncertainty: introduction and literature review ⋮ A vehicle routing problem with multiple service agreements ⋮ A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs ⋮ A bi-criteria moving-target travelling salesman problem under uncertainty ⋮ Evolutionary dynamics of compliance in a two-population game of auditors and taxpayers
Cites Work
- An efficient implementation of local search algorithms for constrained routing problems
- An algorithm for the traveling salesman problem with pickup and delivery customers
- A stochastic and dynamic model for the single-vehicle pick-up and delivery problem
- Stochastic vehicle routing
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- The pickup and delivery problem: Faces and branch-and-cut algorithm
- A new extension of local search applied to the Dial-A-Ride problem
- A heuristic for the pickup and delivery traveling salesman problem
- Perturbation heuristics for the pickup and delivery traveling salesman problem
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- Introduction to Stochastic Programming
- The General Pickup and Delivery Problem
- The m-Traveling Salesman Problem with Minmax Objective
- Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem
