Skip to main content
SpringerLink
Log in

Metaheuristic Algorithms for Multiagent Routing Problems

  • CONTROL SCIENCES
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

The problems of constructing routes in complex networks by many sales agents are considered. Formalization leads to pseudo-Boolean discrete optimization problems with constraints that take into account the specifics of route construction. The sparsity of the constraint matrix permits one to apply decomposition approaches and network clustering. The development of approximate algorithms for selecting routes in complex networks involves taking into account the properties of the network structure, its complexity, the presence of restrictions, regulations, reachability conditions, and the number of sales agents. It is shown that the solution of routing problems can be based on the application of a multiagent approach in combination with clustering (decomposition) of the original problem and metaheuristics. Multiagent systems with swarm intelligence are used to solve complex discrete optimization problems that cannot efficiently be solved by classical algorithms. The agent model for a complex network of a problem of the many traveling salesmen type becomes an intelligent system that defines heuristic algorithms for finding the optimal solution by reactive agents (that follow the rules laid down in them). We use and describe in detail the composition of the algorithms, which have proven themselves well in computational experiments; those are a modification of the genetic algorithm, ant colony optimization, artificial bee colony algorithm, and simulated annealing. A generalized algorithm is proposed and implemented in which a simpler network (a flyover network) is matched to the source network. Here a numerical experiment was carried out for the problem of routing on a GIS map for urban infrastructure. Clustering algorithms are implemented in which the initially traversed routes are refined using 2-opt algorithms, simulated annealing, and other metaheuristics. A comparison of the algorithms used and an illustration of their operation are given.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.

Similar content being viewed by others

Notes

  1. https://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/index.html .

  2. http://www.math.uwaterloo.ca/tsp/world/countries.html .

  3. TSPLB 95 documentation. https://tsplib95.readthedocs.io/en/stable/index.htm .

