{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T01:08:59Z","timestamp":1772759339994,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/cec.2012.6252941","type":"proceedings-article","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T20:51:10Z","timestamp":1344286270000},"page":"1-7","source":"Crossref","is-referenced-by-count":9,"title":["A discrete artificial bee colony algorithm for the traveling salesman problem with time windows"],"prefix":"10.1109","author":[{"given":"Korhan","family":"Karabulut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Fatih","family":"Tasgetiren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.009"},{"key":"17","author":"karaboga","year":"2005","journal-title":"An Idea Based on Honey Bee Swarm for Numerical Optimization"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9149-x"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2007.05.007"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2009.03.090"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1050.0145"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2008.11.003"},{"key":"11","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/opre.46.3.330","article-title":"A generalized insertion heuristic for the traveling salesman problem with time windows","volume":"46","author":"gendreau","year":"1998","journal-title":"Operations Research"},{"key":"12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/trsc.34.1.113.12284","article-title":"A new heuristic for the traveling salesman problem with time windows","volume":"34","author":"calvo","year":"2000","journal-title":"Transportation Science"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7825(01)00323-1"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7825(99)00389-8"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/0360-8352(96)00040-X"},{"key":"24","author":"mitsuo","year":"2000","journal-title":"Genetic Algorithms and Engineering Optimization"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6440(200009)83:9<1::AID-ECJC1>3.0.CO;2-U"},{"key":"26","first-page":"1019","article-title":"Constrained optimization by ? constrained particle swarm optimizer with ?-level control","author":"takahama","year":"2005","journal-title":"Proc of the 4th IEEE International Workshop on Soft Computing As Transdisciplinary Science and Technology (WSTST'05) May 2005"},{"key":"27","article-title":"Efficient Constrained Optimization by the ? Constrained Adaptive Differential Evolution","author":"takahama","year":"2010","journal-title":"WCCI 2010 IEEE World Congress on Computational Intelligence July 18-23 2010 Barcelona Spain"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2006.1688283"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.11.015"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.31.5.938"},{"key":"2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230110207","article-title":"State-space relaxation procedures for the computation of bounds to routing problems","volume":"11","author":"christofides","year":"1981","journal-title":"Networks"},{"key":"10","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1080\/15458830.1996.11770707","article-title":"Solving the traveling-salesman problem with time windows using tabu search","volume":"28","author":"carlton","year":"1996","journal-title":"IIE Transactions"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02022044"},{"key":"30","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.disopt.2010.04.002","article-title":"A general VNS heuristic for the traveling salesman problem with time windows","volume":"7","author":"silva","year":"2010","journal-title":"Discrete Optimization"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.14.4.403.2827"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.32.1.12"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.2.367"},{"key":"4","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1002\/net.3230230706","article-title":"A two-commodity flow formulation for the traveling salesman and makespan problems with time windows","volume":"23","author":"langevin","year":"1993","journal-title":"Networks"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.13.1.56.9748"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011432"}],"event":{"name":"2012 IEEE Congress on Evolutionary Computation (CEC)","location":"Brisbane, Australia","start":{"date-parts":[[2012,6,10]]},"end":{"date-parts":[[2012,6,15]]}},"container-title":["2012 IEEE Congress on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6241678\/6252855\/06252941.pdf?arnumber=6252941","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T15:37:21Z","timestamp":1562081841000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6252941\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/cec.2012.6252941","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}