The model takes advantage of the characteristics of the existing route structures and can solve the service route design problems effectively from the practical perspective. The ship deployment problem concerning the number of ships and their capacity and sailing speeds is considered at the third stage. This greatly simplifies the route structure design decisions at the first stage and enables us to develop an efficient heuristic algorithm to reposition empty containers at the second stage. We introduce the notions of topological structure and ship load factors, which lead to a classification of shipping route structures and the relationships between the container flow pattern and the route structure. We propose a three-stage optimisation method to tackle the problem. The objective of this problem is to minimise the total cost incurred from a liner long-haul service route, including ship related costs, fuel consumption costs, port related costs, laden containers and empty container inventory-in-transition costs. Moreover, the heuristic-rules based method can also be applied to stochastic situations because its second stage is rule-based and dynamical.read more read lessĪbstract: This paper proposes a single liner long-haul service route design problem including route structure design, ship deployment and empty container repositioning. However, the heuristic-rules based method has advantages in its applicability to large-scale realistic systems while producing good performance, to which the shortest-path based method may be computationally inapplicable. The shortest-path based method is preferable for relatively small-scale problems as it yields slightly better solution than the heuristic-rules based method. The results show that two solution methods perform substantially better than the practical policy. The two solution methods are applied to two case studies with 30 different scenarios and compared with a practical policy. The second is a two-stage heuristic-rules based integer programming method, which combines an integer programming of the static system with a heuristic implementation algorithm in dynamic system. The first is a two-stage shortest-path based integer programming method, which combines a cargo routing algorithm with an integer programming of the dynamic system. Two solution methods are proposed to solve the optimization problem. The laden container routing from the original port to the destination port is limited with at most three service routes. The objective is to minimize the total relevant costs in the planning horizon including: container lifting on/off costs at ports, customer demand backlog costs, the demurrage (or waiting) costs at the transhipment ports for temporarily storing laden containers, the empty container inventory costs at ports, and the empty container transportation costs. Abstract: This paper considers the problem of joint cargo routing and empty container repositioning at the operational level for a shipping network with multiple service routes, multiple deployed vessels and multiple regular voyages.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |