Skip to main content
SpringerLink
Log in

Solving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods

  • Special Issue Paper
  • Published:
Journal of the Operational Research Society

Abstract

This paper presents the investigation of an evolutionary multi-objective simulated annealing (EMOSA) algorithm with variable neighbourhoods to solve the multi-objective multicast routing problems in telecommunications. The hybrid algorithm aims to carry out a more flexible and adaptive exploration in the complex search space by using features of the variable neighbourhood search to find more non-dominated solutions in the Pareto front. Different neighbourhood strictures have been designed with regard to the set of objectives, aiming to drive the search towards optimising all objectives simultaneously. A large number of simulations have been carried out on benchmark instances and random networks with real world features including cost, delay and link utilisations. Experimental results demonstrate that the proposed EMOSA algorithm with variable neighbourhoods is able to find high-quality non-dominated solutions for the problems tested. In particular, the neighbourhood structures that are specifically designed for each objective significantly improved the performance of the proposed algorithm compared with variants of the algorithm with a single neighbourhood.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6

References

  • Adibi MA, Zandieh M and Amiri M (2010). Multi-objective scheduling of dynamic job shop using variable neighborhood search. Expert Syst Appl 37: 282–287.

    Article  Google Scholar 

  • Betsekas D and Gallager R (1992). Data Networks. 2nd edn, Prentice-Hall: Englewood Cliffs, NJ.

    Google Scholar 

  • Chen S and Nahrstedt K (1998). An overview of quality of service routing for next-generation high-speed networks: Problems and solutions. IEEE Network, Special Issue on Transmission and Distribution of Digital Video 12: 64–79.

    Google Scholar 

  • Crichigno J and Baran B (2004a). Multiobjective multicast routing algorithm. LNCS 3124: 1029–1034.

    Google Scholar 

  • Crichigno J and Baran B (2004b). Multiobjective multicast routing algorithm for traffic engineering. In: Luijten RP, DaSilva LA and Engbersen APJ (eds). Proceedings of the 13th International Conference on Computer Communications and Networks. Springer: Heidelberg, pp 301–306.

  • Cui X, Lin C and Wei Y (2003). A multiobjective model for QoS multicast routing based on genetic algorithm. In: Lu X and Wah BW (eds). Proceedings of the International Conference on Computer Networks and Mobile Computing (ICCNMC’03). IEEE Computer Society: Beijing, pp 49–53.

    Google Scholar 

  • Czyzak P and Jaszkiewicz A (1998). Pareto simulated annealing—A meta-heuristic technique for multiple-objective combinatorial optimization. J Multi-Criteria Decis Anal 7: 34–37.

    Article  Google Scholar 

  • Deb K (2005). Multiobjective optimisation. In: Burke EK and Kendall G (eds). Search Methodologies: Introductory Tutorials in Optimisation and Decision Support Methodologies. Chapter 10. Springer.

    Google Scholar 

  • Diego P and Baran B (2005). Solving multiobjective multicast routing problem with a new ant colony optimization approach. Proceedings of the 3rd International IFIP/ACM Latin American Conference on Networking. Cali, Columbia, pp 11–19. ACM: New York.

  • Diot C, Dabbous W and Crowcroft J (1997). Multipoint communication: A survey of protocols, functions, and mechanisms. IEEE J Sel Area Comm 15: 277–290.

    Article  Google Scholar 

  • Ehrgott M and Gandibleux X (2000). A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spectrum 22: 425–460.

    Article  Google Scholar 

  • Eppstein D (1998). Finding the k shortest paths. SIAM J Comput 28: 652–673.

    Article  Google Scholar 

  • Fabregat R, Donoso Y, Baran B, Solano F and Marzo JL (2005). Multi-objective optimization scheme for multicast flows: A survey, a model and a MOEA solution. In: Leiss EL (ed). Proceedings of the 3rd international IFIP/ACM Latin American Conference on Networking (LANC ‘05), pp 73–86. ACM: New York.

  • Gandibleux X, Sevaux M, Sorensen K and Tkindt V (2004). Metaheuristics for multiobjective optimization. Lecture Notes in Economics and Mathematical Systems, Vol. 535. Springer: Berlin.

  • Garey MR and Johnson DS (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company: New York.

    Google Scholar 

  • Guo L and Matta I (1999). QDMR: An efficient QoS dependent multicast routing algorithm. In: Bestavros A and Wolfe VF (eds). Proceedings of the 5th IEEE Real Time Technology and Applications Symposium. IEEE Computer Society: Vancouver, Canada, pp 213–222.

  • Haghighat AT, Faez K, Dehghan M, Mowlaei A and Ghahremani Y (2004). GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing. Comput Commun 27: 111–127.

    Article  Google Scholar 

  • Haidine A and Lehnert R (2008). Multi-case multi-objective simulated annealing (MC-MOSA): New approach for adapt simulated annealing to multi-objective optimization. Int J Inform Technol 4: 197–205.

    Google Scholar 

  • Hansen P and Mladenovic N (2001). Variable neighborhood search: Principles and applications. Eur J Opns Res 130: 449–467.

    Article  Google Scholar 

  • Hwang FK and Richards DS (1992). Steiner tree problems. Networks 22: 55–89.

    Article  Google Scholar 

  • Kirkpatrick S, Gelatt CD and Vecchi MP (1983). Optimization by simulated annealing. Science 220: 671–680.

    Article  Google Scholar 

  • Konak A, David WC and Alice ES (2006). Multi-objective optimization using genetic algorithms: A tutorial. Reliab Eng Syst Safe 91: 992–1007.

    Article  Google Scholar 

  • Koyama A, Barolli L, Matsumoto K and Apduhan BO (2004). A GA-based multi-purpose optimization algorithm for QoS routing. Proceedings of the 18th International Conference on Advanced Information Networking and Applications (AINA 2004), Vol. 1. IEEE Computer Society: Fukuoka, Japan, pp. 23–28.

  • Kun Z, Heng W and Feng-Yu L (2005). Distributed multicast routing for delay and delay variation-bounded Steiner tree using simulated annealing. Comput Commun 28: 1356–1370.

    Article  Google Scholar 

  • Landa-Silva JD, Burke EK and Petrovic S (2004). An introduction to multiobjective metaheuristics for scheduling and timetabling. In: Gandibleux X, Sevaux M, Sorensen K and T’kindt V (eds). Metaheuristic for Multiobjective Optimisation. Lecture Notes in Economics and Mathematical Systems, Vol 535. Springer: Berlin, pp 91–129.

    Chapter  Google Scholar 

  • Li C, Cao C, Li Y and Yu Y (2007). Hybrid of genetic algorithm and particle swarm optimization for multicast QoS routing. IEEE International Conference on Control and Automation, Guangzhou, China, IEEE Explore Press: Guangzhou, pp 2355–2359.

  • Li H and Landa-Silva D (2008). Evolutionary multi-objective simulated annealing with adaptive and competitive search direction. In: Michalewicz Z and Reynolds RG (eds). Proceedings of the 2008 IEEE Congress on Evolutionary Computation (CEC 2008), IEEE Press: Hong Kong, pp 3310–3317.

  • Liu H, Abraham A, Choi O and Moon SH (2006). Variable neighborhood particle swarm optimization for multi-objective flexible job-shop scheduling problems. SEAL 2006, LNCS 4247: 197–204.

  • Masip-Bruin X, Yannuzzi M, Domingo-Pascual J, Fonte A, Curado M, Monteiro E, Kuipers F, Van Mieghem P, Avallone S, Ventre G, Aranda-Gutierrez P, Hollick M, Steinmetz R, Iannone L and Salamatian K (2006). Research challenges in QoS routing. Comput Commun 29: 563–581.

    Article  Google Scholar 

  • Miettinen K (1999). Nonlinear Multiobjective Optimization. Kluwer Academic Pulishers: Boston, USA.

    Google Scholar 

  • Oliveira CAS and Pardalos PM (2005). A survey of combinatorial optimization problems in multicast routing. Comput Opns Res 32: 1953–1981.

    Article  Google Scholar 

  • Qu R, Xu Y and Kendall G (2009). A variable neighborhood descent search algorithm for delay-constrained least-cost multicast routing. LNCS 5851: 15–29.

  • Roy A and Das SK (2004). QM2RP: A QoS-based mobile multicast routing protocol using multi-objective genetic algorithm. Wirel Netw 10: 271–286.

    Article  Google Scholar 

  • Roy A, Banerjee N and Das SK (2002). An efficient multi-objective QoS-routing algorithm for wireless-multicasting. In: Jackson P (ed). Proceedings of the IEEE 55th Vehicular Technology Conference, pp 1160–1164.

  • Salama HF, Reeves DS and Viniotis Y (1997). Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE J Sel Area Comm 15: 332–345.

    Article  Google Scholar 

  • Sefarini P (1992). Simulated annealing for multiobjective optimization problems. In: Tzeng GH, Wang HF, Wen VP and Yu PL (eds). Proceedings of the Tenth International Conference on Multiple Criteria Decision Making. Springer: pp 283–292.

  • Skorin-Kapov N and Kos M (2006). A GRASP heuristic for the delay-constrained multicast routing problem. Telecommun Syst 32: 55–69.

    Article  Google Scholar 

  • Suman B and Kumar P (2006). A survey of simulated annealing as a tool for single and multiobjective optimization. J Opl Res Soc 57: 1143–1160.

    Article  Google Scholar 

  • Ulungu EL and Teghem J (1994). Multiobjective combinatorial optimization problems: A survey. J Multi-Criteria Decis Anal 3: 83–104.

    Article  Google Scholar 

  • Ulungu EL, Teghem J, Fortemps PH and Tuyttens D (1999). MOSA method: A tool for solving multiobjective combinatorial optimization problems. J Multi-Criteria Decis Anal 8: 221–236.

    Article  Google Scholar 

  • Waxman BM (1988). Routing of multipoint connections. IEEE J Sel Area Comm 6: 1617–1622.

    Article  Google Scholar 

  • Yeo CK, Lee BS and Er MH (2004). A survey of application level multicast techniques. Comput Commun 27: 1547–1568.

    Article  Google Scholar 

  • Zhu Q, Parsa M and Garcia-Luna-Aceves JJ (1995). A source-based algorithm for delay-constrained minimum-cost multicasting. In: Jaffe J (ed). Proceedings of the 14th Annual Joint Conference of the IEEE Computer and Communication (INFOCOM’95). IEEE Computer Society Press: Boston, MA, pp 377–385.

Download references

Author information

Authors and Affiliations

  1. The University of Nottingham, Nottingham, UK

    Y Xu & R Qu

  2. Hunan University, Changsha, China

    Y Xu

Authors
  1. Y Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R Qu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Y Xu or R Qu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, Y., Qu, R. Solving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods. J Oper Res Soc 62, 313–325 (2011). https://doi.org/10.1057/jors.2010.138

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.2010.138

Keywords

Search

Navigation