Summary
This chapter proposes a combination of estimation of distribution algorithm (EDA) and the 2-opt local search algorithm (EDA/LS) for the quadratic assignment problem (QAP). In EDA/LS, a new operator, called guided mutation, is employed for generating new solutions. This operator uses both global statistical information collected from the previous search and the location information of solutions found so far. The 2-opt local search algorithm is applied to each new solution generated by guided mutation. A restart strategy based on statistical information is used when the search is trapped in a local area. Experimental results on a set of QAP test instances show that EDA/LS is comparable with the memetic algorithm of Merz and Freisleben and outperforms estimation of distribution algorithm with guided local search (EDA/GLS). The proximate optimality principle on the QAP is verified experimentally to justify the rationale behind heuristics (including EDA/GLS) for the QAP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T.C. Koopmans and M.J. Beckmann, “Assignment Problems and the Location of Economic Activities,” Econometrica, vol. 25, pp. 53–76, 1957.
E. Çela, “The Quadratic Assignment Problem: Theory and Algorithms”, Kluwer Academic Publishers, 1998.
Larranaga, P. and Lozano, J.A., “Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation,” Kluwer Academic Publishers, 2001.
D.T. Connolly, “An Improved Annealing Scheme for the Quadratic Assignment Problem,” European Journal of Operational Research, vol. 46, pp. 93–100, 1990.
V. Nissen and H. Paul, “A Modification of Threshold Accepting and its Application to the Quadratic Assignment Problem,” OR Spektrum, vol. 17, pp. 205–210, 1995.
S. Ishii and M. Sato, “Constrained Neural Approaches to Quadratic Assignment Problems,” Neural Networks, vol. 11, pp. 1073–1082, 1998.
V. Bachelet, P. Preux, and E.-G. Talbi, “Parallel Hybrid Meta-Heuristics: Application to the Qudratic Assignment Problem,” in Proceedings of the Parallel Optimization Colloquium, (Versailles, France), 1996.
P. Mills, E.P.K. Tsang and J.A. Ford, “Applying an Extended Guided Local Search on the Quadratic Assignment Problem,” Annals of Operations Research, Kluwer Academic Publishers, vol. 118, pp. 121–135, 2003.
V. Nissen, “Solving the Quadratic Assignment Problem with Clues from Nature,” IEEE Transactions on Neural Networks, vol. 5, no. 1, pp. 66–72, 1994.
D.M. Tate and A.E. Smith, “A Genetic Approach to the Quadratic Assignment Problem,” Computers and Operations Research, vol. 22, no. 1, pp.73–83, 1995.
L. Gambardella, É. Taillard and M. Dorigo, “Ant Colonies for the QAP,” Journal of the Operations Research Society, 1999.
P. Merz and B. Freisleben, “Fitness Landscape Analysis and Memetic Algorithms for the Quadratic Assignment Problem,” IEEE Transactions on Evolutionary Computation, vol. 4, no. 4, pp. 337–352, 2000.
V.-D. Cung, T. Mautor, P. Michelon and A. Tavares, “A Scatter Search Based Approach for the Quadratic Assignment Problem,” in Proceedings of the 1997 IEEE International Conference on Evolutionary Computation (ICEC), (T. Bäck, Z. Michalewicz, and X. Yao, eds.), (Indianapolis, USA), pp. 165–170, IEEE Press, 1997.
S. Baluja, “Population-based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization And Competitive Learning,” Technical Report, Carnegie Mellon University, 1994.
R.E. Burkard, S. Karisch and F. Rendl, “QAPLIB-A Quadratic Assignment Problem Library,” European Journal of Operational Research, vol. 55, pp. 115–119, 1991. Updated Version: http://www.imm.dtu.dk/sk/qaplib.
E.S. Buffa, G.C. Armour and T.E. Vollmann, “Allocating Facilities with CRAFT,” Harvard Business Review, pp. 136–158, March 1964.
F. Glover and M. Laguna, Tabu Search, Kluwer, 1997.
P.M. Hahn, T. Grant and N. Hall, “A Branch-and-Bound Algorithm for the Quadratic Assignment Problem based on the Hungarian Method,” European Journal of Operational Research, vol. 108, pp. 629–640, 1998.
Q. Zhang, J. Sun, E.P.K. Tsang and J.A. Ford, “Combination of Guided Local Search and Estimation of Distribution Algorithm for Solving Quadratic Assignment Problem,” Proceedings of the Bird of a Feather Workshops, Genetic and Evolutionary Computation Conference, pp. 42–48, 2004.
Q. Zhang, J. Sun, and E. Tsang, “An evolutionary algorithm with guided mutation for the maximum clique problem. IEEE Trans. Evolutionary Computation”, vol. 9, no. 2. pp. 192–200, 2005.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Zhang, Q., Sun, J., Tsang, E., Ford, J. (2006). Estimation of Distribution Algorithm with 2-opt Local Search for the Quadratic Assignment Problem. In: Lozano, J.A., Larrañaga, P., Inza, I., Bengoetxea, E. (eds) Towards a New Evolutionary Computation. Studies in Fuzziness and Soft Computing, vol 192. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32494-1_12
Download citation
DOI: https://doi.org/10.1007/3-540-32494-1_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29006-3
Online ISBN: 978-3-540-32494-2
eBook Packages: EngineeringEngineering (R0)