{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:47:30Z","timestamp":1771703250059,"version":"3.50.1"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,4,6]],"date-time":"2016-04-06T00:00:00Z","timestamp":1459900800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10489-016-0776-0","type":"journal-article","created":{"date-parts":[[2016,4,6]],"date-time":"2016-04-06T02:44:52Z","timestamp":1459910692000},"page":"598-621","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Fuzzy particle swarm optimization algorithms for the open shortest path first weight setting problem"],"prefix":"10.1007","volume":"45","author":[{"given":"Mohammad Aijaz","family":"Mohiuddin","sequence":"first","affiliation":[]},{"given":"Salman A.","family":"Khan","sequence":"additional","affiliation":[]},{"given":"Andries P.","family":"Engelbrecht","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,6]]},"reference":[{"key":"776_CR1","doi-asserted-by":"crossref","unstructured":"Coffman KG, Odlyzko AM (2001) Internet Growth: Is there a Moore\u2019s Law for data Traffic? Handbook of Massive Data Sets, pp 47\u201393","DOI":"10.1007\/978-1-4615-0005-6_3"},{"key":"776_CR2","doi-asserted-by":"crossref","unstructured":"Fortz B, Thorup M (2000) Internet traffic engineering by optimizing OSPF weights. IEEE Conference on Computer Communications(INFOCOM), pp 519\u2013528","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"776_CR3","unstructured":"Kurose JF, Ross KW (2002) Computer Networking: A top-down approach featuring the internet prentice hall series"},{"issue":"5","key":"776_CR4","first-page":"443","volume":"1","author":"NH Bhagat","year":"2013","unstructured":"Bhagat NH (2013) A new hybrid approach to OSPF weight setting problem. Int J Recent Innov Trends Comput Commun 1(5):443\u2013450","journal-title":"Int J Recent Innov Trends Comput Commun"},{"key":"776_CR5","doi-asserted-by":"crossref","unstructured":"Bizri F, Sanso B (2008) Corouting: an IP hybrid routing approach. In: Fourth international conference on networking and services, pp 46\u201352","DOI":"10.1109\/ICNS.2008.53"},{"key":"776_CR6","unstructured":"Kandula S, Katabi D, Davie B, Charny A (2005) Walking the tightrope responsive yet stable traffic engineering. In: ACM 2005 Conference on applications, technologies, architectures, and protocols for computer communications, pp 253\u2013264"},{"key":"776_CR7","doi-asserted-by":"crossref","unstructured":"Dijkstra EW (1959) A node on two problems in connection of graphs. Numerical Mathematics","DOI":"10.1007\/BF01386390"},{"key":"776_CR8","unstructured":"Fortz B, Thorup M (2000) Increasing internet capacity using local search. Technical Report IS-MG"},{"key":"776_CR9","doi-asserted-by":"crossref","unstructured":"Kling R, Banerjee P (1990) Optimization by simulated evolution with applications to standard cell placement. In: Proceedings of 27th Design Automation Conference, pp 20\u201325","DOI":"10.1145\/123186.123193"},{"issue":"4","key":"776_CR10","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1109\/JSAC.2002.1003042","volume":"20","author":"B Fortz","year":"2006","unstructured":"Fortz B, Thorup M (2006) Optimizing OSPF\/IS-IS weights in a changing world. IEEE J Sel Areas Commun 20(4):756\u2013767","journal-title":"IEEE J Sel Areas Commun"},{"key":"776_CR11","doi-asserted-by":"crossref","unstructured":"Sqalli MH, Sait SM, Mohiuddin MA (2006) An enhanced estimator to multi objective OSPF weight setting problem. Network Operations and Management Symposium, NOMS","DOI":"10.1109\/NOMS.2006.1687555"},{"issue":"1","key":"776_CR12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1002\/bltj.2267","volume":"6","author":"M Rodrigues","year":"2002","unstructured":"Rodrigues M, Ramakrishnan KG (2002) Optimal routing in data networks. Bell Labs Tech J 6(1):117\u2013138","journal-title":"Bell Labs Tech J"},{"key":"776_CR13","unstructured":"Ericsson M, Resende MGC, Pardalos PM (2002) A Genetic Algorithm for the Weight Setting Problem in OSPF Routing. J. Combinatorial Optimisation conference"},{"key":"776_CR14","doi-asserted-by":"crossref","unstructured":"Zagozdzon M, Dzida M, Pioro M (2007) Traffic flow optimization in networks with combined OSPF\/MPLS routing. In: IEEE 15Th international conference on advanced computing and communications, pp 131\u2013137","DOI":"10.1109\/ADCOM.2007.46"},{"issue":"5","key":"776_CR15","first-page":"191","volume":"9","author":"A Abo Ghazala","year":"2009","unstructured":"Abo Ghazala A, El Sayed A (2009) Open Shortest Path First Weight Setting (OSPFWS) solving algorithms comparison and new method for updating weights. Int J Comput Sci Netw Secur 9(5):191\u2013197","journal-title":"Int J Comput Sci Netw Secur"},{"key":"776_CR16","unstructured":"Parmar A, Ahmed S, Sokol J (2006) An integer programming approach to the OSPF weight setting problem NSF Technical Report no DMI-0457066"},{"key":"776_CR17","doi-asserted-by":"crossref","unstructured":"Srivastava S, Agarwal G, Medhi D, Pioro M (2005) Determining feasible link weight systems under various objectives for OSPF networks. IEEE Trans Netw Serv Manag 2(1)","DOI":"10.1109\/TNSM.2005.4798297"},{"key":"776_CR18","unstructured":"Buriol L, Resende M, Rebeiro C, Thorup M (2002) TA Memetic algorithm for OSPF routing. In: 6Th INFORMS telecom, pp 187\u2013188"},{"key":"776_CR19","doi-asserted-by":"crossref","unstructured":"Bley A (2005) On the approximability of the minimum congestion unsplittable shortest path routing problem. In: Integer programming and combinatorial optimization (IPCO 2005), lecture notes in computer science LNCS, pp 97\u2013210","DOI":"10.1007\/11496915_8"},{"issue":"1","key":"776_CR20","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/net.20303","volume":"54","author":"A Bley","year":"2009","unstructured":"Bley A (2009) Approximability of unsplittable shortest path routing problems. Networks 54(1):23\u201346","journal-title":"Networks"},{"key":"776_CR21","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-540-95978-6_7","volume":"187","author":"L Lin","year":"2009","unstructured":"Lin L, Gen M (2009) Priority-Based Genetic Algorithm for Shortest Path Routing Problem in OSPF. Intell Evol Syst, Stud in Comput Intell 187:91\u2013104","journal-title":"Intell Evol Syst, Stud in Comput Intell"},{"issue":"4","key":"776_CR22","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0166-5316(02)00036-6","volume":"48","author":"M Pioro","year":"2002","unstructured":"Pioro M, Szentsi A, Harmatos J, Juttner A, Gajownicczek P, Kozdrowski S (2002) On open shortest path first related network optimization problems. Perform Eval 48(4):201\u2013223","journal-title":"Perform Eval"},{"key":"776_CR23","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1109\/LCOMM.2004.837629","volume":"8","author":"G Retvari","year":"2004","unstructured":"Retvari G, Cinkler T (2004) Practical ospf traffic engineering. IEEE Commun Lett 8:689\u2013691","journal-title":"IEEE Commun Lett"},{"key":"776_CR24","unstructured":"Retvari G, Biro J, Cinkler T (2006) On improving the accuracy of OSPF traffic engineering. In: NETWORKING 2006, Lecture notes in computer science (LNCS), vol 3976, pp 51\u201362"},{"issue":"4","key":"776_CR25","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1109\/TNET.2007.893878","volume":"15","author":"A Nucci","year":"2007","unstructured":"Nucci A, Bhattacharyya S, Taft N, Diot C (2007) Igp link weight assignment for operational tier-1 backbones. IEEE\/ACM Trans Networking 15(4):789\u2013802","journal-title":"IEEE\/ACM Trans Networking"},{"issue":"2","key":"776_CR26","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1109\/TNET.2009.2026748","volume":"18","author":"G Shrimali","year":"2010","unstructured":"Shrimali G, Akella A, Mutapcic A (2010) Cooperative interdomain traffic engineering using nash bargaining and decomposition. IEEE\/ACM Trans Networking 18(2):341\u2013352","journal-title":"IEEE\/ACM Trans Networking"},{"key":"776_CR27","doi-asserted-by":"crossref","unstructured":"Riedl A (2003) Optimized routing adaptation in IP networks utilizing OSPF and MPLS. In: IEEE International conference on communications, pp 1754\u20131758","DOI":"10.1109\/ICC.2003.1203901"},{"key":"776_CR28","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/j.future.2011.05.003","volume":"28","author":"S Lee","year":"2012","unstructured":"Lee S, Po-Kai T, Chen A (2012) Link weight assignment and loop-free routing table update for link state routing protocols in energy-aware internet. Futur Gener Comput Syst 28:437\u2013445","journal-title":"Futur Gener Comput Syst"},{"key":"776_CR29","doi-asserted-by":"crossref","unstructured":"Fortz B, Rexford J, Thorup M (2002) Traffic engineering with tradional IP routing protocols. IEEE Commun Mag:118\u2013124","DOI":"10.1109\/MCOM.2002.1039866"},{"key":"776_CR30","doi-asserted-by":"crossref","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"776_CR31","doi-asserted-by":"crossref","unstructured":"Frigioni D, loffreda M, Nanni U, Pasqualone G (1998) Experimental analysis of dynamic algorithms for the single source shortest paths problem. ACM journal of experimental algorithms","DOI":"10.1007\/3-540-68530-8_31"},{"key":"776_CR32","doi-asserted-by":"crossref","unstructured":"Ramalingam G, Reps T (1996) An incremental algorithm for a generalization of the shortest path problem. Journal of Algorithms, 267\u2013305","DOI":"10.1006\/jagm.1996.0046"},{"key":"776_CR33","unstructured":"Fortz B Combinatorial Optimization and Telecommunications. http:\/\/www.poms.ucl.ac.be\/staff\/bf\/en\/COCom-5.pdf"},{"key":"776_CR34","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor"},{"key":"776_CR35","doi-asserted-by":"crossref","unstructured":"Abo Ghazala A, El Sayed A, Mousa M (2008) A survey for open shortest path first weight setting (OSPFWS) problem. The 2nd International Conference on Information Security and Assurance (ISA2008), pp 24\u201326","DOI":"10.1109\/ISA.2008.36"},{"key":"776_CR36","unstructured":"Reis R, Ritt M, Buriol L, Resende M (2007) A memetic algorithm for the weight setting problem in DEFT. In: COMCEV 2007, pp 1\u20136"},{"key":"776_CR37","unstructured":"Abo Ghazala A, El Sayed A, Mousa M (2008) A new approach for open shortest path weight setting (OSPFWS) problem. Convergence and Hybrid Information Technology, pp 188\u2013193"},{"key":"776_CR38","doi-asserted-by":"crossref","unstructured":"Sait SM, Sqalli MH, Mohiuddin MA (2006) Engineering evolutionary algorithm to solve multi objective OSPF weight setting problem. Australian Conference on Artificial Intelligence, pp 950\u2013955","DOI":"10.1007\/11941439_103"},{"key":"776_CR39","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated Annealing: Theory and applications","author":"P Laarhoven","year":"1987","unstructured":"Laarhoven P, Aarts E (1987) Simulated Annealing: Theory and applications. Kluwer, Norwell"},{"issue":"10","key":"776_CR40","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1109\/43.88926","volume":"10","author":"R Kling","year":"1991","unstructured":"Kling R, Banerjee P (1991) Empirical and theoretical studies of the simulated evolution method applied to standard cell placement. IEEE Trans Comput-Aided Design 10(10):1303\u20131315","journal-title":"IEEE Trans Comput-Aided Design"},{"key":"776_CR41","doi-asserted-by":"crossref","unstructured":"Houssaini Sqalli M, Mohammed Sait S, Asadullah S (2008) Minimizing the number of congested links in OSPF routing. ATNAC","DOI":"10.1109\/ATNAC.2008.4783288"},{"issue":"3","key":"776_CR42","first-page":"1","volume":"40","author":"M Mohiuddin","year":"2014","unstructured":"Mohiuddin M, Khan SA, Engelbrecht AP (2014) Simulated evolution and simulated annealing algorithms for solving multi-objective open shortest path first weight setting problem. Appl Intell, Springer 40(3):1\u201320","journal-title":"Appl Intell, Springer"},{"key":"776_CR43","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"LA Zadeh","year":"1965","unstructured":"Zadeh LA (1965) Fuzzy sets. Inf Control 8:338\u2013353","journal-title":"Inf Control"},{"key":"776_CR44","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0255(75)90036-5","volume":"8","author":"LA Zadeh","year":"1975","unstructured":"Zadeh LA (1975) The Concept of a Linguistic Variable and its Application to Approximate Reasoning. Inf Sci 8:199\u2013249","journal-title":"Inf Sci"},{"issue":"1","key":"776_CR45","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/TSMC.1973.5408575","volume":"3","author":"LA Zadeh","year":"1973","unstructured":"Zadeh LA (1973) Outline of a new approach to the analysis of complex systems and decision processes. IEEE Trans Syst Man Cybern 3(1):28\u201344","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"776_CR46","volume-title":"Fuzzy sets and fuzzy decision-making","author":"H Li","year":"1995","unstructured":"Li H, Yen V (1995) Fuzzy sets and fuzzy decision-making. CRC Press, USA"},{"key":"776_CR47","first-page":"276","volume":"3","author":"H Hamacher","year":"1978","unstructured":"Hamacher H (1978) Ueber Logische Verknupfungen Unschalfer Aussagen und deren Zugehoerige Bewertungs-funktione. Prog Cybern Syst Res 3:276\u2013288","journal-title":"Prog Cybern Syst Res"},{"key":"776_CR48","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/BF02189866","volume":"19","author":"M Frank","year":"1979","unstructured":"Frank M (1979) On the simultaneous associativity of F(x,y) and x + y\u2212F(x,y). Aequationes Math 19:194\u2013226","journal-title":"Aequationes Math"},{"key":"776_CR49","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0165-0114(83)80073-6","volume":"11","author":"S Weber","year":"1983","unstructured":"Weber S (1983) A general concept of fuzzy connectives, negations and implications based on t-Norms and t-Conorms. Fuzzy Sets & Systems 11:115\u2013134","journal-title":"Fuzzy Sets & Systems"},{"key":"776_CR50","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0019-9958(79)90730-7","volume":"43","author":"D Dubois","year":"1979","unstructured":"Dubois D, Prade H (1979) Operations in fuzzy-valued logic. Inf Control 43:224\u2013240","journal-title":"Inf Control"},{"issue":"12","key":"776_CR51","doi-asserted-by":"crossref","first-page":"2692","DOI":"10.1016\/j.ins.2007.01.031","volume":"177","author":"SA Khan","year":"2007","unstructured":"Khan SA, Engelbrecht AP (2007) A new fuzzy operator and its application to topology design of distributed local area networks. Inf Sci 177(12):2692\u20132711","journal-title":"Inf Sci"},{"key":"776_CR52","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1995) Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"776_CR53","doi-asserted-by":"crossref","unstructured":"Kling R, Banerjee P (1991) Empirical and theoretical studies of the simulated evolution method applied to standard cell placement. IEEE Transactions on Computer-Aided Design, pp 1303\u20131305","DOI":"10.1109\/43.88926"},{"key":"776_CR54","doi-asserted-by":"crossref","unstructured":"Kling R, ESP P. Banerjee. (1989) Placement by simulated evolution. IEEE Transactions on Computer-Aided Design, pp 245\u2013255","DOI":"10.1109\/43.21844"},{"key":"776_CR55","unstructured":"Zegura EW (1996) GT-ITM: Georgia Tech Internetwork Topology Models (software). http:\/\/www.cc.gatech.edu\/faq\/Ellen.Zegura\/gt-itm\/gt-itm.tar.gz"},{"key":"776_CR56","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1109\/35.587723","volume":"35","author":"K Calvert","year":"1997","unstructured":"Calvert K, Doar M, Zegura EW (1997) Modeling internet toplogy. IEEE Commun Mag 35:160\u2013163","journal-title":"IEEE Commun Mag"},{"key":"776_CR57","doi-asserted-by":"crossref","unstructured":"Zegura EW, Calvert KL, bhattacharjee S (1996) How to model an internetwork. 15th IEE Conference on Computer Communications (INFOCOM), pp 594\u2013602","DOI":"10.1109\/INFCOM.1996.493353"},{"key":"776_CR58","unstructured":"van den Bergh F (2001) An analysis of particle swarm optimizers. PhD Thesis, University of Pretoria"},{"key":"776_CR59","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10489-010-0251-2","volume":"36","author":"SA Khan","year":"2012","unstructured":"Khan SA, Engelbrecht AP (2012) A fuzzy particle swarm optimization algorithm for computer communication network topology design. Appl Intell 36:161\u2013177","journal-title":"Appl Intell"},{"key":"776_CR60","unstructured":"Cho H, Wang B, Roychowdhury S (1998) Automatic rule generation for fuzzy controllers using genetic algorithms a study on representation scheme and mutation rate. In: IEEE World congress on computational intelligence, pp 1290\u20131295"},{"key":"776_CR61","doi-asserted-by":"crossref","unstructured":"Haupt R (2000) Optimum population size and mutation rate for a simple real genetic algorithm that optimizes array factors. In: IEEE Antennas and propagation society international symposium, pp 1034\u20131037","DOI":"10.1109\/APS.2000.875398"},{"key":"776_CR62","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0165-0114(95)00254-5","volume":"82","author":"M Lim","year":"1996","unstructured":"Lim M, Rahardja S, Gwee B (1996) A GA paradigm for learning fuzzy rules. Fuzzy Sets Syst 82:177\u2013186","journal-title":"Fuzzy Sets Syst"},{"key":"776_CR63","unstructured":"Liska J, Melsheimer SS (1994) Complete design of fuzzy login system using genetic algorithms. In: 3Rd IEEE international conference on fuzzy systems, pp 1377\u2013 1382"},{"key":"776_CR64","doi-asserted-by":"crossref","unstructured":"Alvarez-Benitez J, Everson R, Fieldsend J (2005) A MOPSO Algorithm Based Exclusively on Pareto Dominance Concepts. In: 3rd International Conference on Evolutionary Multi-criterion Optimization, Lecture Notes in Computer Science (LNCS), vol 3410, pp 459\u2013473","DOI":"10.1007\/978-3-540-31880-4_32"},{"key":"776_CR65","doi-asserted-by":"crossref","unstructured":"Parsopoulos K, Vrahatis M (2002) Particle swarm optimization method in multiobjective problems. In: ACM Symposium on applied computing, pp 603\u2013607","DOI":"10.1145\/508791.508907"},{"issue":"2","key":"776_CR66","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-016-0776-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-016-0776-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-016-0776-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-016-0776-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T08:48:49Z","timestamp":1567759729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-016-0776-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,6]]},"references-count":66,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["776"],"URL":"https:\/\/doi.org\/10.1007\/s10489-016-0776-0","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,6]]}}}