Skip to main content

ST Method-Based Algorithm for the Supply Routes for Multilocation Companies Problem

  • Conference paper
  • First Online:
Knowledge, Information and Creativity Support Systems: Recent Trends, Advances and Solutions

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 364))

Abstract

This paper presents an optimization algorithm, based on the substitution tasks method (ST method). It is designed for the supply routes for multilocation companies problem. This problem is NP-hard and belongs to the class of problems for which it is impossible to establish all values and parameters a priori. The substitution tasks method uses a mathematical model of multistage decision process named algebraic-logical meta-model (ALMM). This method allows one to create many algorithms, also automatically. A formal algebraic-logical model of the problem and an algorithm based on ST method are introduced in this paper. Results of computer experiments are presented as well.

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Dudek-Dyduch, E.: Formalization and analysis of problems of discrete manufacturing processes. Scientific bulletin of AGH UST. Automatics 54 (1990) (in Polish)

    Google Scholar 

  2. Dudek-Dyduch, E.: Learning based algorithm in scheduling. J. Intell. Manuf. 11(2), 135–143 (2000)

    Article  Google Scholar 

  3. Dudek-Dyduch, E., Dutkiewicz, L.: Substitution tasks method for discrete optimization. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Żurada, J.M. (eds.) ICAISC 2013, Part II. LNCS, vol. 7895, pp. 419–430. Springer, Heidelberg (2013)

    Google Scholar 

  4. Dudek-Dyduch, E., Kucharska, E.: Learning Method for Co-operation. In: Jȩdrzejowicz, P., Nguyen, N.T., Hoang, K. (eds.) ICCCI 2011 Part II. LNCS, vol. 6923, pp. 290–300. Springer, Heidelberg (2011)

    Google Scholar 

  5. Grobler-Dȩbska, K., Kucharska, E., Dudek-Dyduch, E.: Idea of switching algebraic-logical models in flow-shop scheduling problem with defects. In: Proceedings of the 18th International Conference on Methods and Models in Automation and Robotics: Miedzyzdroje, Poland, 26–29 Aug 2013, pp. 532–537. IEEE (2013)

    Google Scholar 

  6. Jȩdrzejowicz, P., Ratajczak-Ropel, E.: A-team for solving the resource availability cost problem. Computational Collective Intelligence, Technologies and Applications, LNCS, vol. 7654, pp. 443–452 (2012)

    Google Scholar 

  7. Kucharska, E., Dutkiewicz, L., Ra̧czka, K., Grobler-Dȩbska, K.: ALMM approach for optimization of the supply routes for multi-location companies problem, advances in decision sciences and future studies. In: Skulimowsk, A.M. (ed.) Proceedings of the 8-th International Conference on Knowledge, Information and Creativity Support Systems: Krakow, vol. 2, pp. 321–332. Poland, 7–9 Nov 2013, (2013)

    Google Scholar 

  8. Oberlin, P., Rathinam, S., Darbha, S.: A transformation for a multiple depot, multiple traveling salesman problem. In: American Control Conference, pp. 2636–2641 (2009). ISBN: 978-1-4244-4523-3

    Google Scholar 

  9. Ray, S.S., Bandyopadhyay, S., Pal, S.K.: New operators of genetic algorithms for traveling salesman problem. In: Proceedings of the 17th International Conference on Pattern Recognition (ICPR’04), vol. 2, pp. 497–500 (2004)

    Google Scholar 

  10. Shafie, A.A.: Optimal tour construction for multiple mobile robots. J. Eng. Sci. Technol. 6(2), 215–227 (2011)

    Google Scholar 

  11. Sze, S.N., Tiong, W.K.: A comparison between heuristic and meta-heuristic methods for solving the multiple traveling salesman problem. Int. J. Mech., Ind. Sci. Eng. 1(1), 27–30 (2007), World Academy of Science, Engineering and Technology

    Google Scholar 

  12. Wa̧s, J., Kułakowski, K.: Agent-based approach in evacuation modeling, Agentand Multi-agent Systems: Technologies and Applications—Lecture Notes in Computer Science, vol. 6070, pp. 325–330. Springer (2010)

    Google Scholar 

  13. Yuen, S.Z., Chow, C.K.: Applying non-revisiting genetic algorithm to traveling salesman problem. In: IEEE World Congress on Computational Intelligence, Hong Kong, 1–6 June 2008, pp. 2217–2224 (2008)

    Google Scholar 

  14. Zachara, M., Pałka, D., Majchrzyk-Zachara, E.: Agent based simulation of the selected energy commodity market. In: Ramik, J., Stavarek, D. (ed.) Proceedings of 30th International Conference Mathematical Methods in Economics, 11–13 Sept 2012, Karvina, Czech Republic, pp. 1004–1009 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Edyta Kucharska .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Dutkiewicz, L., Kucharska, E., Ra̧czka, K., Grobler-Dȩbska, K. (2016). ST Method-Based Algorithm for the Supply Routes for Multilocation Companies Problem. In: Skulimowski, A., Kacprzyk, J. (eds) Knowledge, Information and Creativity Support Systems: Recent Trends, Advances and Solutions. Advances in Intelligent Systems and Computing, vol 364. Springer, Cham. https://doi.org/10.1007/978-3-319-19090-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19090-7_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19089-1

  • Online ISBN: 978-3-319-19090-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics