Skip to main content

Advertisement

SpringerLink
Log in

Development of a maritime transportation planning support system for car carriers based on genetic algorithm

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Recently, the port logistics market is rapidly expanding, along with the active maritime trade. To adjust to this trend and gain a competitive advantage, competition among shipping companies at home and abroad has intensified, and many efforts are being made for the improvement of customer services and cost saving. In particular, car carriers transporting more than 80% of total car import/export volume must quickly make efforts to reduce transportation costs. Much research has been conducted to improve the efficiency of maritime transportation, but studies on car carriers, which are given relatively less importance, have been lacking. The car carrier’s transportation planning is similar to the vehicle routing problem, but it is much more complicated in that cars and cargo are prepared at different points in time, and cargo can be loaded not only at the departing port but also at other ports. Therefore, in an effort to solve the problem, this study has developed a meta-heuristic algorithm based on a genetic algorithm, and we have succeeded in developing a maritime transportation planning support system with the algorithm, thus making it possible to prepare various alternatives, evaluate them, and consequently support user’s decision making.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alfredo O, Omar V (2005) Adaptive memory programming for the vehicle routing problem with multiple trips. Comput Oper Res 34(1):28–47

    Google Scholar 

  2. Al-Khayyal F, Hwang SJ (2007) Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, part I: application and model. Eur J Oper Res 176:106–130

    Article  MathSciNet  MATH  Google Scholar 

  3. Bäck T (1996) Evolutionary algorithms in theory and practice: evolutionary strategies, evolutionary programming, genetic algorithms. Oxford University Press, London

    MATH  Google Scholar 

  4. Badeau P, Guertin F, Gendreau M, Potvin J, Taillard E (1997) A parallel tabu search heuristic for the vehicle routing problem with time windows. Transp Res, Part C, Emberging Technol 5:109–122

    Article  Google Scholar 

  5. Bagchi S, Uckun S, Miyabe Y, Kawamura K (1991) Exploring problem-specific recombination operators for job shop scheduling. In: Proc. fourth international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 10–17

    Google Scholar 

  6. Baker BM, Ayechew MA (2003) A genetic algorithm for the vehicle routing problem. Comput Oper Res 30:787–800

    Article  MathSciNet  MATH  Google Scholar 

  7. Beasley JE, Krishnamoorthy M, Sharaiha YM, Bramsom DA (2002) Scheduling aircraft landings the static case. Transp Sci 34(2):180–197

    Article  Google Scholar 

  8. Bell JE, McMullen PR (2004) Ant colony optimization techniques for the vehicle routing problem. Adv Eng Inform 18:41–48

    Article  Google Scholar 

  9. Brindle A (1981) Genetic algorithms for function optimization. Unpublished Ph.D. thesis, University of Alberta, Edmonton

  10. Briskin LE (1966) Selecting delivery dates in the tanker scheduling problem. Manag Sci 12(6):224–234

    Article  Google Scholar 

  11. Brønmo G, Christiansen M, Fagerholt K, Nygreen B (2007) A multi-start local search heuristic for ship scheduling—a computational study. Comput Oper Res 34:900–917

    Article  Google Scholar 

  12. Brown GG, Graves GW, Ronen D (1987) Scheduling ocean transportation of crude oil. Manag Sci 33:335–346

    Article  Google Scholar 

  13. Burger J, Salois M, Begin R (1998) A hybrid genetic algorithm for the vehicle routing problem with time windows. Lect Notes Artif Intell 1418:114–127

    Google Scholar 

  14. Christiansen M, Fagerholt K, Nygreen B, Ronen D (2007) Maritime transportation. Handb Oper Res Manag Sci 14:189–284

    Article  Google Scholar 

  15. Chung EY, Park YB (2004) A genetic algorithm for vehicle routing problems with mixed delivery and pick-up. J Korean Inst Ind Eng 30:346–354

    Google Scholar 

  16. Clark G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581

    Article  Google Scholar 

  17. Cordeau JF, Laporte G (2002) Tabu search heuristics for the vehicle routing problem/GERAD G-2002-15

  18. Dantzig GB, Fulkerson DR (1954) Minimizing the number of tankers to meet a fixed schedule. Nav Res Logist Q 1:217–222

    Article  Google Scholar 

  19. Davis L (1991) Oder-based genetic algorithms and the graph coloring problem. Handbook of genetic algorithms. Van Nostrand-Reinhold, New York

    Google Scholar 

  20. David M, Olli B (2005) Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Comput Oper Res 34(10):2964–2975

    Google Scholar 

  21. Du TC, Li EY, Chou D (2005) Dynamic vehicle routing for online B2C delivery. Omega 33:33–45

    Article  Google Scholar 

  22. Fagerholt K (1999) Optimal fleet design in a ship routing problem. Int Trans Oper Res 6(5):453–464

    Article  Google Scholar 

  23. Fagerholt K (2001) Ship scheduling with soft time windows: an optimisation based approach. Eur J Oper Res 131:559–571

    Article  MathSciNet  MATH  Google Scholar 

  24. Fagerholt K (2004) A computer-based decision support system for vessel fleet scheduling—experience and future research. Decis Support Syst 37:35–47

    Article  Google Scholar 

  25. Fagerholt K, Christiansen M (2000) A combined ship scheduling and allocation problem. J Oper Res Soc 51:834–842

    MATH  Google Scholar 

  26. Fallahi AE, Prins C, Calvo RW (2008) A genetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Comput Oper Res 35:1725–1741

    Article  MATH  Google Scholar 

  27. Fisher ML, Rosenwein MB (1989) An interactive optimization system for bulk-cargo ship scheduling. Nav Res Logist 36(1):27–42

    Article  Google Scholar 

  28. Franklin TH, Beatrice MOB (2007) Dynamic vehicle routing using genetic algorithms. Appl Intell 27:89–99

    Article  MATH  Google Scholar 

  29. Gen M, Cheng R (1997) Genetic algorithms and engineering design. Wiley, New York

    Google Scholar 

  30. Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manag Sci 40:1276–1290

    Article  MATH  Google Scholar 

  31. George I, Manolis K, Gregory P (2003) A problem generator-solver heuristic for vehicle routing with soft time windows. Omega 31(1):41–53

    Article  Google Scholar 

  32. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading

    MATH  Google Scholar 

  33. Gribkovskaia I, Halskau O, Laporte G, Vlcek M (2007) General solutions to the single vehicle routing problem with pickups and deliveries. Eur J Oper Res 180:568–584

    Article  MathSciNet  MATH  Google Scholar 

  34. Haugland D, Ho SC, Laporte G (2007) Designing delivery districts for the vehicle routing problem with stochastic demands. Eur J Oper Res 180:997–1010

    Article  MathSciNet  MATH  Google Scholar 

  35. Herminia IC, Carment G, Maria-Jose O, Belen S (2005) A goal programming approach to vehicle routing problems with soft time windows. Eur J Oper Res 177(3):1720–1733

    Google Scholar 

  36. Hideki H, Toshihide I, Shinji I, Mutsunori Y (2006) The vehicle routing problem with flexible time windows and traveling times. Discrete Appl Math 154(16):2271–2290

    Article  MathSciNet  MATH  Google Scholar 

  37. Ho SC, Haugland D (2004) A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput Oper Res 31:1947–1964

    Article  MATH  Google Scholar 

  38. Hoberger S, Park Y (1999) A heuristic for Bi-objective vehicle routing with time window constraints. Int J Prod Econ 62:249–258

    Article  Google Scholar 

  39. Holland HJ (1992) Adaptation in natural and artificial systems. MIT Press, Cambridge

    Google Scholar 

  40. Jetlund AS, Karimi IA (2004) Improving the logistics of multi-compartment chemical tankers. Comput Chem Eng 28:1267–1283

    Article  Google Scholar 

  41. Jia J (2007) Investigations of vehicle securing without lashings for Ro-Ro ships. J Mar Sci Technol 12(1):43–57

    Article  Google Scholar 

  42. Jih WR, Kao CY, Hsu JY (2002) Using family competition genetic algorithm in pickup and delivery problem with time window constraints. In: Proceedings of the 2002 IEEE international symposium on intelligent control

    Google Scholar 

  43. Jung JU, Choi HR, Kim HS, Park BJ (2007) Development of car carrier’s maritime transportation planning system. In: Korea intelligent information systems society. Autumn season academic meeting 2007, pp 556–563

    Google Scholar 

  44. Karmmarti P, Hammadi S, Borne P, Ksouri MA (2004) New hybrid evolutionary approach for the pickup and delivery problem with time windows. In: 2004 IEEE international conference on systems, man and cybernetics

    Google Scholar 

  45. Keen PG, Scott M (1978) Decision support system: an organizational perspective. Addison-Wesley, New York

    Google Scholar 

  46. Kim SH, Lee KK (1997) An optimization-based decision support system for ship scheduling. Comput Ind Eng 33:689–692

    Article  Google Scholar 

  47. Kim SY (2003) Recent market trend of car carrier. Mon Marit Korea 353:34–42

    Google Scholar 

  48. Laderman J, Gleiberman L, Egan JF (1966) Vessel allocation by linear programming. Nav Res Logist Q 13(3):315–320

    Article  Google Scholar 

  49. Laporte G, Gendreau M, Potvin JY, Semet F (2000) Classical and modern heuristics for the vehicle routing problem. Int Trans Oper Res 7:285–300

    Article  MathSciNet  Google Scholar 

  50. Lau HC, Liang Z (2001) Pickup and delivery with time windows: algorithms and test case generation. In: 13th IEEE international conference on tools with artificial intelligence, Dallas, USA

    Google Scholar 

  51. Lawrence SA (1972) International sea transport: the year ahead. Lexington Books, Lexington

    Google Scholar 

  52. Lee CY, Lee ZJ, Lin SW, Ying KC (2010) An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem. Appl Intell 32(1):88–95

    Article  Google Scholar 

  53. Lenstra J, Kan R (1981) Complexity of vehicle routing and scheduling problems. Networks 11:221–227

    Article  Google Scholar 

  54. Li H, Lim A (2001) A metaheuristic for the pickup and delivery problem with time windows. In: 13th IEEE international conference on tools with artificial intelligence, Dallas, USA

    Google Scholar 

  55. Liu FH, Shen SY (1999) The fleet size and mix vehicle routing problem with time windows. J Oper Res Soc 50:721–732

    MATH  Google Scholar 

  56. Mitsui OSK Lines LTD (2007) Investor guidebook

  57. Mosheiov G (1998) Vehicle routing with pick-up and delivery: tour-partitioning heuristics. Comput Ind Eng 34(3):669–684

    Article  MathSciNet  Google Scholar 

  58. Nanry WP, Barnes JW (2000) Solving the pickup and delivery problem with time windows using reactive tabu search. Transp Res Part B 34:107–121

    Article  Google Scholar 

  59. Ombuk B, Ross BJ, Hanshar F (2006) Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl Intell 24:17–30

    Article  Google Scholar 

  60. Osman LH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41:421–451

    Article  MATH  Google Scholar 

  61. Park BJ, Choi HR, Kim HS (2003) A hybrid GA for job shop scheduling problems. Comput Ind Eng 45:597–613

    Article  Google Scholar 

  62. Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34:2403–2435

    Article  MathSciNet  MATH  Google Scholar 

  63. Potvin JY, Dube D, Robillard C (1996) A hybrid approach to vehicle routing using neural networks and genetic algorithms. Appl Intell 6:241–252

    Article  Google Scholar 

  64. Rodolfo D, Jaime C (2006) A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. Eur J Oper Res 176(3):1478–1507

    Google Scholar 

  65. Ronen D (1986) Short-term scheduling of vessels for ship bulk or semi-bulk commodities originating in a single area. Oper Res 34:164–173

    Article  MATH  Google Scholar 

  66. Ronen D (1993) Ship scheduling: the last decade. Eur J Oper Res 71:325–333

    Article  MATH  Google Scholar 

  67. Scott Morton MS (1971) Management decision systems: computer-based support for decision making. Harvard Division of Research, Cambridge

    Google Scholar 

  68. Solomon M (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35:254–265

    Article  MathSciNet  MATH  Google Scholar 

  69. Syswerda G (1989) Uniform crossover in genetic algorithms. In: Proc. third international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 2–9

    Google Scholar 

  70. Tailard ED (1996) A heuristic column generation method for the heterogeneous fleet VRP. RAIRO 33:1–34

    Article  Google Scholar 

  71. Whiton JC (1967) Some constraints on shipping in linear programming models. Nav Res Logist Q 14(2):257–260

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management, University of Arkansas at Little Rock, 2801 S. University Avenue, Little Rock, AR, 72204, USA

    Moo Hong Kang

  2. Department of Management Information Systems, Dong-A University, 1, 2-ga, Bumin-dong, Seo-gu, Busan, 602-760, South Korea

    Hyung Rim Choi & Hyun Soo Kim

  3. Gyeongnam Development Institute, 152 Joongan-ro Changwon city, Gyeongnam, 641-060, South Korea

    Byung Joo Park

Authors
  1. Moo Hong Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hyung Rim Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hyun Soo Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Byung Joo Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hyung Rim Choi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kang, M.H., Choi, H.R., Kim, H.S. et al. Development of a maritime transportation planning support system for car carriers based on genetic algorithm. Appl Intell 36, 585–604 (2012). https://doi.org/10.1007/s10489-011-0278-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-011-0278-z

Keywords

Search

Navigation