{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T02:37:01Z","timestamp":1722739021115},"reference-count":71,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T00:00:00Z","timestamp":1343779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1016\/j.ejor.2012.02.038","type":"journal-article","created":{"date-parts":[[2012,3,8]],"date-time":"2012-03-08T05:46:59Z","timestamp":1331185619000},"page":"831-843","source":"Crossref","is-referenced-by-count":65,"title":["Coupling ant colony systems with strong local searches"],"prefix":"10.1016","volume":"220","author":[{"given":"L.M.","family":"Gambardella","sequence":"first","affiliation":[]},{"given":"R.","family":"Montemanni","sequence":"additional","affiliation":[]},{"given":"D.","family":"Weyland","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2012.02.038_b0005","unstructured":"D. Anghinolfi, R. Montemanni, M. Paolucci, L.M. Gambardella, A particle swarm optimization approach for the sequential ordering problem, in: Proceedings of the VIII Metaheuristic International Conference (MIC 2009), 2009."},{"issue":"7","key":"10.1016\/j.ejor.2012.02.038_b0010","doi-asserted-by":"crossref","first-page":"1076","DOI":"10.1016\/j.cor.2010.10.014","article-title":"A hybrid particle swarm optimization approach for the sequential ordering problem","volume":"38","author":"Anghinolfi","year":"2011","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.02.038_b0015","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10732-006-9004-0","article-title":"Metaheuristics for the team orienteering problem","volume":"13","author":"Archetti","year":"2007","journal-title":"Journal of Heuristics"},{"key":"10.1016\/j.ejor.2012.02.038_b0020","unstructured":"N. Ascheuer, Hamiltonian path problems in the on-line optimization of flexible manufacturing systems, PhD thesis, Technische Universit\u00e4t Berlin, 1995."},{"key":"10.1016\/j.ejor.2012.02.038_b0025","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0803002","article-title":"A cutting plane approach to the sequential ordering problem (with applications to job scheduling in manufacturing)","volume":"3","author":"Ascheuer","year":"1993","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/j.ejor.2012.02.038_b0030","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.ejor.2008.11.027","article-title":"Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem","volume":"199","author":"Balaprakash","year":"2009","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2012.02.038_b0035","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s11721-009-0031-y","article-title":"Estimation-based ant colony optimization and local search for the probabilistic traveling salesman problem","volume":"3","author":"Balaprakash","year":"2009","journal-title":"Swarm Intelligence"},{"key":"10.1016\/j.ejor.2012.02.038_b0040","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01585767","article-title":"The precedence-constrained asymmetric traveling salesman polytope","volume":"65","author":"Balas","year":"1995","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2012.02.038_b0045","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","article-title":"Fast algorithms for geometric traveling salesman problems","volume":"4","author":"Bentley","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/j.ejor.2012.02.038_b0050","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/3-540-45724-0_15","article-title":"Solving the homogeneous probabilistic traveling salesman problem by the ACO metaheuristic","author":"Bianchi","year":"2002","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/j.ejor.2012.02.038_b0055","first-page":"883","article-title":"An ant colony optimization approach to the probabilistic traveling salesman problem","author":"Bianchi","year":"2003","journal-title":"Lecture Notes in Computer Science"},{"issue":"4","key":"10.1016\/j.ejor.2012.02.038_b0060","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1287\/ijoc.1080.0276","article-title":"Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem","volume":"20","author":"Birattari","year":"2008","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"10.1016\/j.ejor.2012.02.038_b0065","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10288-006-0009-1","article-title":"An exact algorithm for team orienteering problems","volume":"5","author":"Boussier","year":"2007","journal-title":"4OR"},{"issue":"4","key":"10.1016\/j.ejor.2012.02.038_b0070","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1023\/B:JMMA.0000049380.86987.d4","article-title":"Solving the probabilistic TSP with ant colony optimization","volume":"3","author":"Branke","year":"2004","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"10.1016\/j.ejor.2012.02.038_b0075","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/S0305-0548(98)00071-9","article-title":"A heuristic for the multiple path maximum collection problem","volume":"26","author":"Butt","year":"1999","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.02.038_b0080","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0305-0548(94)90065-5","article-title":"A heuristic for the multiple path maximum collection problem","volume":"21","author":"Butt","year":"1994","journal-title":"Computers and Operations Research"},{"issue":"9","key":"10.1016\/j.ejor.2012.02.038_b0085","doi-asserted-by":"crossref","first-page":"2703","DOI":"10.1016\/j.cor.2005.02.024","article-title":"Aggregation for the probabilistic traveling salesman problem","volume":"33","author":"Campbell","year":"2006","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.02.038_b0090","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/0377-2217(95)00035-6","article-title":"A fast and effective heuristic for the orienteering problem","volume":"88","author":"Chao","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.038_b0095","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","article-title":"The team orienteering problem","volume":"88","author":"Chao","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.038_b0100","unstructured":"S. Chen, S. Smith, Commonality and genetic algorithms, Technical Report CMU-RI-TR-96-27, The Robotic Institute, Carnagie Mellon University, 1996."},{"key":"10.1016\/j.ejor.2012.02.038_b0105","unstructured":"A. Colorni, M. Dorigo, V. Maniezzo, Distributed optimization by ant colonies, in: Proceeding of ECAL \u2013 European Conference on Artificial Life, 1991, pp. 134\u2013142."},{"key":"10.1016\/j.ejor.2012.02.038_b0110","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","article-title":"Ant colony optimization theory: a survey","volume":"344","author":"Dorigo","year":"2005","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.ejor.2012.02.038_b0115","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1162\/106454699568728","article-title":"Ant algorithms for discrete optimization","volume":"5","author":"Dorigo","year":"1999","journal-title":"Artificial Life"},{"issue":"1","key":"10.1016\/j.ejor.2012.02.038_b0120","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","article-title":"The ant system: optimization by a colony of cooperating agents","volume":"26","author":"Dorigo","year":"1996","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics \u2013 Part B: Cybernetics"},{"key":"10.1016\/j.ejor.2012.02.038_b0125","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/0377-2217(88)90333-5","article-title":"An inexact algorithm for the sequential ordering problem","volume":"37","author":"Escudero","year":"1988","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.038_b0130","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF02085641","article-title":"A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships","volume":"50","author":"Escudero","year":"1994","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2012.02.038_b0135","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/ijoc.10.2.133","article-title":"Solving the orienteering problem through branch-and-cut","volume":"20","author":"Fischetti","year":"1998","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"10.1016\/j.ejor.2012.02.038_b0140","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1287\/ijoc.12.3.237.12636","article-title":"An ant colony system hybridized with a new local search for the sequential ordering problem","volume":"12","author":"Gambardella","year":"2000","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2012.02.038_b0145","series-title":"New Ideas in Optimization","first-page":"63","article-title":"MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows","author":"Gambardella","year":"1999"},{"issue":"2","key":"10.1016\/j.ejor.2012.02.038_b0150","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1287\/trsc.29.2.143","article-title":"An exact algorithm for the vehicle routing problem with stochastic demands and customers","volume":"29","author":"Gendreau","year":"1995","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2012.02.038_b0155","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1287\/opre.44.3.469","article-title":"A tabu search heuristic for the vehicle routing problem with stochastic demands and customers","author":"Gendreau","year":"1996","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2012.02.038_b0160","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0377-2217(95)00050-X","article-title":"Stochastic vehicle routing","volume":"88","author":"Gendreau","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.038_b0165","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<263::AID-NET3>3.0.CO;2-Q","article-title":"The selective traveling salesman problem","volume":"32","author":"Gendreau","year":"1998","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2012.02.038_b0170","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","article-title":"The orienteering problem","volume":"34","author":"Golden","year":"1987","journal-title":"Naval Research Logistics"},{"key":"10.1016\/j.ejor.2012.02.038_b0175","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/1520-6750(198806)35:3<359::AID-NAV3220350305>3.0.CO;2-H","article-title":"A multifaceted heuristic for the orienteering problem","volume":"35","author":"Golden","year":"1987","journal-title":"Naval Research Logistics"},{"issue":"5","key":"10.1016\/j.ejor.2012.02.038_b0180","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1016\/S0167-8191(03)00048-6","article-title":"A cooperative parallel rollout algorithm for the sequential ordering problem","volume":"29","author":"Guerriero","year":"2003","journal-title":"Parallel Computing"},{"key":"10.1016\/j.ejor.2012.02.038_b0185","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1080\/07408179508936734","article-title":"Transportation with common carrier and private fleet: system assignment and shipment frequency optimization","volume":"21","author":"Hall","year":"1995","journal-title":"IIE Transactions"},{"key":"10.1016\/j.ejor.2012.02.038_b0190","doi-asserted-by":"crossref","unstructured":"I.T. Hern\u00e0dv\u00f6lgyi, Solving the sequential ordering problem with automatically generated lower bounds, in: Proceedings of Operations Research 2003, pp. 355\u2013362.","DOI":"10.1007\/978-3-642-17022-5_46"},{"key":"10.1016\/j.ejor.2012.02.038_b0195","unstructured":"I.T. Hern\u00e0dv\u00f6lgyi, Automatically Generated Lower Bounds for Search, PhD thesis, University of Ottawa, 2004."},{"issue":"2","key":"10.1016\/j.ejor.2012.02.038_b0200","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1287\/ijoc.1070.0239","article-title":"A unified modeling and solution framework for vehicle routing and local search-based metaheuristics","volume":"20","author":"Irnich","year":"2008","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2012.02.038_b0205","unstructured":"P. Jaillet, Probabilistic traveling salesman problems, PhD thesis, MIT, Dept. of Civil Engineering, 1985."},{"key":"10.1016\/j.ejor.2012.02.038_b0210","first-page":"215","article-title":"The traveling salesman problem: a case study in local optimization","author":"Johnson","year":"1997","journal-title":"Local Search in Combinatorial Optimization"},{"issue":"6","key":"10.1016\/j.ejor.2012.02.038_b0215","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1057\/jors.1992.88","article-title":"The orienteering problem with time windows","volume":"43","author":"Kantor","year":"1992","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2012.02.038_b0220","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0377-2217(96)00309-8","article-title":"Minimum directed 1-subtree relaxation for score orienteering problem","volume":"104","author":"Kataoka","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.038_b0225","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.cie.2007.10.001","article-title":"Ants can solve the team orienteering problem","volume":"54","author":"Ke","year":"2008","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/j.ejor.2012.02.038_b0230","doi-asserted-by":"crossref","unstructured":"T. K\u00f6tzing, F. Neumann, H. R\u00f6glin, C. Witt, Theoretical properties of two ACO approaches for the traveling salesman problem, in: Proceedings of the 7th ANTS Conference, 2010, pp. 324\u2013335.","DOI":"10.1007\/978-3-642-15461-4_28"},{"key":"10.1016\/j.ejor.2012.02.038_b0235","series-title":"The Traveling Salesman Problem","author":"Lawler","year":"1985"},{"key":"10.1016\/j.ejor.2012.02.038_b0240","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/0377-2217(94)90247-X","article-title":"Strong linear programming relaxations for the orienteering problem","volume":"73","author":"Leifer","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.038_b0245","unstructured":"R. Mansini, M. Pelizzari, R. Wolfler Calvo, A granular variable neighborhood search heuristics for the tour orienteering problem with time windows, Technical Report 2008-02-52, Dipartimento di Elettronica per l\u2019Automazione, Universit\u00e1 di Brescia, 2008."},{"key":"10.1016\/j.ejor.2012.02.038_b0250","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02601639","article-title":"Combining simulated annealing with local search heuristics","volume":"63","author":"Martin","year":"1996","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2012.02.038_b0255","series-title":"Artificial Ants","year":"2010"},{"issue":"4","key":"10.1016\/j.ejor.2012.02.038_b0260","first-page":"287","article-title":"An ant colony system for team orienteering problems with time windows","volume":"34","author":"Montemanni","year":"2009","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"10.1016\/j.ejor.2012.02.038_b0265","doi-asserted-by":"crossref","unstructured":"R. Montemanni, D.H. Smith, L.M. Gambardella, Ant colony systems for large sequential ordering problems, in: Proceedings of IEEE Swarm Intelligence Symposium, 2007.","DOI":"10.1109\/SIS.2007.368027"},{"issue":"12","key":"10.1016\/j.ejor.2012.02.038_b0270","doi-asserted-by":"crossref","first-page":"3931","DOI":"10.1016\/j.cor.2007.05.003","article-title":"A heuristic manipulation technique for the sequential ordering problem","volume":"35","author":"Montemanni","year":"2008","journal-title":"Computers and Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2012.02.038_b0275","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1504\/IJSPM.2009.032597","article-title":"Sequential ordering problems for crane scheduling in port terminals","volume":"5","author":"Montemanni","year":"2009","journal-title":"International Journal of Simulation and Process Modelling"},{"key":"10.1016\/j.ejor.2012.02.038_b0280","unstructured":"W. Pullyblank, M. Timlin, Precedence constrained routing and helicopter scheduling: heuristic design, Technical Report RC17154 (#76032), IBM T.J. Watson Research Center, 1991."},{"key":"10.1016\/j.ejor.2012.02.038_b0285","series-title":"The Traveling Salesman: Computational Solutions for TSP Applications","author":"Reinelt","year":"1994"},{"key":"10.1016\/j.ejor.2012.02.038_b0290","series-title":"Metaheuristics: Progress as Real Problem Solvers","first-page":"29","article-title":"Grasp with path-relinking: recent advances and applications","author":"Resende","year":"2005"},{"key":"10.1016\/j.ejor.2012.02.038_b0295","series-title":"Handbook of Metaheuristics","first-page":"87","article-title":"Scatter search and path-relinking: fundamentals, advances, and applications","author":"Resende","year":"2010"},{"issue":"4","key":"10.1016\/j.ejor.2012.02.038_b0300","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1016\/j.cor.2008.01.003","article-title":"Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming","volume":"36","author":"Righini","year":"2009","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.02.038_b0305","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0377-2217(90)90091-O","article-title":"An efficient implementation of local search algorithms for constrained routing problems","volume":"47","author":"Savelsbergh","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.038_b0310","doi-asserted-by":"crossref","unstructured":"D.-I. Seo, B.R. Moon, A hybrid genetic algorithm based on complete graph representation for the sequential ordering problem, in: Proceedings of GECCO 2003, pp. 69\u2013680.","DOI":"10.1007\/3-540-45105-6_82"},{"issue":"11","key":"10.1016\/j.ejor.2012.02.038_b0315","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1016\/j.cor.2009.05.002","article-title":"A path relinking approach for the team orienteering problem","volume":"37","author":"Souffriau","year":"2010","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.02.038_b0320","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","article-title":"A tabu search heuristic for the vehicle routing problem with soft time windows","volume":"31","author":"Taillard","year":"1997","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2012.02.038_b0325","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1016\/j.cor.2003.11.008","article-title":"A tabu search heuristic for the team orienteering problem","volume":"32","author":"Tang","year":"2005","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.02.038_b0330","doi-asserted-by":"crossref","unstructured":"F. Tricoire, M. Romauch, K.F. Doerner, R.F. Hartl, Addendum to the paper \u201cHeuristics for the multi-period orienteering problem with multiple time windows, November 2010 .","DOI":"10.1016\/j.cor.2009.05.012"},{"issue":"2","key":"10.1016\/j.ejor.2012.02.038_b0335","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.cor.2009.05.012","article-title":"Heuristics for the multi-period orienteering problem with multiple time windows","volume":"37","author":"Tricoire","year":"2010","journal-title":"Computers and Operations Research"},{"issue":"12","key":"10.1016\/j.ejor.2012.02.038_b0340","doi-asserted-by":"crossref","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","article-title":"Iterated local search for the team orienteering problem with time windows","volume":"36","author":"Vansteenwegen","year":"2009","journal-title":"Computers and Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2012.02.038_b0345","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","article-title":"The orienteering problem: a survey","volume":"209","author":"Vansteenwegen","year":"2011","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.038_b0350","doi-asserted-by":"crossref","unstructured":"D. Weyland, L. Bianchi, L.M. Gambardella, New approximation-based local search algorithms for the probabilistic traveling salesman problem, in: Proceedings of the 12th International Conference on Computer Aided Systems Theory, 2009.","DOI":"10.1007\/978-3-642-04772-5_88"},{"key":"10.1016\/j.ejor.2012.02.038_b0355","unstructured":"D. Weyland, L. Bianchi, L.M. Gambardella, New heuristics for the probabilistic traveling salesman problem, in: Proceedings of the VIII Metaheuristic International Conference (MIC 2009), 2009."}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712001889?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712001889?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T22:38:24Z","timestamp":1561415904000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221712001889"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":71,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["S0377221712001889"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2012.02.038","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2012,8]]}}}