{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:32:29Z","timestamp":1729614749102,"version":"3.28.0"},"reference-count":8,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icsmc.2003.1245638","type":"proceedings-article","created":{"date-parts":[[2004,4,23]],"date-time":"2004-04-23T18:38:15Z","timestamp":1082745495000},"page":"4159-4164","source":"Crossref","is-referenced-by-count":0,"title":["A normalized minimum cross-entropy pheromone updating rule for ACO algorithm"],"prefix":"10.1109","volume":"5","author":[{"family":"Xiao-Rong Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Tie-Jun Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"21","article-title":"Updating ACO pheromones using Stochastic Gradient Ascent and Cross-Entropy methods","author":"dorigo","year":"0","journal-title":"Proceedings of the EvoWorkshops 2002 LNCS 2279"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/S0954-1810(99)00021-7","article-title":"A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines","volume":"13","author":"liu","year":"1999","journal-title":"Artificial Intelligence in Engineering"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00044-3"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/WCICA.2002.1022069"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-6594-6_14","article-title":"Combinatorial optimization, cross-entropy, ants and rare events","author":"rubinstein","year":"2001","journal-title":"Stochastic Optimization Algorithms and Application"},{"key":"ref2","first-page":"476","article-title":"Ant syatem baesd algorithm for scheduling problem","volume":"17","author":"chen","year":"2002","journal-title":"Journal of Systems Engineering"},{"key":"ref1","first-page":"399","article-title":"HC-ACO. The hyper-cube framework for Ant Colony Optimization","volume":"2","author":"blum","year":"2001","journal-title":"Proceedings of MIC'2001 - Meta-heuristics International Conference"}],"event":{"name":"SMC '03 2003 IEEE International Conference on Systems, Man and Cybernetics","acronym":"ICSMC-03","location":"Washington, DC, USA"},"container-title":["SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8811\/27913\/01245638.pdf?arnumber=1245638","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T06:22:40Z","timestamp":1497594160000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1245638\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":8,"URL":"https:\/\/doi.org\/10.1109\/icsmc.2003.1245638","relation":{},"subject":[]}}