{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T13:08:45Z","timestamp":1779887325052,"version":"3.53.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,3,30]],"date-time":"2014-03-30T00:00:00Z","timestamp":1396137600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s00500-014-1266-0","type":"journal-article","created":{"date-parts":[[2014,3,29]],"date-time":"2014-03-29T08:55:20Z","timestamp":1396083320000},"page":"471-482","source":"Crossref","is-referenced-by-count":34,"title":["A novel membrane algorithm for capacitated vehicle routing problem"],"prefix":"10.1007","volume":"19","author":[{"given":"Yunyun","family":"Niu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juanjuan","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianhua","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,3,30]]},"reference":[{"key":"1266_CR1","first-page":"301","volume":"7","author":"BM Baker","year":"2003","unstructured":"Baker BM, Ayechew MA (2003) A genetic algorithm for the vehicle routing problem. Comput Oper Res 7:301\u2013317","journal-title":"Comput Oper Res"},{"key":"1266_CR2","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1631\/jzus.2006.A0607","volume":"7","author":"AL Chen","year":"2006","unstructured":"Chen AL, Yang GK, Wu ZM (2006) Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. J Zhejiang Univ Sci A 7:607\u2013614","journal-title":"J Zhejiang Univ Sci A"},{"key":"1266_CR3","first-page":"134","volume":"1991","author":"A Colorni","year":"1991","unstructured":"Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. Proc First Eur Conf Artif Life 1991:134\u2013142","journal-title":"Proc First Eur Conf Artif Life"},{"key":"1266_CR4","volume-title":"An investigation of some properties of ant algorithm","author":"A Colorni","year":"1992","unstructured":"Colorni A, Dorigo M, Maniezzo V (1992) An investigation of some properties of ant algorithm. Elsevier Publishing, Brussels"},{"key":"1266_CR5","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G Dantzig","year":"1959","unstructured":"Dantzig G, Ramser JH (1959) The truck dispatching problem. Manag Sci 6:80\u201391","journal-title":"Manag Sci"},{"key":"1266_CR6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M Dorigo","year":"1999","unstructured":"Dorigo M, Di Caro G, Gambardella LM (1999) Ant algorithms for discrete optimization. Artif Life 5:137\u2013172","journal-title":"Artif Life"},{"key":"1266_CR7","doi-asserted-by":"crossref","unstructured":"Gendreau M, Laporte G, Musaraganyi C, Taillard ED (1999) A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comput Oper Res 41:421\u2013451","DOI":"10.1016\/S0305-0548(98)00100-2"},{"key":"1266_CR8","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1002\/net.20192","volume":"1","author":"M Gendreau","year":"2008","unstructured":"Gendreau M, Iori M, Laporte G, Martello S (2008) A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 1:4\u201318","journal-title":"Networks"},{"key":"1266_CR9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230110204","volume":"11","author":"B Lawrence","year":"1981","unstructured":"Lawrence B, Bruce G (1981) Classification of vehicle routing and scheduling. Networks 11:97\u2013108","journal-title":"Networks"},{"key":"1266_CR10","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the TSP. Oper Res 21:498\u2013516","journal-title":"Oper Res"},{"key":"1266_CR11","unstructured":"Nishida TY (2005) Membrane algorithm: an approximate algorithm for NP-complete optimization problems exploiting P-systems. In: Proceedings of 6th international workshop on membrane computing, pp 26\u201343"},{"key":"1266_CR12","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/j.amc.2003.10.058","volume":"162","author":"IH Osman","year":"2005","unstructured":"Osman IH, Abo-Sinna MA, Mouse AA (2005) An effective genetic algorithm approach to multiobjective routing problems. Appl Math Comput 162:769\u2013781","journal-title":"Appl Math Comput"},{"issue":"1","key":"1266_CR13","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"Gh P\u0103un","year":"2000","unstructured":"P\u0103un Gh (2000) Computing with membranes. J Comput Syst Sci 61(1):108\u2013143","journal-title":"J Comput Syst Sci"},{"key":"1266_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56196-2","volume-title":"Membrane computing: an introduction","author":"Gh P\u0103un","year":"2002","unstructured":"P\u0103un Gh (2002) Membrane computing: an introduction. Springer, Berlin"},{"key":"1266_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-11467-0","volume-title":"The Oxford handbook of membrane computing","author":"Gh P\u0103un","year":"2010","unstructured":"P\u0103un Gh, Rozenberg G, Salomaa A (2010) The Oxford handbook of membrane computing. Oxford University Press, Oxford"},{"key":"1266_CR16","unstructured":"St\u00fctzle T, Hoos H (1996) Improving the ant-system: a detailed report on the MAX\u2013MIN ant system. Technical Report AIDA-96-12, FG Intellektik, TH Darmstadt"},{"key":"1266_CR17","first-page":"308","volume":"1997","author":"T St\u00fctzle","year":"1997","unstructured":"St\u00fctzle T, Hoos H (1997) MAX\u2013MIN ant system and local search for the traveling salesman problem. Int Conf Evol Comput 1997:308\u2013313","journal-title":"Int Conf Evol Comput"},{"key":"1266_CR18","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos H (2000) MAX\u2013MIN ant system. Futur Gener Comput Syst 16:889\u2013914","journal-title":"Futur Gener Comput Syst"},{"issue":"8","key":"1266_CR19","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1145\/545151.545152","volume":"45","author":"P Tarasewich","year":"2002","unstructured":"Tarasewich P, McMullen PR (2002) Swarm intelligence: power in numbers. Commun ACM 45(8):62\u201367","journal-title":"Commun ACM"},{"key":"1266_CR20","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/j.amc.2005.09.040","volume":"176","author":"R Tavakkoli-Moghaddam","year":"2006","unstructured":"Tavakkoli-Moghaddam R, Safaei N, Gholipour Y (2006) A hybrid simulated annealing for the capacitated vehicle routing problems with the independent tour length. Appl Math Comput 176:445\u2013454","journal-title":"Appl Math Comput"},{"key":"1266_CR21","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1016\/j.ejor.2007.05.058","volume":"195","author":"E Zachariadis","year":"2009","unstructured":"Zachariadis E, Tarantilis C, Kiranoudis C (2009) A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. Eur J Oper Res 195:729\u2013743","journal-title":"Eur J Oper Res"},{"key":"1266_CR22","first-page":"93","volume":"87","author":"G Zhang","year":"2008","unstructured":"Zhang G, Gheorghe M, Wu C (2008) A quantum-inspired evolutionary algorithm based on P systems for knapsack problem. Fundam Inform 87:93\u2013116","journal-title":"Fundam Inform"},{"key":"1266_CR23","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.ejor.2008.02.028","volume":"196","author":"B Yu","year":"2009","unstructured":"Yu B, Yang Z, Ya B (2009) An improved ant colony optimization for vehicle routing problem. Eur J Oper Res 196:171\u2013176","journal-title":"Eur J Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1266-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-014-1266-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1266-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T21:59:47Z","timestamp":1565301587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-014-1266-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,30]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["1266"],"URL":"https:\/\/doi.org\/10.1007\/s00500-014-1266-0","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,30]]}}}