{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:49:29Z","timestamp":1760708969110},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T00:00:00Z","timestamp":1450656000000},"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":["Soft Comput"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s00500-015-1991-z","type":"journal-article","created":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T04:07:02Z","timestamp":1450670822000},"page":"3063-3079","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Solving robot path planning problem by using a new elitist multi-objective IWD algorithm based on coefficient of variation"],"prefix":"10.1007","volume":"21","author":[{"given":"Soheila","family":"Salmanpour","sequence":"first","affiliation":[]},{"given":"Hesamoddin","family":"Monfared","sequence":"additional","affiliation":[]},{"given":"Hesam","family":"Omranpour","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,21]]},"reference":[{"key":"1991_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed F, Deb K (2011) Multi-objective path planning using spline representation. In: Proceedings of the IEEE international conference on robotics and biomimetics (IEEE-ROBIO), Piscatway. pp 1047\u20131052","DOI":"10.1109\/ROBIO.2011.6181426"},{"issue":"7","key":"1991_CR2","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1007\/s00500-012-0964-8","volume":"17","author":"F Ahmed","year":"2013","unstructured":"Ahmed F, Deb K (2013) Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms. Soft Comput 17(7):1283\u20131299","journal-title":"Soft Comput"},{"key":"1991_CR3","unstructured":"Alaya C Solnon, Ghedira K (2007) Ant colony optimization for multi-objective optimization problems. In: 19th IEEE international conference on tools with artificial intelligence (ICTAI), vol 1, pp 450-457"},{"issue":"1","key":"1991_CR4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s11721-008-0022-4","volume":"3","author":"D Angus","year":"2009","unstructured":"Angus D, Woodward C (2009) Multiple objective ant colony optimisation. Swarm Intell 3(1):69\u201385","journal-title":"Swarm Intell"},{"key":"1991_CR5","unstructured":"Bar\u00e1n B, Schaerer M (2003) A multiobjective ant colony system for vehicle routing problem with time windows. In: Proceedings of the 21st IASTED International Conference, Applied informatics, Innsbruck, Austria, pp 97\u2013102"},{"issue":"1","key":"1991_CR6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s12293-012-0076-0","volume":"4","author":"J Botzheim","year":"2012","unstructured":"Botzheim J, Toda Y, Kubota N (2012) Bacterial memetic algorithm for offline path planning of mobile robots. Memet Comput 4(1):73\u201386","journal-title":"Memet Comput"},{"issue":"1","key":"1991_CR7","first-page":"48","volume":"6","author":"O Castilho","year":"2005","unstructured":"Castilho O, Trujilo L (2005) Multiple objective optimization genetic algorithms for path planning in autonomous mobile robots. Int J Comput Syst Signal 6(1):48\u201363","journal-title":"Int J Comput Syst Signal"},{"issue":"5","key":"1991_CR8","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.robot.2011.02.007","volume":"59","author":"M Dakulovi\u0107","year":"2011","unstructured":"Dakulovi\u0107 M, Petrovi\u0107 I (2011) Two-way D* algorithm for path planning and replanning. Robot Auton Syst 59(5):329\u2013342","journal-title":"Robot Auton Syst"},{"issue":"1","key":"1991_CR9","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1016\/j.asoc.2012.07.023","volume":"13","author":"M Davoodi","year":"2013","unstructured":"Davoodi M, Panahi F, Mohades A, Hashemi SN (2013) Multi-objective path planning in discrete space. Appl Soft Comput 13(1):709\u2013720","journal-title":"Appl Soft Comput"},{"key":"1991_CR10","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, Hoboken"},{"key":"1991_CR11","doi-asserted-by":"crossref","unstructured":"Deb K, Agrawal S, Pratap A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Lecture notes in computer science, vol 1917, pp 849\u2013858","DOI":"10.1007\/3-540-45356-3_83"},{"issue":"1\u20134","key":"1991_CR12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1023\/B:ANOR.0000039513.99038.c6","volume":"131","author":"K Doerner","year":"2004","unstructured":"Doerner K, Gutjahr WJ, Hartl RF, Strauss C, Stummer C (2004) Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection. Ann Oper Res 131(1\u20134):79\u201399","journal-title":"Ann Oper Res"},{"issue":"2","key":"1991_CR13","first-page":"115","volume":"11","author":"KF Doerner","year":"2003","unstructured":"Doerner KF, Hartl RF, Reimann M (2003) Are CompetAnts more competent for problem solving? The case of a multiple objective transportation problem. Cent Eur J Oper Res Econ 11(2):115\u2013141","journal-title":"Cent Eur J Oper Res Econ"},{"key":"1991_CR14","doi-asserted-by":"crossref","unstructured":"Ferariu L, Cimpanu C (2014) Multiobjective hybrid evolutionary path planning with adaptive pareto ranking of variable-length chromosomes. In: 2014 IEEE 12th international symposium on applied machine intelligence and informatics (SAMI), pp 73\u201378","DOI":"10.1109\/SAMI.2014.6822417"},{"key":"1991_CR15","unstructured":"Fonseca CM, Fleming PJ (1993) Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization. In: Proceedings of the fifth international conference on genetic algorithms, vol 423, pp 416\u2013423"},{"key":"1991_CR16","doi-asserted-by":"crossref","unstructured":"Gong D, Lu L, Li M (2009) Robot path planning in uncertain environments based on particle swarm optimization. In: IEEE congress on evolutionary computation, 2009 (CEC\u201909), pp 2127\u20132134","DOI":"10.1109\/CEC.2009.4983204"},{"issue":"8","key":"1991_CR17","first-page":"1554","volume":"6","author":"DW Gong","year":"2011","unstructured":"Gong DW, Zhang JH, Zhang Y (2011) Multi-objective particle swarm optimization for robot path planning in environment with danger sources. J Comput 6(8):1554\u20131561","journal-title":"J Comput"},{"key":"1991_CR18","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1109\/TEVC.2011.2182651","volume":"16","author":"M L\u00f3pez-Ib\u00e1nez","year":"2011","unstructured":"L\u00f3pez-Ib\u00e1nez M, St\u00fctzle T (2011) The automatic design of multi-objective ant colony optimization algorithms. IEEE Trans Evol Comput 16:861\u2013875","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"1991_CR19","doi-asserted-by":"crossref","first-page":"1556","DOI":"10.1109\/TSMCB.2011.2157493","volume":"41","author":"Y Lu","year":"2011","unstructured":"Lu Y, Huo X, Arslan O, Tsiotras P (2011) Incremental multi-scale search algorithm for dynamic path planning with low worst-case complexity. IEEE Trans Syst Man Cybern B Cybern 41(6):1556\u20131570","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"1991_CR20","doi-asserted-by":"crossref","unstructured":"Lu Y, Huo X, Tsiotras P (2010) Beamlet-like data processing for accelerated path-planning using multiscale information of the environment. In: 49th IEEE conference on decision and control (CDC), 2010, pp 3808\u20133813","DOI":"10.1109\/CDC.2010.5717586"},{"issue":"1","key":"1991_CR21","first-page":"101","volume":"29","author":"E Masehian","year":"2007","unstructured":"Masehian E, Sedighizadeh D (2007) Classic and heuristic approaches in robot motion planning\u2014a chronological review. World Acad Sci Eng Technol 29(1):101\u2013106","journal-title":"World Acad Sci Eng Technol"},{"key":"1991_CR22","doi-asserted-by":"crossref","unstructured":"Mohanty PK, Kumar S, Parhi DR (2015) A new ecologically inspired algorithm for mobile robot navigation. In: Proceedings of the 3rd international conference on frontiers of intelligent computing: theory and applications (FICTA) 2014. Springer International Publishing, pp 755\u2013762","DOI":"10.1007\/978-3-319-11933-5_85"},{"issue":"2","key":"1991_CR23","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01743536","volume":"10","author":"A Osyczka","year":"1995","unstructured":"Osyczka A, Kundu S (1995) A new method to solve generalized multicriteria optimization problems using the simple genetic algorithm. Struct Optim 10(2):94\u201399","journal-title":"Struct Optim"},{"issue":"3","key":"1991_CR24","doi-asserted-by":"crossref","first-page":"1519","DOI":"10.3233\/IFS-131118","volume":"27","author":"S Salmanpour","year":"2014","unstructured":"Salmanpour S, Motameni H (2014) Optimal path planning for mobile robot using Intelligent Water Drops algorithm. J Intell Fuzzy Syst 27(3):1519\u20131531","journal-title":"J Intell Fuzzy Syst"},{"issue":"224\u2013229","key":"1991_CR25","first-page":"2012","volume":"32","author":"H Shah-Hosseini","year":"2012","unstructured":"Shah-Hosseini H (2012) An approach to continuous optimization by the intelligent water drops algorithm. Proc Soc Behav Sci 32(224\u2013229):2012","journal-title":"Proc Soc Behav Sci"},{"issue":"1","key":"1991_CR26","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1504\/IJBIC.2009.022775","volume":"1","author":"H Shah-Hosseini","year":"2009","unstructured":"Shah-Hosseini H (2009) The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm. Int J Bio-Inspired Comput 1(1):71\u201379","journal-title":"Int J Bio-Inspired Comput"},{"issue":"3","key":"1991_CR27","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221\u2013248","journal-title":"Evol Comput"},{"key":"1991_CR28","unstructured":"Stentz, (1995) The focussed D* algorithm for real-time replanning. In: International joint conference on artificial intelligence, vol 14, pp 1652\u20131659"},{"key":"1991_CR29","unstructured":"Sugihara K (1997) A case study on tuning of genetic algorithms by using performance evaluation based on experimental design. In: Proceedings of the 1997 joint conference on information sciences"},{"key":"1991_CR30","doi-asserted-by":"crossref","unstructured":"Tuncer, Yildirim M (2012) Dynamic path planning of mobile robots with improved genetic algorithm. Comput Electr Eng 38(6):1564\u20131572","DOI":"10.1016\/j.compeleceng.2012.06.016"},{"key":"1991_CR31","doi-asserted-by":"crossref","first-page":"2738","DOI":"10.1016\/j.proeng.2011.08.515","volume":"15","author":"W Zhangqi","year":"2011","unstructured":"Zhangqi W, Xiaoguang Z, Qingyao H (2011) Mobile robot path planning based on parameter optimization ant colony algorithm. Proc Eng 15:2738\u20132741","journal-title":"Proc Eng"},{"key":"1991_CR32","unstructured":"Zitzler E, Thiele L (1998) An evolutionary algorithm for multiobjective optimization: The strength pareto approach. Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology Z\u00fcrich (ETH)"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1991-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1991-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1991-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1991-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,13]],"date-time":"2020-09-13T01:17:13Z","timestamp":1599959833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1991-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,21]]},"references-count":32,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["1991"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1991-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,21]]}}}