Abstract
We consider the NP-hard integer three-index axial assignment problem. The task of optimal combination of the pairs of feasible solutions of the problem is posed, and a linear complexity algorithm for its solution is constructed. This algorithm can be used as a supplement to heuristic or approximate algorithms for the three-index assignment problem for post-processing the obtained approximate solutions of the problem. The results of computational experiments, which demonstrate the promising nature of our approach, are presented.
Similar content being viewed by others
REFERENCES
Spieksma, F.C.R., Multi index assignment problems. Complexity, approximation, applications, in Nonlinear Assignment Problems: Algorithms and Applications, Pardalos, P.M. and Pitsoulis, L.S., Eds., Dordrecht: Kluwer Academic Publ., 2000, pp. 1–11.
Afraimovich, L.G., A heuristic method for solving integer-valued decompositional multiindex problems, Autom. Remote Control, 2014, vol. 75, pp. 1357–1368.
Afraimovich, L.G. and Prilutskii, M.Kh., Multiindex optimal production planning problems, Autom. Remote Control, 2010, vol. 71, pp. 2145–2151.
Garey, M. and Johnson, D., Computer and Intractability: A Guide to the Theory of NP-Completeness, New York: W.H. Freeman, 1979. Translated under the title: Vychislitel’nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.
Crama, Y. and Spieksma, F.C.R., Approximation algorithms for three-dimensional assignment problems with triangle inequalities, Eur. J. Oper. Res., 1992, vol. 60, pp. 273–279.
Bandelt, H.J., Crama, Y., and Spieksma, F.C.R., Approximation algorithms for multidimensional assignment problems with decomposable costs, Discrete Appl. Math., 1994, vol. 49, pp. 25–50.
Burkard, R.E., Rudolf, R., and Woeginger, G.J., Three-dimensional axial assignment problems with decomposable cost coefficients, Discrete Appl. Math., 1996, vol. 65, pp. 123–139.
Spieksma, F. and Woeginger, G., Geometric three-dimensional assignment problems, Eur. J. Oper. Res., 1996, vol. 91, pp. 611–618.
Afraimovich, L.G., Multi-index transport problems with decomposition structure, Autom. Remote Control, 2012, vol. 73, no. 1, pp. 118–133.
Afraimovich, L.G., Multiindex transportation problems with 2-embedded structure, Autom. Remote Control, 2013, vol. 74, no. 1, pp. 90–104.
Afraimovich, L.G., Three-index linear programs with nested structure, Autom. Remote Control, 2011, vol. 72, no. 8, pp. 1679–1689.
Balas, E. and Saltzman, M.J., An algorithm for the three-index assignment problem, Oper. Res., 1991, vol. 39, no. 1, pp. 150–161.
Huang, G. and Lim, A., A hybrid genetic algorithm for the three-index assignment problem, Eur. J. Oper. Res., 2006, vol. 172, pp. 249–257.
Kim, B.J., Hightower, W.L., Hahn, P.M., Zhu, Y.R., and Sun, L., Lower bounds for the axial three-index assignment problem, Eur. J. Oper. Res., 2010, vol. 202, pp. 654–668.
Dichkovskaya, S.A. and Kravtsov, M.K., Investigation of polynomial algorithms for solving the three-index planar assignment problem, Comput. Math. Math. Phys., 2006, vol. 46, no. 2, pp. 212–217.
Dumbadze, L.G., Leonov, V.Yu., Tizik, A.P., and Tsurkov, V.I., Decomposition method for solving a three-index planar assignment problem, J. Comput. Syst. Sci. Int., 2020, vol. 59, no. 5, pp. 695–698.
Gimadi, E.Kh. and Glazkov, Yu.V., An asymptotically exact algorithm for one modification of planar three-index assignment problem, J. Ind. Appl. Math., 2007, vol. 1, no. 4, pp. 442–452.
Magos, D., Tabu search for the planar three-index assignment problem, J. Global Optim., 1996, vol. 8, pp. 35–48.
Prilutskii, M.Kh., Programmed control of two-stage stochastic production systems, Autom. Remote Control, 2020, vol. 81, pp. 64–73.
Prilutskii, M.Kh., Optimal control for two-stage stochastic production systems, Autom. Remote Control, 2018, vol. 79, pp. 830–840.
Prilutskii, M.Kh., Optimal planning for two-stage stochastic industrial systems, Autom. Remote Control, 2014, vol. 75, pp. 1384–1392.
Karapetyan, D. and Gutin, D., A new approach to population sizing for memetic algorithms: a case study for the multidimensional assignment problem, Evol. Comput., 2011, vol. 19, no. 3, pp. 345–371.
Medvedev, S.N. and Medvedeva, O.A., An adaptive algorithm for solving the axial three-index assignment problem, Autom. Remote Control, 2019, vol. 80, pp. 718–732.
GabrovŢek, B., Novak, T., Povh, J., Rupnik Poklukar, D., and Žerovnik, J., Multiple Hungarian method for k-assignment problem, Mathematics, 2020, vol. 8, p. 2050.
Author information
Authors and Affiliations
Corresponding authors
Additional information
Translated by V. Potapchouck
Rights and permissions
About this article
Cite this article
Afraimovich, L.G., Emelin, M.D. Combining Solutions of the Axial Assignment Problem. Autom Remote Control 82, 1418–1425 (2021). https://doi.org/10.1134/S0005117921080087
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117921080087