Skip to main content

Genetic Algorithm Adoption to Transport Task Optimization

  • Conference paper
  • First Online:
International Joint Conference SOCO’16-CISIS’16-ICEUTE’16 (SOCO 2016, CISIS 2016, ICEUTE 2016)

Abstract

The paper presents an optimization task of transportation - production solved with genetic algorithms. For the network of processing plants (factories) and collection centers the cost-optimal transportation plan will be established. Plan is regarding to raw materials to the relevant factories. Task of transportation - production regard to the milk transport and processing will be investigated. It is assumed that the functions defining the costs of processing are polynomials of the second degree. Genetic algorithms, their properties and capabilities in solving computational problems will be described and conclusions will be presented. The program that uses genetic algorithms written in MATLAB will be used to solve an investigated issue.

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

Access this chapter

Institutional subscriptions

References

  1. Ayough, A., Zandieh, M., Farsijani, H.: GA and ICA approaches to job rotation scheduling problem: considering employee’s boredom. Int. J. Adv. Manuf. Technol. 60, 651–666 (2012)

    Article  Google Scholar 

  2. Chodak G., Kwaśnicki W.: Genetic algorithms in seasonal demand forecasting. In: Information Systems Architecture and Technology 2000, Wrocław University of Technology, pp. 91–98 (2000)

    Google Scholar 

  3. Govindan, K., Jha, P.C., Garg, K.: Product recovery optimization in closed-loop supply chain to improve sustainability in manufacturing. Int. J. Prod. Res. 54(5), 1463–1486 (2016)

    Article  Google Scholar 

  4. Guvenir, H.A., Erel, E.: Multicriteria inventory classification using a genetic algorithm. Eur. J. Oper. Res. 105(1), 29–37 (1998)

    Article  MATH  Google Scholar 

  5. Jachimowski, R., Kłodawski, M.: Simulated annealing algorithm for the multi-level vehicle routing problem, Logistyka 4 (2013)

    Google Scholar 

  6. Krenczyk, D., Skolud, B.: Transient states of cyclic production planning and control. Appl. Mech. Mater. 657, 961–965 (2014)

    Article  Google Scholar 

  7. Nissen, V.: Evolutionary algorithms in management science. An overview and list of references. Papers on Economics & Evolution, Report No. 9303, European Study Group for Evolutionary Economics (1993)

    Google Scholar 

  8. Sahu, A., Tapadar, R.: Solving the assignment problem using genetic algorithm and simulated annealing. Int. J. Appl. Math. 36, 1 (2007)

    MathSciNet  MATH  Google Scholar 

  9. Yusoff, M., Ariffin, J., Mohamed, A.: Solving vehicle assignment problem using evolutionary computation. In: Tan, Y., Shi, Y., Tan, K.C. (eds.) ICSI 2010, Part I. LNCS, vol. 6145, pp. 523–532. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Zegordi, S.H., Beheshti Nia, M.A.: A multi-population genetic algorithm for transportation scheduling. Transp. Res. Part E: Logist. Transp. Rev. 45(6), 946–959 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anna Burduk .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Burduk, A., Musiał, K. (2017). Genetic Algorithm Adoption to Transport Task Optimization. In: Graña, M., López-Guede, J.M., Etxaniz, O., Herrero, Á., Quintián, H., Corchado, E. (eds) International Joint Conference SOCO’16-CISIS’16-ICEUTE’16. SOCO CISIS ICEUTE 2016 2016 2016. Advances in Intelligent Systems and Computing, vol 527. Springer, Cham. https://doi.org/10.1007/978-3-319-47364-2_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-47364-2_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-47363-5

  • Online ISBN: 978-3-319-47364-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics