{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T14:05:51Z","timestamp":1726063551983},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030378370"},{"type":"electronic","value":"9783030378387"}],"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-3-030-37838-7_4","type":"book-chapter","created":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T20:02:45Z","timestamp":1577995365000},"page":"31-42","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Channel Assignment with Ant Colony Optimization"],"prefix":"10.1007","author":[{"given":"Marko","family":"Peras","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikola","family":"Ivkovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,3]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Buttar, A.S., Goel, A.K., Kumar, S.: Solving 55-cell benchmark frequency assignment problem by novel nature inspired algorithm. In: 2014 International Conference on Signal Processing and Integrated Networks (SPIN), pp. 407\u2013411, February 2014","DOI":"10.1109\/SPIN.2014.6776988"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ins.2014.09.039","volume":"295","author":"S Chatterjee","year":"2015","unstructured":"Chatterjee, S., Das, S.: Ant colony optimization based enhanced dynamic source routing algorithm for mobile ad-hoc network. Inf. Sci. 295, 67\u201390 (2015)","journal-title":"Inf. Sci."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Eisenbl\u00e4tter, A., Geerdes, H.F., Siomina, I.: Integrated access point placement and channel assignment for wireless LANs in an indoor office environment. In: Proceedings of the 8th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, June 2007","DOI":"10.1109\/WOWMOM.2007.4351711"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Ghosal, S., Ghosh, S.C.: Channel assignment in mobile networks based on geometric prediction and random coloring. In: 2015 IEEE 40th Conference on Local Computer Networks (LCN), pp. 237\u2013240, October 2015","DOI":"10.1109\/LCN.2015.7366315"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Ivkovic, N.: Ant colony algorithms for the travelling salesman problem and the quadratic assignment problem. In: Swarm Intelligence: Principles, Current Algorithms and Methods, Control, Robotics & Sensors, vol. 1, chap. 15, pp. 409\u2013442. Institution of Engineering and Technology (2018)","DOI":"10.1049\/PBCE119F_ch15"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"528","DOI":"10.17706\/jcp.11.6.528-536","volume":"11","author":"N Ivkovic","year":"2016","unstructured":"Ivkovic, N., Golub, M., Jakobovic, D.: Designing dna microarrays with ant colony optimization. JCP 11, 528\u2013536 (2016)","journal-title":"JCP"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Kari, C., Shashidhar, N., Kentros, S.: Distributed dynamic channel assignment in wireless networks. In: 2014 International Conference on Computing, Networking and Communications (ICNC), pp. 1113\u20131117, February 2014","DOI":"10.1109\/ICCNC.2014.6785495"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.procs.2018.07.262","volume":"126","author":"F Laidoui","year":"2018","unstructured":"Laidoui, F., Bessedik, M., Si-Tayeb, F.B., Bengherbia, N., Khelil, Y.: Nash-Pareto genetic algorithm for the frequency assignment problem. Procedia Comput. Sci. 126, 282\u2013291 (2018). Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 22nd International Conference, KES-2018, Belgrade, Serbia","journal-title":"Procedia Comput. Sci."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Leu, F., Liu, P.: A channel assignment and AP deployment scheme for concentric-hexagon based multi-channel wireless networks. In: 2010 13th International Conference on Network-Based Information Systems, pp. 504\u2013509, September 2010","DOI":"10.1109\/NBiS.2010.37"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-71615-0_10","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"F Luna","year":"2007","unstructured":"Luna, F., Alba, E., Nebro, A.J., Pedraza, S.: Evolutionary algorithms for real-world instances of the automatic frequency planning problem in GSM networks. In: Cotta, C., van Hemert, J. (eds.) Evolutionary Computation in Combinatorial Optimization, pp. 108\u2013120. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-71615-0_10"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Marappan, R., Sethumadhavan, G.: Solving channel allocation problem using new genetic algorithm with clique partitioning method. In: 2016 IEEE International Conference on Computational Intelligence and Computing Research (ICCIC), pp. 1\u20134, December 2016","DOI":"10.1109\/ICCIC.2016.7919671"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Novillo, F., Valdivieso, C., Velasquez, F.: Centralized channel assignment algorithm for OSA-enabled WLANs based on simulated annealing. In: 2015 7th IEEE Latin-American Conference on Communications (LATINCOM), pp. 1\u20136, November 2015","DOI":"10.1109\/LATINCOM.2015.7430136"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Peter, E.U., Olusegun, A.O.: A neural network and genetic algorithm scheme for optimal dynamic channel assignment in mobile networks. In: 2017 IEEE 3rd International Conference on Electro-Technology for National Development (NIGERCON), pp. 139\u2013144, November 2017","DOI":"10.1109\/NIGERCON.2017.8281887"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Sharma, P.C., Chaudhari, N.S.: Channel assignment problem in cellular network and its reduction to satisfiability using graph k-colorability. In: 2012 7th IEEE Conference on Industrial Electronics and Applications (ICIEA). pp. 1734\u20131737, July 2012","DOI":"10.1109\/ICIEA.2012.6361005"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Shukla, A., Tiwari, R., Rungta, S., Kumar, M.S.: A new heuristic channel assignment in cellular networks. In: 2009 WRI World Congress on Computer Science and Information Engineering, vol. 7, pp. 473\u2013478, March 2009","DOI":"10.1109\/CSIE.2009.795"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Valdivieso, C., Novillo, F., Gomez, J., Dik, D.: Centralized channel assignment algorithm for WSN based on simulated annealing in dense urban scenarios. In: 2016 8th IEEE Latin-American Conference on Communications (LATINCOM), pp. 1\u20136, November 2016","DOI":"10.1109\/LATINCOM.2016.7811603"}],"container-title":["Communications in Computer and Information Science","Swarm, Evolutionary, and Memetic Computing and Fuzzy and Neural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37838-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T20:10:34Z","timestamp":1577995834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37838-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030378370","9783030378387"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37838-7_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEMCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm, Evolutionary, and Memetic Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Maribor","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"semcco2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/semcco2019.org\/","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":"31","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":"15","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":"48% - 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":"3","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":"1.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)"}}]}}