Home  Journals  Finance and Credit  11(803) - 2020 November

Modeling and optimizing logistics, information, economic and financial intercluster cooperation using the ant colony optimization algorithm

Received: 27 August 2020

Received in revised form: 10 September 2020

Accepted: 24 September 2020

Available online: 27 November 2020

Subject Heading: INVESTING

JEL Classification: C63, E17, O21, O36

Pages: 2427–2447

https://doi.org/10.24891/fc.26.11.2427

Subject. This article discusses the issues related to the creation of a technology of modeling and optimization of economic, financial, information, and logistics cluster-cluster cooperation within a federal district.
Objectives. The article aims to propose a model for determining the optimal center of industrial agglomeration for innovation and industry clusters located in a federal district.
Methods. For the study, we used the ant colony optimization algorithm.
Results. The article proposes an original model of cluster-cluster cooperation, showing the best version of industrial agglomeration, the cities of Samara, Ulyanovsk, and Dimitrovgrad, for the Volga Federal District as a case study.
Conclusions. If the industrial agglomeration center is located in these three cities, the cutting of the overall transportation costs and natural population decline in the Volga Federal District will make it possible to qualitatively improve the foresight of evolution of the large innovation system of the district under study.

Keywords: quadratic assignment problem, cluster-cluster cooperation, ant colony optimization, industrial agglomeration

References:

1. Anstreicher K.M. Recent Advances in the Solution of Quadratic Assignment Problems. Mathematical Programming, Series B, 2003, vol. 97, pp. 27–42. URL: Link
2. Anstreicher K.M., Brixius N.W., Goux J.P., Linderoth J. Solving Large Quadratic Assignment Problems on Computational Grids. Mathematical Programming, Series B, 2002, vol. 91, pp. 563–588. URL: Link
3. Drezner Z., Hahn P.M., Taillard E.D. Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods. Annals of Operation Research, 2005, vol. 139, pp. 65–94. URL: Link
4. Rendl F., Sotirov R. Bounds for the Quadratic Assignment Problem Using the Bundle Method. Mathematical Programming, 2007, vol. 109, pp. 505–524. URL: Link
5. Hahn P.M., Kim B.-J., Monique G. et al. An Algorithm for the Generalized Quadratic Assignment Problem. Computational Optimization and Applications, 2008, vol. 40, Article no. 351. URL: Link
6. Povh J., Rendl F. Copositive and Semidefinite Relaxations of the Quadratic Assignment Problem. Discrete Optimization, 2009, vol. 6, iss. 3, pp. 231–241. URL: Link
7. Erdoğan G., Tansel B.Ç. Two Classes of Quadratic Assignment Problems that are Solvable as Linear Assignment Problems. Discrete Optimization, 2011, vol. 8, iss. 3, pp. 446–451. URL: Link
8. Ahuja R.K., Orlin J.B., Tiwari A. A Greedy Genetic Algorithm for the Quadratic Assignment Problem. Computers & Operations Research, 2000, vol. 27, iss. 10, pp. 917–934. URL: Link00067-2
9. Kravets O.Ya., Safronova A.P. [An Overview of Methods for the Synthesis of Structural Solutions of Quadratic Assignment Problem]. Sovremennaya nauka: Aktual'nye problemy teorii i praktiki: nauchno-prakticheskii zhurnal. Seriya Estestvennye i tekhnicheskie nauki = Modern Science: Current Problems of Theory and Practice: Scientific and Practical Journal, 2013, no. 9-10, pp. 66–72. (In Russ.)
10. Tasgetiren M.F., Pan Q.-K., Suganthan P.N., Dizbay I.E. Metaheuristic Algorithms for the Quadratic Assignment Problem. 2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS), 2013, pp. 131–137. URL: Link
11. Drezner Z. The Quadratic Assignment Problem. In: G. Laporte, S. Nickel, and F.S. da Gama (Eds) Location Science. Chum, Heidelberg, Springer, 2015, pp. 345–363. URL: Link
12. Kim S., Kojima M., Toh K.C. A Lagrangian-DNN Relaxation: A Fast Method for Computing Tight Lower Bounds for a Class of Quadratic Optimization Problems. Mathematical Programming, 2016, vol. 156, pp. 161–187. URL: Link
13. Monmarché N., Guinand F., Siarry P. Artificial Ants. Wiley-ISTE, 2010, 576 p.
14. Dorigo M., Stültze T. Ant Colony Optimization. The MIT Press, 2004, 321 p.
15. Fujisawa R., Dobata S., Sugawara K., Matsuno F. Designing Pheromone Communication in Swarm Robotics: Group Foraging Behavior Mediated by Chemical Substance. Swarm Intelligence, 2014, vol. 8, no. 3, pp. 227–246. URL: Link
16. Lima D.A., Oliveira G.M.B. A Cellular Automata Ant Memory Model of Foraging in a Swarm of Robots. Applied Mathematical Modelling, 2017, vol. 47, pp. 551–572. URL: Link
17. Zhang Y., Wang S., Ji G. A Rule-Based Model for Bankruptcy Prediction Based on an Improved Genetic Ant Colony Algorithm. Mathematical Problems in Engineering, 2013, pp. 1–10. URL: 10.1155/2013/753251" target="_blank">Link
18. Tsutsui Sh. Parallel Ant Colony Optimization for the Quadratic Assignment Problems with Symmetric Multi Processing. ANTS 2008: Ant Colony Optimization and Swarm Intelligence, pp. 363–370. URL: Link
19. Mouhoub M., Wang Zh. Improving the Ant Colony Optimization Algorithm for the Quadratic Assignment Problem. 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence), 2008, pp. 250–257. URL: Link
20. Oliveira S.M., Hussin M.S., Stützle T. et al. A Detailed Analysis of the Population-Based Ant Colony Optimization Algorithm for the TSP and the QAP. Genetic and Evolutionary Computation Conference, GECCO'11 – Companion Publication, 2011, pp. 13–14. URL: Link
21. Oliveira S., Hussin M.S., Roli A., Dorigo M., Stützle T. Analysis of the Population-Based Ant Colony Optimization Algorithm for the TSP and the QAP. 2017 IEEE Congress on Evolutionary Computation (CEC), 2017, pp. 1734–1741. URL: Link

View all articles of issue

ISSN 2311-8709 (Online)
ISSN 2071-4688 (Print)

Journal current issue

Vol. 30, Iss. 3 March 2024

Archive