マリンエンジニアリング
Online ISSN : 1884-3778
Print ISSN : 1346-1427
ISSN-L : 1346-1427
内航不定期船の配船
坂口 隆
著者情報
ジャーナル フリー

2008 年 43 巻 6 号 p. 916-921

詳細
抄録

With order-type tramper allocation, an operator receives an order from a cargo owner for cargo to be transported and so must make a shipping schedule to execute all the order, completely. To transport orders efficiently it is critical to group and ship cargoes together efficiently and avoid the occurrence of conflict in the tramper's hold. We try to solve this order-type tramper allocation problem by applying a network model, and a constraint programming (CP) . This paper describes an optimization algorithm based on the CP. This optimizes a tramper's allocation in terms of fuel consumption. The results of the algorithm are demonstrated.

著者関連情報
© 社団法人 日本マリンエンジニアリング学会
前の記事 次の記事
feedback
Top