{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:55:50Z","timestamp":1725515750000},"reference-count":32,"publisher":"Elsevier BV","issue":"1","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\/"}],"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.036","type":"journal-article","created":{"date-parts":[[2012,1,25]],"date-time":"2012-01-25T19:53:13Z","timestamp":1327521193000},"page":"270-285","source":"Crossref","is-referenced-by-count":101,"title":["A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem"],"prefix":"10.1016","volume":"220","author":[{"given":"Nenad","family":"Mladenovi\u0107","sequence":"first","affiliation":[]},{"given":"Dragan","family":"Uro\u0161evi\u0107","sequence":"additional","affiliation":[]},{"given":"Sa\u0131\u00a8d","family":"Hanafi","sequence":"additional","affiliation":[]},{"given":"Aleksandar","family":"Ili\u0107","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2012.01.036_b0005","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1002\/(SICI)1520-6750(199909)46:6<654::AID-NAV4>3.0.CO;2-A","article-title":"Approximation algorithms for the capacitated travelling salesman problem with pickups and deliveries","volume":"46","author":"Anily","year":"1999","journal-title":"Naval Research Logistics"},{"key":"10.1016\/j.ejor.2012.01.036_b0010","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10288-009-0108-x","article-title":"Attraction probabilities in variable neighborhood search","volume":"8","author":"Brimberg","year":"2010","journal-title":"4OR"},{"key":"10.1016\/j.ejor.2012.01.036_b0015","doi-asserted-by":"crossref","first-page":"2133","DOI":"10.1137\/S0097539795295468","article-title":"Approximating capacitated routing and delivery problems","volume":"28","author":"Chalasani","year":"1999","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"10.1016\/j.ejor.2012.01.036_b0020","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1002\/spe.4380240306","article-title":"A new data structure for cumulative frequency tables","volume":"24","author":"Fenwick","year":"1994","journal-title":"Software \u2013 Practice and Experience"},{"issue":"4","key":"10.1016\/j.ejor.2012.01.036_b0025","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1016\/j.cor.2005.06.014","article-title":"Implementation analysis of efficient heuristic algorithms for the travelling salesman problem","volume":"33","author":"Gamboa","year":"2006","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2012.01.036_b0030","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/S0305-0548(98)00085-9","article-title":"Heuristics for the travelling salesman problem with pickup and delivery","volume":"26","author":"Gendreau","year":"1999","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2012.01.036_b0035","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1287\/opre.45.4.639","article-title":"An approximation algorithm for the travelling salesman problem with backhauls","volume":"45","author":"Gendreau","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2012.01.036_b0040","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0166-218X(97)00074-7","article-title":"Routing a vehicle of capacity greater than one","volume":"81","author":"Guan","year":"1998","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2012.01.036_b0045","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1016\/j.dam.2005.05.020","article-title":"First vs. best improvement: an empirical study","volume":"154","author":"Hansen","year":"2006","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2012.01.036_b0050","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.ejor.2007.02.002","article-title":"Variable neighborhood search","volume":"191","author":"Hansen","year":"2008","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.036_b0055","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","article-title":"Variable neighborhood search: algorithms and applications","volume":"175","author":"Hansen","year":"2010","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2012.01.036_b0060","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., 2004. Travelling salesman problems with pickups and deliveries. PhD Thesis, University of La Laguna, Spain."},{"key":"10.1016\/j.ejor.2012.01.036_b0065","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1287\/trsc.1030.0086","article-title":"Heuristics for the one-commodity pickup-and-delivery travelling salesman problem","volume":"38","author":"Hern\u00e1ndez-P\u00e9rez","year":"2004","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2012.01.036_b0070","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.dam.2003.09.013","article-title":"A branch-and-cut algorithm for a travelling salesman problem with pickup and delivery","volume":"145","author":"Hern\u00e1ndez-P\u00e9rez","year":"2004","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2012.01.036_b0075","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1002\/net.20209","article-title":"The one-commodity pickup and delivery travelling salesman problem: Inequalities and algorithms","volume":"50","author":"Hern\u00e1ndez\u2013P\u00e9rez","year":"2007","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2012.01.036_b0080","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1016\/j.cor.2008.03.008","article-title":"A hybrid GRASP\/VND heuristic for the one-commodity pickup-and-delivery travelling salesman problem","volume":"36","author":"Hern\u00e1ndez-P\u00e9rez","year":"2009","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2012.01.036_b0085","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.ejor.2010.02.022","article-title":"Variable neighborhood search for solving the uncapacitated single allocation p-hub median problem","volume":"206","author":"Ili\u0107","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.036_b0090","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 & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2012.01.036_b0095","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.01.036_b0100","series-title":"Local Search in Combinatorial Optimization","article-title":"The travelling salesman problem: a case study in local optimization","author":"Johnson","year":"1996"},{"key":"10.1016\/j.ejor.2012.01.036_b0105","series-title":"Local search in combinatorial optimization","article-title":"The travelling salesman problem: a case study in local optimization","author":"Johnson","year":"1997"},{"issue":"2","key":"10.1016\/j.ejor.2012.01.036_b0110","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","article-title":"The travelling salesman 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.036_b0115","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the travelling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2012.01.036_b0120","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2012.01.036_b0125","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0377-2217(94)90360-3","article-title":"The travelling salesman problem with pick-up and delivery","volume":"79","author":"Mosheiov","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.036_b0130","first-page":"58 21","article-title":"A survey on pickup and delivery problems. Part I: Transportation between customers and depot","author":"Parragh","year":"2008","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"key":"10.1016\/j.ejor.2012.01.036_b0135","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","article-title":"A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations","volume":"58","author":"Parragh","year":"2008","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"key":"10.1016\/j.ejor.2012.01.036_b0140","doi-asserted-by":"crossref","first-page":"187","DOI":"10.2298\/YJOR1102187P","article-title":"A new efficient transformation of the generalized VRP into the classical VRP","volume":"21","author":"Pop","year":"2011","journal-title":"Yugoslav Journal of Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2012.01.036_b0145","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2010.09.010","article-title":"Travelling salesman problem heuristics: leading methods, implementations and latest advances","volume":"211","author":"Rego","year":"2011","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.036_b0150","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","article-title":"The general pickup and delivery problem","volume":"29","author":"Savelsbergh","year":"1995","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2012.01.036_b0155","doi-asserted-by":"crossref","first-page":"1642","DOI":"10.1016\/j.cie.2008.10.014","article-title":"Genetic algorithm for the one-commodity pickup-and-delivery travelling salesman problem","volume":"56","author":"Zhao","year":"2009","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2012.01.036_b0160","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s11633-009-0097-4","article-title":"A hybrid genetic algorithm for the travelling salesman problem with pickup and delivery","volume":"6","author":"Zhao","year":"2009","journal-title":"International Journal of Automation and Computing"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712000719?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712000719?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T22:23:23Z","timestamp":1543271003000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221712000719"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["S0377221712000719"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2012.01.036","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}