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.