Skip to main content

Application of Selected Optimization Methods in Car Distribution Planning on the Example of Polish Market

  • Conference paper
  • First Online:
Eurasian Business Perspectives

Part of the book series: Eurasian Studies in Business and Economics ((EBES,volume 13/2))

  • 521 Accesses

Abstract

At present, many transportation companies can boast about their new and modern transport fleet. However, only few of them have advanced decision support software for route planning. Most often the decisions related to the organization of transport depend on the experience of the staff. The chapter takes an optimisation-based perspective of the problem of work organization for a given means of transport in the distribution of passenger cars. The author illustrates selected methods of optimizing transportation services which can be used to improve the flow of vehicles from the loading point to the car dealer. One of the methods presented in the chapter is a technique based on permutations and the evolutionary method, the other—the branch and bound method with Little algorithm. They are used to solve the most-known combinatorial problem—the Travelling Salesman Problem. The main objective of the chapter is to show the possibility of using these methods in a simple way, without using specialized software. In addition, apart from the simplicity of their use, the application of these methods could help to optimize route planning, shorten the working time of drivers, and consequently increase the economic efficiency of the distribution system of a transportation company. Eventually, the chapter provides an example of solving the vehicle routing problem together with its analysis.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Baj-Rogowska, A. (2013). Planowanie tras z wykorzystaniem narzÄ™dzia Solver jako zadanie logistyczne w maÅ‚ej firmie (Route Planning with the Use of Solver Tool, as a Logistic Task in a Small Company). Prace Naukowe Wyższej SzkoÅ‚y Bankowej w GdaÅ„sku, 28, 169–178.

    Google Scholar 

  • Belfiore, P., Tsugunobu, H., & Yoshizaki, Y. (2008). Scatter search for vehicle routing problem with time windows and split deliveries. In: T. Carić & H. Gold (Eds.), Vehicle routing problem (pp. 1–14). InTech [online]. Accessed December 12, 2017, from https://bib.irb.hr/datoteka/433524.Vehnicle_Routing_Problem.pdf

  • Clausen, J. (1999). Branch and bound algorithms principles and examples [online]. Accessed December 13, 2017, from http://janders.eecg.toronto.edu/1387/readings/b_and_b.pdf

  • Dantzig, G. B., Fulkerson, D. R., & Johnson, S. M. (1954). Solution of a large-scale traveling-salesman problem. Operations Research, 2, 393–410.

    Google Scholar 

  • Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80–91.

    Article  Google Scholar 

  • Dhamala, T. N., & Pyakurel, U. (2016). Significance of transportation network models in emergency planning of urban cities. International Journal of Cities, People and Places, 2(1), 58–76.

    Google Scholar 

  • Jakubowska, A., & Piechocka, K. (2015). W poszukiwaniu optymalnej trasy – Wybrane algorytmy w zastosowaniu do problemu komiwojażera (In search of the optimal route selected algorithms applicable to the traveling salesman problem). Journal of Translogistics, 2015, 7–23.

    Google Scholar 

  • Kumar, L. (2017). Comparative analysis of different methods for solving fuzzy transportation problem. International Journal of Statistics and Applied Mathematics, 2(4), 19–21.

    Google Scholar 

  • Laporte, G. (1992). The traveling salesman problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59, 231–247.

    Article  Google Scholar 

  • Liana, M., & Pisula, T. (2014). Problem wyboru tras dostaw z uwzglÄ™dnieniem różnych Å›rodków transport (The problem of optimal choice of supply routes with different means of transport). Logistyka, 6, 6719–6725.

    Google Scholar 

  • Little, J. D. C., Murty, K. G., Sweeney, D. W., & Karel, C. (1963). An algorithm for the traveling salesman problem. Operations Research, 11(6), 972–989.

    Article  Google Scholar 

  • Matai, R., Singh, S. P., & Mittal, M. L. (2010). Traveling salesman problem: An overview of applications, formulations, and solution approaches. In: D. Davendra (Ed.), Traveling salesman problem, theory and applications (pp. 1–24). InTech. Accessed December 13, 2017, from http://www.intechopen.com/books/traveling-salesman-problem-theory-and-applications/traveling-salesmanproblem-an-overview-of-applications-formulations-and-solution-approaches

  • Mathur, N., Srivastava, P. K., & Paul, A. (2016). Trapezoidal fuzzy model to optimize transportation problem. International Journal of Modeling, Simulation, and Scientific Computing, 7(3), 1650028.

    Article  Google Scholar 

  • Monreal, C. O. (2017). Transportation network modeling and ITS research group. IEEE Intelligent Transportation Systems Magazine, 9(3), 151–155.

    Article  Google Scholar 

  • Näher, S. (2011). The travelling salesman problem. In B. Vöcking et al. (Eds.), Algorithms unplugged (pp. 383–391). Berlin: Springer.

    Chapter  Google Scholar 

  • Notomista, G., Selvaggio, M., Sbrizzi, F., Di Maio, G., Grazioso, S., & Botsch, M. (2016). A fast airplane boarding strategy using online seat assignment based on passenger classification. Journal of Air Transport Management, 53, 140–149.

    Article  Google Scholar 

  • Öncan, T., Altınel, I. K., & Laporte, G. (2009). A comparative analysis of several asymmetric traveling salesman problem formulations. Computers & Operations Research, 36, 637–654.

    Article  Google Scholar 

  • Pashchenkoa, F. F., Kuznetsovb, N. A., Ryabykhc, N. G., Minashinac, I. K., Zakharovac, E. M., & Tsvetkovad, O. A. (2015). Implementation of train scheduling system in rail transport using assignment problem solution. Procedia Computer Science, 63, 154–158.

    Article  Google Scholar 

  • Singh, S., Dubey, G. C., & Shrivastava, R. (2012). A various method to solve the optimality for the transportation problem. International Journal of Mathematical Engineering and Science, 1(4), 21–28.

    Google Scholar 

  • WÄ™grzyn, J. (2013). RozwiÄ…zywanie problemu komiwojażera za pomocÄ… Metody Ewolucyjnej z Excela 2010 (Solving of traveling salesman problem using evolutionary solver for excel 2010). Gospodarka MateriaÅ‚owa i Logistyka, 12, pp. 11–17. Following: A. Chaudhuri, K. De, A study of traveling salesman problem using fuzzy self organizing map. In: D. Davendra (Ed.), 2010. Traveling salesman problem, theory and applications (pp. 197–212). InTech.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marta Jarocka .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jarocka, M. (2020). Application of Selected Optimization Methods in Car Distribution Planning on the Example of Polish Market. In: Bilgin, M., Danis, H., Demir, E., Aysan, A. (eds) Eurasian Business Perspectives. Eurasian Studies in Business and Economics, vol 13/2. Springer, Cham. https://doi.org/10.1007/978-3-030-40160-3_7

Download citation

Publish with us

Policies and ethics