EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM

DOI10.1142/S0217595910002715zbMATH Open1200.90017OpenAlexW2051276846MaRDI QIDQ3580197FDOQ3580197

Authors: Gianpaolo Ghiani, Francesca Vocaturo, Patrizia Beraldi, Roberto Musmanno 

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

Recommendations

• Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem
• Variable neighborhood search algorithms for pickup and delivery problems with loading constraints
• The multi-vehicle profitable pickup and delivery problem
• A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
• Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
• A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
• Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem
• Variable neighborhood search for the travelling deliveryman problem

zbMATH Keywords

local searchstochastic vehicle routingminmax objective function

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites Work

• Introduction to Stochastic Programming
• Stochastic vehicle routing
• An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
• A new extension of local search applied to the Dial-A-Ride problem
• The General Pickup and Delivery Problem
• A stochastic and dynamic model for the single-vehicle pick-up and delivery 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
• The m-Traveling Salesman Problem with Minmax Objective
• An algorithm for the traveling salesman problem with pickup and delivery customers
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• A heuristic for the pickup and delivery traveling salesman problem
• Perturbation heuristics for the pickup and delivery traveling salesman problem
• An efficient implementation of local search algorithms for constrained routing problems
• Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem

Cited In (10)

• A probabilistic approach to pickup and delivery problems with time window uncertainty
• Inequity averse optimization in operational research
• A vehicle routing problem with multiple service agreements
• Arc routing under uncertainty: introduction and literature review
• Evolutionary dynamics of compliance in a two-population game of auditors and taxpayers
• A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak
• Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem
• A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs
• Local search heuristics for the probabilistic dial-a-ride problem
• A bi-criteria moving-target travelling salesman problem under uncertainty

This page was built for publication: EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580197)