{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T11:18:09Z","timestamp":1762341489595,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,8]]},"DOI":"10.1145\/3377929.3398081","type":"proceedings-article","created":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T15:27:01Z","timestamp":1598455621000},"page":"1434-1440","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["gBeam-ACO"],"prefix":"10.1145","author":[{"given":"Jeff","family":"Hajewski","sequence":"first","affiliation":[{"name":"University of Iowa"}]},{"given":"Suely","family":"Oliveira","sequence":"additional","affiliation":[{"name":"University of Iowa"}]},{"given":"David E.","family":"Stewart","sequence":"additional","affiliation":[{"name":"University of Iowa"}]},{"given":"Laura","family":"Weiler","sequence":"additional","affiliation":[{"name":"University of Iowa"}]}],"member":"320","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Balancing Exploration and Exploitation by an Elitist Ant System with Exponential Pheromone Deposition Rule. CoRR abs\/0811.0131","author":"Acharya Ayan","year":"2008","unstructured":"Ayan Acharya , Deepyaman Maiti , Aritra Banerjee , and Amit Konar . 2008. Balancing Exploration and Exploitation by an Elitist Ant System with Exponential Pheromone Deposition Rule. CoRR abs\/0811.0131 ( 2008 ). arXiv:0811.0131 Ayan Acharya, Deepyaman Maiti, Aritra Banerjee, and Amit Konar. 2008. Balancing Exploration and Exploitation by an Elitist Ant System with Exponential Pheromone Deposition Rule. CoRR abs\/0811.0131 (2008). arXiv:0811.0131"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2003.11.018"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1080.0271"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FUZZY.2007.4295615"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the Asia-Pacific advanced network 34","author":"Chengming LI","year":"2013","unstructured":"LI Chengming , LIU Wenjing , and Koji Okamura . 2013 . A greedy ant colony forwarding algorithm for named data networking . Proceedings of the Asia-Pacific advanced network 34 (2013), 17--26. LI Chengming, LIU Wenjing, and Koji Okamura. 2013. A greedy ant colony forwarding algorithm for named data networking. Proceedings of the Asia-Pacific advanced network 34 (2013), 17--26."},{"key":"e_1_3_2_1_6_1","unstructured":"Paul D Coddington. 1997. Random number generators for parallel computers. (1997).  Paul D Coddington. 1997. Random number generators for parallel computers. (1997)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01397554"},{"key":"e_1_3_2_1_9_1","volume-title":"Thomas St\u00fctzle, et al.","author":"Dorigo Marco","year":"2004","unstructured":"Marco Dorigo , Directeur de Recherches Du Fnrs Marco , Thomas St\u00fctzle, et al. 2004 . Ant Colony Optimization. MIT Press . Marco Dorigo, Directeur de Recherches Du Fnrs Marco, Thomas St\u00fctzle, et al. 2004. Ant Colony Optimization. MIT Press."},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 2005 International Conference on Artificial Intelligence, ICAI 2005","volume":"1","author":"Gaertner Dorian","year":"2005","unstructured":"Dorian Gaertner and Keith L. Clark . 2005. On Optimal Parameters for Ant Colony Optimization Algorithms . In Proceedings of the 2005 International Conference on Artificial Intelligence, ICAI 2005 , Las Vegas, Nevada, USA , June 27-30, 2005 , Volume 1 , Hamid R. Arabnia and Rose Joshua (Eds.). CSREA Press, 83--89. Dorian Gaertner and Keith L. Clark. 2005. On Optimal Parameters for Ant Colony Optimization Algorithms. In Proceedings of the 2005 International Conference on Artificial Intelligence, ICAI 2005, Las Vegas, Nevada, USA, June 27-30, 2005, Volume 1, Hamid R. Arabnia and Rose Joshua (Eds.). CSREA Press, 83--89."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.01.039"},{"volume-title":"The traveling salesman problem and its variations","author":"Gutin Gregory","key":"e_1_3_2_1_12_1","unstructured":"Gregory Gutin and Abraham P Punnen . 2006. The traveling salesman problem and its variations . Vol. 12 . Springer Science & Business Media . Gregory Gutin and Abraham P Punnen. 2006. The traveling salesman problem and its variations. Vol. 12. Springer Science & Business Media."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8790219"},{"key":"e_1_3_2_1_14_1","volume-title":"Jaradat and Masri Ayob","author":"Ghaith","year":"2010","unstructured":"Ghaith M. Jaradat and Masri Ayob . 2010 . An Elitist-Ant System for Solving the Post-Enrolment Course Timetabling Problem. In Database Theory and Application, Bio-Science and Bio-Technology - International Conferences, DTA and BSBT 2010, Held as Part of the Future Generation Information Technology Conference, FGIT 2010, Jeju Island , Korea, December 13-15, 2010. Proceedings (Communications in Computer and Information Science), Yanchun Zhang, Alfredo Cuzzocrea, Jianhua Ma, Kyo-Il Chung, Tughrul Arslan, and Xiaofeng Song (Eds.), Vol. 118. Springer, 167--176. Ghaith M. Jaradat and Masri Ayob. 2010. An Elitist-Ant System for Solving the Post-Enrolment Course Timetabling Problem. In Database Theory and Application, Bio-Science and Bio-Technology - International Conferences, DTA and BSBT 2010, Held as Part of the Future Generation Information Technology Conference, FGIT 2010, Jeju Island, Korea, December 13-15, 2010. Proceedings (Communications in Computer and Information Science), Yanchun Zhang, Alfredo Cuzzocrea, Jianhua Ma, Kyo-Il Chung, Tughrul Arslan, and Xiaofeng Song (Eds.), Vol. 118. Springer, 167--176."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"S. Kirkpatrick C. D. Gelatt and M. P. Vecchi. 1983. Optimization by simulated annealing. SCIENCE 220 4598 (1983) 671--680.  S. Kirkpatrick C. D. Gelatt and M. P. Vecchi. 1983. Optimization by simulated annealing. SCIENCE 220 4598 (1983) 671--680.","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2013.07.010"},{"key":"e_1_3_2_1_17_1","volume-title":"Beam-ACO for the travelling salesman problem with time windows. Computers & operations research 37, 9","author":"L\u00f3pez-Ib\u00e1\u00f1ez Manuel","year":"2010","unstructured":"Manuel L\u00f3pez-Ib\u00e1\u00f1ez and Christian Blum . 2010. Beam-ACO for the travelling salesman problem with time windows. Computers & operations research 37, 9 ( 2010 ), 1570--1583. Manuel L\u00f3pez-Ib\u00e1\u00f1ez and Christian Blum. 2010. Beam-ACO for the travelling salesman problem with time windows. Computers & operations research 37, 9 (2010), 1570--1583."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/358407.358427"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(77)90026-1"},{"key":"e_1_3_2_1_20_1","volume-title":"PCG: A Family of Simple Fast Space-Efficient Statistically Good Algorithms for Random Number Generation. Technical Report HMC-CS-2014-0905","author":"O'Neill Melissa E.","year":"2014","unstructured":"Melissa E. O'Neill . 2014 . PCG: A Family of Simple Fast Space-Efficient Statistically Good Algorithms for Random Number Generation. Technical Report HMC-CS-2014-0905 . Harvey Mudd College , Claremont, CA . Melissa E. O'Neill. 2014. PCG: A Family of Simple Fast Space-Efficient Statistically Good Algorithms for Random Number Generation. Technical Report HMC-CS-2014-0905. Harvey Mudd College, Claremont, CA."},{"key":"e_1_3_2_1_21_1","unstructured":"Gerhard Reinelt. [n. d.]. TSPLIB. ([n. d.]). GerhardReinelt  Gerhard Reinelt. [n. d.]. TSPLIB. ([n. d.]). GerhardReinelt"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48661-5"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04918-7_3"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2011.6162354"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2011.10.028"},{"key":"e_1_3_2_1_28_1","volume-title":"Jordan Tyler Thayer, and Wheeler Ruml","author":"Wilt Christopher Makoto","year":"2010","unstructured":"Christopher Makoto Wilt , Jordan Tyler Thayer, and Wheeler Ruml . 2010 . A comparison of greedy search algorithms. In third annual symposium on combinatorial search. Christopher Makoto Wilt, Jordan Tyler Thayer, and Wheeler Ruml. 2010. A comparison of greedy search algorithms. In third annual symposium on combinatorial search."},{"key":"e_1_3_2_1_29_1","unstructured":"Weixiong Zhang. 1998. Complete anytime beam search. In AAAI\/IAAI. 425--430.  Weixiong Zhang. 1998. Complete anytime beam search. In AAAI\/IAAI. 425--430."}],"event":{"name":"GECCO '20: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Canc\u00fan Mexico","acronym":"GECCO '20"},"container-title":["Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377929.3398081","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3377929.3398081","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:55Z","timestamp":1750199935000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377929.3398081"}},"subtitle":["a greedy and faster variant of Beam-ACO"],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":28,"alternative-id":["10.1145\/3377929.3398081","10.1145\/3377929"],"URL":"https:\/\/doi.org\/10.1145\/3377929.3398081","relation":{},"subject":[],"published":{"date-parts":[[2020,7,8]]},"assertion":[{"value":"2020-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}