Development of a Genetic Algorithm for the Maritime Transportation Planning of Car Carriers

Many researches have been made in order to solve global logistic problems, and especially in case of maritime transportation, much more studies have been made compared with other transportation fields because of its weight in terms of international logistics. However, little study has been made on the car carrier’s transportation, due to its relatively small weight in the maritime transportation market. For this reason, this study has tried to develop an algorithm for the maritime transportation planning of car carriers, so that they can not only reduce logistics costs but also improve competitiveness. Car carriers are usually depending upon manual work, and concerning the routing of car carriers, however, many changes are frequently taking place in the car production schedule and ship’s arrival schedule. Because of this, this study has developed a genetic algorithm for car carrier’s routing so as to make an optimal transportation planning with minimum costs. The genetic algorithm in this study has been compared with the solution results of integer programming in an effort to test its performance.

[1]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[2]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[3]  Hyung-Rim Choi,et al.  DEVELOPMENT OF MARITIME TRANSPORTATION PLANNING SUPPORT SYSTEM FOR A CAR SHIPPING COMPANY , 2008 .

[4]  Dag Haugland,et al.  A tabu search heuristic for the vehicle routing problem with time windows and split deliveries , 2004, Comput. Oper. Res..

[5]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[6]  Hyung Rim Choi,et al.  A hybrid genetic algorithm for the job shop scheduling problems , 2003, Comput. Ind. Eng..

[7]  Gilbert Laporte,et al.  Classical and modern heuristics for the vehicle routing problem , 2000 .

[8]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[9]  Patrick R. McMullen,et al.  Ant colony optimization techniques for the vehicle routing problem , 2004, Adv. Eng. Informatics.

[10]  Barrie M. Baker,et al.  A genetic algorithm for the vehicle routing problem , 2003, Comput. Oper. Res..

[11]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

[12]  Kazuhiko Kawamura,et al.  Exploring Problem-Specific Recombination Operators for Job Shop Scheduling , 1991, ICGA.

[13]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[14]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .