A Hybrid Heuristic Algorithm for Ship Block Construction Space Scheduling Problem

Ship block construction space is an important bottleneck resource in the process of shipbuilding, so the production scheduling optimization is a key technology to improve the efficiency of shipbuilding. With respect to ship block construction space scheduling problem, a hybrid heuristic algorithm is proposed in this paper. Firstly, Bottom-Left-Fill (BLF) process is introduced. Next, an initial solution is obtained by guiding the sorting process with corners. Then on the basis of the initial solution, the simulated annealing arithmetic (SA) is used to improve the solution by offering a possibility to accept worse neighbor solutions in order to escape from local optimum. Finally, the simulation experiments are conducted to verify the effectiveness of the algorithm.

[1]  Liu Zhen-yuan,et al.  Heuristic algorithm for RCPSP with the objective of minimizing activities' cost , 2006 .

[2]  Daniele Vigo,et al.  The Three-Dimensional Bin Packing Problem , 2000, Oper. Res..

[3]  Murat Ermis,et al.  A new hybrid evolutionary algorithm for three - dimensional packing problems , 2010, 2010 IEEE International Conference on Systems, Man and Cybernetics.

[4]  Tarun Bhaskar,et al.  A heuristic method for RCPSP with fuzzy activity times , 2011, Eur. J. Oper. Res..

[5]  Felix T.S. Chan,et al.  A hybrid Tabu sample-sort simulated annealing approach for solving distributed scheduling problem , 2013 .

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[7]  Guido Moerkotte,et al.  Heuristic and randomized optimization for the join ordering problem , 1997, The VLDB Journal.

[8]  Bernard Chazelle,et al.  The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation , 1983, IEEE Transactions on Computers.

[9]  T. M. Chan,et al.  Heuristics with Stochastic Neighborhood Structures for Two-Dimensional Bin Packing and Cutting Stock Problems , 2011, Asia Pac. J. Oper. Res..

[10]  Chung-Shou Liao,et al.  New Lower Bounds for the Three-dimensional Orthogonal Bin Packing Problem , 2013, CCCG.

[11]  Ronald L. Rivest,et al.  Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[12]  Jae Kyu Lee,et al.  A spatial scheduling system and its application to shipbuilding: DAS-CURVE , 1996 .

[13]  K. Bouleimen,et al.  A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version , 2003, Eur. J. Oper. Res..

[14]  Sönke Hartmann,et al.  A competitive genetic algorithm for resource-constrained project scheduling , 1998 .

[15]  Rainer Kolisch,et al.  Efficient priority rules for the resource-constrained project scheduling problem , 1996 .

[16]  Chin-Chia Wu,et al.  Parallel-Machine Scheduling to Minimize Flowtime, Holding, and Batch Delivery Costs , 2014, Asia Pac. J. Oper. Res..

[17]  Rasaratnam Logendran,et al.  Spatial scheduling for shape-changing mega-blocks in a shipbuilding company , 2011 .

[18]  Gleb Belov,et al.  One-dimensional heuristics adapted for two-dimensional rectangular strip packing , 2008, J. Oper. Res. Soc..

[19]  T. C. Edwin Cheng,et al.  Two-agent single-machine scheduling with unrestricted due date assignment , 2015, Comput. Ind. Eng..

[20]  Analía Amandi,et al.  Hybridizing a multi-objective simulated annealing algorithm with a multi-objective evolutionary algorithm to solve a multi-objective project scheduling problem , 2013, Expert Syst. Appl..

[21]  Erik Demeulemeester,et al.  New Benchmark Results for the Resource-Constrained Project Scheduling Problem , 1997 .

[22]  Ramón Alvarez-Valdés,et al.  A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems , 2013, Comput. Oper. Res..