The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms

DOI10.1007/S10732-008-9083-1zbMath1187.90054OpenAlexW2075952611MaRDI QIDQ972640

Manar I. Hosny, Christine L. Mumford

Publication date: 21 May 2010

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-008-9083-1

zbMATH Keywords

simulated annealingvehicle routinggenetic algorithmsdial-a-rideHill climbingpickup and delivery problem with time windows

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

A hybrid genetic algorithm for the heterogeneous dial-a-ride problem

Uses Software

• GALib

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• A new extension of local search applied to the Dial-A-Ride problem
• A heuristic for the pickup and delivery traveling salesman problem
• A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
• Solving the Dial-a-Ride problem using genetic algorithms
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
• The General Pickup and Delivery Problem

This page was built for publication: The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms