ARTÍCULO
TITULO

Overall Scheduling Model for Vessels Scheduling and Berth Allocation for Ports with Restricted Channels That Considers Carbon Emissions

Xing Jiang    
Ming Zhong    
Jiahui Shi    
Weifeng Li    
Yi Sui and Yuzhi Dou    

Resumen

As maritime transportation develops, the pressure of port traffic increases. To improve the management of ports and the efficiency of their operations, vessel scheduling must be optimized. The vessel scheduling problem can be divided into channel scheduling and berth allocation. We considered the complex problem of vessel scheduling in a restricted channel and the berth allocation problem, and a combined model that considers carbon emissions was developed. This model should reduce vessel waiting times, improve the quality of the berth loading and unloading service, meet the requirements of ?green? shipping, and improve the overall scheduling efficiency and safety of ports. An adaptive, double-population, multi-objective genetic algorithm NSGA-II-DP is proposed to calculate the mathematical model. In the case study, the rationality verification and sensitivity analysis of the model and algorithm are conducted, and the NSGA-II-DP and NSGA-II were compared. Results demonstrate that the overall convergence of the NSGA-II-DP algorithm is better than that of NSGA-II, demonstrating that the NSGA-II-DP algorithm is a useful development of NSGA-II. In terms of port scheduling, the results of our model and algorithm, compared with the decisions provided by the traditional First Come First Service (FCFS) strategy, are more in line with the requirements for efficiency and cost in the actual port management, and more dominant in the port management can provide better decision support for the decision-makers.

 Artículos similares

       
 
Laila Bouhouch, Mostapha Zbakh and Claude Tadonki    
The development of big data has generated data-intensive tasks that are usually time-consuming, with a high demand on cloud data centers for hosting big data applications. It becomes necessary to consider both data and task management to find the optimal... ver más
Revista: Information

 
Jun Long, Shimin Wu, Xiaodong Han, Yunbo Wang and Limin Liu    
The increasing number of satellites for specific space tasks makes it difficult for traditional satellite task planning that relies on ground station planning and on-board execution to fully exploit the overall effectiveness of satellites. Meanwhile, the... ver más
Revista: Aerospace

 
Prathamesh Lahande, Parag Kaveri and Jatinderkumar Saini    
Cloud computing delivers robust computational services by processing tasks on its virtual machines (VMs) using resource-scheduling algorithms. The cloud?s existing algorithms provide limited results due to inappropriate resource scheduling. Additionally,... ver más
Revista: Informatics

 
Bin Shen, Lingfei Xiao and Zhifeng Ye    
In order to solve the problem of full flight envelope control for aircraft engines, the design of a linear parameter-varying (LPV) controller is described in this paper. First, according to the nonlinear aerodynamic model of the aircraft engine, the LPV ... ver más
Revista: Aerospace

 
Levente Fazekas, Boldizsár Tüu-Szabó, László T. Kóczy, Olivér Hornyák and Károly Nehéz    
Flow-shop scheduling problems are classic examples of multi-resource and multi-operation scheduling problems where the objective is to minimize the makespan. Because of the high complexity and intractability of the problem, apart from some exceptional ca... ver más
Revista: Algorithms