{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T00:37:21Z","timestamp":1774139841305,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,9,13]],"date-time":"2007-09-13T00:00:00Z","timestamp":1189641600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Swarm Intell"],"published-print":{"date-parts":[[2007,11,15]]},"DOI":"10.1007\/s11721-007-0005-x","type":"journal-article","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T12:24:32Z","timestamp":1189599872000},"page":"135-151","source":"Crossref","is-referenced-by-count":144,"title":["Ant colony optimization for real-world vehicle routing problems"],"prefix":"10.1007","volume":"1","author":[{"given":"A. E.","family":"Rizzoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Montemanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Lucibello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. M.","family":"Gambardella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,9,13]]},"reference":[{"issue":"3","key":"5_CR1","first-page":"1","volume":"30","author":"Y. Aksoy","year":"2003","unstructured":"Aksoy, Y., & Derbez, A. (2003). Software survey: supply chain management. OR\/MS Today, 30(3), 1\u201313.","journal-title":"OR\/MS Today"},{"issue":"1","key":"5_CR2","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.ejor.2005.06.042","volume":"176","author":"M. D. Albritton","year":"2007","unstructured":"Albritton, M. D., & McMullen, P. R. (2007). Optimal product design using a colony of virtual ants. European Journal of Operational Research, 176(1), 498\u2013520.","journal-title":"European Journal of Operational Research"},{"key":"5_CR3","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/978-3-540-30217-9_46","volume-title":"Parallel problem solving from nature\u2014PPSN VIII","author":"L. Bianchi","year":"2004","unstructured":"Bianchi, L., Birattari, M., Chiarandini, M., Manfrin, M., Mastrolilli, M., Paquete, L., Rossi-Doria, O., & Schiavinotto, T. (2004). Metaheuristics for the vehicle routing problem with stochastic demands. X.\u00a0Yao, et al. (Eds.), Lecture notes in computer science : Vol.\u00a03242. Parallel problem solving from nature\u2014PPSN VIII (pp.\u00a0450\u2013460). Berlin: Springer."},{"issue":"6","key":"5_CR4","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1016\/j.cor.2003.11.018","volume":"32","author":"C. Blum","year":"2005","unstructured":"Blum, C. (2005). Beam-ACO\u2014Hybridizing ant colony optimization with beam search: an application to open shop scheduling. Computers and Operations Research, 32(6), 1565\u20131591.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"5_CR5","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1109\/TSMCB.2003.821450","volume":"34","author":"C. Blum","year":"2004","unstructured":"Blum, C., & Dorigo, M. (2004). The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man and Cybernetics\u2014Part B: Cybernetics, 34(2), 1161\u20131172.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics\u2014Part B: Cybernetics"},{"issue":"3","key":"5_CR6","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C. Blum","year":"2003","unstructured":"Blum, C., & Roli, A. (2003). Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Computing Surveys, 35(3), 268\u2013308.","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"5_CR7","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/ijoc.15.4.347.24896","volume":"15","author":"O. Br\u00e4ysy","year":"2003","unstructured":"Br\u00e4ysy, O. (2003). A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS Journal on Computing, 15(4), 347\u2013368.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"5_CR8","first-page":"25","volume":"7","author":"B. Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999). A new rank-based version of the ant system: a computational study. Central European Journal of Operations Research, 7(1), 25\u201338.","journal-title":"Central European Journal of Operations Research"},{"key":"5_CR9","first-page":"225","volume-title":"The vehicle routing problem","author":"G. Desaulniers","year":"2000","unstructured":"Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M. M., & Soumis, F. (2000). VRP with pickup and delivery. In P. Toth & D. Vigo (Eds.), The vehicle routing problem (pp.\u00a0225\u2013242). Philadelphia: SIAM."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Donati, A. V., Montemanni, R., Casagrande, N., Rizzoli, A. E., & Gambardella, L. M. (2007, in press). Time dependent vehicle routing problem with a multi ant colony system. European Journal of Operational Research.","DOI":"10.1016\/j.ejor.2006.06.047"},{"key":"5_CR11","unstructured":"Dorigo, M. (1992). Optimization, learning and natural algorithms. PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy."},{"issue":"1","key":"5_CR12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., & Gambardella, L. M. (1997). Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1), 53\u201366.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"5_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant colony optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., & St\u00fctzle, T. (2004). Ant colony optimization. Cambridge: MIT Press."},{"issue":"1","key":"5_CR14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., & Colorni, A. (1996). Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics\u2014Part B: Cybernetics, 26(1), 29\u201341.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics\u2014Part B: Cybernetics"},{"key":"5_CR15","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, L. M. (1999). Ant algorithms for discrete optimization. Artificial Life, 5, 137\u2013172.","journal-title":"Artificial Life"},{"issue":"2","key":"5_CR16","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1177\/003754979807100205","volume":"71","author":"L. M. Gambardella","year":"1998","unstructured":"Gambardella, L. M., Rizzoli, A. E., & Zaffalon, M. (1998). Simulation and planning of an intermodal container terminal. Simulation, 71(2), 107\u2013116.","journal-title":"Simulation"},{"key":"5_CR17","first-page":"63","volume-title":"New ideas in optimization","author":"L. M. Gambardella","year":"1999","unstructured":"Gambardella, L. M., Taillard, \u00c9., & Agazzi, G. (1999). MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In D. Corne, M. Dorigo & F. Glover (Eds.), New ideas in optimization (pp.\u00a063\u201376). London: McGraw\u2013Hill."},{"key":"5_CR18","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/978-1-4615-5755-5_5","volume-title":"Fleet management and logistic","author":"M. Gendreau","year":"1998","unstructured":"Gendreau, M., & Potvin, J.-Y. (1998). Dynamic vehicle routing and dispatching. In T. G. Crainic & G. Laporte (Eds.), Fleet management and logistic (pp.\u00a0115\u2013226). Berlin: Springer."},{"issue":"10","key":"5_CR19","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M. Gendreau","year":"1994","unstructured":"Gendreau, M., Hertz, A., & Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management Science, 40(10), 1276\u20131290.","journal-title":"Management Science"},{"issue":"1","key":"5_CR20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0377-2217(95)00050-X","volume":"88","author":"M. Gendreau","year":"1996","unstructured":"Gendreau, M., Laporte, G., & S\u00e9guin, R. (1996). Stochastic vehicle routing. European Journal of Operational Research, 88(1), 3\u201312.","journal-title":"European Journal of Operational Research"},{"key":"5_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover, F., & Laguna, M. (1997). Tabu search. Boston: Kluwer Academic."},{"key":"5_CR22","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-45365-2_22","volume-title":"Applications of evolutionary computing: EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM","author":"M. Guntsch","year":"2001","unstructured":"Guntsch, M., & Middendorf, M. (2001). Pheromone modification strategies for ant algorithms applied to dynamic TSP. In E. J. W. Boers et al. (Eds.), Lecture notes in computer science : Vol.\u00a02037. Applications of evolutionary computing: EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM (pp.\u00a0213\u2013222), Como, Italy, 18\u201320 April 2001. Berlin: Springer."},{"issue":"2","key":"5_CR23","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s10100-006-0162-9","volume":"14","author":"R. F. Hartl","year":"2006","unstructured":"Hartl, R. F., Hasle, G., & Janssens, G. K. (2006). Special issue on rich vehicle routing problems: editorial. Central European Journal of Operations Research, 14(2), 103\u2013104.","journal-title":"Central European Journal of Operations Research"},{"issue":"2","key":"5_CR24","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0377-2217(02)00147-9","volume":"144","author":"S. Ichoua","year":"2003","unstructured":"Ichoua, S., Gendreau, M., & Potvin, J.-Y. (2003). Vehicle dispatching with time-dependent travel times. European Journal of Operational Research, 144(2), 379\u2013396.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"5_CR25","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1016\/j.cor.2004.11.002","volume":"33","author":"B. Kallehauge","year":"2006","unstructured":"Kallehauge, B., Larsen, J., & Madsen, O. B. G. (2006). Lagrangian duality applied to the vehicle routing problem with time windows. Computers and Operations Research, 33(5), 1464\u20131487.","journal-title":"Computers and Operations Research"},{"key":"5_CR26","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/978-1-4615-5775-3_32","volume-title":"Meta-heuristics: advances and trends in local search paradigms for optimization","author":"P. Kilby","year":"1999","unstructured":"Kilby, P., Prosser, P., & Shaw, P. (1999). Guided local search for the vehicle routing problem. In S. Voss, S. Martello, I. H. Osman & C. Roucairol (Eds.), Meta-heuristics: advances and trends in local search paradigms for optimization (pp.\u00a0473\u2013486). Boston: Kluwer Academic."},{"issue":"4598","key":"5_CR27","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671\u2013680.","journal-title":"Science"},{"issue":"9","key":"5_CR28","doi-asserted-by":"crossref","first-page":"2743","DOI":"10.1016\/j.cor.2005.10.010","volume":"34","author":"J. Kyt\u00f6joki","year":"2007","unstructured":"Kyt\u00f6joki, J., Nuortio, T., Br\u00e4ysy, O., & Gendreau, M. (2007). An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Computers and Operations Research, 34(9), 2743\u20132757.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"5_CR29","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1287\/opre.39.4.616","volume":"39","author":"M. Labb\u00e9","year":"1991","unstructured":"Labb\u00e9, M., Laporte, G., & Mercure, H. (1991). Capacitated vehicle routing on trees. Operations Research, 39(4), 616\u2013622.","journal-title":"Operations Research"},{"key":"5_CR30","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-1-4615-5755-5_7","volume-title":"Fleet management and logistics","author":"G. Laporte","year":"1998","unstructured":"Laporte, G., & Louveaux, F. V. (1998). Solving stochastic routing problems with the integer L-shaped method. In T. G. Crainic & G. Laporte (Eds.), Fleet management and logistics (pp.\u00a0159\u2013167). Boston: Kluwer Academic."},{"issue":"1","key":"5_CR31","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.envsoft.2006.05.023","volume":"22","author":"Y. Li","year":"2007","unstructured":"Li, Y., & Chan Hilton, A. B. (2007). Optimal groundwater monitoring design using an ant colony optimization paradigm. Environmental Modelling and Software, 22(1), 110\u2013116.","journal-title":"Environmental Modelling and Software"},{"issue":"5","key":"5_CR32","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. Computers and Operations Research, 32(5), 1165\u20131179.","journal-title":"Computers and Operations Research"},{"key":"5_CR33","first-page":"321","volume-title":"Handbook of metaheuristics","author":"H. R. Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H. R., Martin, O., & St\u00fctzle, T. (2003). Iterated local search. In F. Glover & G. Kochenberger (Eds.), Handbook of metaheuristics (pp.\u00a0321\u2013353). Boston: Kluwer Academic."},{"issue":"8","key":"5_CR34","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/S0167-739X(00)00046-7","volume":"16","author":"V. Maniezzo","year":"2000","unstructured":"Maniezzo, V., & Carbonaro, A. (2000). ANTS heuristic for the frequency assignment problem. Future Generation Computer Systems, 16(8), 927\u2013935.","journal-title":"Future Generation Computer Systems"},{"issue":"6","key":"5_CR35","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1016\/j.cor.2003.11.017","volume":"32","author":"D. Mester","year":"2005","unstructured":"Mester, D., & Br\u00e4ysy, O. (2005). Active guided evolution strategies for the large scale vehicle routing problem with time windows. Computers & Operations Research, 32(6), 1593\u20131614.","journal-title":"Computers & Operations Research"},{"key":"5_CR36","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10878-005-4922-6","volume":"10","author":"R. Montemanni","year":"2005","unstructured":"Montemanni, R., Gambardella, L. M., Rizzoli, A. E., & Donati, A. V. (2005). Ant colony system for a dynamic vehicle routing problem. Journal of Combinatorial Optimization, 10, 327\u2013343.","journal-title":"Journal of Combinatorial Optimization"},{"key":"5_CR37","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I. H. Osman","year":"1993","unstructured":"Osman, I. H. (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41, 421\u2013451.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"5_CR38","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1016\/j.cor.2004.09.015","volume":"33","author":"J.-Y. Potvin","year":"2006","unstructured":"Potvin, J.-Y., Xu, Y., & Benyahia, I. (2006). Vehicle routing and scheduling with dynamic travel times. Computers and Operations Research, 33(4), 1129\u20131137.","journal-title":"Computers and Operations Research"},{"key":"5_CR39","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02098286","volume":"61","author":"H. Psaraftis","year":"1995","unstructured":"Psaraftis, H. (1995). Dynamic vehicle routing: status and prospects. Annals of Operations Research, 61, 143\u2013164.","journal-title":"Annals of Operations Research"},{"key":"5_CR40","first-page":"223","volume-title":"Vehicle routing: methods and studies","author":"H. Psaraftis","year":"1988","unstructured":"Psaraftis, H. (1988). Dynamic vehicle routing problems. In B. L. Golden & A. A. Assad (Eds.), Vehicle routing: methods and studies (pp.\u00a0223\u2013248). Amsterdam: North-Holland."},{"key":"5_CR41","first-page":"1317","volume-title":"Proceedings of the genetic and evolutionary computation conference (GECCO-2002)","author":"M. Reimann","year":"2002","unstructured":"Reimann, M., Doerner, K., & Hartl, R. F. (2002). A savings based ant system for the vehicle routing problem. In W. B. Langdon et al. (Eds.), Proceedings of the genetic and evolutionary computation conference (GECCO-2002) (pp.\u00a01317\u20131325). San Francisco: Kaufmann."},{"key":"5_CR42","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/3-540-36605-9_28","volume-title":"Applications of evolutionary computing: EvoWorkshops 2003: EvoBIO, EvoCOP, EvoIASP, EvoMUSART, EvoROB, and EvoSTIM","author":"M. Reimann","year":"2003","unstructured":"Reimann, M., Doerner, K., & Hartl, R. F. (2003). Analyzing a unified ant system for the VRP and some of its variants. In G. Raidl et al. (Eds.), Lecture notes in computer science : Vol.\u00a02611. Applications of evolutionary computing: EvoWorkshops 2003: EvoBIO, EvoCOP, EvoIASP, EvoMUSART, EvoROB, and EvoSTIM (pp.\u00a0300\u2013310), Essex, UK, 14\u201316 April 2003. Berlin: Springer."},{"issue":"4","key":"5_CR43","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0305-0548(03)00014-5","volume":"31","author":"M. Reimann","year":"2004","unstructured":"Reimann, M., Doerner, K., & Hartl, R. F. (2004). D-ants: savings based ants divide and conquer the vehicle routing problem. Computers and Operations Research, 31(4), 563\u2013591.","journal-title":"Computers and Operations Research"},{"key":"5_CR44","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of metaheuristics","author":"M. G. C. Resende","year":"2003","unstructured":"Resende, M. G. C., & Ribeiro, C. C. (2003). Greedy randomized adaptive search procedures. In F. Glover & G. Kochenberger (Eds.), Handbook of metaheuristics (pp.\u00a0219\u2013249). Boston: Kluwer Academic."},{"key":"5_CR45","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"M. W. P. Savelsbergh","year":"1985","unstructured":"Savelsbergh, M. W. P. (1985). Local search in routing problems with time windows. Annals of Operations Research, 4, 285\u2013305.","journal-title":"Annals of Operations Research"},{"issue":"8","key":"5_CR46","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. H. (2000). MAX-MIN ant-system. Future Generation Computer Systems, 16(8), 889\u2013914.","journal-title":"Future Generation Computer Systems"},{"issue":"2","key":"5_CR47","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"\u00c8. D. Taillard","year":"1997","unstructured":"Taillard, \u00c8. D., Badeau, E. P., Gendreau, M., Guertin, F., & Potvin, J.-Y. (1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science, 31(2), 170\u2013186.","journal-title":"Transportation Science"},{"key":"5_CR48","first-page":"29","volume-title":"The vehicle routing problem","author":"P. Toth","year":"2001","unstructured":"Toth, P., & Vigo, D. (2001a). Branch-and-bound algorithms for the capacitated VRP. In P. Toth & D. Vigo (Eds.), The vehicle routing problem (pp.\u00a029\u201351). Philadelphia: SIAM."},{"key":"5_CR49","first-page":"1","volume-title":"The vehicle routing problem","author":"P. Toth","year":"2001","unstructured":"Toth, P., & Vigo, D. (2001b). An overview of vehicle routing problems. In P. Toth & D. Vigo (Eds.), The vehicle routing problem (pp.\u00a01\u201326). Philadelphia: SIAM."},{"issue":"4","key":"5_CR50","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","volume":"15","author":"P. Toth","year":"2003","unstructured":"Toth, P., & Vigo, D. (2003). The granular tabu search and its application to the vehicle routing problem. INFORMS Journal on Computing, 15(4), 333\u2013346.","journal-title":"INFORMS Journal on Computing"},{"key":"5_CR51","unstructured":"Van Breedam, A. (1996). An analysis of the effect of local improvement operators in genetic algorithms and simulated annealing for the vehicle routing problem. RUCA Working Paper 96\/14, University of Antwerp, Belgium, 1996."},{"issue":"1","key":"5_CR52","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1061\/(ASCE)0733-9496(2007)133:1(87)","volume":"133","author":"A. C. Zecchin","year":"2007","unstructured":"Zecchin, A. C., Maier, H. R., Simpson, A. R., Leonard, M., & Nixon, J. B. (2007). Ant colony optimization applied to water distribution system design: comparative study of five algorithms. Journal of Water Resources Planning and Management, 133(1), 87\u201392.","journal-title":"Journal of Water Resources Planning and Management"},{"key":"5_CR53","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-71722-7","volume-title":"Dynamic fleet management\u2014concepts, systems, algorithms & case studies","author":"V. Zeimpekis","year":"2007","unstructured":"Zeimpekis, V., Tarantilis, C. D., Giaglis, G. M., & Minis, I. (2007). Dynamic fleet management\u2014concepts, systems, algorithms & case studies. Berlin: Springer."}],"container-title":["Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-007-0005-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11721-007-0005-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-007-0005-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T11:27:46Z","timestamp":1559561266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11721-007-0005-x"}},"subtitle":["From theory to applications"],"short-title":[],"issued":{"date-parts":[[2007,9,13]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,11,15]]}},"alternative-id":["5"],"URL":"https:\/\/doi.org\/10.1007\/s11721-007-0005-x","relation":{},"ISSN":["1935-3812","1935-3820"],"issn-type":[{"value":"1935-3812","type":"print"},{"value":"1935-3820","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,13]]}}}