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

Applied Intelligence

Volumn 36, Issue 3, 2012, Pages 585-604

  Kang, Moo Hong ^a   Choi, Hyung Rim ^b   Kim, Hyun Soo ^b   Park, Byung Joo ^c  

^a UNIVERSITY OF ARKANSAS AT LITTLE ROCK   (United States)

^b Dong A University   (South Korea)

^c Gyeongnam Development Institute   (South Korea)

Author keywords

Decision support system; Genetic algorithm; Maritime transportation; Routing problem

Indexed keywords

COMPETITIVE ADVANTAGE; COST SAVING; CUSTOMER SERVICES; MARITIME TRANSPORTATION; META HEURISTIC ALGORITHM; PORT LOGISTICS; ROUTING PROBLEMS; SHIPPING COMPANIES; TRANSPORTATION COST; TRANSPORTATION PLANNING; VEHICLE ROUTING PROBLEMS;

ARTIFICIAL INTELLIGENCE; COMPETITION; DECISION SUPPORT SYSTEMS; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; PORTS AND HARBORS;

WATERWAY TRANSPORTATION;

EID: 84862133445     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10489-011-0278-z     Document Type: Article

References (71)

1. Alfredo O, Omar V (2005) Adaptive memory programming for the vehicle routing problem with multiple trips. Comput Oper Res 34(1):28-47
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 (Pubitemid 44442698)
3. Bäck T (1996) Evolutionary algorithms in theory and practice: evolutionary strategies, evolutionary programming, genetic algorithms. Oxford University Press, London
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
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, 10-17
6. Baker BM, Ayechew MA (2003) A genetic algorithm for the vehicle routing problem. Comput Oper Res 30:787-800 (Pubitemid 36175284)
7. Beasley JE, Krishnamoorthy M, Sharaiha YM, Bramsom DA (2002) Scheduling aircraft landings the static case. Transp Sci 34(2):180-197
8. Bell JE, McMullen PR (2004) Ant colony optimization techniques for the vehicle routing problem. Adv Eng Inform 18:41-48
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
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 (Pubitemid 44332705)
12. Brown GG, Graves GW, Ronen D (1987) Scheduling ocean transportation of crude oil. Manag Sci 33:335-346 (Pubitemid 17569623)
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 (Pubitemid 128092969)
14. Christiansen M, Fagerholt K, Nygreen B, Ronen D (2007) Maritime transportation. Handb Oper Res Manag Sci 14:189-284
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
16. Clark G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568-581
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
19. Davis L (1991) Oder-based genetic algorithms and the graph coloring problem. Handbook of genetic algorithms. Van Nostrand-Reinhold, New York
20. David M, Olli B (2005) Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Comput Oper Res 34(10):2964-2975
21. Du TC, Li EY, Chou D (2005) Dynamic vehicle routing for online B2C delivery. Omega 33:33-45 (Pubitemid 39518809)
22. Fagerholt K (1999) Optimal fleet design in a ship routing problem. Int Trans Oper Res 6(5):453-464
23. Fagerholt K (2001) Ship scheduling with soft time windows: an optimisation based approach. Eur J Oper Res 131:559-571 (Pubitemid 32272378)
24. Fagerholt K (2004) A computer-based decision support system for vessel fleet scheduling-experience and future research. De-cis Support Syst 37:35-47
25. Fagerholt K, Christiansen M (2000) A combined ship scheduling and allocation problem. J Oper Res Soc 51:834-842
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 (Pubitemid 47488641)
27. Fisher ML, Rosenwein MB (1989) An interactive optimization system for bulk-cargo ship scheduling. Nav Res Logist 36(1):27-42
28. Franklin TH, Beatrice MOB (2007) Dynamic vehicle routing using genetic algorithms. Appl Intell 27:89-99
29. Gen M, Cheng R (1997) Genetic algorithms and engineering design. Wiley, New York
30. Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manag Sci 40:1276-1290
31. George I, Manolis K, Gregory P (2003) A problem generatorsolver heuristic for vehicle routing with soft time windows. Omega 31(1):41-53
32. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading
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 (Pubitemid 46199073)
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
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
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
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 (Pubitemid 38728562)
38. Hoberger S, Park Y (1999) A heuristic for Bi-objective vehicle routing with time window constraints. Int J Prod Econ 62:249-258
39. Holland HJ (1992) Adaptation in natural and artificial systems. MIT Press, Cambridge
40. Jetlund AS, Karimi IA (2004) Improving the logistics of multi-compartment chemical tankers. Comput Chem Eng 28:1267-1283 (Pubitemid 38609081)
41. Jia J (2007) Investigations of vehicle securing without lashings for Ro-Ro ships. J Mar Sci Technol 12(1):43-57 (Pubitemid 46492291)
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
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
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
45. Keen PG, Scott M (1978) Decision support system: an organizational perspective. Addison-Wesley, New York
46. Kim SH, Lee KK (1997) An optimization-based decision support system for ship scheduling. Comput Ind Eng 33:689-692
47. Kim SY (2003) Recent market trend of car carrier. Mon Marit Korea 353:34-42
48. Laderman J, Gleiberman L, Egan JF (1966) Vessel allocation by linear programming. Nav Res Logist Q 13(3):315-320
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
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
51. Lawrence SA (1972) International sea transport: the year ahead. Lexington Books, Lexington
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
53. Lenstra J, Kan R (1981) Complexity of vehicle routing and scheduling problems. Networks 11:221-227 (Pubitemid 13506973)
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
55. Liu FH, Shen SY (1999) The fleet size and mix vehicle routing problem with time windows. J Oper Res Soc 50:721-732
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 (Pubitemid 128674734)
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 (Pubitemid 30135209)
59. Ombuk B, Ross BJ, Hanshar F (2006) Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl Intell 24:17-30 (Pubitemid 43130238)
60. Osman LH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41:421-451
61. Park BJ, Choi HR, Kim HS (2003) A hybrid GA for job shop scheduling problems. Comput Ind Eng 45:597-613
62. Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34:2403-2435 (Pubitemid 46073431)
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 (Pubitemid 126708303)
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
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 (Pubitemid 16571966)
66. Ronen D (1993) Ship scheduling: the last decade. Eur J Oper Res 71:325-333
67. Scott Morton MS (1971) Management decision systems: computer-based support for decision making. Harvard Division of Research, Cambridge
68. Solomon M (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35:254-265 (Pubitemid 17652588)
69. Syswerda G (1989) Uniform crossover in genetic algorithms. In: Proc. third international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 2-9
70. Tailard ED (1996) A heuristic column generation method for the heterogeneous fleet VRP. RAIRO 33:1-34
71. Whiton JC (1967) Some constraints on shipping in linear programming models. Nav Res Logist Q 14(2):257-260