{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T01:33:14Z","timestamp":1775266394895,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030034924","type":"print"},{"value":"9783030034931","type":"electronic"}],"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-03493-1_76","type":"book-chapter","created":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T10:16:52Z","timestamp":1541672212000},"page":"730-739","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimizing Meta-heuristics for the Time-Dependent TSP Applied to Air Travels"],"prefix":"10.1007","author":[{"given":"Diogo","family":"Duque","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5808-576X","authenticated-orcid":false,"given":"Jos\u00e9 Aleixo","family":"Cruz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1252-7515","authenticated-orcid":false,"given":"Henrique Lopes","family":"Cardoso","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9271-610X","authenticated-orcid":false,"given":"Eug\u00e9nio","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,9]]},"reference":[{"key":"76_CR1","volume-title":"Graph Theory, 1736\u20131936","author":"N Biggs","year":"1986","unstructured":"Biggs, N., Lloyd, E.K., Wilson, R.J.: Graph Theory, 1736\u20131936. Clarendon Press, New York (1986)"},{"issue":"4","key":"76_CR2","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/j.disopt.2008.04.001","volume":"5","author":"L-P Bigras","year":"2008","unstructured":"Bigras, L.-P., Gamache, M., Savard, G.: The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times. Discrete Optim. 5(4), 685\u2013699 (2008)","journal-title":"Discrete Optim."},{"key":"76_CR3","unstructured":"Birattari, M.: The problem of tuning metaheuristics: as seen from the machine learning perspective. Master\u2019s thesis, Universit\u00e9 libre de Bruxelles (2005)"},{"key":"76_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78295-7","volume-title":"Hybrid Metaheuristics: An Emerging Approach to Optimization","author":"C Blum","year":"2008","unstructured":"Blum, C., Aguilera, M.J.B., Roli, A., Sampels, M.: Hybrid Metaheuristics: An Emerging Approach to Optimization, 1st edn. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78295-7","edition":"1"},{"key":"76_CR5","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem, p. 10, February 1976"},{"key":"76_CR6","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Di Caro, G.: Ant colony optimization: a new meta-heuristic. In: Proceedings of the Congress on Evolutionary Computation, pp. 1470\u20131477. IEEE Press (1999)","DOI":"10.1109\/CEC.1999.782657"},{"key":"76_CR7","unstructured":"Duque, D., Cruz, J.A.: (2018). https:\/\/github.com\/jazzchipc\/MPE-FEUP"},{"issue":"7","key":"76_CR8","doi-asserted-by":"publisher","first-page":"1875","DOI":"10.1016\/j.asoc.2012.04.018","volume":"12","author":"JA Fernandez-Prieto","year":"2012","unstructured":"Fernandez-Prieto, J.A., Canada-Bago, J., Gadeo-Martos, M.A., Velasco, J.R.: Optimisation of control parameters for genetic algorithms to test computer networks under realistic traffic loads. Appl. Soft Comput. 12(7), 1875\u20131883 (2012)","journal-title":"Appl. Soft Comput."},{"key":"76_CR9","doi-asserted-by":"crossref","unstructured":"Gambardella, L.M., Dorigo, M.: Ant-Q: a reinforcement learning approach to the traveling salesman problem. In: Proceedings of the 12th International Conference on Machine Learning, ICML1995, pp. 252\u2013260. Morgan Kaufmann Publishers Inc. (1995)","DOI":"10.1016\/B978-1-55860-377-6.50039-6"},{"key":"76_CR10","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R: Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Hammer, P.L., Johnson, E.L., Korte, B.H. (eds.) Discrete Optimization II, volume 5 of Annals of Discrete Mathematics, pp. 287\u2013326. Elsevier (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"76_CR11","unstructured":"Johnson, D., McGeoch, L.A.: The traveling salesman problem: a case study in local optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization. Wiley (1997)"},{"key":"76_CR12","unstructured":"Kiwi.com: Rules for kiwi.com travelling salesman competition (2018). https:\/\/github.com\/kiwicom\/travelling-salesman. Accessed 29 June 2018"},{"key":"76_CR13","unstructured":"Kiwi.com: Travelling salesman challenge (2018). https:\/\/travellingsalesman.cz. Accessed 29 June 2018"},{"issue":"9","key":"76_CR14","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1287\/mnsc.13.9.723","volume":"13","author":"PJ Kolesar","year":"1967","unstructured":"Kolesar, P.J.: A branch and bound algorithm for the knapsack problem. Manage. Sci. 13(9), 723\u2013735 (1967)","journal-title":"Manage. Sci."},{"key":"76_CR15","doi-asserted-by":"crossref","unstructured":"Li, B., Wang, L., Song, W.: Ant colony optimization for the traveling salesman problem based on ants with memory. In: 2008 Fourth International Conference on Natural Computation (ICNC), pp. 496\u2013501 (2008)","DOI":"10.1109\/ICNC.2008.354"},{"issue":"10","key":"76_CR16","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44(10), 2245\u20132269 (1965)","journal-title":"Bell Syst. Tech. J."},{"key":"76_CR17","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1155\/2016\/8932896","volume":"2016","author":"AM Mohsen","year":"2016","unstructured":"Mohsen, A.M.: Annealing ant colony optimization with mutation operator for solving TSP. Comput. Intell. Neurosci. 2016, 13 (2016)","journal-title":"Comput. Intell. Neurosci."},{"issue":"4","key":"76_CR18","doi-asserted-by":"publisher","first-page":"647","DOI":"10.20533\/ijicr.2042.4655.2015.0080","volume":"6","author":"H Mukhairez","year":"2015","unstructured":"Mukhairez, H., Maghari, A.: Performance comparison of simulated annealing, GA and ACO applied to TSP. Int. J. Intell. Comput. Res. 6(4), 647\u2013654 (2015)","journal-title":"Int. J. Intell. Comput. Res."},{"issue":"4","key":"76_CR19","first-page":"1","volume":"5","author":"V Selvi","year":"2010","unstructured":"Selvi, V., Umarani, R.: Comparative analysis of ant colony and particle swarm optimization techniques. Int. J. Comput. Appl. 5(4), 1\u20136 (2010)","journal-title":"Int. J. Comput. Appl."}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03493-1_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T00:29:11Z","timestamp":1775262551000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03493-1_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030034924","9783030034931"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03493-1_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"9 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IDEAL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Data Engineering and Automated Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"21 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ideal2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aida.ii.uam.es\/ideal2018\/#!\/main","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}