{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:00:44Z","timestamp":1743080444687,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030041786"},{"type":"electronic","value":"9783030041793"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04179-3_50","type":"book-chapter","created":{"date-parts":[[2018,11,17]],"date-time":"2018-11-17T07:12:42Z","timestamp":1542438762000},"page":"564-576","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Combining Two-Phase Local Search with Multi-objective Ant Colony Optimization"],"prefix":"10.1007","author":[{"given":"Chun-Wa","family":"Leung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sin-Chun","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew K.","family":"Lui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,18]]},"reference":[{"key":"50_CR1","unstructured":"Gambardella, L.M., Taillard, \u00c9., Agazzi, G.: MACS-VRPTW: a multiple colony system for vehicle routing problems with time windows. In: New Ideas in Optimization, pp. 63\u201376. McGraw-Hill (1999)"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization, pp. 33\u201338. Bradford Company, Scituate (2004)","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"50_CR3","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/3-540-36970-8_34","volume-title":"Evolutionary Multi-Criterion Optimization","author":"L Paquete","year":"2003","unstructured":"Paquete, L., St\u00fctzle, T.: A two-phase local search for the biobjective traveling salesman problem. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds.) Evolutionary Multi-Criterion Optimization, pp. 479\u2013493. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36970-8_34"},{"key":"50_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1, 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"50_CR5","unstructured":"Ren, L., Duhamel, C., Quilliot, A.: A hybrid ILS\/VND Heuristic for the one-commodity pickup-and-delivery traveling salesman problem. Presented at the International Workshop on Green Supply Chain\u2013GSC, Arras, France (2012)"},{"key":"50_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/B978-155860872-6\/50020-2","volume-title":"Stochastic Local Search","author":"Holger H. Hoos","year":"2005","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. pp. 298\u2013358. Elsevier, Amsterdam (2004)"},{"key":"50_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-30671-6_3","volume-title":"Hybrid Metaheuristics","author":"J Dubois-Lacoste","year":"2013","unstructured":"Dubois-Lacoste, J., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Combining two search paradigms for multi-objective optimization: two-phase and pareto local search. In: Talbi, E.-G. (ed.) Hybrid Metaheuristics, pp. 97\u2013117. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-30671-6_3"},{"key":"50_CR8","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-19893-9_18","volume-title":"Lecture Notes in Computer Science","author":"Thibaut Lust","year":"2011","unstructured":"Lust, T., Teghem, J., Tuyttens, D.: Very large-scale neighborhood search for solving multiobjective combinatorial optimization problems. In: Takahashi, R.H.C., Deb, K., Wanner, E.F., Greco, S. (eds.) Evolutionary Multi-Criterion Optimization, pp. 254\u2013268. LNCS, vol. 6576, Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19893-9_18"},{"key":"50_CR9","doi-asserted-by":"publisher","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."},{"issue":"1\u20132","key":"50_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10479-017-2415-5","volume":"254","author":"A Jaszkiewicz","year":"2017","unstructured":"Jaszkiewicz, A., Lust, T.: Proper balance between search towards and along pareto front: biobjective TSP case study. Ann. Oper. Res. 254(1\u20132), 111\u2013130 (2017)","journal-title":"Ann. Oper. Res."},{"key":"50_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10852-005-9034-x","volume":"5","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2006","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Paquete, L., St\u00fctzle, T.: Hybrid population-based algorithms for the bi-objective quadratic assignment problem. J. Math. Model. Algorithms 5, 111\u2013137 (2006)","journal-title":"J. Math. Model. Algorithms"},{"key":"50_CR12","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength pareto evolutionary algorithm. TIK-report. 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH), Zurich, Switzerland (2001)"},{"key":"50_CR13","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E Taillard","year":"1991","unstructured":"Taillard, E.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17, 443\u2013455 (1991)","journal-title":"Parallel Comput."},{"key":"50_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(03)00376-1","volume":"310","author":"E Angel","year":"2004","unstructured":"Angel, E., Bampis, E., Gourv\u00e8s, L.: Approximating the pareto curve with local search for the bicriteria TSP(1, 2) problem. Theoret. Comput. Sci. 310, 135\u2013146 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"50_CR15","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"JJ Bentley","year":"1992","unstructured":"Bentley, J.J.: Fast algorithms for geometric traveling salesman problems. ORSA J. Comput. 4, 387\u2013411 (1992)","journal-title":"ORSA J. Comput."},{"key":"50_CR16","unstructured":"Johnson, D., Mcgeoch, L.: The traveling salesman problem: a case study in local optimization. In: Local Search in Combinatorial Optimization (1997)"},{"key":"50_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/B:ANOR.0000039513.99038.c6","volume":"131","author":"K Doerner","year":"2004","unstructured":"Doerner, K., Gutjahr, W.J., Hartl, R.F., Strauss, C., Stummer, C.: Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection. Ann. Oper. Res. 131, 79\u201399 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"50_CR18","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1109\/TEVC.2011.2182651","volume":"16","author":"Manuel Lopez-Ibanez","year":"2012","unstructured":"Lopez-Ibanez, M., Stutzle, T.: The automatic design of multiobjective ant colony optimization algorithms. IEEE Trans. Evol. Comput. 16, 861\u2013875 (2012)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"50_CR19","unstructured":"Zitzler, E.: Evolutionary algorithms for multiobjective optimization: methods and applications. Ph.D. thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland (1999)"},{"key":"50_CR20","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.swevo.2015.02.003","volume":"23","author":"I.D.I.D. Ariyasingha","year":"2015","unstructured":"Ariyasingha, I., Fernando, T.: Performance analysis of the multi-objective ant colony optimization algorithms for the traveling salesman problem. Swarm Evol. Comput. 23, 11\u201326 (2015)","journal-title":"Swarm and Evolutionary Computation"},{"issue":"2","key":"50_CR21","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.ejor.2014.10.062","volume":"243","author":"J\u00e9r\u00e9mie Dubois-Lacoste","year":"2015","unstructured":"Dubois-Lacoste, J., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Anytime pareto local search. Eur. J. Oper. Res.Eur. J. Oper. Res. 243, 369\u2013385 (2015)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04179-3_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:31:36Z","timestamp":1709825496000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04179-3_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030041786","9783030041793"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04179-3_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"18 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Siem Reap","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambodia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/iconip\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"575","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"401","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}