An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
详细信息 查看全文
- 作者：Philippe Grangiera ; b ; philippe.grangier@mines-nantes.fr" class="auth_mail" title="E-mail the corresponding author ; Michel Gendreaub ; michel.gendreau@cirrelt.ca" class="auth_mail" title="E-mail the corresponding author ; Fabien Lehué ; dé ; ; a ; fabien.lehuede@mines-nantes.fr" class="auth_mail" title="E-mail the corresponding author ; fabien.lehuede@emn.fr" class="auth_mail" title="E-mail the corresponding author ; Louis-Martin Rousseaub ; louis-martin.rousseau@polymtl.ca" class="auth_mail" title="E-mail the corresponding author
- 关键词：Routing ; Two-echelon VRP ; Synchronization ; City logistics ; Adaptive large neighborhood search
- 刊名：European Journal of Operational Research
- 出版年：2016
- 出版时间：1 October 2016
- 年：2016
- 卷：254
- 期：1
- 页码：80-91
- 全文大小：768 K
文摘
- •
We integrate multiple trips, time-windows and synchronization in the two-echelon vehicle routing problem.
- •
We propose an adaptive large neighborhood search with efficient heuristics to explore the solution space.
- •
Temporal precedence and synchronization constraints are efficiently handled.
- •
Existing instances were extended to constitute benchmarks for this problem.
- •
The methodology has been successfully applied to these instances.