The pickup and delivery problem with time windows and handling operations
详细信息 查看全文
- 作者：Marjolein Veenstraa ; marjolein.veenstra@rug.nl" class="auth_mail" title="E-mail the corresponding author ; Marilè ; ne Cherkeslyb ; marilene.cherkesly@gerad.ca" class="auth_mail" title="E-mail the corresponding author ; Guy Desaulniersc ; guy.desaulniers@gerad.ca" class="auth_mail" title="E-mail the corresponding author ; Gilbert Laported ; gilbert.laporte@cirrelt.ca" class="auth_mail" title="E-mail the corresponding author
- 关键词：Vehicle routing with pickups and deliveries ; Handling operations ; Column generation ; Branch-price-and-cut ; Valid inequalities
- 刊名：Computers and Operations Research
- 出版年：2017
- 出版时间：January 2017
- 年：2017
- 卷：77
- 期：Complete
- 页码：127-140
- 全文大小：678 K
文摘
- •
We study the pickup and delivery problem with time windows and handling operations.
- •
We define two handling policies with compulsory and preventive handling.
- •
Branch-price-and-cut algorithms with ad hoc dominance criteria are presented.
- •
Computational results are reported on pickup and delivery benchmark instances.