The pickup and delivery traveling salesman problem with handling costs
详细信息 查看全文
- 作者：Marjolein Veenstra ; a ; marjolein.veenstra@rug.nl" class="auth_mail" title="E-mail the corresponding author ; Kees Jan Roodbergena ; k.j.roodbergen@rug.nl" class="auth_mail" title="E-mail the corresponding author ; Iris F.A. Visa ; i.f.a.vis@rug.nl" class="auth_mail" title="E-mail the corresponding author ; Leandro C. Coelhoa ; b ; leandro.coelho@cirrelt.ca" class="auth_mail" title="E-mail the corresponding author
- 关键词：Routing ; Pickup and delivery ; Packing ; Handling costs ; Metaheuristics
- 刊名：European Journal of Operational Research
- 出版年：2017
- 出版时间：16 February 2017
- 年：2017
- 卷：257
- 期：1
- 页码：118-132
- 全文大小：598 K
文摘
- •
We introduce the pickup and delivery traveling salesman problem with handling costs.
- •
It is shown that the problem generalizes two existing problem classes.
- •
We propose a large neighborhood search heuristic and introduce new removal operators.
- •
The heuristic is shown to provide optimal or near-optimal solutions.
- •
We report new best known solutions for 67 instances on special cases of the problem.