Skip to main content

2011 | OriginalPaper | Buchkapitel

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

verfasst von : Jae Un Jung, Moo Hong Kang, Hyung Rim Choi, Hyun Soo Kim, Byung Joo Park, Chang Hyun Park

Erschienen in: Dynamics in Logistics

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Bagchi, S., Uckun, S., Miyabe, Y., and Kawamura, K. (1991) Exploring Problem-Specific Recombination Operators for Job Shop Scheduling, Proc. Fourth Int’l Conf. on Genetic Algorithms, Morgan Kaufmann, San Mateo, pp.10–17. Bagchi, S., Uckun, S., Miyabe, Y., and Kawamura, K. (1991) Exploring Problem-Specific Recombination Operators for Job Shop Scheduling, Proc. Fourth Int’l Conf. on Genetic Algorithms, Morgan Kaufmann, San Mateo, pp.10–17.
Zurück zum Zitat Baker, B.M. and Ayechew, M.A. (2003) A genetic algorithm for the vehicle routing problem. Computers and Operations Research 30, 787–800.MATHCrossRefMathSciNet Baker, B.M. and Ayechew, M.A. (2003) A genetic algorithm for the vehicle routing problem. Computers and Operations Research 30, 787–800.MATHCrossRefMathSciNet
Zurück zum Zitat Bell, J.E. and McMullen, P.R. (2004) Ant colony optimization techniques for the vehicle routing problem. Advanced Engineering Informatics 18, 41–48.CrossRef Bell, J.E. and McMullen, P.R. (2004) Ant colony optimization techniques for the vehicle routing problem. Advanced Engineering Informatics 18, 41–48.CrossRef
Zurück zum Zitat Davis, L. (1991) Oder-Based Genetic Algorithms and the Graph Coloring Problem, Handbook of Genetic Algorithms, Davis, L. (ed), van Nostrand Reinhold, New York, pp. 72–90. Davis, L. (1991) Oder-Based Genetic Algorithms and the Graph Coloring Problem, Handbook of Genetic Algorithms, Davis, L. (ed), van Nostrand Reinhold, New York, pp. 72–90.
Zurück zum Zitat Gen, M. and Cheng, R. (1997) Genetic Algorithms and Engineering Design, New York, John Wiley & Sons. Gen, M. and Cheng, R. (1997) Genetic Algorithms and Engineering Design, New York, John Wiley & Sons.
Zurück zum Zitat Gendreau, M., Hertz, A., and Laporte, G. (1994) A tabu search heuristic for the vehicle routing problem. Management Science 40, 1276–1290.MATHCrossRef Gendreau, M., Hertz, A., and Laporte, G. (1994) A tabu search heuristic for the vehicle routing problem. Management Science 40, 1276–1290.MATHCrossRef
Zurück zum Zitat Ho, S.C. and Haugland, D. (2004) A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Computers & Operations Research 31, 1947–1964.MATHCrossRef Ho, S.C. and Haugland, D. (2004) A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Computers & Operations Research 31, 1947–1964.MATHCrossRef
Zurück zum Zitat Laporte, G., Gendreau, M., Potvin, J.Y., and Semet, F. (2000) Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research 7, 285–300.CrossRefMathSciNet Laporte, G., Gendreau, M., Potvin, J.Y., and Semet, F. (2000) Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research 7, 285–300.CrossRefMathSciNet
Zurück zum Zitat Lenstra, J. and Kan, R. (1981) Complexity of vehicle routing and scheduling problems. Networks 11, 221–227.CrossRef Lenstra, J. and Kan, R. (1981) Complexity of vehicle routing and scheduling problems. Networks 11, 221–227.CrossRef
Zurück zum Zitat Osman, L.H. (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operation Research 41, 421–451.MATHCrossRef Osman, L.H. (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operation Research 41, 421–451.MATHCrossRef
Zurück zum Zitat Park, B. J., Choi, H.R., and Kim, H.S. (2003) A hybrid GA for job shop scheduling problems. Computers and Industrial Engineering 45, 597–613.CrossRef Park, B. J., Choi, H.R., and Kim, H.S. (2003) A hybrid GA for job shop scheduling problems. Computers and Industrial Engineering 45, 597–613.CrossRef
Zurück zum Zitat Park, B.J., Choi, H.R., Kim, H.S., and Jung, J.U. (2008) Maritime Transportation Planning Support System for a Car Shipping Company. Journal of Navigation and Port Research International Edition 32, 295–304. Park, B.J., Choi, H.R., Kim, H.S., and Jung, J.U. (2008) Maritime Transportation Planning Support System for a Car Shipping Company. Journal of Navigation and Port Research International Edition 32, 295–304.
Zurück zum Zitat Pisinger, D. and Ropke, S. (2007) A general heuristic for vehicle routing problems. Computers and Operations Research 34, 2403–2435.MATHCrossRefMathSciNet Pisinger, D. and Ropke, S. (2007) A general heuristic for vehicle routing problems. Computers and Operations Research 34, 2403–2435.MATHCrossRefMathSciNet
Metadaten
Titel
Development of a Genetic Algorithm for the Maritime Transportation Planning of Car Carriers
verfasst von
Jae Un Jung
Moo Hong Kang
Hyung Rim Choi
Hyun Soo Kim
Byung Joo Park
Chang Hyun Park
Copyright-Jahr
2011
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-642-11996-5_43