An adaptive large neighborhood search heuristic for the share-a-ride problem
From MaRDI portal
Publication:342178
DOI10.1016/j.cor.2015.08.008zbMath1349.90099OpenAlexW1533441792MaRDI QIDQ342178
Tom Van Woensel, Dmitry Krushinsky, Baoxiang Li, Hajo A. Reijers
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/42a40e20-80ea-42c6-aea5-7faa11194601
Related Items (9)
Collaborative urban transportation: recent advances in theory and practice ⋮ An adaptive large neighborhood search for relocating vehicles in electric carsharing services ⋮ Simulated annealing heuristic for the general share-a-ride problem ⋮ An adaptive large neighbourhood search for asset protection during escaped wildfires ⋮ Scheduling heterogeneous multi-load AGVs with battery constraints ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ Typology and literature review for dial-a-ride problems ⋮ Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand ⋮ Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
Uses Software
Cites Work
- The share-a-ride problem: people and parcels sharing taxis
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- The dial-a-ride problem: Models and algorithms
- Variable neighborhood search for the dial-a-ride problem
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
This page was built for publication: An adaptive large neighborhood search heuristic for the share-a-ride problem