{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:18:01Z","timestamp":1742912281956,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":10,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811514678"},{"type":"electronic","value":"9789811514685"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-1468-5_135","type":"book-chapter","created":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T19:05:02Z","timestamp":1580756702000},"page":"1155-1162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Time-Limited Tour Planning Based on Ant Colony Optimization Algorithm"],"prefix":"10.1007","author":[{"given":"Han","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhujun","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenhui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihong","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,4]]},"reference":[{"key":"135_CR1","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-319-91065-9_13","volume-title":"Nonlinear Systems and Complexity","author":"Leila Eskandari","year":"2018","unstructured":"Eskandari, L., A. Jafarian, P. Rahimloo, and D. Baleanu. August 2018. A modified and enahanced ant colony optimization algorithm for traveling salesman problem. In Mathematical methods in engineering, vol. 23, 257\u2013265, \nhttps:\/\/doi.org\/10.1007\/978-3-319-91065-9_13\n\n."},{"issue":"2","key":"135_CR2","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s11831-017-9247-y","volume":"26","author":"A. Hanif Halim","year":"2017","unstructured":"Halim, A., and I. Ismail. April 2019. Combinatorial optimization: Comparison of heuristic algorithms in travelling salesman problem. Archives of Computational Methods in Engineering 26 (2): 367\u2013380, \nhttps:\/\/doi.org\/10.1007\/s11831-017-9247-y\n\n.","journal-title":"Archives of Computational Methods in Engineering"},{"key":"135_CR3","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ins.2018.11.006","volume":"478","author":"Jianyu Long","year":"2019","unstructured":"Long, J., Z. Sun, Y. Hong, S. Zhang, and C. Li. April 2019. A hybrid multi-objective genetic local search algorithm for the prize-collecting vehicle routing problem. Information Science 478: 40\u201361, \nhttps:\/\/doi.org\/10.1016\/j.ins.2018.11.006\n\n.","journal-title":"Information Sciences"},{"key":"135_CR4","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-981-13-3450-4_32","volume-title":"Advances in Communication, Devices and Networking","author":"Rahul Saxena","year":"2019","unstructured":"Saxena, R., A. Kumar, V. Jain, and T. Sadana. February 2019. An improved genetic algorithm based solution to vehicle routing problem over openmp with load consideration. Advances in Communication, Devices and Networking 537: 285\u2013296, \nhttps:\/\/doi.org\/10.1007\/978-981-13-3450-4_32\n\n."},{"key":"135_CR5","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.swevo.2018.05.006","volume":"44","author":"Indadul Khan","year":"2019","unstructured":"Khan, I., and M. Maiti. Feburary 2019. A swap sequence based artificial bee colony algorithm for traveling salesman problem. Swarm and Evolutionary Computation 44: 428\u2013438, \nhttps:\/\/doi.org\/10.1016\/j.swevo.2018.05.006\n\n.","journal-title":"Swarm and Evolutionary Computation"},{"issue":"3","key":"135_CR6","doi-asserted-by":"publisher","first-page":"2761","DOI":"10.3233\/JIFS-169628","volume":"35","author":"Yan Mei","year":"2018","unstructured":"Mei, Y. October 2018. Study on the application and improvement of ant colony algorithm in terminal tour route planning under android platform. Journal of Intelligent and Fuzzy Systems 35: 2761\u20132768, \nhttps:\/\/doi.org\/10.3233\/jifs-169628\n\n.","journal-title":"Journal of Intelligent & Fuzzy Systems"},{"issue":"1","key":"135_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.11648\/j.ijmfs.20190501.12","volume":"5","author":"Adhe Afriani","year":"2019","unstructured":"Afriani, A., H. Saleh, and M. Gamal. Feburary 2019. An application of goal programming: The best route to discover a wonderful west sumatera. International Journal of Management and Fuzzy Systems 5: 9\u201313, \nhttps:\/\/doi.org\/10.11648\/j.ijmfs.20190501.12\n\n.","journal-title":"International Journal of Management and Fuzzy Systems"},{"issue":"1","key":"135_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/23248378.2018.1489741","volume":"7","author":"Wencheng Huang","year":"2018","unstructured":"Huang, W. and B. Shuai. June 2018. Approach and application on high-speed train stop plan for better passenger transfer efficiency: the China case. International Journal of Rail Transportation 7: 55\u201378, \nhttps:\/\/doi.org\/10.1080\/23248378.2018.1489741\n\n.","journal-title":"International Journal of Rail Transportation"},{"key":"135_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-030-14118-9_13","volume-title":"Advances in Intelligent Systems and Computing","author":"Ibrahim A. Hameed","year":"2019","unstructured":"Hameed, I. March 2019. Multi-objective solution of traveling salesman problem with time. International Conference on Advanced Machine Learning Technologies and Applications, vol. 921, pp. 121\u2013132, \nhttps:\/\/doi.org\/10.1007\/978-3-030-14118-9_13\n\n."},{"key":"135_CR10","doi-asserted-by":"publisher","unstructured":"Ghannadpour, S. 2019. Evolutionary approach for energy minimizing vehicle routing problem with time windows and customers\u2019 priority. International Journal of Transportation Engineering 6 (Winter): 237\u2013264, \nhttps:\/\/doi.org\/10.22119\/ijte.2018.55929\n\n.","DOI":"10.22119\/ijte.2018.55929"}],"container-title":["Advances in Intelligent Systems and Computing","Data Processing Techniques and Applications for Cyber-Physical Systems (DPTA 2019)"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-1468-5_135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T16:23:36Z","timestamp":1589905416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-1468-5_135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811514678","9789811514685"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-1468-5_135","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}