{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:46Z","timestamp":1750220746635,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,3,21]],"date-time":"2020-03-21T00:00:00Z","timestamp":1584748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Internal Grant Agency of University of Economics, Prague","award":["F4\/53\/2019"],"award-info":[{"award-number":["F4\/53\/2019"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,3,21]]},"DOI":"10.1145\/3396474.3396485","type":"proceedings-article","created":{"date-parts":[[2020,5,30]],"date-time":"2020-05-30T12:35:11Z","timestamp":1590842111000},"page":"47-51","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Ant Colony Optimization for Time-Dependent Travelling Salesman Problem"],"prefix":"10.1145","author":[{"given":"Petra","family":"Tomanov\u00e1","sequence":"first","affiliation":[{"name":"University of Economics, Prague, Czech Republic"}]},{"given":"Vladim\u00edr","family":"Hol\u00fd","sequence":"additional","affiliation":[{"name":"University of Economics, Prague, Czech Republic"}]}],"member":"320","published-online":{"date-parts":[[2020,5,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/321043.321046"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Picard J. C. and Queyranne M. 1978. The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Operations research 26(1) 86--110.  Picard J. C. and Queyranne M. 1978. The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Operations research 26(1) 86--110.","DOI":"10.1287\/opre.26.1.86"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.4.1018"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.11.019"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)E0238-S"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6750(199609)43:6<797::AID-NAV2>3.0.CO;2-#"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2008.04.001"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0047-y"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00299-1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.036701"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Schneider J. 2002. The time-dependent traveling salesman problem. Physica A: Statistical Mechanics and its Applications 314(1-4) 151--155.  Schneider J. 2002. The time-dependent traveling salesman problem. Physica A: Statistical Mechanics and its Applications 314(1-4) 151--155.","DOI":"10.1016\/S0378-4371(02)01078-6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.11.038"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJISTA.2019.097744"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.04.024"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Dorigo M. and Gambardella L. M. 1997. Ant colonies for the travelling salesman problem. biosystems 43(2) 73--81.  Dorigo M. and Gambardella L. M. 1997. Ant colonies for the travelling salesman problem. biosystems 43(2) 73--81.","DOI":"10.1016\/S0303-2647(97)01708-5"},{"key":"e_1_3_2_1_16_1","unstructured":"Hol\u00fd V. and Tomanov\u00e1 P. 2017. \u0158e\u0161en\u00ed \u010dasov\u011b z\u00e1visl\u00e9 \u00falohy obchodn\u00edho cestuj\u00edc\u00edch pomoc\u00ed optimalizace mraven\u010d\u00ed koloni\u00ed a lok\u00e1ln\u00edho vyhled\u00e1v\u00e1n\u00ed. Vyu\u017eitie kvantitat\u00edvnych met\u00f3d vo vedecko-v\u00fdskumnej \u010dinnosti a v praxi XII. Bratislava: Ekon\u00f3m 75--81.  Hol\u00fd V. and Tomanov\u00e1 P. 2017. \u0158e\u0161en\u00ed \u010dasov\u011b z\u00e1visl\u00e9 \u00falohy obchodn\u00edho cestuj\u00edc\u00edch pomoc\u00ed optimalizace mraven\u010d\u00ed koloni\u00ed a lok\u00e1ln\u00edho vyhled\u00e1v\u00e1n\u00ed. Vyu\u017eitie kvantitat\u00edvnych met\u00f3d vo vedecko-v\u00fdskumnej \u010dinnosti a v praxi XII. Bratislava: Ekon\u00f3m 75--81."}],"event":{"name":"ISMSI '20: 2020 4th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","sponsor":["University of Delhi"],"location":"Thimphu Bhutan","acronym":"ISMSI '20"},"container-title":["Proceedings of the 2020 4th International Conference on Intelligent Systems, Metaheuristics &amp; Swarm Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3396474.3396485","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3396474.3396485","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:46Z","timestamp":1750199926000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3396474.3396485"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,21]]},"references-count":16,"alternative-id":["10.1145\/3396474.3396485","10.1145\/3396474"],"URL":"https:\/\/doi.org\/10.1145\/3396474.3396485","relation":{},"subject":[],"published":{"date-parts":[[2020,3,21]]},"assertion":[{"value":"2020-05-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}