A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem

DOI10.3390/A12020039zbMath1461.90009OpenAlexW2917261650WikidataQ128361262 ScholiaQ128361262MaRDI QIDQ2632513

Slim Belhaiza

Publication date: 14 May 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a12020039

zbMATH Keywords

genetic algorithmstime windowsdial-a-ride problemadaptive large neighborhood searchimpaired and elderly transportation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Event-based MILP models for ridepooling applications ⋮ A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem ⋮ Scheduling heterogeneous multi-load AGVs with battery constraints ⋮ A survey of adaptive large neighborhood search algorithms and applications

Cites Work

• Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
• The dial-A-ride problem with transfers
• A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
• Hybrid column generation and large neighborhood search for the dial-a-ride problem
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
• The dial-a-ride problem: Models and algorithms
• A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
• Variable neighborhood search for the dial-a-ride problem

This page was built for publication: A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem