An Improved Discrete PSO for Tugboat Assignment Problem under a Hybrid Scheduling Rule in Container Terminal

In container terminal, tugboat plays vital role in safety of ship docking. Tugboat assignment problem under a hybrid scheduling rule (TAP-HSR) is to determine the assignment between multiple tugboats and ships and the scheduling sequence of ships to minimize the turnaround time of ships. A mixed-integer programming model and the scheduling method are described for TAP-HSR problem. Then an improved discrete PSO (IDPSO) algorithm for TAP-HSR problem is proposed to minimize the turnaround time of ships. In particular, some new redefined PSO operators and the discrete updating rules of position and velocity are developed. The experimental results show that the proposed IDPSO can get better solutions than GA and basic discrete PSO.

[1]  Umut Tosun,et al.  A New Recombination Operator for the Genetic Algorithm Solution of the Quadratic Assignment Problem , 2014, ANT/SEIT.

[2]  Katta G. Murty,et al.  Effect of block length and yard crane deployment systems on overall performance at a seaport container transshipment terminal , 2009, Comput. Oper. Res..

[3]  Peng-Yeng Yin,et al.  A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems , 2006, Comput. Stand. Interfaces.

[4]  Thomas Stützle,et al.  Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances , 2014, Comput. Oper. Res..

[5]  K. L. Mak,et al.  Yard crane scheduling in port container terminals , 2005 .

[6]  Akio Imai,et al.  The Dynamic Berth Allocation Problem for a Container Port , 2001 .

[7]  Hong Wang,et al.  Random assignment method based on genetic algorithms and its application in resource allocation , 2012, Expert Syst. Appl..

[8]  W. C. Ng,et al.  Crane scheduling in container yards with inter-crane interference , 2005, Eur. J. Oper. Res..

[9]  A. Immanuel Selvakumar,et al.  Modified Binary Particle Swarm optimization algorithm application to real-time task assignment in heterogeneous multiprocessor , 2013, Microprocess. Microsystems.

[10]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[11]  Yasmine Abouelseoud,et al.  A heuristics-based solution to the continuous berth allocation and crane assignment problem , 2013 .

[12]  Jui-Lin Lai,et al.  An efficient bi-objective personnel assignment algorithm based on a hybrid particle swarm optimization model , 2010, Expert Syst. Appl..

[13]  Zhixiong Liu.  Hybrid Evolutionary Strategy Optimization for Port Tugboat Operation Scheduling , 2009, 2009 Third International Symposium on Intelligent Information Technology Application.

[14]  Nihan Çetin Demirel,et al.  Optimization of the quadratic assignment problem using an ant colony algorithm , 2006, Appl. Math. Comput..

[15]  Ali H. Diabat,et al.  An Integrated Quay Crane Assignment and Scheduling Problem Using Branch-and-Price , 2014, 2016 International Conference on Computational Science and Computational Intelligence (CSCI).

[16]  Yiyo Kuo,et al.  Optimizing truck sequencing and truck dock assignment in a cross docking system , 2013, Expert Syst. Appl..

[17]  Ali H. Diabat,et al.  A multi-vessel quay crane assignment and scheduling problem: Formulation and heuristic solution approach , 2014, Expert Syst. Appl..

[18]  Kap Hwan Kim,et al.  A dispatching method for automated lifting vehicles in automated port container terminals , 2009, Comput. Ind. Eng..

[19]  Nima Safaei,et al.  A genetic algorithm to solve the storage space allocation problem in a container terminal , 2009, Comput. Ind. Eng..

[20]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[21]  Jadranka Skorin-Kapov,et al.  Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

[22]  Celal Özkale,et al.  Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems , 2013 .

[23]  Ashish Tiwari,et al.  A greedy genetic algorithm for the quadratic assignment problem , 2000, Comput. Oper. Res..

[24]  Bin Jiao,et al.  A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan , 2006, Appl. Math. Comput..

[25]  Ikou Kaku,et al.  Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight , 2009, Comput. Math. Appl..

[26]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[27]  Y. Rahmat-Samii,et al.  Particle swarm, genetic algorithm, and their hybrids: optimization of a profiled corrugated horn antenna , 2002, IEEE Antennas and Propagation Society International Symposium (IEEE Cat. No.02CH37313).

[28]  Christian Bierwirth,et al.  A survey of berth allocation and quay crane scheduling problems in container terminals , 2010, Eur. J. Oper. Res..

[29]  Kap Hwan Kim,et al.  A crane scheduling method for port container terminals , 2004, Eur. J. Oper. Res..

[30]  Wang Shao-mei.  The Computer Simulation Study of Port Tugboat Operation , 2004 .

[31]  Yskandar Hamam,et al.  Assignment of program modules to processors: A simulated annealing approach , 2000, Eur. J. Oper. Res..

[32]  西村 悦子,et al.  Berth Allocation Planning in the Public Berth System by Genetic Algorithms , 2000 .