Skip to main content
Log in

Heuristic Strategies for Combining Solutions of the Three-Index Axial Assignment Problem

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

Abstract

We consider the NP-hard integer three-index axial assignment problem. Strategies for combining feasible solutions of the problem are investigated. Combining can be used as a supplement to heuristic or approximate solution algorithms instead of the generally accepted step of choosing the record among the feasible solutions found. The results of computational experiments are presented that demonstrate the promising nature of the approach proposed.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1.

Similar content being viewed by others

REFERENCES

  1. 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 Acad. Publ., 2000, pp. 1–11.

  2. Afraimovich, L.G., A heuristic method for solving integer-valued decompositional multiindex problems, Autom. Remote Control, 2014, vol. 75, no. 8, pp. 1357–1368.

    Article  MathSciNet  Google Scholar 

  3. Afraimovich, L.G. and Prilutskii, M.Kh., Multiindex optimal production planning problems, Autom. Remote Control, 2010, vol. 71, no. 10, pp. 2145–2151.

    Article  MathSciNet  Google Scholar 

  4. Garey, MR. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: W. H. Freeman, 1979. Translated under the title: Vychislitel’nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.

    MATH  Google Scholar 

  5. 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.

    Article  Google Scholar 

  6. 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.

    Article  MathSciNet  Google Scholar 

  7. 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.

    Article  Google Scholar 

  8. Medvedev, S.N. and Medvedeva, O.A., An adaptive algorithm for solving the axial three-index assignment problem, Autom. Remote Control, 2019, vol. 80, no. 4, pp. 718–732.

    Article  MathSciNet  Google Scholar 

  9. 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.

  10. Gimadi, E.Kh. and Korkishko, N.M., An algorithm for solving the three-index axial assignment problem on one-cycle permutations, Diskretnyi Anal. Issled. Oper. Ser. 1 , 2003, vol. 10, no. 2, pp. 56–65.

    MathSciNet  MATH  Google Scholar 

  11. Afraimovich, L.G. and Emelin, L.G., Combining solutions of the axial assignment problem, Autom. Remote Control, 2021, vol. 82, pp. 1418–1425. https://doi.org/10.1134/S0005117921080087

    Article  Google Scholar 

  12. Balas, E. and Saltzman, M.J., An algorithm for the three-index assignment problem, Oper. Res., 1991, vol. 39, no. 1, pp. 150–161.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to L. G. Afraimovich or M. D. Emelin.

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

Afraimovich, L.G., Emelin, M.D. Heuristic Strategies for Combining Solutions of the Three-Index Axial Assignment Problem. Autom Remote Control 82, 1635–1640 (2021). https://doi.org/10.1134/S0005117921100027

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Navigation