Decomposition of the vehicle routing problem with time windows on the time dimension
Open Access
- 11 March 2022
- journal article
- Published by Elsevier BV in Transportation Research Procedia
- Vol. 62, 131-138
- https://doi.org/10.1016/j.trpro.2022.02.017
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time WindowsTransportation Science, 2020
- On the road to better routes: Five decades of published research on the vehicle routing problemNetworks, 2020
- Efficient and Easy-to-Implement Mixed-Integer Linear Programs for the Traveling Salesperson Problem with Time WindowsTransportation Research Procedia, 2018
- OR problems related to Home Health Care: A review of relevant routing and scheduling problemsOperations Research for Health Care, 2017
- Home health care routing and scheduling: A reviewComputers & Operations Research, 2017
- A review of dynamic vehicle routing problemsEuropean Journal of Operational Research, 2013
- Path inequalities for the vehicle routing problem with time windowsNetworks, 2007
- Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cutMathematical Programming, 2001
- The Vehicle Routing Problem with Time Windows: Minimizing Route DurationINFORMS Journal on Computing, 1992
- Complexity of vehicle routing and scheduling problemsNetworks, 1981