{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T17:06:39Z","timestamp":1778346399731,"version":"3.51.4"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T00:00:00Z","timestamp":1603411200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T00:00:00Z","timestamp":1603411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s11047-020-09807-1","type":"journal-article","created":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T22:02:36Z","timestamp":1603490556000},"page":"507-522","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A comparison of multi-objective optimization algorithms for weight setting problems in traffic engineering"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8661-9626","authenticated-orcid":false,"given":"V\u00edtor","family":"Pereira","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Sousa","sequence":"additional","affiliation":[]},{"given":"Miguel","family":"Rocha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,23]]},"reference":[{"issue":"2","key":"9807_CR1","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1002\/net.21461","volume":"60","author":"A Altin","year":"2012","unstructured":"Altin A, Fortz B, \u00dcmit H (2012) Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty. Networks 60(2):132\u2013139","journal-title":"Networks"},{"issue":"1","key":"9807_CR2","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10479-012-1270-7","volume":"204","author":"A Altin","year":"2013","unstructured":"Altin A, Fortz B, Thorup M, \u00dcmit H (2013) Intra-domain traffic engineering with shortest path routing protocols. Ann Oper Res 204(1):65\u201395","journal-title":"Ann Oper Res"},{"key":"9807_CR3","doi-asserted-by":"crossref","unstructured":"Awduche D, Malcolm J, Agogbua J, O\u2019Dell M, McManus J (1999) Requirements for traffic engineering over MPLS. RFC 2702 (Informational)","DOI":"10.17487\/rfc2702"},{"key":"9807_CR4","series-title":"Genetic algorithms","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming","author":"T B\u00e4ck","year":"1996","unstructured":"B\u00e4ck T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming. Genetic algorithms. Oxford University Press, Oxford"},{"key":"9807_CR5","unstructured":"Ben-Ameur W, Gourdin E, Liau B, Michel N (2000) Optimizing administrative weights for efficient single-path routing. In: Proceedings of networks"},{"key":"9807_CR6","doi-asserted-by":"crossref","unstructured":"Bley A, Fortz B, Gourdin E, Holmberg K, Klopfenstein O, Pi\u00f3ro M, Tomaszewski , \u00dcmit H (2010)ptimization of OSPF routing in IP networks. In: Koster AMCA, M\u00f1uoz X (eds) Graphs and algorithms in communication networks: studies in broadband, optical, wireless and ad hoc networks, Springer, Berlin, Chap. 8, pp 199\u2013240","DOI":"10.1007\/978-3-642-02250-0_8"},{"key":"9807_CR7","unstructured":"Cisco customer case study, maximizing return on network infrastructure investment with Cisco MATE design"},{"issue":"3","key":"9807_CR8","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1109\/TEVC.2004.826067","volume":"8","author":"C Coello","year":"2004","unstructured":"Coello C, Pulido G, Lechuga M (2004) Handling multiple objectives with particle swarm optimization. IEEE Trans Evol Comput 8(3):256\u2013279","journal-title":"IEEE Trans Evol Comput"},{"key":"9807_CR9","unstructured":"Corne D, Jerram N, Knowles J, Oates M (2001) PESA-II: region-based selection in evolutionary multiobjective optimization. In: Proceedings of the genetic and evolutionary computation conference (GECCO-2001), San Francisco, California. Morgan Kaufmann Publishers, pp 283\u2013290"},{"issue":"6","key":"9807_CR10","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1109\/TNET.2011.2134866","volume":"19","author":"X Dahai","year":"2011","unstructured":"Dahai X, Mung C, Jennifer R (2011) Link-state routing with hop-by-hop forwarding can achieve optimal traffic engineering. IEEE\/ACM Trans Netw 19(6):1717\u20131730","journal-title":"IEEE\/ACM Trans Netw"},{"key":"9807_CR11","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, New York"},{"issue":"2","key":"9807_CR12","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Agrawal S, Pratap A, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):82\u201397","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"9807_CR13","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E Dijkstra","year":"1959","unstructured":"Dijkstra E (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"key":"9807_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1014852026591","volume":"6","author":"M Ericsson","year":"2002","unstructured":"Ericsson M, Resende M, Pardalos P (2002) A genetic algorithm for the weight setting problem in OSPF routing. J Combin Optim 6:299\u2013333","journal-title":"J Combin Optim"},{"key":"9807_CR15","doi-asserted-by":"crossref","unstructured":"Evangelista P, Maia P, Rocha M (2009) Implementing metaheuristic optimization algorithms with jecoli. In Proceedings of the 2009 ninth international conference on intelligent systems design and applications, ISDA \u201909, Washington, DC, USA. IEEE Computer Society, pp 505\u2013510","DOI":"10.1109\/ISDA.2009.161"},{"issue":"4","key":"9807_CR16","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1109\/90.793002","volume":"7","author":"S Floyd","year":"1999","unstructured":"Floyd S, Fall K (1999) Promoting the use of end-to-end congestion control in the internet. IEEE\/ACM Trans Netw 7(4):458\u2013472","journal-title":"IEEE\/ACM Trans Netw"},{"key":"9807_CR17","doi-asserted-by":"crossref","unstructured":"Fortz B (2000) Internet traffic engineering by optimizing OSPF weights. In: Proceedings of IEEE INFOCOM, pp 519\u2013528","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"9807_CR18","unstructured":"Fortz B, Thorup M (2003) Robust optimization of OSPF\/IS-IS weights. In: Ben-Ameur W, Petrowski A (eds) Proceedings of INOC, pp 225\u2013230"},{"key":"9807_CR19","unstructured":"Goldberg E (1989) Genetic algorithms in search, optimization and machine learning, 1st edn, Addison-Wesley"},{"key":"9807_CR20","volume-title":"The complete IS-IS routing protocol","author":"H Gredler","year":"2005","unstructured":"Gredler H, Goralski W (2005) The complete IS-IS routing protocol. Springer, Berlin"},{"key":"9807_CR21","doi-asserted-by":"crossref","unstructured":"Hopps C (2000) Analysis of an equal-cost multi-path algorithm, internet engineering task force , IETF , RFC 2992 (Informational)","DOI":"10.17487\/rfc2992"},{"key":"9807_CR22","doi-asserted-by":"crossref","unstructured":"Iannaccone G, Chuah C, Mortier R, Bhattacharyya S, Diot C (2002) Analysis of link failures in an ip backbone. In: Proceedings of the 2nd ACM SIGCOMM workshop on internet measurment, IMW \u201902, New York, NY, USA, ACM, pp 237\u2013242","DOI":"10.1145\/637201.637238"},{"key":"9807_CR23","doi-asserted-by":"crossref","unstructured":"Jain S, Kumar A, Mandal S, Ong J, Poutievski L, Singh A, Venkata S, Wanderer J, Zhou J, Zhu M, Zolla J, H\u00f6lzle U, Stuart S, Vahdat A(2013) B4: experience with a globally-deployed software defined wan. In: Proceedings of the ACM SIGCOMM conference on SIGCOMM (SIGCOMM \u201913), ACM, New York, NY, USA, pp 3\u201314","DOI":"10.1145\/2534169.2486019"},{"issue":"2","key":"9807_CR24","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"J Knowles","year":"2000","unstructured":"Knowles J, Corne D (2000) Approximating the nondominated front using the Pareto archived evolution strategy. Evol Comput 8(2):149\u2013172","journal-title":"Evol Comput"},{"key":"9807_CR25","unstructured":"Medina A, Lakhina A, Matta I, Byers J (2001) Brite: universal topology generation from a user\u2019s perspective. Technical report, Boston, MA, USA"},{"key":"9807_CR26","doi-asserted-by":"crossref","unstructured":"Moy J (1998) OSPF Version 2. RFC 2328 (Standard), April . Updated by RFC 5709","DOI":"10.17487\/rfc2328"},{"key":"9807_CR27","doi-asserted-by":"crossref","unstructured":"Pereira V, Rocha M, Cortez P, Rio M, and Sousa P (2013) A framework for robust traffic engineering using evolutionary computation. In: 7th International conference on autonomous infrastructure, management and security (AIMS 2013), Barcelona, Spain, Springer, LNCS 7943, pp 2\u201313","DOI":"10.1007\/978-3-642-38998-6_1"},{"key":"9807_CR28","doi-asserted-by":"crossref","unstructured":"Pereira V, Sousa P, Cortez P, Rio M, Rocha M (2015) Comparison of single and multiobjective evolutionary algorithms for robust link-state routing. In: Proceedings of evolutionary multi-criterion optimization (EMO2015), Springer, Guimar\u00e3es, Portugal, pp 573\u201387","DOI":"10.1007\/978-3-319-15892-1_39"},{"key":"9807_CR29","unstructured":"Pereira V, Rocha M, Sousa P (2016)optimizing load balancing routing mechanisms with evolutionary computation. In: Proceedings of international workshop on future internet and smart networks (FI&SN 2016), IOS Press, Ambient Intelligence and Smart Environments, Intelligent Environments, vol 21"},{"key":"9807_CR30","unstructured":"Razali N and Geraghty J (2011) Genetic algorithm performance with different selection strategies in solving TSP. In: Proceedings of the world congress on engineering 2011, Vol II WCE 2011, London, U.K, July 6\u20138"},{"key":"9807_CR31","unstructured":"RFC 3954-Cisco Systems NetFlow services export version 9, B. Claise, Ed., Cisco Systems, October 2004"},{"issue":"1","key":"9807_CR32","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.asoc.2009.11.026","volume":"11","author":"M Rocha","year":"2011","unstructured":"Rocha M, Sousa P, Cortez P, Rio M (2011) Quality of service constrained routing optimization using evolutionary computation. Appl Soft Comput 11(1):356\u2013364","journal-title":"Appl Soft Comput"},{"key":"9807_CR33","unstructured":"Schaffer J (1984) Some experiments in machine learning using vector evaluated genetic algorithms (artificial intelligence, optimization, adaptation, pattern recognition), PhD thesis, Vanderbilt University"},{"key":"9807_CR34","unstructured":"Schaffer J (1985) Multiple objective optimization with vector evaluated genetic algorithms. In: Proceedings of the 1st international conference on genetic algorithms, L. Erlbaum Associates Inc., Hillsdale, NJ, USA, pp 93\u2013100"},{"issue":"3","key":"9807_CR35","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Multiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221\u201324","journal-title":"Evol Comput"},{"key":"9807_CR36","doi-asserted-by":"crossref","unstructured":"Suchara M, Xu D, Doverspike R, Johnson D, Rexford J (2011) Network architecture for joint failure recovery and traffic engineering. In: Proceedings of SIGMETRICS11 conference","DOI":"10.1145\/1993744.1993756"},{"issue":"4","key":"9807_CR37","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/A:1015516501242","volume":"17","author":"KC Tan","year":"2002","unstructured":"Tan KC, Lee TH, Khor EF (2002) Evolutionary algorithms for multi-objective optimization: Performance assessments and comparisons. Artif Intell Rev 17(4):251\u2013290","journal-title":"Artif Intell Rev"},{"key":"9807_CR38","unstructured":"Technologies Cariden (2012) Building traffic matrices: introduction to MATE flow collection. White Paper-Version 2"},{"key":"9807_CR39","doi-asserted-by":"crossref","unstructured":"Tune P, Roughan M (2014) Network design Sensitivity Analysis. In: The 2014 ACM international conference on measurement and modeling of computer systems, ACM, SIGMETRICS 14, pp 449\u2013461","DOI":"10.1145\/2591971.2591979"},{"issue":"5","key":"9807_CR40","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/205511.205520","volume":"24","author":"C Villamizar","year":"1994","unstructured":"Villamizar C, Song C (1994) High performance TCP in ANSNET. Comput Commun Rev 24(5):45\u201360","journal-title":"Comput Commun Rev"},{"key":"9807_CR41","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67\u201382","journal-title":"IEEE Trans Evol Comput"},{"key":"9807_CR42","unstructured":"Zitzler E, Thiele L (1998) An evolutionary algorithm for multiobjective optimization: the strength Pareto approach. Technical report 43, Gloriastrasse 35, CH-8092 Zurich, Switzerland"},{"key":"9807_CR43","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) Spea2: improving the strength pareto evolutionary algorithm. Technical report"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-020-09807-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-020-09807-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-020-09807-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T04:06:23Z","timestamp":1661659583000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-020-09807-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,23]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["9807"],"URL":"https:\/\/doi.org\/10.1007\/s11047-020-09807-1","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,23]]},"assertion":[{"value":"3 September 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}