A traveling salesman problem with pickups and deliveries, time windows and draft limits: Case study from chemical shipping
详细信息 查看全文
- 作者：Mari Jevne Arnesena ; Magnhild Gjestvanga ; Xin Wanga ; xin.wang@iot.ntnu.no" class="auth_mail" title="E-mail the corresponding author ; Kjetil Fagerholta ; Kristian Thuna ; Jø ; rgen G. Rakkeb
- 关键词：Maritime transportation ; Traveling salesman problem with pickup and delivery ; Draft limit ; Dynamic programming
- 刊名：Computers and Operations Research
- 出版年：2017
- 出版时间：January 2017
- 年：2017
- 卷：77
- 期：Complete
- 页码：20-31
- 全文大小：2037 K
文摘
- •
A forward dynamic programming algorithm is proposed to solve an in-port routing problem.
- •
The imposition of label extension rules significantly increase computational efficiency.
- •
The proposed algorithm greatly outperforms the commercial solver Xpress.
- •
The approach can efficiently solve real problems in the chemical shipping industry.