Scheduling ships movements within a canal harbor

Pellegrini, Paola; Tollo, Giacomo di; Pesenti, Raffaele

doi:10.1007/s00500-018-3469-2

“…Only few works focus their attention on waterway scheduling. Some analogies exploited the similarities maritime movements with the problem of scheduling trains on single track networks through Mixed Integer Linear Program (MILP)-based heuristic [9]. They provided experimental analysis on instances representing the ship movements in the Port of Venice.…”

Section: Literature Reviewmentioning

confidence: 99%

“…To ensure that the eligible berth is chosen, equation (8) shows that the vessel's length must be within the berth length. Equation (9) enforces that the start time at berth must be greater than its arrival time and must be greater than the occupied time of selected berth (10). Service time or the period the berth is occupied is stated in equation (11).…”

Section: Mathematical Modelmentioning

confidence: 99%

Waterway, Anchorage, and Berth Scheduling: A Case Study on Port of Manila

2022

Proceedings of WCSE 2022 Spring Event: 2022 9th International Conference on Industrial Engineering and Applications

0

View full text Add to dashboard Cite

Maritime transport is a huge instrumental engine of trade economy following the nation's GDP growth. Short turnaround times and reduced waiting times play an important role in increasing countries' port competitiveness. Port operators need to establish an efficient port schedule through the minimization of ships' completion times. In this regard, vessels need to undergo sequential phasesinbound passage in waterway, anchorage queuing, berth allocation, and outbound passage. Technical limitations must also be addressed such as traffic capacity, safety distance, and berth spatial constraints. In this paper, the dependency of these phases will be solved in an integrated manner through the reformulation of the classic MM-RCPSP. The novelty of multi-alternative waterways considering safety distance will be explored, and port capacity restrictions are imposed to effectively replicate the real-life port situation. Data set from Port of Manila is generated to verify and validate the feasibility of the established MILP model. Computational results show that the proposed approach is effective in minimizing the completion time of vessels with a decrease of about 16.51% from the actual port performance.

show abstract

“…Some other literature summaries in this area of research were published by Haghani [3], Cordeau et al [4], Lusby et al [5], and Harrod and Gorman [6]. Various scheduling problems have been modelled and described in detail Meisel and Fagerholt [7], Pellegrini et al [8]. The first work that sought to find an optimum solution for the train scheduling problem was started by Szpigel [9].…”

Section: Introductionmentioning

confidence: 99%

An Optimization Model for Scheduling Freight Trains on a Single Rail Track

Alaghband

¹

,

Moghaddam

²

2020

Scientia Iranica

1

0

View full text Add to dashboard Cite

In many countries, a rail network consists of single lines with sidings where interactions between trains occur (meet, pass). In this paper, we study two issues of these networks: first, the scheduling of freight trains in a single line corridor while ensuring safe interactions and second, the allocation of freight to freight trains regarding the release dates of freight, weight of freight, and weight capacity of the trains. Both of these issues must be addressed when examining real-world freight train scheduling problems. The objective functions of this study are the minimization of a train's travelling time, the allocation of freight to freight trains, and the reduction of tardiness of freight at destination. Both scheduling and allocation problems are presented using integer linear programming models. In addition, an integrated novel heuristic algorithm has been proposed to solve them. Computational results demonstrated through a generated dataset show both model validation and efficiency of the heuristic algorithm. The heuristic algorithm has been designed to incorporate the practical operational railway rules with modest modification. Although its outputs slightly differ from the exact solutions, it can solve both models simultaneously in large scale problems.

show abstract

“…Some other literature summaries in this area of research were published by Haghani (1987), Cordeau et al (1998), Lusby et al (2011), andHarrod andGorman (2010). Various scheduling problems have been modelled and described in detail Meisel and Fagerholt (2019), Pellegrini et al (2019). The first work that sought to find an optimum solution for the train scheduling problem was started by Szpigel (1973).…”

Section: Introductionmentioning

confidence: 99%

An Optimization Model for Scheduling Freight Trains on a Single Rail Track

Alaghband¹,

Moghaddam²

2019

Preprint

0

View full text Add to dashboard Cite

In many countries, a rail network consists of single lines with sidings where interactions between trains occur (meet, pass). In this paper, we study two issues of these networks: first, the scheduling of freight trains in a single line corridor while ensuring safe interactions and second, the allocation of freight to freight trains regarding the release dates of freight, weight of freight, and weight capacity of the trains. Both of these issues must be addressed when examining real-world freight train scheduling problems. The objective functions of this study are the minimization of a train's travelling time, the allocation of freight to freight trains, and the reduction of tardiness of freight at destination. Both scheduling and allocation problems are presented using integer linear programming models. In addition, an integrated novel heuristic algorithm has been proposed to solve them. Computational results demonstrated through a generated dataset show both model validation and efficiency of the heuristic algorithm. The heuristic algorithm has been designed to incorporate the practical operational railway rules with modest modification. Although its outputs slightly differ from the exact solutions, it can solve both models simultaneously in large scale problems.

show abstract

Scheduling ships movements within a canal harbor

Cited by 9 publications

References 34 publications

Waterway, Anchorage, and Berth Scheduling: A Case Study on Port of Manila

Waterway, Anchorage, and Berth Scheduling: A Case Study on Port of Manila

An Optimization Model for Scheduling Freight Trains on a Single Rail Track

An Optimization Model for Scheduling Freight Trains on a Single Rail Track

Contact Info

Product

Resources

About