### Abstract

Original language | Undefined |
---|---|

Place of Publication | onbekend |

Publisher | University of Twente |

Number of pages | 17 |

ISBN (Print) | 9789038612256 |

Publication status | Published - 1 Jan 2008 |

### Publication series

Name | BETA Working Papers |
---|---|

Publisher | University of Twente |

No. | 236 |

### Keywords

- IR-70229
- ILP-formulation
- Duty times
- Driving hours regulations
- Time-dependent travel times
- Vehicle scheduling
- METIS-247527

### Cite this

*Optimizing departure times in vehicle routes*. (BETA Working Papers; No. 236). onbekend: University of Twente.

}

*Optimizing departure times in vehicle routes*. BETA Working Papers, no. 236, University of Twente, onbekend.

**Optimizing departure times in vehicle routes.** / Kok, A.L.; Hans, Elias W.; Schutten, Johannes M.J.

Research output: Book/Report › Report › Professional

TY - BOOK

T1 - Optimizing departure times in vehicle routes

AU - Kok, A.L.

AU - Hans, Elias W.

AU - Schutten, Johannes M.J.

N1 - ISBN 978-90-386-1225-6 / NUR 804

PY - 2008/1/1

Y1 - 2008/1/1

N2 - Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. However, in practice, temporal traffic congestions make that such solutions are not optimal with respect to minimizing the total duty time. Furthermore, VRPTW solutions do not account for complex driving hours regulations, which severely restrict the daily travel time available for a truck driver. To deal with these problems, we consider the vehicle departure time optimization (VDO) problem as a post-processing step of solving a VRPTW. We propose an ILP-formulation that minimizes the total duty time. The obtained solutions are feasible with respect to driving hours regulations and they account for temporal traffic congestions by modeling time-dependent travel times. For the latter, we assume a piecewise constant speed function. Computational experiments show that problem instances of realistic sizes can be solved to optimality within practical computation times. Furthermore, duty time reductions of 8 percent can be achieved. Finally, the results show that ignoring time-dependent travel times and driving hours regulations during the development of vehicle routes leads to many infeasible vehicle routes. Therefore, vehicle routing methods should account for these real-life restrictions.

AB - Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. However, in practice, temporal traffic congestions make that such solutions are not optimal with respect to minimizing the total duty time. Furthermore, VRPTW solutions do not account for complex driving hours regulations, which severely restrict the daily travel time available for a truck driver. To deal with these problems, we consider the vehicle departure time optimization (VDO) problem as a post-processing step of solving a VRPTW. We propose an ILP-formulation that minimizes the total duty time. The obtained solutions are feasible with respect to driving hours regulations and they account for temporal traffic congestions by modeling time-dependent travel times. For the latter, we assume a piecewise constant speed function. Computational experiments show that problem instances of realistic sizes can be solved to optimality within practical computation times. Furthermore, duty time reductions of 8 percent can be achieved. Finally, the results show that ignoring time-dependent travel times and driving hours regulations during the development of vehicle routes leads to many infeasible vehicle routes. Therefore, vehicle routing methods should account for these real-life restrictions.

KW - IR-70229

KW - ILP-formulation

KW - Duty times

KW - Driving hours regulations

KW - Time-dependent travel times

KW - Vehicle scheduling

KW - METIS-247527

M3 - Report

SN - 9789038612256

T3 - BETA Working Papers

BT - Optimizing departure times in vehicle routes

PB - University of Twente

CY - onbekend

ER -