{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T22:57:18Z","timestamp":1703026638213},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,1,20]],"date-time":"2009-01-20T00:00:00Z","timestamp":1232409600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Autom. Comput."],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s11633-009-0097-4","type":"journal-article","created":{"date-parts":[[2009,1,19]],"date-time":"2009-01-19T07:18:00Z","timestamp":1232349480000},"page":"97-102","source":"Crossref","is-referenced-by-count":14,"title":["A hybrid genetic algorithm for the traveling salesman problem with pickup and delivery"],"prefix":"10.1007","volume":"6","author":[{"given":"Fang-Geng","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiang-Sheng","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Su-Jian","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Min","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,1,20]]},"reference":[{"issue":"2","key":"97_CR1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0377-2217(94)90360-3","volume":"79","author":"G. Mosheiov","year":"1994","unstructured":"G. Mosheiov. The Travelling Salesman Problem with Pickup and Delivery. European Journal of Operational Research, vol. 79, no. 2, pp. 299\u2013310, 1994.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"97_CR2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0167-6377(94)90016-7","volume":"16","author":"S. Anily","year":"1994","unstructured":"S. Anily, G. Mosheiov. The Traveling Salesman Problem with Delivery and Backhauls. Operations Research Letters, vol. 16, no. 1, pp. 11\u201318, 1994.","journal-title":"Operations Research Letters"},{"issue":"7","key":"97_CR3","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/S0305-0548(98)00085-9","volume":"26","author":"M. Gendreau","year":"1999","unstructured":"M. Gendreau, G. Laporte, D. Vigo. Heuristics for the Traveling Salesman Problem with Pickup and Delivery. Computer and Operations Research, vol. 26, no. 7, pp. 699\u2013714, 1999.","journal-title":"Computer and Operations Research"},{"issue":"1","key":"97_CR4","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1002\/net.10079","volume":"42","author":"R. Baldacci","year":"2003","unstructured":"R. Baldacci, E. Hadjiconstantinou, A. Mingozzi. An Exact Algorithm for the Traveling Salesman Problem with Deliveries and Collections. Networks, vol. 42, no. 1, pp. 26\u201341, 2003.","journal-title":"Networks"},{"issue":"2","key":"97_CR5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1287\/trsc.1030.0086","volume":"38","author":"H. Hern\u00e1ndez-P\u00e9rez","year":"2004","unstructured":"H. Hern\u00e1ndez-P\u00e9rez, J. J. Salazar Gonz\u00e1lez. Heuristics for the One-commodity Pickup-and-delivery Traveling Salesman Problem. Transportation Science, vol. 38, no. 2, pp. 245\u2013255, 2004.","journal-title":"Transportation Science"},{"issue":"5","key":"97_CR6","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/0305-0548(95)00036-4","volume":"23","author":"M. Gendreau","year":"1996","unstructured":"M. Gendreau, A. Hertz, G. Laporte. The Traveling Salesman Problem with Backhauls. Computer and Operations Research, vol. 23, no. 5, pp. 501\u2013508, 1996.","journal-title":"Computer and Operations Research"},{"issue":"3","key":"97_CR7","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/j.cor.2004.07.009","volume":"33","author":"F. A. Tang","year":"2006","unstructured":"F. A. Tang, R. D. Galv\u00e4o. A Tabu Search Algorithm for the Vehicle Routing Problem with Simultaneous Pick-up and Delivery Service. Computer and Operations Research, vol. 33, no. 3, pp. 595\u2013619, 2006.","journal-title":"Computer and Operations Research"},{"key":"97_CR8","first-page":"136","volume-title":"Proceedings of the 2nd IEEE Conference on Industrial Electronics and Applications","author":"P. Chen","year":"2007","unstructured":"P. Chen, H. K. Huang, X. Y. Dong. An Ant Colony System Based Heuristic Algorithm for the Vehicle Routing Problem with Simultaneous Delivery and Pickup. In Proceedings of the 2nd IEEE Conference on Industrial Electronics and Applications, IEEE Press, Harbin, China, pp. 136\u2013141, 2007."},{"issue":"1","key":"97_CR9","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TSMCB.2006.880136","volume":"37","author":"H. D. Nguyen","year":"2007","unstructured":"H. D. Nguyen, I. Yoshihara, K. Yamamori, M. Yasunaga. Implementation of an Effective Hybrid GA for Large-scale Traveling Salesman Problems. IEEE Transactions on Systems, Man, and Cybernetics \u2014 Part B: Cybernetics, vol. 37, no. 1, pp. 92\u201399, 2007.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics \u2014 Part B: Cybernetics"},{"key":"97_CR10","volume-title":"Adaptation in Natural and Artificial Systems","author":"J. H. Holland","year":"1975","unstructured":"J. H. Holland. Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbour, USA, 1975."},{"issue":"2\u20134","key":"97_CR11","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.knosys.2004.03.001","volume":"17","author":"A. Misevicius","year":"2004","unstructured":"A. Misevicius. An Improved Hybrid Genetic Algorithm: New Results for the Quadratic Assignment Problem. Knowledge-Based Systems, vol. 17, no. 2\u20134, pp. 65\u201373, 2004.","journal-title":"Knowledge-Based Systems"},{"issue":"12","key":"97_CR12","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C. Prins","year":"2004","unstructured":"C. Prins. A Simple and Effective Evolutionary Algorithm for the Vehicle Routing Problem. Computer and Operations Research, vol. 31, no. 12, pp. 1985\u20132002, 2004.","journal-title":"Computer and Operations Research"},{"issue":"4","key":"97_CR13","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/S0360-8352(03)00077-9","volume":"45","author":"B. J. Park","year":"2003","unstructured":"B. J. Park, H. R. Choi, H. S. Kim. A Hybrid Genetic Algorithm for the Job Shop Scheduling Problems. Computer & Industrial Engineering, vol. 45, no. 4, pp. 597\u2013613, 2003.","journal-title":"Computer & Industrial Engineering"},{"key":"97_CR14","volume-title":"The Traveling Salesman: Computational Solutions for TSP Applications","author":"G. Reinelt","year":"1994","unstructured":"G. Reinelt. The Traveling Salesman: Computational Solutions for TSP Applications, Springer-Verlag, Berlin, Germany, 1994."},{"key":"97_CR15","first-page":"116","volume-title":"Proceedings of the 3rd International Conference on Genetic Algorithms","author":"D. Whitley","year":"1989","unstructured":"D. Whitley, H. K. Huang, X. Y. Dong. The Genitor Algorithm and Selection Pressure: Why Rank-based Allocation of Reproductive Trials is Best. In Proceedings of the 3rd International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, San Francisco, USA, pp. 116\u2013121, 1989."},{"key":"97_CR16","first-page":"154","volume-title":"Proceedings of the 1st International Conference on Genetic Algorithms and their Applications","author":"D. E. Goldberg","year":"1985","unstructured":"D. E. Goldberg, R. Lingle. Alleles, loci, and the traveling salesman problem. In Proceedings of the 1st International Conference on Genetic Algorithms and their Applications, Lawrence Erlbaum Associates, Pittsburgh, USA, pp. 154\u2013159, 1985."},{"key":"97_CR17","first-page":"332","volume-title":"Handbook of Genetic Algorithms","author":"G. Syswerda","year":"1991","unstructured":"G. Syswerda. Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, USA, pp. 332\u2013349, 1991."},{"key":"97_CR18","first-page":"224","volume-title":"Proceedings of 2nd International Conference on Genetic Algorithms and their Application","author":"I.M. Oliver","year":"1987","unstructured":"I.M. Oliver, D. J. Smith, J. R. C. Holland. A Study of Permutation Crossover Operators on the Traveling Salesman Problem. In Proceedings of 2nd International Conference on Genetic Algorithms and their Application, Lawrence Erlbaum Associates, Mahwah, USA, pp. 224\u2013230, 1987."},{"key":"97_CR19","volume-title":"Hybrid Genetic Algorithms for Combinatorial Optimization Problems","author":"H. D. Nguyen","year":"2004","unstructured":"H. D. Nguyen. Hybrid Genetic Algorithms for Combinatorial Optimization Problems, Ph.D. dissertation, University of Miyazaki, Miyazaki, Japan, 2004."},{"key":"97_CR20","first-page":"159","volume-title":"Proceedings of IEEE International Conference on Evolutionary Computation","author":"P. Merz","year":"1997","unstructured":"P. Merz, B. Freisleben. Genetic Local Search for the TSP: New Results. In Proceedings of IEEE International Conference on Evolutionary Computation, IEEE Press, Indianapolis, USA, pp. 159\u2013164, 1997."},{"issue":"4","key":"97_CR21","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s11086-005-0029-1","volume":"31","author":"S. D. Shtovba","year":"2005","unstructured":"S. D. Shtovba. Ant Algorithms: Theory and Applications. Programming and Computer Software, vol. 31, no. 4, pp. 167\u2013178, 2005.","journal-title":"Programming and Computer Software"},{"issue":"10","key":"97_CR22","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"S. Lin. Computer Solutions of the Traveling Salesman Problem. Bell Labs Technical Journal, vol. 44, no. 10, pp. 2245\u20132269, 1965.","journal-title":"Bell Labs Technical Journal"},{"issue":"8","key":"97_CR23","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"T. St\u00fctzle, H. H. Hoos. MAX-MIN Ant System. Future Generation Computer Systems, vol. 16, no. 8, pp. 889\u2013914, 2000.","journal-title":"Future Generation Computer Systems"},{"key":"97_CR24","volume-title":"Performance of Various Computers Using Standard Linear Equations Software, Technical Report CS-89-85","author":"J. J. Dongarra","year":"2007","unstructured":"J. J. Dongarra. Performance of Various Computers Using Standard Linear Equations Software, Technical Report CS-89-85, Department of Computer Science Department, University of Tennessee, TN, USA, 2007."}],"container-title":["International Journal of Automation and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11633-009-0097-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11633-009-0097-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11633-009-0097-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:46:36Z","timestamp":1559400396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11633-009-0097-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,20]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["97"],"URL":"https:\/\/doi.org\/10.1007\/s11633-009-0097-4","relation":{},"ISSN":["1476-8186","1751-8520"],"issn-type":[{"value":"1476-8186","type":"print"},{"value":"1751-8520","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,20]]}}}