Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
DOI10.1007/S11590-020-01698-6zbMATH Open1484.90106OpenAlexW3121080552MaRDI QIDQ2070134FDOQ2070134
Authors: André L. S. Souza, Marcella Bernardo, Puca Huachi Vaz Penna, Jürgen Pannek, M. J. F. Souza 
Publication date: 21 January 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01698-6
Recommendations
- Dynamic transportation of patients in hospitals
- Modeling and optimizing dynamic dial-a-ride problems
- Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Variable neighborhood search
- Dynamic transportation of patients in hospitals
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A hybrid heuristic algorithm for the open-pit-mining operational planning problem
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
- Variable neighborhood search: basics and variants
- A variable neighborhood search for flying sidekick traveling salesman problem
Cited In (6)
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
- Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- Dynamic transportation of patients in hospitals
- MILP models of a patient transportation problem
This page was built for publication: Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2070134)
