A traveling salesman problem with pickups and deliveries, time windows and draft limits: Case study from chemical shipping
详细信息    查看全文
文摘

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.

NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.