关键词: |
*TANKER SHIPS, *CRUDE OIL, *FLEETS(SHIPS), *OPTIMIZATION, *SCHEDULING, *SHIPPING, *ROUTING, FUEL CONSUMPTION, ALLOCATIONS, PORTS(FACILITIES), BALLAST, CARGO SHIPS, PLANNING, AVAILABILITY, COSTS, INTEGER PROGRAMMING, DECISION MAKING, SUEZ CANAL, REQUIREMEN |
摘要: |
A crude oil tanker scheduling problem faced by a major oil company is presented and solved using an elastic set partitioning model. The model takes into account all fleet cost components, including the opportunity cost of ship time, port and canal charges, and demurrage and bunker fuel. The model determines optimal speeds for the ships and the best routing of ballast (empty) legs, as well as which cargos to load on controlled ships and which to spot charter. All feasible schedules are generated, the cost of each is accurately determined, and the best set of schedules is selected. For the problems encountered, optimal integer solutions to set partitioning problems with thousands of binary variables have been achieved in less than a minute. |