A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows
From MaRDI portal
Publication:6079872
DOI10.1111/itor.13096OpenAlexW4200545513MaRDI QIDQ6079872
Daniel Severín, Paula Zabala, Mauro Lucci
Publication date: 29 September 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.13096
vehicle routingcrew schedulingvariable neighborhood descentgreedy randomized adaptive search procedure
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Rich vehicle routing problems: from a taxonomy to a definition
- \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care
- Variable neighbourhood search: methods and applications
- The pickup and delivery problem with time windows
- The driver and vehicle routing problem
- Home health care routing and scheduling: a review
- Bidirectional labeling for solving vehicle routing and truck driver scheduling problems
- Drive: Dynamic Routing of Independent Vehicles
- Vehicle Routing
- Optimization by GRASP
- An annotated bibliography of GRASP-Part II: Applications
- Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- Multicriteria Optimization
- Handbook of metaheuristics
- Variable neighborhood search: Principles and applications
This page was built for publication: A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows
