{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T19:58:57Z","timestamp":1780603137230,"version":"3.54.1"},"reference-count":35,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2016,3,14]],"date-time":"2016-03-14T00:00:00Z","timestamp":1457913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,3,14]]},"abstract":"<jats:sec>\n               <jats:title content-type=\"abstract-heading\">Purpose<\/jats:title>\n               <jats:p> \u2013 The purpose of this paper is to explore a real world vehicle routing problem (VRP) that has multi-depot subcontractors with a heterogeneous fleet of vehicles that are available to pickup\/deliver jobs with varying time windows and locations. Both the overall job completion time and number of drivers utilized are analyzed for the automated job allocations and manual job assignments from transportation field experts. <\/jats:p>\n            <\/jats:sec>\n            <jats:sec>\n               <jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title>\n               <jats:p> \u2013 A nested genetic algorithm (GA) is used to automate the job allocation process and minimize the overall time to deliver all jobs, while utilizing the fewest number of drivers \u2013 as a secondary objective. <\/jats:p>\n            <\/jats:sec>\n            <jats:sec>\n               <jats:title content-type=\"abstract-heading\">Findings<\/jats:title>\n               <jats:p> \u2013 Three different real world data sets were used to compare the results of the GA vs transportation field experts\u2019 manual assignments. The job assignments from the GA improved the overall job completion time in 100 percent (30\/30) of the cases and maintained the same or fewer drivers as BS Logistics (BSL) in 47 percent (14\/30) of the cases. <\/jats:p>\n            <\/jats:sec>\n            <jats:sec>\n               <jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title>\n               <jats:p> \u2013 This paper provides a novel approach to solving a real world VRP that has multiple variants. While there have been numerous models to capture a select number of these variants, the value of this nested GA lies in its ability to incorporate multiple depots, a heterogeneous fleet of vehicles as well as varying pickup times, pickup locations, delivery times and delivery locations for each job into a single model. Existing research does not provide models to collectively address all of these variants.<\/jats:p>\n            <\/jats:sec>","DOI":"10.1108\/ijicc-06-2015-0018","type":"journal-article","created":{"date-parts":[[2016,3,9]],"date-time":"2016-03-09T10:33:21Z","timestamp":1457519601000},"page":"2-22","source":"Crossref","is-referenced-by-count":10,"title":["An evolutionary algorithm approach for the constrained multi-depot vehicle routing problem"],"prefix":"10.1108","volume":"9","author":[{"given":"Carin","family":"Lightner-Laws","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vikas","family":"Agrawal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Constance","family":"Lightner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neal","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"140","reference":[{"key":"key2020121704485363800_b1","doi-asserted-by":"crossref","unstructured":"Archetti, C.\n               , \n                  Bouchard, M.\n                and \n                  Desaulniers, G.\n                (2011), \u201cEnhanced branch and price and cut for vehicle routing with split deliveries and time windows\u201d, \n                  Transportation Science\n               , Vol. 45 No. 3, pp. 285-298.","DOI":"10.1287\/trsc.1100.0363"},{"key":"key2020121704485363800_b2","doi-asserted-by":"crossref","unstructured":"Baldacci, R.\n                and \n                  Mingozzi, A.\n                (2009), \u201cA unified exact method for solving different classes of vehicle routing problems\u201d, \n                  Mathematical Programming\n               , Vol. 120 No. 2, pp. 347-380.","DOI":"10.1007\/s10107-008-0218-9"},{"key":"key2020121704485363800_b3","doi-asserted-by":"crossref","unstructured":"Baldacci, R.\n               , \n                  Bartolini, E.\n                and \n                  Mingozzi, A.\n                (2011), \u201cAn exact algorithm for the pickup and delivery problem with time windows\u201d, \n                  Operations Research\n               , Vol. 59 No. 2, pp. 414-426.","DOI":"10.1287\/opre.1100.0881"},{"key":"key2020121704485363800_b4","doi-asserted-by":"crossref","unstructured":"Banos, R.\n               , \n                  Ortega, J.\n               , \n                  Gil, C.\n               , \n                  Fernandez, A.\n                and \n                  De Toro, F.\n                (2013), \u201cA simulated annealing-based parallel multi-objective approach to vehicle routing problems with time windows\u201d, \n                  Expert Systems with Applications\n               , Vol. 40 No. 5, pp. 1696-1707.","DOI":"10.1016\/j.eswa.2012.09.012"},{"key":"key2020121704485363800_b5","doi-asserted-by":"crossref","unstructured":"Berbotto, L.\n               , \n                  Garcia, S.\n                and \n                  Nogales, F.J.\n                (2014), \u201cA randomized granular tabu search heuristic for the split delivery vehicle routing problem\u201d, \n                  Annals of Operations Research\n               , Vol. 222 No. 1, pp. 153-173.","DOI":"10.1007\/s10479-012-1282-3"},{"key":"key2020121704485363800_b6","doi-asserted-by":"crossref","unstructured":"Brandao, J.\n                (2011), \u201cA tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem\u201d, \n                  Computers and Operations Research\n               , Vol. 38 No. 1, pp. 140-45l.","DOI":"10.1016\/j.cor.2010.04.008"},{"key":"key2020121704485363800_b7","doi-asserted-by":"crossref","unstructured":"Braysy, O.\n                and \n                  Gendreau, M.\n                (2005), \u201cVehicle routing problem with time windows, part I: route construction and local search algorithms\u201d, \n                  Transportation Science\n               , Vol. 39 No. 1, pp. 104-118.","DOI":"10.1287\/trsc.1030.0056"},{"key":"key2020121704485363800_b8","doi-asserted-by":"crossref","unstructured":"Chen, W.\n               , \n                  Song, J.\n               , \n                  Shi, L.\n               , \n                  Pi, L.\n                and \n                  Sun, P.\n                (2012), \u201cData mining-based dispatching system for solving the local pickup and delivery problem\u201d, \n                  Annals of Operations Research\n               , Vol. 203 No. 1, pp. 351-370.","DOI":"10.1007\/s10479-012-1118-1"},{"key":"key2020121704485363800_b9","doi-asserted-by":"crossref","unstructured":"Choi, E.\n                and \n                  Tcha, D.\n                (2007), \u201cA column generation approach to the heterogeneous fleet vehicle routing problem\u201d, \n                  Computers and Operations Research\n               , Vol. 34 No. 7, pp. 2080-2095.","DOI":"10.1016\/j.cor.2005.08.002"},{"key":"key2020121704485363800_b10","doi-asserted-by":"crossref","unstructured":"Cordeau, J.F.\n                and \n                  Maichberger, M.\n                (2012), \u201cA parallel iterated tabu search heuristic for vehicle routing problems\u201d, \n                  Computers and Operations Research\n               , Vol. 39 No. 9, pp. 2033-2050.","DOI":"10.1016\/j.cor.2011.09.021"},{"key":"key2020121704485363800_b11","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B.\n                and \n                  Ramser, J.H.\n                (1959), \u201cThe truck dispatching problem\u201d, \n                  Management Science\n               , Vol. 6 No. 1, pp. 80-91.","DOI":"10.1287\/mnsc.6.1.80"},{"key":"key2020121704485363800_b12","doi-asserted-by":"crossref","unstructured":"Decker, C.\n                and \n                  Wohar, M.E.\n                (2007), \u201cDeterminants of state diesel fuel excise tax rates: the political economy of fuel taxation in the Unites States\u201d, \n                  The Annals of Regional Science\n               , Vol. 41 No. 1, pp. 171-188.","DOI":"10.1007\/s00168-006-0090-6"},{"key":"key2020121704485363800_b13","doi-asserted-by":"crossref","unstructured":"Desaulniers, G.\n                (2010), \u201cBranch-and-price-and-cut for the split delivery vehicle routing problem with time windows\u201d, \n                  Operations Research\n               , Vol. 58 No. 1, pp. 179-192.","DOI":"10.1287\/opre.1090.0713"},{"key":"key2020121704485363800_b14","doi-asserted-by":"crossref","unstructured":"Dumas, Y.\n               , \n                  Desrosiers, J.\n                and \n                  Soumis, F.\n                (1991), \u201cThe pickup and delivery problem with time windows\u201d, \n                  European Journal of Operational Research\n               , Vol. 54 No. 1, pp. 7-22.","DOI":"10.1016\/0377-2217(91)90319-Q"},{"key":"key2020121704485363800_b15","doi-asserted-by":"crossref","unstructured":"Escobar, J.W.\n               , \n                  Linfati, R.\n               , \n                  Toth, P.\n                and \n                  Baldoquin, M.G.\n                (2014), \u201cA hybrid granular tabu search algorithm for the multi depot vehicle routing problem\u201d, \n                  Journal of Heuristics\n               , Vol. 20 No. 5, pp. 483-509.","DOI":"10.1007\/s10732-014-9247-0"},{"key":"key2020121704485363800_b16","unstructured":"Holland, J.H.\n                (1975), \n                  Adaptation in Natural and Artificial Systems\n               , University of Michigan Press, Ann Arbor, MI."},{"key":"key2020121704485363800_b17","doi-asserted-by":"crossref","unstructured":"Koc, C.\n               , \n                  Bektas, T.\n               , \n                  Jabali, O.\n                and \n                  Laporte, G.\n                (2015), \u201cA hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows\u201d, \n                  Computers and Operations Research\n               , Vol. 64, pp. 11-27.","DOI":"10.1016\/j.cor.2015.05.004"},{"key":"key2020121704485363800_b18","doi-asserted-by":"crossref","unstructured":"Lau, H.\n               , \n                  Chan, T.\n               , \n                  Tsui, W.\n                and \n                  Pang, W.\n                (2010), \u201cApplication of genetic algorithms to solve the multidepot vehicle routing problem\u201d, \n                  IEEE Transactions on Automation Science and Engineering\n               , Vol. 7 No. 2, pp. 383-392.","DOI":"10.1109\/TASE.2009.2019265"},{"key":"key2020121704485363800_b19","unstructured":"Likaj, R.\n               , \n                  Shala, A.\n                and \n                  Bruqi, M.\n                (2013), \u201cApplication of graph theory to find optimal paths for the transportation problem\u201d, \n                  International Journal of Current Engineering and Technology\n               , Vol. 3 No. 3, pp. 1099-1103."},{"key":"key2020121704485363800_b20","unstructured":"Michalewicz, Z.\n                (2012), \u201cThe emperor is naked: evolutionary algorithms for real-world applications\u201d, \n                  ACM Ubiquity\n               , Vol. 2012, November, pp. 1-13."},{"key":"key2020121704485363800_b21","doi-asserted-by":"crossref","unstructured":"Nanry, W.P.\n                and \n                  Barnes, J.W.\n                (2000), \u201cSolving the pickup and delivery problem with time windows using reactive tabu search\u201d, \n                  Transportation Research Part B\n               , Vol. 34 No. 2, pp. 107-121.","DOI":"10.1016\/S0191-2615(99)00016-8"},{"key":"key2020121704485363800_b22","doi-asserted-by":"crossref","unstructured":"Ombuki-Berman, B.\n                and \n                  Hanshar, T.\n                (2009), \u201cUsing genetic algorithms for multi-depot vehicle routing\u201d, in \n                  Pereira, F.B.\n                and \n                  Tavares, J.\n                (Eds), \n                  Bio-Inspired Algorithms for the Vehicle Routing Problem\n               , Springer Berlin, pp. 77-99.","DOI":"10.1007\/978-3-540-85152-3_4"},{"key":"key2020121704485363800_b23","doi-asserted-by":"crossref","unstructured":"Parragh, S.N.\n               , \n                  Doerner, K.F.\n                and \n                  Hartl, R.F.\n                (2008), \u201cA survey on pickup and delivery problems part I: transportation between customer and depot\u201d, \n                  Journal fur Betriebswirtschaft\n               , Vol. 58 No. 1, pp. 21-51.","DOI":"10.1007\/s11301-008-0033-7"},{"key":"key2020121704485363800_b24","doi-asserted-by":"crossref","unstructured":"Pisinger, D.\n                and \n                  Ropke, S.\n                (2007), \u201cA general heuristic for vehicle routing problems\u201d, \n                  Computers and Operations Research\n               , Vol. 34 No. 8, pp. 2403-2435.","DOI":"10.1016\/j.cor.2005.09.012"},{"key":"key2020121704485363800_b26","doi-asserted-by":"crossref","unstructured":"Ropke, S.\n                and \n                  Cordeau, J.F.\n                (2009), \u201cBranch and cut and price for the pickup and delivery problem with time windows\u201d, \n                  Transportation Science\n               , Vol. 43 No. 3, pp. 267-286.","DOI":"10.1287\/trsc.1090.0272"},{"key":"key2020121704485363800_b25","doi-asserted-by":"crossref","unstructured":"Ropke, S.\n               , \n                  Cordeau, J.F.\n                and \n                  Laporte, G.\n                (2007), \u201cModels and branch-and-cut algorithms for pickup and delivery problem with time windows\u201d, \n                  Networks\n               , Vol. 49 No. 4, pp. 258-272.","DOI":"10.1002\/net.20177"},{"key":"key2020121704485363800_b27","unstructured":"Schneider, L.M.\n                (1985), \u201cNew era in transportation strategy\u201d, \n                  Harvard Business Review\n               , Vol. 63 No. 2, pp. 118-126."},{"key":"key2020121704485363800_b28","doi-asserted-by":"crossref","unstructured":"Solomon, M.\n                (1987), \u201cAlgorithms for vehicle routing and scheduling problem with time window constraints\u201d, \n                  Operations Research\n               , Vol. 35 No. 2, pp. 254-265.","DOI":"10.1287\/opre.35.2.254"},{"key":"key2020121704485363800_b29","doi-asserted-by":"crossref","unstructured":"Toth, P.\n                and \n                  Tramontani, A.\n                (2008), \u201cAn integer linear programming local search for capacitated vehicle routing problems\u201d, in \n                  Bruce, G.\n               , \n                  Raghavan, S.\n                and \n                  Edward, W.\n                (Eds), \n                  The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research\/Computer Science Interfaces\n               , Springer, New York, NY, pp. 275-295.","DOI":"10.1007\/978-0-387-77778-8_13"},{"key":"key2020121704485363800_b31","unstructured":"Vidal, T.\n               , \n                  Crainic, T.\n               , \n                  Gendreau, M.\n                and \n                  Prins, C.\n                (2011), \u201cA hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time windows\u201d, CIRRELT, Vol. 61, Montreal."},{"key":"key2020121704485363800_b30","doi-asserted-by":"crossref","unstructured":"Vidal, T.\n               , \n                  Crainic, T.\n               , \n                  Gendreau, M.\n                and \n                  Prins, C.\n                (2013), \u201cHeuristics for multi-attribute vehicle routing problems: a survey and synthesis\u201d, \n                  European Journal of Operational Research\n               , Vol. 231 No. 1, pp. 1-21.","DOI":"10.1016\/j.ejor.2013.02.053"},{"key":"key2020121704485363800_b33","doi-asserted-by":"crossref","unstructured":"Wang, X.\n                and \n                  Regan, A.C.\n                (2002), \u201cLocal truckload pickup and delivery with hard time window constraints\u201d, \n                  Transportation Research, Part B\n               , Vol. 36 No. 1, pp. 78-94.","DOI":"10.1016\/S0965-8564(00)00037-9"},{"key":"key2020121704485363800_b34","doi-asserted-by":"crossref","unstructured":"Winston, C.\n                (1998), \u201cUS industry adjustment to economic deregulation\u201d, \n                  Journal of Economic Perspectives\n               , Vol. 12 No. 3, pp. 89-110.","DOI":"10.1257\/jep.12.3.89"},{"key":"key2020121704485363800_b35","doi-asserted-by":"crossref","unstructured":"Xiao, Y.\n               , \n                  Zhao, Q.\n               , \n                  Kaku, I.\n                and \n                  Mladenovic, N.\n                (2014), \u201cVariable neighbourhood simulated annealing algorithm for capacitated vehicle routing problems\u201d, \n                  Egineering Optimization\n               , Vol. 46 No. 4, pp. 562-579.","DOI":"10.1080\/0305215X.2013.791813"},{"key":"key2020121704485363800_frd1","doi-asserted-by":"crossref","unstructured":"Vidal, T.\n               , \n                  Crainic, T.G.\n               , \n                  Gendreau, M.\n                and \n                  Prins, C.\n                (2012), \u201cHeuristics for multi-attribute vehicle routing problems: a survey and synthesis\u201d, CIRRELT, Montreal, February.","DOI":"10.1016\/j.ejor.2013.02.053"}],"container-title":["International Journal of Intelligent Computing and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/IJICC-06-2015-0018","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJICC-06-2015-0018\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJICC-06-2015-0018\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:54:22Z","timestamp":1753397662000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijicc\/article\/9\/1\/2-22\/134626"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,14]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,3,14]]}},"alternative-id":["10.1108\/IJICC-06-2015-0018"],"URL":"https:\/\/doi.org\/10.1108\/ijicc-06-2015-0018","relation":{},"ISSN":["1756-378X"],"issn-type":[{"value":"1756-378X","type":"print"}],"subject":[],"published":{"date-parts":[[2016,3,14]]}}}