Abstract
Past research has shown that the performance of algorithms for solving the Quadratic Assignment Problem (QAP) depends on the structure and the size of the instances. In this paper, we study the bi-objective QAP, which is a multi-objective extension of the single-objective QAP to two objectives. The algorithm we propose extends a high-performing Simulated Annealing (SA) algorithm for large-sized, single-objective QAP instances to the bi-objective context. The resulting Hybrid Simulated Annealing (HSA) algorithm is shown to clearly outperform a basic, hybrid iterative improvement algorithm. Experimental results show that HSA clearly outperforms basic Hybrid Iterative Improvement. When compared to state-of-the-art algorithms for the bQAP, a Multi-objective Ant Colony Optimization algorithm and the Strength Pareto Evolutionary Algorithm 2, HSA shows very good performance, outperforms the former in most cases, and showing competitive performance to the latter.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Essafi, I., Mati, Y., Dauzère-Pèréz, S.: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Comput. Oper. Res. 35(8), 2599–2616 (2008)
Wagner, M.O., Yannou, B., Kehl, S., Feillet, D., Eggers, J.: Ergonomic modelling and optimization of the keyboard arrangement with an ant colony algorithm. J. Eng. Des. 14(2), 187–208 (2003)
Steinberg, L.: The backboard wiring problem: a placement algorithm. SIAM Rev. 3, 37–50 (1961)
Choi, W., Storer, R.H.: Heuristic algorithms for a turbine-blade-balancing problem. Comput. Oper. Res. 31, 1245–1258 (2004)
Knowles, J., Corne, D.: Instance generators and test suites for the multiobjective quadratic assignment problem. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds.) EMO 2003. LNCS, vol. 2632, pp. 295–310. Springer, Heidelberg (2003). doi:10.1007/3-540-36970-8_21
Hamacher, H., Nickel, S., Tenfelde-Podehl, D.: Facilities layout for social institutions. In: Chamoni, P., Leisten, R., Martin, A., Minnemann, J., Stadtler, H. (eds.) Operations Research Proceedings 2001, vol. 2001, pp. 229–236. Springer, Heidelberg (2001). doi:10.1007/978-3-642-50282-8_29
Paquete, L., Stützle, T.: A two-phase local search for the biobjective traveling salesman problem. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds.) EMO 2003. LNCS, vol. 2632, pp. 479–493. Springer, Heidelberg (2003). doi:10.1007/3-540-36970-8_34
Lust, T., Teghem, J.: Two-phase Pareto local search for the biobjective traveling salesman problem. J. Heuristics 16(3), 475–510 (2010)
López-Ibáñez, M., Paquete, L., Stützle, T.: Hybrid population-based algorithms for the bi-objective quadratic assignment problem. J. Math. Model. Algorithms 5(1), 111–137 (2006)
Paquete, L., Chiarandini, M., Stützle, T.: Pareto local optimum sets in the biobjective traveling salesman problem: an experimental study. In: Gandibleux, X., Sevaux, M., Sörensen, K., T’kindt, V. (eds.) Metaheuristics for Multiobjective Optimisation. LNE, vol. 535, pp. 177–199. Springer, Heidelberg (2004). doi:10.1007/978-3-642-17144-4_7
Stützle, T., Hoos, H.H.: Improving the ant system: a detailed report on the \(\cal{MAX}-\cal{MIN}\) ant system. Technical report AIDA-96-12, FG Intellektik, FB Informatik, TU Darmstadt, August 1996
Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength Pareto evolutionary algorithm. Technical report, Swiss Federal Institute of Technology Zurich (2001)
Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3(4), 257–271 (1999)
Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans. Evol. Comput. 4(4), 337–352 (2000)
Hussin, M.S., Stützle, T.: Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances. Comput. Oper. Res. 43, 286–291 (2014)
Wang, J.C.: Solving quadratic assignment problems by a Tabu based simulated annealing algorithm. In: Proceedings of 2007 International Conference on Intelligent and Advanced Systems, ICIAS 2007, Kuala Lumpur, Malaysia, pp. 75–80 (2007)
Connolly, D.T.: An improved annealing scheme for the QAP. Eur. J. Oper. Res. 46(1), 93–100 (1990)
Dubois-Lacoste, J., López-Ibáñez, M., Stützle, T.: A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems. Comput. Oper. Res. 38(8), 1219–1236 (2011)
Hussin, M.S.: Stochastic local search algorithms for single objective and bi-objective quadratic assignment problems. Ph.D. thesis, Université Libre de Bruxelles, 190 p. (2015)
Okabe, T., Jin, Y., Sendhoff, B.: A critical survey of performance indices for multi-objective optimisation. In: 2003 Congress on Evolutionary Computation (CEC 2003), vol. 2, pp. 878–885 (2003)
da Grunert Fonseca, V., Fonseca, C.M., Hall, A.O.: Inferential performance assessment of stochastic optimisers and the attainment function. In: Zitzler, E., Thiele, L., Deb, K., Coello Coello, C.A., Corne, D. (eds.) EMO 2001. LNCS, vol. 1993, pp. 213–225. Springer, Heidelberg (2001). doi:10.1007/3-540-44719-9_15
López-Ibáñez, M., Paquete, L., Stützle, T.: Exploratory analysis of stochastic local search algorithms in biobjective optimization. In: Bartz-Beielstein, T., Chiarandini, M., Paquete, L., Preuss, M. (eds.) Experimental Methods for the Analysis of Optimization Algorithms, pp. 209–222. Springer, Berlin (2010). doi:10.1007/978-3-642-02538-9_9
Fleischer, M.: The measure of Pareto optima applications to multi-objective metaheuristics. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds.) EMO 2003. LNCS, vol. 2632, pp. 519–533. Springer, Heidelberg (2003). doi:10.1007/3-540-36970-8_37
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston (1989)
Acknowledgments
This work was supported by the META-X project, an Action de Recherche Concertée funded by the Scientific Research Directorate of the French Community of Belgium. Mohamed Saifullah Hussin acknowledges support from the Universiti Malaysia Terengganu and Fundamental Research Grant Scheme, Ministry of Higher Education, Malaysia. Thomas Stützle acknowledges support from the Belgian F.R.S.-FNRS, of which he is a Research Associate.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Hussin, M.S., Stützle, T. (2017). Hybrid Simulated Annealing for the Bi-objective Quadratic Assignment Problem. In: Phon-Amnuaisuk, S., Ang, SP., Lee, SY. (eds) Multi-disciplinary Trends in Artificial Intelligence. MIWAI 2017. Lecture Notes in Computer Science(), vol 10607. Springer, Cham. https://doi.org/10.1007/978-3-319-69456-6_38
Download citation
DOI: https://doi.org/10.1007/978-3-319-69456-6_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-69455-9
Online ISBN: 978-3-319-69456-6
eBook Packages: Computer ScienceComputer Science (R0)