REFERENCES

  1. Shcherbina, O.A., Lemtyuzhnikova, D.V., and Tsurkov, V.I., Mnogomernye zadachi s kvaziblochnymi matritsami (Multidimensional Problems with Quasiblock Matrices), Moscow: Fizmatlit, 2018.

    Google Scholar 

  2. Kovkov, D.V. and Lemtyuzhnikova, D.V., Decomposition in multidimensional Boolean-optimization problems with sparse matrices, J. Comput. Syst. Sci. Int., 2018, vol. 57, no. 1, pp. 97–108.

    Article  MathSciNet  Google Scholar 

  3. Tsurkov, V.I., Decomposition principle for block-separable systems, Dokl. Akad. Nauk SSSR, 1979, vol. 246, no. 1, pp. 27–31.

    MathSciNet  MATH  Google Scholar 

  4. Germanchuk, M.S., Using additional information in discrete optimization problems of the multiple traveling salesmen type, Tavrich. Vestn. Inf. Mat., 2016, no. 4(33), pp. 68–82.

  5. Shcherbina, O.A., Metaheuristic algorithms for combinatorial optimization problems: a survey, Tavrich. Vestn. Inf. Mat., 2014, no. 1, pp. 56–73.

  6. Germanchuk, M.S., Kozlova, M.G., and Lukianenko, V.A., Discrete optimization problems of the multiple traveling salesmen type, Matematicheskie metody raspoznavaniya obrazov: Tezisy dokl. 18-i Vseross. konf. s mezhdunar. uchastiem (Mathematical Methods of Pattern Recognition: Abstr. Rep. 18th All-Russ. Conf. Int. Participation) (Taganrog, 2017), Moscow: TORUS PRESS, 2017, p. 48.

  7. Germanchuk, M.S., Kozlova, M.G., and Pivovar, A.E., Solving the multiple traveling salesman problem, Matematika, informatika, komp’yuternye nauki, modelirovanie, obrazovanie: sb. nauchn. tr. nauchno-prakt. konf. MIKMO–2017 i Tavrich. nauchn. konf. stud. molodykh spets. mat. inf. (Mathematics, Informatics, Computer Science, Modeling, Education: Proc. Sci.-Pract. Conf. MIKMO-2017 and Tavrida Sci. Conf. Stud. Young Spec. Math. Inf.), Lukianenko, V.A., Ed., Simferopol: IP Kornienko A.A., 2017, pp. 114–119.

  8. Poli, R., Analysis of the publications of the applications of particle swarm optimization, Hindawi Publ. Corp. J. Artificial Evol. Appl. https://www.hindawi.com/journals/jaea/2008/685175/ . https://doi.org/10.1155/2008/685175

  9. Jungsbluth, M., Thiele, J., Winter, Y., et al., Vertebrate Pollinators: Phase Transition in a Time-Dependent Generalized Traveling-Salesperson Problem. .

  10. Shah-Hosseini, H., Intelligent water drops algorithm: a new optimization method for solving the multiple knapsack problem, Int. J. Intell. Comput. Cybern., 2008, vol. 1, no. 2, pp. 193–212. https://www.emerald.com/insight/content/doi/10.1108/17563780810874717/full/html .

    Article  MathSciNet  Google Scholar 

  11. Zhou, H., Song, M., and Pedrycz, W., A comparative study of improved GA and PSO in solving multiple traveling salesmen problem, Appl. Soft Comput., 2018, vol. 64, pp. 564–580.

    Article  Google Scholar 

  12. Singh, D.R., Singh, M.K., Singh, T., et al., Genetic algorithm for solving multiple traveling salesmen problem using a new crossover and population generation, Computación y Sistemas, 2018, vol. 22, no. 2, pp. 491–503.

  13. Venkatesh, P. and Singh, A., Two metaheuristic approaches for the multiple traveling salesperson problem, Appl. Soft Comput., 2015, vol. 26, pp. 74–89.

    Article  Google Scholar 

  14. Lo, K.M., Yi, W.Y., Wong, P.K., et al., A genetic algorithm with new local operators for multiple traveling salesman problems, Int. J. Comput. Intell. Syst., 2018, vol. 11, no. 1, pp. 692–705.

    Article  Google Scholar 

  15. Harrath, Y., Salman, A.F., Alqaddoumi, A., et al., A novel hybrid approach for solving the multiple traveling salesmen problem, Arab J. Basic Appl. Sci., 2019, vol. 26, no. 1, pp. 103–112.

    Article  Google Scholar 

  16. Shokouhi, R.A., Farahnaz, M., Hengameh, K., and Hosseinabadi, A.R., Solving multiple traveling salesman problem using the gravitational emulation local search algorithm, Appl. Math. & Inf. Sci., 2015, vol. 9, no. 2, pp. 699–709.

    MathSciNet  Google Scholar 

  17. Huizing, D., Solving the mTSP for fresh food delivery, Rep. on Behalf of Delft Inst. Appl. Math., Netherlands: Delft, 2015. https://repository.tudelft.nl/islandora/object/uuid%3A8af405cc-bdd1-46c0-a790- a66471eadb3f.

  18. Othman, A., Mouhssine, R., Ezziyyani, M., et al., An effective parallel approach to solve multiple traveling salesmen problem, in Int. Conf. Adv. Intell. Syst. Sustainable Dev., Cham: Springer, 2018, pp. 647–664.

  19. Necula, R., Raschip, M., and Breaban, M., Balancing the subtours for multiple TSP approached with ACS: clustering-based approaches vs. MinMax formulation, in EVOLVE-A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation VI , Cham: Springer, 2018, pp. 210–223.

  20. Kara, I. and Bektas, T., Integer linear programming formulations of multiple salesman problems and its variations, Eur. J. Oper. Res., 2006, vol. 174, pp. 1449–1458.

    Article  MathSciNet  Google Scholar 

  21. Makarov, O.O. and Germanchuk, M.S., Development of routing algorithms in complex networks, Matematika, informatika, komp’yuternye nauki, modelirovanie, obrazovanie: sb. nauchn. tr. nauchno-prakt. konf. MIKMO–2018 i Tavrich. nauchn. konf. stud. molodykh spets. mat. inf. (Mathematics, Informatics, Computer Science, Modeling, Education: Proc. Sci.-Pract. Conf. MIKMO-2018 and Tavrida Sci. Conf. Stud. Young Spec. Math. Inf.), Lukianenko, V.A., Ed., Simferopol: IP Kornienko A.A., 2018, no. 2, pp. 127–135.

  22. Dorigo, M. and Stutzle, T., Ant Colony Optimization, Cambridge: Bradford Book, 2004.

    Book  Google Scholar 

  23. Zaitsev, A.A., Kureichik, V.V., and Polupanov, A.A., Review of evolutionary optimization methods based on swarm intelligence, Izv. Yuzhn. Fed. Univ. Tekh. Nauki, 2010, no. 12(113), pp. 7–12.

  24. Karaboga, D. and Akay, B., A survey: algorithms simulating bee swarm intelligence, Artif. Intell. Rev., 2009, vol. 31, no. 1–4, pp. 61–85.

    Article  Google Scholar 

  25. Kirkpatrick, S., Gelatt, C.D., and Vecchi, M.P., Optimization by simulated annealing, Science, 1983, vol. 220, no. 4598, pp. 671–680.

    Article  MathSciNet  Google Scholar 

  26. Carter, A.E. and Ragsdale, C.T., A new approach to solving the multiple traveling salesperson problem using genetic algorithms, Eur. J. Oper. Res., 2006, vol. 175, pp. 246–257.

    Article  MathSciNet  Google Scholar 

  27. Urakov, A.R. and Timeryaev, T.V., Using weighted graphs features for fast searching their parameters, Prikl. Diskretnaya Mat., 2012, no. 2(16), pp. 95–99.

  28. Voloshinov, V.V., Lemtyuzhnikova, D.V., and Tsurkov, V.I., Grid parallelizing of discrete optimization problems with quasi-block structure matrices, J. Comput. Syst. Sci. Int., 2017, vol. 56, no. 6, pp. 930–936.

    Article  MathSciNet  Google Scholar 

  29. Mironov, A.A., Fedorchuk, V.V., and Tsurkov, V.I., Minimax in transportation models with integral constraints: II, J. Comput. Syst. Sci. Int., 2005, vol. 44, no. 5, pp. 732–752.

    MathSciNet  MATH  Google Scholar 

  30. Mironov, A.A. and Tsurkov, V.I., Minimax in transportation models with integral constraints: I, J. Comput. Syst. Sci. Int., 2003, vol. 42, no. 4, pp. 562–574.

    MathSciNet  MATH  Google Scholar 

Download references

ACKNOWLEDGMENTS

The authors express their appreciation to the referee for their comments and recommendations, which have led to a better quality of representing the research contents.

Funding

The work was supported by the Russian Foundation for Basic Research, project nos. 18-31-00458 and 20-58-S52006.

Author information

Authors and Affiliations

  1. Vernadsky Crimean Federal University, Simferopol, 295007, Russia

    M. S. Germanchuk & V. A. Lukianenko

  2. Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, 117997, Russia

    D. V. Lemtyuzhnikova

  3. Moscow Aviation Institute, Moscow, 125993, Russia

    D. V. Lemtyuzhnikova

Authors
  1. M. S. Germanchuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. V. Lemtyuzhnikova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. A. Lukianenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to M. S. Germanchuk, D. V. Lemtyuzhnikova or V. A. Lukianenko.

Additional information

Translated by V. Potapchouck

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Germanchuk, M.S., Lemtyuzhnikova, D.V. & Lukianenko, V.A. Metaheuristic Algorithms for Multiagent Routing Problems. Autom Remote Control 82, 1787–1801 (2021). https://doi.org/10.1134/S0005117921100155

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117921100155

Keywords

Search

Navigation