Ant colony optimisation with random selection for block transportation scheduling with heterogeneous transporters in a shipyard

References

• Baker , EK . 1983 . An exact algorithm for the time-constrained traveling salesman problem . Operations Research , 31 ( 5 ) : 939 – 945 .
   Web of Science ®Google Scholar
• Bard , JF , Kontoravdis , G and Yu , G . 2002 . A branch-and-cut procedure for the vehicle routing problem with time windows . Transportation Science , 36 ( 2 ) : 250 – 269 .
   Web of Science ®Google Scholar
• Bianco , L , Mingozzi , A and Ricciardelli , S . 1998 . Dynamic programming strategies for the traveling salesman problem with time windows and precedence constraints . Operations Research , 45 ( 3 ) : 365 – 378 .
   Web of Science ®Google Scholar
• Calvo , RW . 2000 . A new heuristic for the traveling salesman problem with time windows . Transportation Science , 34 ( 1 ) : 113 – 124 .
   Web of Science ®Google Scholar
• Chao , IM . 2002 . A tabu search method for truck and trailer routing problem . Computers and Operations Research , 29 ( 1 ) : 33 – 51 .
   Web of Science ®Google Scholar
• Crainic , TG and Laporte , G . 1998 . Fleet management and logistics , Dordrecht, MA : Kluwer Academic Publishers .
   Google Scholar
• Desrosiers , J , Sauve , M and Soumis , F . 1988 . Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows . Management Science , 34 ( 8 ) : 1005 – 1022 .
   Web of Science ®Google Scholar
• Dorigo , M and Gambardella , LM . 1997 . Ant colony system: A cooperative learning approach to the travel salesman problem . IEEE Transactions on Evolutionary Computation , 1 ( 1 ) : 53 – 66 .
   Google Scholar
• Driessel , R and Monch , L . 2011. Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times. Computers & Industrial Engineering, 61 (2), 336–345
   Google Scholar
• Dumas , Y . 1995 . An optimal algorithm for the traveling salesman problem with time windows . Operations Research , 43 ( 2 ) : 367 – 371 .
   Web of Science ®Google Scholar
• Gendreau , M . 1998 . A generalized insertion heuristic for the traveling salesman problem with time windows . Operations Research , 46 ( 3 ) : 330 – 335 .
   Web of Science ®Google Scholar
• Gharehgozli , AH , Tavakkoli-Moghaddam , R and Zaerpour , N . 2009 . A fuzzy-mixed -integer goal programming mode for a parallel-machine scheduling problem with sequence-dependent setup times and release dates . Robotics and Computer-Integrated Manufacturing , 25 ( 4–5 ) : 853 – 859 .
   Web of Science ®Google Scholar
• Joo , CM . 2006 . Transporter scheduling for block transportation in shipbuilding . Journal of the Korea Management Engineer Society , 11 ( 3 ) : 169 – 179 .
   Google Scholar
• Langevin , A . 1993 . A two commodity flow formulation for the traveling salesman and makespan problems with time windows . Network , 23 ( 7 ) : 631 – 640 .
   Web of Science ®Google Scholar
• Laporte , G and Osman , H . 1995 . Routing problems: A bibliography . Annals of Operations Research , 61 ( 1 ) : 227 – 262 .
   Web of Science ®Google Scholar
• Logendran , R , McDonnell , B and Smucker , B . 2007 . Scheduling unrelated parallel machines with sequence-dependent setups . Computers & Operations Research , 11 ( 11 ) : 3420 – 3438 .
   Web of Science ®Google Scholar
• Nait , TD . 2003 . A new approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times based on linear programming . In: International conference on industrial engineering and production management (IEPM’03), 26–28 May, Porto, Portugal , : 266 – 274 .
   Google Scholar
• Nessah , F . Yalaoui, F., and Chu, C., 2005. New heuristics for identical parallel machine scheduling with sequence-dependent setup times and dates. In: Proceedings of the international conference on industrial engineering and systems management (IEMS'05), 16–19 May, Marrakech, Morocco, 32–41
   Google Scholar
• Pesant , G . 1998 . An exact constraint logic programming algorithm for the TSP with time windows . Transportation Science , 32 ( 1 ) : 12 – 29 .
   Web of Science ®Google Scholar
• Rocha , M . 2007 . Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighborhood search . IMA Journal of Management Mathematics , 18 ( 2 ) : 101 – 115 .
   Google Scholar
• Roh , M and Cha , J . 2011 . A block transportation scheduling system considering a minimization of travel distance without loading of and interference between multiple transporters . International Journal of Production Research , 49 ( 11 ) : 3231 – 3250 .
   Web of Science ®Google Scholar
• Savelsbergh , MWP . 1985 . Local search in routing problems with time windows . Annals of Operations Research , 4 ( 1 ) : 285 – 305 .
   Google Scholar
• Sveltana , A , Kravchenko , S and Werner , F . 2001 . A heuristic algorithm for minimizing mean flow time with unit setups . Information Processing Letters , 79 ( 6 ) : 291 – 296 .
   Web of Science ®Google Scholar
• Tahar , DN . 2006 . A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times . International Journal of Production Economics , 99 ( 1–2 ) : 63 – 73 .
   Web of Science ®Google Scholar
• Yalaoui , F and Chu , C . 2003 . An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times . IIE Transactions , 35 ( 2 ) : 183 – 190 .
   Web of Science ®Google Scholar