Approximate Muscle Guided Beam Search for Three-Index Assignment Problem
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.
KeywordsCombinatorial Optimization Heuristic Muscle Beam Search
Unable to display preview. Download preview PDF.
- 1.Pierskalla, W.P.: The tri-substitution method for the three-dimensional assignment problem. CORS Journal 5, 71–81 (1967)Google Scholar
- 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
- 8.Pardalos, P.M., Pitsoulis, L.S.: Nonlinear assignment problems: Algorithms and applications. Springer (2000)Google Scholar
- 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