Advertisement

Approximate Muscle Guided Beam Search for Three-Index Assignment Problem

  • He Jiang
  • Shuwei Zhang
  • Zhilei Ren
  • Xiaochen Lai
  • Yong Piao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8794)

Abstract

As a well-known NP-hard problem, the Three-Index Assignment Problem (AP3) has attracted lots of research efforts for developing heuristics. However, existing heuristics either obtain less competitive solutions or consume too much time. In this paper, a new heuristic named Approximate Muscle guided Beam Search (AMBS) is developed to achieve a good trade-off between solution quality and running time. By combining the approximate muscle with beam search, the solution space size can be significantly decreased, thus the time for searching the solution can be sharply reduced. Extensive experimental results on the benchmark indicate that the new algorithm is able to obtain solutions with competitive quality and it can be employed on instances with large-scale. Work of this paper not only proposes a new efficient heuristic, but also provides a promising method to improve the efficiency of beam search.

Keywords

Combinatorial Optimization Heuristic Muscle Beam Search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Pierskalla, W.P.: The tri-substitution method for the three-dimensional assignment problem. CORS Journal 5, 71–81 (1967)Google Scholar
  2. 2.
    Pierskalla, W.P.: Letter to the Editor—The Multidimensional Assignment Problem. Operations Research 16, 422–431 (1968)CrossRefzbMATHGoogle Scholar
  3. 3.
    Frieze, A.M., Yadegar, J.: An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice. The Journal of the Operational Research Society 32, 989–995 (1981)CrossRefzbMATHGoogle Scholar
  4. 4.
    Crama, Y., Kolen, A.W.J., Oerlemans, A.G., Spieksma, F.C.R.: Throughput rate optimization in the automated assembly of printed circuit boards. Ann. Oper. Res. 26, 455–480 (1991)Google Scholar
  5. 5.
    Balas, E., Saltzman, M.J.: An Algorithm for the Three-Index Assignment Problem. Operations Research 39, 150–161 (1991)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Crama, Y., Spieksma, F.C.R.: Approximation algorithms for three-dimensional assignment problems with triangle inequalities. European Journal of Operational Research 60, 273–279 (1992)CrossRefzbMATHGoogle Scholar
  7. 7.
    Burkard, R.E., Rudolf, R., Woeginger, G.J.: Three-dimensional axial assignment problems with decomposable cost coefficients. Discrete Applied Mathematics 65, 123–139 (1996)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Pardalos, P.M., Pitsoulis, L.S.: Nonlinear assignment problems: Algorithms and applications. Springer (2000)Google Scholar
  9. 9.
    Voss, S.: Heuristics for Nonlinear Assignment Problems. In: Pardalos, P., Pitsoulis, L. (eds.) Nonlinear Assignment Problems, vol. 7, pp. 175–215. Springer, US (2000)CrossRefGoogle Scholar
  10. 10.
    Aiex, R.M., Resende, M.G.C., Pardalos, P.M., Toraldo, G.: GRASP with Path Relinking for Three-Index Assignment. INFORMS J. on Computing 17, 224–247 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Huang, G., Lim, A.: A hybrid genetic algorithm for the Three-Index Assignment Problem. European Journal of Operational Research 172, 249–257 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Jiang, H., Xuan, J., Zhang, X.: An approximate muscle guided global optimization algorithm for the Three-Index Assignment Problem. In: IEEE Congress on Evolutionary Computation, CEC 2008 (IEEE World Congress on Computational Intelligence), pp. 2404–2410 (2008)Google Scholar
  13. 13.
    Jiang, H., Chen, Y.: An efficient algorithm for generalized minimum spanning tree problem. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 217–224. ACM, Portland (2010)CrossRefGoogle Scholar
  14. 14.
    Cazenave, T.: Monte Carlo Beam Search. IEEE Transactions on Computational Intelligence and AI in Games 4, 68–72 (2012)CrossRefGoogle Scholar
  15. 15.
    López-Ibáñez, M., Blum, C.: Beam-ACO for the travelling salesman problem with time windows. Computers & Operations Research 37, 1570–1583 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  16. 16.
    Kim, B.-J., Hightower, W.L., Hahn, P.M., Zhu, Y.-R., Sun, L.: Lower bounds for the axial three-index assignment problem. European Journal of Operational Research 202, 654–668 (2010)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • He Jiang
    • 1
  • Shuwei Zhang
    • 1
  • Zhilei Ren
    • 1
  • Xiaochen Lai
    • 1
  • Yong Piao
    • 1
  1. 1.Software SchoolDalian University of TechnologyDalianChina

Personalised recommendations