{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T12:38:55Z","timestamp":1774269535326,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2016,9,29]],"date-time":"2016-09-29T00:00:00Z","timestamp":1475107200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s00521-016-2608-x","type":"journal-article","created":{"date-parts":[[2016,9,29]],"date-time":"2016-09-29T05:59:31Z","timestamp":1475128771000},"page":"955-968","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["OVRP_GELS: solving open vehicle routing problem using the gravitational emulation local search algorithm"],"prefix":"10.1007","volume":"29","author":[{"given":"Ali Asghar Rahmani","family":"Hosseinabadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javad","family":"Vahidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentina Emilia","family":"Balas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seyed Saeid","family":"Mirkamali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,29]]},"reference":[{"key":"2608_CR1","doi-asserted-by":"crossref","first-page":"2918","DOI":"10.1016\/j.cor.2005.11.018","volume":"34","author":"F Li","year":"2007","unstructured":"Li F, Golden B, Wasil E (2007) The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Comput Oper Res 34:2918\u20132930","journal-title":"Comput Oper Res"},{"key":"2608_CR2","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1016\/j.ejor.2007.06.064","volume":"195","author":"K Fleszar","year":"2009","unstructured":"Fleszar K, Osman IH, Hindi KS (2009) A variable neighbourhood search algorithm for the open vehicle routing problem. Eur J Oper Res 195:803\u2013809","journal-title":"Eur J Oper Res"},{"issue":"2","key":"2608_CR3","first-page":"77","volume":"2","author":"S Csisz\u00e1r","year":"2005","unstructured":"Csisz\u00e1r S (2005) Route elimination heuristic for vehicle routing problem with time windows. acta polytech hung 2(2):77\u201389","journal-title":"acta polytech hung"},{"key":"2608_CR4","unstructured":"Hosseinabadi AR, Kardgar M, Shojafar M, Shamshirband Sh, Abraham A (2015) Gravitational search algorithm to solve open vehicle routing problem. In: 6th International conference on innovations in bio-inspired computing and applications (IBICA 2015), chapter advances in intelligent systems and computing, Kochi, India, Springer, pp 93\u2013103"},{"key":"2608_CR5","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1057\/palgrave.jors.2600924","volume":"51","author":"D Sariklis","year":"2000","unstructured":"Sariklis D, Powell S (2000) A heuristic method for the open vehicle routing problem. J Oper Res Soc 51:564\u2013573","journal-title":"J Oper Res Soc"},{"key":"2608_CR6","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1016\/S0377-2217(03)00238-8","volume":"157","author":"J Brandao","year":"2004","unstructured":"Brandao J (2004) A tabu search algorithm for the open vehicle routing problem. Eur J Oper Res 157:552\u2013564","journal-title":"Eur J Oper Res"},{"key":"2608_CR7","first-page":"3569","volume":"41","author":"C Erbao","year":"2013","unstructured":"Erbao C, Mingyong L, Hongming Y (2013) Open vehicle routing problem with demand uncertainty and its robust strategies. Expert Syst Appl 41:3569\u20133575","journal-title":"Expert Syst Appl"},{"key":"2608_CR8","doi-asserted-by":"crossref","first-page":"10568","DOI":"10.1016\/j.eswa.2011.02.108","volume":"38","author":"Sh Yu","year":"2011","unstructured":"Yu Sh, Ding Ch, Zhu K (2011) A hybrid GA-TS algorithm for open vehicle routing optimization of coal mines material. Expert Syst Appl 38:10568\u201310573","journal-title":"Expert Syst Appl"},{"key":"2608_CR9","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.eswa.2011.07.025","volume":"39","author":"X Li","year":"2012","unstructured":"Li X, Leung SCH, Tian P (2012) A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle, routing problem. Expert Syst Appl 39:365\u2013374","journal-title":"Expert Syst Appl"},{"key":"2608_CR10","first-page":"132","volume":"1","author":"F Huang","year":"2010","unstructured":"Huang F, Liu C (2010) A hybrid tabu search for open vehicle routing problem. CCTAE 1:132\u2013134","journal-title":"CCTAE"},{"key":"2608_CR11","doi-asserted-by":"crossref","unstructured":"Huang F, Liu C (2010) An Improved tabu search for open vehicle routing problem. MASS, pp 1\u20134","DOI":"10.1109\/ICMSS.2010.5576368"},{"key":"2608_CR12","doi-asserted-by":"crossref","unstructured":"Shamshirband S, Shojafar M, Hosseinabadi AR, Abraham A (2014) A solution for multi-objective commodity vehicle routing problem by NSGA-II. In: International conference on hybrid intelligent systems (HIS), pp 12\u201317","DOI":"10.1109\/HIS.2014.7086201"},{"issue":"2","key":"2608_CR13","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10100-011-0204-9","volume":"21","author":"SKh Hadji","year":"2013","unstructured":"Hadji SKh, Prins Ch, Yalaoui A, Reghioui M (2013) Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows. Central Eur J Oper Res 21(2):307\u2013336","journal-title":"Central Eur J Oper Res"},{"key":"2608_CR14","first-page":"15","volume":"1","author":"N Norouzi","year":"2009","unstructured":"Norouzi N, Tavakkoli-Moghaddam R, Salamatbakhsh A, Alinaghian M (2009) Solving a novel bi-objective open vehicle routing problem in a competitive situation by multi objective particle swarm optimization. J Appl Oper Res 1:15\u201329","journal-title":"J Appl Oper Res"},{"key":"2608_CR15","first-page":"560","volume":"2","author":"T Zhen","year":"2009","unstructured":"Zhen T, Zhu Y, Zhang Q (2009) A particle swarm optimization algorithm for the open vehicle routing problem. ESIAT 2:560\u2013563","journal-title":"ESIAT"},{"key":"2608_CR16","unstructured":"Hu F, Wu F (2010) Diploid hybrid particle swarm optimization with differential evolution for open vehicle routing problem. WCICA, pp 2692\u20132697"},{"key":"2608_CR17","doi-asserted-by":"crossref","first-page":"11547","DOI":"10.1016\/j.eswa.2011.03.032","volume":"38","author":"SA Mirhassani","year":"2011","unstructured":"Mirhassani SA, Abolghasemi N (2011) A particle swarm optimization algorithm for open vehicle routing problem. Expert Syst Appl 38:11547\u201311551","journal-title":"Expert Syst Appl"},{"key":"2608_CR18","first-page":"87","volume":"2","author":"T Ghosh","year":"2011","unstructured":"Ghosh T, Sengupta S, Chattopadhyay M, Dan PK (2011) Meta-heuristics in cellular manufacturing: a state-ofthe- art review. Int J Ind Eng Comput 2:87\u2013122","journal-title":"Int J Ind Eng Comput"},{"key":"2608_CR19","unstructured":"Shamshirband Sh, Shojafar M, Hosseinabadi AR, Abraham A (2015) OVRP_ICA: An Imperialist-based optimization algorithm for the open vehicle routing problem. In: International conference on hybrid artificial intelligence systems (HAIS), Springer LNCS, vol 9121, pp 221\u2013233"},{"key":"2608_CR20","unstructured":"Pan L, Fu Z (2009) A clonal selection algorithm for open vehicle routing problem. In: Third international conference on genetic and evolutionary computing, pp 786\u2013790"},{"key":"2608_CR21","unstructured":"Voudouris C, Tsang E (1995) Function optimization using guided local search. Technical Report CSM-249, University of Essex, Colchester"},{"key":"2608_CR22","unstructured":"Webster B (2004) Solving combinatorial optimization problems using a new algorithm based on gravitational attraction. Melbourne"},{"key":"2608_CR23","first-page":"11","volume":"10","author":"A Bagrezai","year":"2013","unstructured":"Bagrezai A, Makki SVA-D, Rostami A (2013) A new energy consumption algorithm with active sensor selection using GELS in target coverage WSN. Int J Comput Sci Issues 10:11\u201318","journal-title":"Int J Comput Sci Issues"},{"key":"2608_CR24","first-page":"223","volume":"4","author":"SR Balachandar","year":"2010","unstructured":"Balachandar SR, Kannan K (2010) A meta-heuristic algorithm for set covering problem based on gravity. Int J Comput Math Sci 4:223\u2013228","journal-title":"Int J Comput Math Sci"},{"key":"2608_CR25","first-page":"1","volume":"6","author":"J Rezaeian","year":"2013","unstructured":"Rezaeian J, Seidgar H, Kiani M (2013) Scheduling of a hybrid flow shop with multiprocessor tasks by a hybrid approach based on genetic and imperialist competitive algorithms. J Optim Ind Eng 6:1\u201311","journal-title":"J Optim Ind Eng"},{"issue":"1","key":"2608_CR26","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10479-014-1770-8","volume":"229","author":"AR Hosseinabadi","year":"2015","unstructured":"Hosseinabadi AR, Siar H, Shamshirband S, Shojafar M, Nizam Md, Nasir MH (2015) Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in Small and Medium Enterprises. Ann Oper Res 229(1):451\u2013474","journal-title":"Ann Oper Res"},{"key":"2608_CR27","doi-asserted-by":"crossref","unstructured":"Hosseinabadi AR, Kardgar M, Shojafar M, Shamshirband S, Abraham A (2014) GELS-GA: hybrid metaheuristic algorithm for solving multiple travelling salesman problem. In: International conference on intelligent systems design and applications (ISDA), pp 76\u201381","DOI":"10.1109\/ISDA.2014.7066271"},{"issue":"2","key":"2608_CR28","first-page":"1","volume":"9","author":"AS Rostami","year":"2015","unstructured":"Rostami AS, Mohanna F, Keshavarz H, Hosseinabadi AR (2015) Solving multiple traveling salesman problem using the gravitational emulation local search algorithm. Appl Math Inf Sci 9(2):1\u201311","journal-title":"Appl Math Inf Sci"},{"key":"2608_CR29","first-page":"745","volume":"10","author":"AR Hosseinabadi","year":"2013","unstructured":"Hosseinabadi AR, Farahabadi AB, Rostami MS, Lateran AF (2013) Presentation of a new and beneficial method through problem solving timing of open shop by random algorithm gravitational emulation local search. Int J Comput Sci Issues 10:745\u2013752","journal-title":"Int J Comput Sci Issues"},{"key":"2608_CR30","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G Dueck","year":"1990","unstructured":"Dueck G (1990) New optimization heuristics : the great deluge algorithm and the record-to-record travel. J Comput Phys 90:161\u2013175","journal-title":"J Comput Phys"},{"key":"2608_CR31","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1016\/j.cor.2003.10.002","volume":"32","author":"F Li","year":"2005","unstructured":"Li F, Golden B, Wasil E (2005) Very large-scale vehicle routing: new test problems, algorithms, and results. Comput Oper Res 32:1165\u20131179","journal-title":"Comput Oper Res"},{"key":"2608_CR32","unstructured":"Site: \n                        www.branchandcut.org\/VRP\/data\/\n                        \n                    , \n                        http:\/\/people.brunel.ac.uk\/mastjjb\/jeb\/info.htm"},{"key":"2608_CR33","doi-asserted-by":"crossref","unstructured":"Christofides N, Mingozzi A, Toth P The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimization. Wiley, Chichester, pp 31538, 31979","DOI":"10.1051\/ro\/197610V100551"},{"key":"2608_CR34","doi-asserted-by":"crossref","unstructured":"Fisher M (1994) Optimal solution of vehicle routing problems using minimum k-trees. Operations Research, pp 626-642","DOI":"10.1287\/opre.42.4.626"},{"key":"2608_CR35","unstructured":"Schneider H, Reinholz A (2008) Integrating variable neighborhood search into a hybrid evolutionary strategy for the open vehicle routing problem. EU\/MEeting 2008\u2014Troyes, France, October 23_24, pp 1\u20136"},{"key":"2608_CR36","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.cor.2008.11.003","volume":"37","author":"PP Repoussisa","year":"2010","unstructured":"Repoussisa PP, Tarantilis CD, Braysy O, Ioannou G (2010) A hybrid evolution strategy for the open vehicle routing problem. Comput Oper Res 37:443\u2013455","journal-title":"Comput Oper Res"},{"key":"2608_CR37","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1016\/j.cor.2009.06.021","volume":"37","author":"EE Zachariadis","year":"2010","unstructured":"Zachariadis EE, Kiranoudis ChT (2010) An open vehicle routing problem metaheuristic for examining wide solution neighborhoods. Comput Oper Res 37:712\u2013723","journal-title":"Comput Oper Res"},{"key":"2608_CR38","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.swevo.2013.12.003","volume":"15","author":"Y Marinakis","year":"2014","unstructured":"Marinakis Y, Marinaki M (2014) A bumble bees mating optimization algorithm for the open vehicle routing problem. Swarm Evol Comput 15:80\u201394","journal-title":"Swarm Evol Comput"},{"key":"2608_CR39","doi-asserted-by":"crossref","unstructured":"Chen P, Qu Y, Huang H, Dong X (2008) A new hybrid iterated local search for the open vehicle routing problem. Pacific-Asia Workshop on Computational Intelligence and Industrial Application, pp 891\u2013895","DOI":"10.1109\/PACIIA.2008.40"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-016-2608-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2608-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2608-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,31]],"date-time":"2018-03-31T06:30:26Z","timestamp":1522477826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-016-2608-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,29]]},"references-count":39,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["2608"],"URL":"https:\/\/doi.org\/10.1007\/s00521-016-2608-x","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,29]]}}}