{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:54:07Z","timestamp":1783749247488,"version":"3.55.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,9,6]],"date-time":"2012-09-06T00:00:00Z","timestamp":1346889600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10732-012-9210-x","type":"journal-article","created":{"date-parts":[[2012,9,5]],"date-time":"2012-09-05T13:01:26Z","timestamp":1346850086000},"page":"849-867","source":"Crossref","is-referenced-by-count":16,"title":["A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Inmaculada","family":"Rodr\u00edguez-Mart\u00edn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan","family":"Jos\u00e9\u00a0Salazar-Gonz\u00e1lez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,9,6]]},"reference":[{"key":"9210_CR1","unstructured":"Ascheuer, N.: Hamiltonian path problems in the on-line optimization of flexible manufacturing systems. Ph.D. Thesis, Technische Universit\u00e4t, Berlin, Germany (1995)"},{"key":"9210_CR2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0803002","volume":"3","author":"N. Ascheuer","year":"1993","unstructured":"Ascheuer, N., Escudero, L.F., Gr\u00f6tschel, M., Stoer, M.: A cutting plane approach to the sequential ordering problem (with applications to job scheduling in manufacturing). SIAM J. Optim. 3, 25\u201342 (1993)","journal-title":"SIAM J. Optim."},{"key":"9210_CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1023\/A:1008779125567","volume":"17","author":"N. Ascheuer","year":"2000","unstructured":"Ascheuer, N., J\u00fcnger, M., Reinelt, G.: A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints. Comput. Optim. Appl. 17, 61\u201384 (2000)","journal-title":"Comput. Optim. Appl."},{"key":"9210_CR4","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1002\/net.3230220408","volume":"22","author":"S. Anily","year":"1992","unstructured":"Anily, S., Hassin, R.: The swapping problem. Networks 22, 419\u2013433 (1992)","journal-title":"Networks"},{"key":"9210_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","volume":"15","author":"G. Berbeglia","year":"2007","unstructured":"Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. Top 15, 1\u201331 (2007)","journal-title":"Top"},{"key":"9210_CR6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E. Danna","year":"2005","unstructured":"Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program., Ser. A 102, 71\u201390 (2005)","journal-title":"Math. Program., Ser. A"},{"key":"9210_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10107-008-0234-9","volume":"121","author":"I. Dumitrescu","year":"2010","unstructured":"Dumitrescu, I., Ropke, S., Cordeau, J.-F., Laporte, G.: The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm. Math. Program. 121, 269\u2013305 (2010)","journal-title":"Math. Program."},{"key":"9210_CR8","doi-asserted-by":"crossref","first-page":"1599","DOI":"10.1016\/j.dam.2010.05.025","volume":"158","author":"G. Erdo\u01e7an","year":"2010","unstructured":"Erdo\u01e7an, G., Cordeau, J.-F., Laporte, G.: A branch-and-cut algorithm for solving the non-preemptive capacitated swapping problem. Discrete Appl. Math. 158, 1599\u20131614 (2010)","journal-title":"Discrete Appl. Math."},{"key":"9210_CR9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. Program., Ser. B 98, 23\u201347 (2003)","journal-title":"Math. Program., Ser. B"},{"key":"9210_CR10","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/inte.22.3.100","volume":"22","author":"M.T. Fiala Timlin","year":"1992","unstructured":"Fiala Timlin, M.T., Pulleyblank, W.R.: Precedence constrained routing and helicopter scheduling: heuristic design. Interfaces 22, 100\u2013111 (1992)","journal-title":"Interfaces"},{"key":"9210_CR11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptative search procedures. J. Glob. Optim. 6, 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"key":"9210_CR12","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"G.N. Frederickson","year":"1978","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Comput. 7, 178\u2013193 (1978)","journal-title":"SIAM J. Comput."},{"key":"9210_CR13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1287\/ijoc.12.3.237.12636","volume":"13","author":"L.M. Gambardella","year":"2000","unstructured":"Gambardella, L.M., Dorigo, M.: An ant colony system hybridized with a new local search for the sequential ordering problem. INFORMS J. Comput. 13, 237\u2013255 (2000)","journal-title":"INFORMS J. Comput."},{"key":"9210_CR14","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/0305-0548(95)00036-4","volume":"23","author":"M. Gendreau","year":"1996","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: The traveling salesman problem with backhauls. Comput. Oper. Res. 23, 501\u2013508 (1996)","journal-title":"Comput. Oper. Res."},{"key":"9210_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1002\/net.20122","volume":"48","author":"L. Gouveia","year":"2006","unstructured":"Gouveia, L., Pesneau, P.: On extended formulations for the precedence constrained asymmetric traveling salesman problem. Networks 48, 77\u201389 (2006)","journal-title":"Networks"},{"key":"9210_CR16","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1016\/j.cor.2008.03.008","volume":"36","author":"H. Hern\u00e1ndez-P\u00e9rez","year":"2009","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., Rodr\u00edguez-Mart\u00edn, I., Salazar-Gonz\u00e1lez, J.J.: A hybrid GRASP\/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem. Comput. Oper. Res. 36, 1639\u20131645 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9210_CR17","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.dam.2003.09.013","volume":"145","author":"H. Hern\u00e1ndez-P\u00e9rez","year":"2004","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., Salazar-Gonz\u00e1lez, J.J.: A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discrete Appl. Math. 145, 126\u2013139 (2004a)","journal-title":"Discrete Appl. Math."},{"key":"9210_CR18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1287\/trsc.1030.0086","volume":"38","author":"H. Hern\u00e1ndez-P\u00e9rez","year":"2004","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., Salazar-Gonz\u00e1lez, J.J.: Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transp. Sci. 38, 245\u2013255 (2004b)","journal-title":"Transp. Sci."},{"key":"9210_CR19","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1016\/j.ejor.2008.05.009","volume":"196","author":"H. Hern\u00e1ndez-P\u00e9rez","year":"2009","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., Salazar-Gonz\u00e1lez, J.J.: The multi-commodity one-to-one pickup-and-delivery traveling salesman problem. Eur. J. Oper. Res. 196, 987\u2013995 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"9210_CR20","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0377-2217(85)90257-7","volume":"22","author":"B. Kalantari","year":"1985","unstructured":"Kalantari, B., Hill, A.V., Arora, S.R.: An algorithm for the traveling salesman problem with pickup and delivery customers. Eur. J. Oper. Res. 22, 377\u2013386 (1985)","journal-title":"Eur. J. Oper. Res."},{"key":"9210_CR21","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/s10878-010-9349-z","volume":"23","author":"H.L. Kerivin","year":"2012","unstructured":"Kerivin, H.L., Lacroix, M., Mahjoub, A.R.: Models for the single-vehicle preemptive pickup and delivery problem. J. Comb. Optim. 23, 196\u2013223 (2012)","journal-title":"J. Comb. Optim."},{"key":"9210_CR22","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21, 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"9210_CR23","volume-title":"Matheuristics. Hybridizing Metaheuristics and Mathematical Programming. Annals of Information Systems","year":"2009","unstructured":"Maniezzo, V., St\u00fctzle, T., Vo\u00df, S. (eds.): Matheuristics. Hybridizing Metaheuristics and Mathematical Programming. Annals of Information Systems. Springer, Berlin (2009)"},{"key":"9210_CR24","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"9210_CR25","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","volume":"58","author":"S.N. Parragh","year":"2008","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. Part I. Transportation between customers and depot. J. Betriebswirtsch. 58, 21\u201351 (2008a)","journal-title":"J. Betriebswirtsch."},{"key":"9210_CR26","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"S.N. Parragh","year":"2008","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. Part II. Transportation between pickup and delivery locations. J. Betriebswirtsch. 58, 81\u2013117 (2008b)","journal-title":"J. Betriebswirtsch."},{"key":"9210_CR27","doi-asserted-by":"crossref","DOI":"10.1016\/S0305-0548(99)00066-0","volume":"27","author":"J. Renaud","year":"2000","unstructured":"Renaud, J., Boctor, F.F., Ouenniche, I.: A heuristic for the pickup and delivery traveling salesman problem. Comput. Oper. Res. 27, 905916 (2000)","journal-title":"Comput. Oper. Res."},{"key":"9210_CR28","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"M.W.P. Savelsbergh","year":"1995","unstructured":"Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery problem. Transp. Sci. 29, 17\u201329 (1995)","journal-title":"Transp. Sci."},{"key":"9210_CR29","unstructured":"TSPLIB: http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-012-9210-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-012-9210-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-012-9210-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:33Z","timestamp":1559256873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-012-9210-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,6]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["9210"],"URL":"https:\/\/doi.org\/10.1007\/s10732-012-9210-x","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,6]]}}}