An adaptive large neighborhood search heuristic for the share-a-ride problem
From MaRDI portal
Publication:342178
DOI10.1016/J.COR.2015.08.008zbMATH Open1349.90099OpenAlexW1533441792MaRDI QIDQ342178FDOQ342178
Authors: Baoxiang Li, Dmitry Krushinsky, Tom Van Woensel, 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
Recommendations
- A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
- Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems
- Simulated annealing heuristic for the general share-a-ride problem
- A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services
Cites Work
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- The dial-a-ride problem: Models and algorithms
- Variable neighborhood search for the dial-a-ride problem
- The share-a-ride problem: people and parcels sharing taxis
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
Cited In (18)
- Integrating parcel delivery schedules with public transport networks in urban co-modality systems
- An adaptive large neighborhood search method for rebalancing free-floating electric vehicle sharing systems
- A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
- Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
- Collaborative urban transportation: recent advances in theory and practice
- The share-a-ride problem: people and parcels sharing taxis
- Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand
- An adaptive large neighbourhood search for asset protection during escaped wildfires
- An adaptive large neighborhood search for relocating vehicles in electric carsharing services
- A survey of adaptive large neighborhood search algorithms and applications
- Simulated annealing heuristic for the general share-a-ride problem
- Scheduling heterogeneous multi-load AGVs with battery constraints
- A combinatorial auction for transportation matching service: formulation and adaptive large neighborhood search heuristic
- Typology and literature review for dial-a-ride problems
- Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)
- The stochastic share-a-ride problem with electric vehicles and customer priorities
Uses Software
This page was built for publication: An adaptive large neighborhood search heuristic for the share-a-ride problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342178)
