The driver and vehicle routing problem
DOI10.1016/j.cor.2017.12.010zbMath1391.90255OpenAlexW2772260493MaRDI QIDQ1651584
Inmaculada Rodríguez-Martín, Juan-José Salazar-González, Bencomo Domínguez-Martín
Publication date: 12 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.12.010
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (4)
Uses Software
Cites Work
- Integrated airline scheduling
- An exact algorithm for a vehicle-and-driver scheduling problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
- Models and algorithms for integration of vehicle and crew scheduling
- Vehicle routing and crew scheduling for metropolitan mail distribution at Australia post
- Vehicle Routing
- Integer Programming Formulation of Traveling Salesman Problems
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
This page was built for publication: The driver and vehicle routing problem