A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows

DOI10.1016/J.EJOR.2005.05.012zbMath1142.90477OpenAlexW2017944701MaRDI QIDQ2433432

Maged M. Dessouky, Quan Lu

Publication date: 27 October 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.05.012

zbMATH Keywords

time windowspickup and delivery problemconstruction heuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (19)

Visual attractiveness in routing problems: a review ⋮ The mixed capacitated arc routing problem with non-overlapping routes ⋮ A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints ⋮ A generalized constructive algorithm using insertion-based heuristics ⋮ An adaptive large neighborhood search heuristic for the share-a-ride problem ⋮ An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services ⋮ Visual attractiveness in vehicle routing via bi-objective optimization ⋮ Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: the pollution routing game ⋮ Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics ⋮ Verification of Correctness of Parallel Algorithms in Practice ⋮ A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands ⋮ Recent Models and Algorithms for One-to-One Pickup and Delivery Problems ⋮ The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms ⋮ The multi-shift vehicle routing problem with overtime ⋮ Route-based approximate dynamic programming for dynamic pricing in attended home delivery ⋮ A new VRPPD model and a hybrid heuristic solution approach for e-tailing ⋮ A local search heuristic for the pre- and end-haulage of intermodal container terminals ⋮ Shipper collaboration in forward and reverse logistics ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care

Cites Work

• Unnamed Item
• A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
• Efficient feasibility testing for dial-a-ride problems
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• Drive: Dynamic Routing of Independent Vehicles
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• New methods to color the vertices of a graph
• Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• A Hierarchical Task Model for Dispatching in Computer-Assisted Demand-Responsive Paratransit Operation
• The General Pickup and Delivery Problem
• A Request Clustering Algorithm for Door-to-Door Handicapped Transportation

This page was built for publication: A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows