An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
From MaRDI portal
Publication:342360
DOI10.1016/j.cor.2016.01.018zbMath1349.90086OpenAlexW2177916571MaRDI QIDQ342360
Emrah Demir, Tom Van Woensel, Veaceslav Ghilas
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/180d06f3-d3a8-491c-86da-0cc1fe6a030a
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (20)
An optimization algorithm for a capacitated vehicle routing problem with time windows ⋮ Collaborative urban transportation: recent advances in theory and practice ⋮ The pickup and delivery problem with alternative locations and overlapping time windows ⋮ Coordinating technician allocation and maintenance routing for offshore wind farms ⋮ A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery ⋮ Two-echelon collaborative routing problem with heterogeneous crowd-shippers ⋮ Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs ⋮ Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers ⋮ Scheduling shared passenger and freight transport on a fixed infrastructure ⋮ An adaptive large neighborhood search method for rebalancing free-floating electric vehicle sharing systems ⋮ Integrating micro-depot freight transport in existing public transport services ⋮ Solving a pickup and delivery routing problem for fourth‐party logistics providers ⋮ A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services ⋮ Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain ⋮ Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm ⋮ Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search ⋮ A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities ⋮ Solution techniques for the inter-modal pickup and delivery problem in two regions
Cites Work
- A note on two problems in connexion with graphs
- A review of recent research on green road freight transportation
- The dial-A-ride problem with transfers
- A general heuristic for vehicle routing problems
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- The bi-objective pollution-routing problem
- The dial-a-ride problem: Models and algorithms
- Cargo Capacity Management with Allotments and Spot Market Demand
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
This page was built for publication: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
