Discrete multi-objective artificial bee colony algorithm for green co-scheduling problem of ship lift and ship lock

Zheng, Qianqian; Yu, Zhongbo; He, Lijun; Hong-wei, Tian

doi:10.1016/j.aei.2023.101897

Cited by 25 publications

(9 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Barbosa's research (2022) showed that the Hybrid Artificial Bee Colony algorithm was able to better accuracy, durability, and speed compared to the other algorithms tested (Barbosa-p, 2022). Analysis by Boufflet (2022) also supports this finding, showing that the Hybrid Artificial Bee Colony algorithm has stability, and better optimization performance (Boufflet et al, 2022;Xiang et al, 2021;Zheng et al, 2023). The results of comparisons with other algorithms will provide a better understanding of the advantages and weaknesses of the Hybrid Artificial Bee Colony algorithm in the context of college course schedule.…”

Section: Introductionmentioning

confidence: 63%

Modelling of Subject Scheduling Systems Using Hybrid Artificial Bee Colony Algorithm

Lingga,

Sutarman,

Darnius

2023

SinkrOn

View full text Add to dashboard Cite

A common schedule problem found in colleges is the positioning of courses in a certain space and time. This placement process often encounters barriers that must be met so that there is no imbalance in the school schedule. One of the problems that often arise is the placement of class capacity that does not match the course requirements. In this study, the researchers used the Artificial Bee Colony Hybrid Algorithm (HABC) to construct course schedules efficiently at the college. The objective of the research was to develop a course scheduling system using the HABC algorithm by combining the Engineering of Artificial Bee Colony (ABC) and genetic algoritms, especially on the crossover process to better address the schedule problems. The research procedure used is to design and implement a course scheduling system using the Hybrid ABC algorithm. The results of the research demonstrate that the Hybrid ABC algorithm is effective in generating optimal course schedule schedules, in line with time limits, room needs, and lecturer requirements and can automate course schedule processes, saving time and resources, while ensuring optimal schedules.

show abstract

Section: Introductionmentioning

confidence: 63%

Modelling of Subject Scheduling Systems Using Hybrid Artificial Bee Colony Algorithm

Lingga,

Sutarman,

Darnius

2023

SinkrOn

View full text Add to dashboard Cite

show abstract

“…Nonetheless, when dealing with larger problem scales or increasingly complex structures, the solution performance of the CP solver exhibits gradual deterioration. Recognizing the inclination of heuristic and meta-heuristic algorithms to become ensnared within local optima when addressing intricate optimization challenges [35,36], this research offers a comprehensive explanation on the configuration of CP solver parameters and strategic solutions to enhance its efficiency. Additionally, it introduces an enhanced twostage solution algorithm that amalgamates ALS, SA, and the CP solver, with the specific aim of avoiding such suboptimal solutions.…”

Section: The Methodology: Heuristic Strategies To Improve the Solutionmentioning

confidence: 99%

Integrated Inbound and Outbound Scheduling for Coal Port: Constraint Programming and Adaptive Local Search

Lu,

Zhang,

Zheng

et al. 2024

JMSE

Self Cite

View full text Add to dashboard Cite

The effective production scheduling of dry bulk ports is a challenging task that demands meticulous planning, task allocation based on customer requirements, as well as strategic route and timing scheduling. Dry bulk ports dedicated to handling commodities like coal and iron ore frequently engage in blending operations as a strategic imperative to gain market competitiveness. The process of blending coal and ore entails the timely arrival of the requisite raw materials at predetermined locations. Simultaneously, it necessitates the coordination of the sequencing of goods entering and departing the port to align with the operational demands associated with material stockpiles. This paper describes and analyzes an operational scheduling problem encountered by one of the largest coal blending sea ports in China. Specifically, a rich constraint programming model is presented to define operation sequences integrating daily inbound and outbound services provided by the port, minimizing the overall operation time. In order to enhance the practicality of the method, a CP-based adaptive simulated annealing local search algorithm has been designed and developed for the optimization problem. The empirical validation of the proposed method is conducted using both real production data and generated experimental data adhering to specific rules. The results conclusively demonstrate the efficacy and feasibility of the proposed method. This also substantiates its practicality and effectiveness in real-world applications, facilitating efficient production and energy-saving operations for the coal port.

show abstract

“…Bin [24] proposes a general model for the generalized serial-lock scheduling problem (GSLSP), innovatively from a multi-commodity network (MCN) perspective, considering the serial locks on the same channel as a multilevel lock system, reducing vessel waiting times and lock water usage with consideration of fairness objectives. Zheng et al [13] used a discrete multi-objective artificial bee colony algorithm to investigate the cooperative scheduling problem of the Three Gorges locks and vessel lifts to reduce the energy consumption of vessel operation and improve the efficiency of vessel passage given the situation that the Three Gorges Cascade Hub have reached the limit of passage capacity. Yuan et al [25] considered water-land transshipment as a new efficient way to share the pressure of the lock for ships passing a dam and established a co-scheduling model of a single lock and different kinds of water-land transshipment docks mixed transportation system for ships passing a lock, which takes into account both fairness of the ships and efficiency of the lock.…”

Section: Research On the Lock Navigation Scheduling Rulesmentioning

confidence: 99%

“…The results of the study showed that waiting time is an essential indicator for evaluating the effectiveness of lock scheduling rules in queuing mode by drawing on the scheduling model of transportation systems such as urban bus scheduling and terminal collector card reservation scheduling in case of congestion [11,12]. The rules of determining the comprehensive priority of vessels and implementing the reservation of vessels for passing locks are added to provide exclusive rights of passage for vessels transporting essential materials, to alleviate the contradiction between the demand for vessels and the passing capacity of locks, and improve scheduling performance [13,14]. In cases where the adoption capacity cannot be improved, it is crucial to evaluate the performance of scheduling rules in terms of fairness and safety.…”

Section: Introductionmentioning

confidence: 99%

An Index Model for the Evaluation of the Performance of Lock Navigation Scheduling Rules Considering the Perspective of Stakeholders

Li,

Liu,

Wang

2024

Sustainability

View full text Add to dashboard Cite

The lock navigation scheduling problem involves multiple stakeholder groups. The game relationship between stakeholders directly affects the sustainable development of regional society and economy. Considering the objectivity and accuracy of social network analysis (SNA) for relationship identification, indicator screening, and system construction, it completes the stakeholder extraction and evaluation index system construction. Considering that the conditional probability of nodes in Bayesian networks (BN) can flexibly and intuitively characterize the direction and strength of the factors’ roles in a complex scenario, this study proposes an index model for the evaluation of the performance of lock navigation scheduling rules. Firstly, build the BN topology under the efficiency, safety, and fairness criteria. Subsequently, an improved composite index method is combined with the BN to determine the evaluation index from the stakeholder perspective. This study takes the Three Gorges locks maintenance scenario as an example. The index evaluation model can accurately identify the direction, trend, and magnitude of the performance of the scheduling rules on the efficiency, safety, and fairness criteria under navigational constraints, realizing the dynamic and quantitative evaluation of the performance of lock navigation scheduling rules during the observation period.

show abstract

Discrete multi-objective artificial bee colony algorithm for green co-scheduling problem of ship lift and ship lock

Cited by 25 publications

References 47 publications

Modelling of Subject Scheduling Systems Using Hybrid Artificial Bee Colony Algorithm

Modelling of Subject Scheduling Systems Using Hybrid Artificial Bee Colony Algorithm

Integrated Inbound and Outbound Scheduling for Coal Port: Constraint Programming and Adaptive Local Search

An Index Model for the Evaluation of the Performance of Lock Navigation Scheduling Rules Considering the Perspective of Stakeholders

Contact Info

Product

Resources

About