{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T07:21:57Z","timestamp":1725866517655},"reference-count":70,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["70872077"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Natural Science Foundation of China\/ Research Grants Council of Hong Kong","award":["70831160527"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1016\/j.ejor.2012.01.061","type":"journal-article","created":{"date-parts":[[2012,2,22]],"date-time":"2012-02-22T15:16:42Z","timestamp":1329923802000},"page":"349-360","source":"Crossref","is-referenced-by-count":45,"title":["The close\u2013open mixed vehicle routing problem"],"prefix":"10.1016","volume":"220","author":[{"given":"Ran","family":"Liu","sequence":"first","affiliation":[]},{"given":"Zhibin","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2012.01.061_b0005","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/trsc.37.2.153.15243","article-title":"An improved branch-and-cut algorithm for the capacitated vehicle routing problem","volume":"37","author":"Achuthan","year":"2003","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2012.01.061_b0010","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.cor.2007.10.017","article-title":"The capacity and distance constrained plant location problem","volume":"36","author":"Albareda-Sambola","year":"2009","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0015","unstructured":"Augerat, P., Belenger, J., Benavent, E., Corberan, A., Naddef, D., Rinaldi, G., 1995. Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem. Technical Report: RR 949-M."},{"key":"10.1016\/j.ejor.2012.01.061_b0020","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1016\/j.ejor.2009.06.034","article-title":"An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles","volume":"202","author":"Azi","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0025","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-007-0178-5","article-title":"An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts","volume":"115","author":"Baldacci","year":"2008","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2012.01.061_b0030","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1287\/opre.38.4.571","article-title":"Twenty years of routing and scheduling","volume":"38","author":"Bodin","year":"1990","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0035","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1016\/j.ejor.2006.10.013","article-title":"A heuristic for the routing and carrier selection problem","volume":"183","author":"Bolduc","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0040","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1057\/palgrave.jors.2602390","article-title":"A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers","volume":"59","author":"Bolduc","year":"2008","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2012.01.061_b0045","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1016\/S0377-2217(03)00238-8","article-title":"A tabu search algorithm for the open vehicle routing problem","volume":"157","author":"Brand\u00e3o","year":"2004","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0050","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/trsc.1030.0056","article-title":"Vehicle routing problem with time windows, Part I: Route construction and local search algorithms","volume":"39","author":"Braysy","year":"2005","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2012.01.061_b0055","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/trsc.1030.0057","article-title":"Vehicle routing problem with time windows, Part II: Metaheuristics","volume":"39","author":"Braysy","year":"2005","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2012.01.061_b0060","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/ijoc.1030.0057","article-title":"Context-independent scatter and tabu search for permutation problems","volume":"17","author":"Campos","year":"2005","journal-title":"Informs Journal on Computing"},{"key":"10.1016\/j.ejor.2012.01.061_b0065","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/j.ejor.2008.09.009","article-title":"A tabu search heuristic for the vehicle routing problem with private fleet and common carrier","volume":"198","author":"C\u00f4t\u00e9","year":"2009","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0070","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2003.08.067","article-title":"A heuristic algorithm for the truckload and less-than-truckload problem","volume":"165","author":"Chu","year":"2005","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0075","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clarke","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0080","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","article-title":"A tabu search heuristic for periodic and multi-depot vehicle routing problems","volume":"30","author":"Cordeau","year":"1997","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2012.01.061_b0085","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","article-title":"A guide to vehicle routing heuristics","volume":"53","author":"Cordeau","year":"2002","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2012.01.061_b0090","first-page":"279","article-title":"New heuristics for the vehicle routing problem","author":"Cordeau","year":"2005","journal-title":"Logistics Systems: Design and Optimization"},{"key":"10.1016\/j.ejor.2012.01.061_b0095","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S0927-0507(06)14006-2","article-title":"Vehicle routing","volume":"14","author":"Cordeau","year":"2007","journal-title":"Transportation"},{"key":"10.1016\/j.ejor.2012.01.061_b0100","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1016\/j.ejor.2005.08.015","article-title":"The multi-depot vehicle routing problem with inter-depot routes","volume":"176","author":"Crevier","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0105","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Management Science"},{"key":"10.1016\/j.ejor.2012.01.061_b0110","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1016\/j.ejor.2005.11.038","article-title":"Applying the attribute based hill climber heuristic to the vehicle routing problem","volume":"177","author":"Derigs","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0115","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","article-title":"Improvements and extensions to the Miller\u2013Tucker\u2013Zemlin subtour elimination constraints","volume":"10","author":"Desrochers","year":"1991","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.ejor.2012.01.061_b0120","first-page":"357","article-title":"Plus court chemin avec contraintes d\u2019horaires","volume":"17","author":"Desrosiers","year":"1983","journal-title":"RAIRO. Recherche op\u00e9rationnelle"},{"key":"10.1016\/j.ejor.2012.01.061_b0125","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10732-006-5561-5","article-title":"Creating very large scale neighborhoods out of smaller ones by compounding moves","volume":"12","author":"Ergun","year":"2006","journal-title":"Journal of Heuristics"},{"key":"10.1016\/j.ejor.2012.01.061_b0130","doi-asserted-by":"crossref","unstructured":"Falkenauer, E., Bouffouix, S., 1991. In: A Genetic Algorithm for Job Shop. (vol. 821), IEEE, pp. 824\u2013829.","DOI":"10.1109\/ROBOT.1991.131689"},{"key":"10.1016\/j.ejor.2012.01.061_b0135","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","article-title":"A generalized assignment heuristic for vehicle routing","volume":"11","author":"Fisher","year":"1981","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2012.01.061_b0140","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1016\/j.ejor.2007.06.064","article-title":"A variable neighbourhood search algorithm for the open vehicle routing problem","volume":"195","author":"Fleszar","year":"2009","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0145","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","article-title":"Robust branch-and-cut-and-price for the capacitated vehicle routing problem","volume":"106","author":"Fukasawa","year":"2006","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2012.01.061_b0150","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","article-title":"A tabu search heuristic for the vehicle routing problem","volume":"40","author":"Gendreau","year":"1994","journal-title":"Management Science"},{"key":"10.1016\/j.ejor.2012.01.061_b0155","unstructured":"Goldberg, D.E., Robert Lingle, J., 1985. Alleles lociand the traveling salesman problem. In Proceedings of the 1st International Conference on Genetic Algorithms, L. Erlbaum Associates Inc, pp. 154\u2013159."},{"key":"10.1016\/j.ejor.2012.01.061_b0160","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0305-0548(84)90007-8","article-title":"The fleet size and mix vehicle routing problem","volume":"11","author":"Golden","year":"1984","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0165","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0377-2217(02)00823-8","article-title":"Guidelines for the use of meta-heuristics in combinatorial optimization","volume":"151","author":"Hertz","year":"2003","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0170","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/j.ejor.2012.01.061_b0175","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.ejor.2004.01.027","article-title":"A two-phase hybrid metaheuristic for the vehicle routing problem with time windows","volume":"162","author":"Homberger","year":"2005","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0180","doi-asserted-by":"crossref","first-page":"2405","DOI":"10.1016\/j.cor.2005.02.020","article-title":"Sequential search and its application to vehicle-routing problems","volume":"33","author":"Irnich","year":"2006","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0185","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/S0377-2217(03)00377-1","article-title":"A note on the lifted Miller\u2013Tucker\u2013Zemlin subtour elimination constraints for the capacitated vehicle routing problem","volume":"158","author":"Kara","year":"2004","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0190","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.mcm.2007.02.007","article-title":"Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots","volume":"47","author":"Kek","year":"2008","journal-title":"Mathematical and Computer Modelling"},{"key":"10.1016\/j.ejor.2012.01.061_b0195","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","article-title":"The vehicle routing problem: an overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0200","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/trsc.1090.0301","article-title":"Fifty years of vehicle routing","volume":"43","author":"Laporte","year":"2009","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2012.01.061_b0205","doi-asserted-by":"crossref","DOI":"10.1002\/net.3230140113","article-title":"Two exact algorithms for the distance-constrained vehicle routing problem","volume":"14","author":"Laporte","year":"1984","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2012.01.061_b0210","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1287\/opre.33.5.1050","article-title":"Optimal routing under capacity and distance restrictions","volume":"33","author":"Laporte","year":"1985","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0215","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/1.9780898718515.ch5","article-title":"Classical heuristics for the capacitated VRP","author":"Laporte","year":"2002","journal-title":"The Vehicle Routing Problem"},{"key":"10.1016\/j.ejor.2012.01.061_b0220","doi-asserted-by":"crossref","first-page":"1642","DOI":"10.1057\/palgrave.jors.2602345","article-title":"A branch-and-cut algorithm for the capacitated open vehicle routing problem","volume":"58","author":"Letchford","year":"2006","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2012.01.061_b0225","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10107-005-0652-x","article-title":"Projection results for vehicle routing","volume":"105","author":"Letchford","year":"2006","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2012.01.061_b0230","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1287\/opre.40.4.790","article-title":"On the distance constrained vehicle routing problem","volume":"40","author":"Li","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0235","doi-asserted-by":"crossref","first-page":"2918","DOI":"10.1016\/j.cor.2005.11.018","article-title":"The open vehicle routing problem: algorithms, large-scale test problems, and computational results","volume":"34","author":"Li","year":"2007","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0240","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1057\/palgrave.jors.2602644","article-title":"An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems","volume":"60","author":"Li","year":"2009","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2012.01.061_b0245","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1016\/j.tre.2010.05.003","article-title":"Task selection and routing problems in collaborative truckload transportation","volume":"46","author":"Liu","year":"2010","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2012.01.061_b0250","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/j.tre.2008.10.003","article-title":"An effective genetic algorithm for the fleet size and mix vehicle routing problems","volume":"45","author":"Liu","year":"2009","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2012.01.061_b0255","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","article-title":"A new branch-and-cut algorithm for the capacitated vehicle routing problem","volume":"100","author":"Lysgaard","year":"2004","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2012.01.061_b0260","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1016\/j.cor.2003.11.017","article-title":"Active guided evolution strategies for large-scale vehicle routing problems with time windows","volume":"32","author":"Mester","year":"2005","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0265","doi-asserted-by":"crossref","first-page":"2964","DOI":"10.1016\/j.cor.2005.11.006","article-title":"Active-guided evolution strategies for large-scale capacitated vehicle routing problems","volume":"34","author":"Mester","year":"2007","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0270","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/978-3-540-71615-0_13","article-title":"Edge assembly crossover for the capacitated vehicle routing problem","author":"Nagata","year":"2007","journal-title":"Evolutionary Computation in Combinatorial Optimization"},{"key":"10.1016\/j.ejor.2012.01.061_b0275","unstructured":"Oliver, I., Smith, D., Holland, J., 1987. A study of permutation crossover operators on the traveling salesman problem. In: L. Erlbaum Associates Inc., Hillsdale, NJ, USA, pp. 224\u2013230."},{"key":"10.1016\/j.ejor.2012.01.061_b0280","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","article-title":"A general heuristic for vehicle routing problems","volume":"34","author":"Pisinger","year":"2007","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0285","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","article-title":"A simple and effective evolutionary algorithm for the vehicle routing problem","volume":"31","author":"Prins","year":"2004","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0290","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0305-0548(03)00014-5","article-title":"D-ants: aavings based ants divide and conquer the vehicle routing problem","volume":"31","author":"Reimann","year":"2004","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0295","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1016\/j.ejor.2007.11.004","article-title":"A web-based decision support system for waste lube oils collection and recycling","volume":"195","author":"Repoussis","year":"2009","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0300","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.cor.2008.11.003","article-title":"A hybrid evolution strategy for the open vehicle routing problem","volume":"37","author":"Repoussis","year":"2010","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0305","doi-asserted-by":"crossref","first-page":"1576","DOI":"10.1016\/j.cor.2006.09.002","article-title":"Integrating multi-product production and distribution in newspaper logistics","volume":"35","author":"Russell","year":"2008","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0310","doi-asserted-by":"crossref","first-page":"2106","DOI":"10.1016\/j.cor.2010.02.010","article-title":"An ILP improvement procedure for the open vehicle routing problem","volume":"37","author":"Salari","year":"2010","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0315","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0377-2217(96)00253-6","article-title":"A multi-level composite heuristic for the multi-depot vehicle fleet mix problem","volume":"103","author":"Salhi","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0320","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1057\/palgrave.jors.2600924","article-title":"A heuristic method for the open vehicle routing problem","volume":"51","author":"Sariklis","year":"2000","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2012.01.061_b0325","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problems with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0330","doi-asserted-by":"crossref","first-page":"1214","DOI":"10.1016\/j.cor.2004.09.011","article-title":"MA\u2223PM: Memetic algorithms with population management","volume":"33","author":"S\u00f6rensen","year":"2006","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.01.061_b0335","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","article-title":"Parallel iterative search methods for vehicle routing problems","volume":"23","author":"Taillard","year":"1993","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2012.01.061_b0340","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1057\/palgrave.jors.2601848","article-title":"Solving the open vehicle routing problem via a single parameter metaheuristic algorithm","volume":"56","author":"Tarantilis","year":"2005","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2012.01.061_b0345","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/S0166-218X(01)00351-1","article-title":"Models, relaxations and exact approaches for the capacitated vehicle routing problem","volume":"123","author":"Toth","year":"2002","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2012.01.061_b0350","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1016\/j.cor.2009.06.021","article-title":"An open vehicle routing problem metaheuristic for examining wide solution neighborhoods","volume":"37","author":"Zachariadis","year":"2010","journal-title":"Computers and Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712000999?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712000999?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,25]],"date-time":"2018-11-25T18:26:44Z","timestamp":1543170404000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221712000999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":70,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["S0377221712000999"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2012.01.061","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}