Simulation optimization based ant colony algorithm for the uncertain quay crane scheduling problem

• Main Authors: Naoufal Rouky, Mohamed Nezar Abourraja, Jaouad Boukachour, Dalila Boudebous, Ahmed El Hilali Alaoui, Fatima El Khoukhi
• Format: Article
• Language: English
• Published: Growing Science 2019-01-01
• Series: International Journal of Industrial Engineering Computations
• Subjects: Container terminal; Simulation Optimization; Quay crane; Uncertainty
• Online Access: http://www.growingscience.com/ijiec/Vol10/IJIEC_2018_4.pdf
• ISSN: 1923-2926; 1923-2934

This work is devoted to the study of the Uncertain Quay Crane Scheduling Problem (QCSP), where the loading /unloading times of containers and travel time of quay cranes are considered uncertain. The problem is solved with a Simulation Optimization approach which takes advantage of the great possibilities offered by the simulation to model the real details of the problem and the capacity of the optimization to find solutions with good quality. An Ant Colony Optimization (ACO) meta-heuristic hybridized with a Variable Neighborhood Descent (VND) local search is proposed to determine the assignments of tasks to quay cranes and the sequences of executions of tasks on each crane. Simulation is used inside the optimization algorithm to generate scenarios in agreement with the probabilities of the distributions of the uncertain parameters, thus, we carry out stochastic evaluations of the solutions found by each ant. The proposed optimization algorithm is tested first for the deterministic case on several well-known benchmark instances. Then, in the stochastic case, since no other work studied exactly the same problem with the same assumptions, the Simulation Optimization approach is compared with the deterministic version. The experimental results show that the optimization algorithm is competitive as compared to the existing methods and that the solutions found by the Simulation Optimization approach are more robust than those found by the optimization algorithm.