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

DOI10.1007/S10732-008-9083-1zbMATH Open1187.90054OpenAlexW2075952611MaRDI QIDQ972640FDOQ972640

Authors: 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

Recommendations

• Computational Science – ICCS 2005
• Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
• A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows
• A two-stage hybrid meta-heuristic for pickup and delivery vehicle routing problem with time windows
• A metaheuristic for the delivery man problem with time windows
• Combining heuristic and exact methods to solve the vehicle routing problem with pickups, deliveries and time windows
• scientific article; zbMATH DE number 1816805
• Exact algorithms for the multi-pickup and delivery problem with time windows
• Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery

zbMATH Keywords

simulated annealinggenetic algorithmsvehicle routingdial-a-rideHill climbingpickup and delivery problem with time windows

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Optimization by simulated annealing
• A new extension of local search applied to the Dial-A-Ride problem
• The General Pickup and Delivery Problem
• A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
• A heuristic for the pickup and delivery traveling salesman problem
• 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
• Solving the Dial-a-Ride problem using genetic algorithms

Cited In (6)

• Computational Science – ICCS 2005
• Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
• A metaheuristic for the delivery man problem with time windows
• A two-stage hybrid meta-heuristic for pickup and delivery vehicle routing problem with time windows
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
• A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows

Uses Software

• GALib

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

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