{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:19Z","timestamp":1750221019101,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":14,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1145\/3335484.3335490","type":"proceedings-article","created":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T16:54:49Z","timestamp":1562604889000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["DDQO"],"prefix":"10.1145","author":[{"given":"Liang","family":"Dong","sequence":"first","affiliation":[{"name":"Future Network Innovation Center, Beijing University of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"AnKang","family":"Chu","sequence":"additional","affiliation":[{"name":"Future Network Innovation Center, Beijing University of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fengkui","family":"Liu","sequence":"additional","affiliation":[{"name":"China Electric Power Research Institute, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3335484.3335490-1","unstructured":"Chen Yingxin. Research on vehicle routing optimization based on improved ant colony algorithm. Application research, 2012 29(6): 2031--2034."},{"key":"key-10.1145\/3335484.3335490-2","unstructured":"Oscar M. González, Carlos Segura, S. Ivvan Valdez Peña, Coromoto León. A memetic algorithm for the Capacitated Vehicle Routing Problem with Time Windows[C]\/\/2017 IEEE Congress on Evolutionary Computation (CEC).San Sebastian, Spain: IEEE Press,2017: 2582--2589"},{"key":"key-10.1145\/3335484.3335490-3","unstructured":"Dorigo M, Colorni A, Maniezzo V. Distributed optimization by ant colonies. In:Proc 1st European Conf Artificaial Life. Pans, France: Rlsevier, 1991. 134~142"},{"key":"key-10.1145\/3335484.3335490-4","doi-asserted-by":"crossref","unstructured":"Metropolis N, Rosenblush A. Rosenbluth Metal, Equation of state calculations by fast computing machines [J]. Journal of Chemical Physics, 1953, 56(21): 1087--1092","DOI":"10.1063\/1.1699114"},{"key":"key-10.1145\/3335484.3335490-5","unstructured":"Chaoying Yin, Yanxia Mu. Simulated annealing algorithm to solve the sub-maximum short-circuit problem [J]. Scientific Outlook, 2015,25 (06), 231"},{"key":"key-10.1145\/3335484.3335490-6","doi-asserted-by":"crossref","unstructured":"Jakkrit.Kaewyotha,Wararat Songpan.A Study on Optimization Algorithm for Solving the Supermarket Shopping Path Problem[C]\/\/2018 3rd International Conference on Computer and Communication Systems (ICCCS).Nagoya, Japan:IEEE Press,2018: 11--15","DOI":"10.1109\/CCOMS.2018.8463247"},{"key":"key-10.1145\/3335484.3335490-7","unstructured":"Stutzle T,Hoos H. MAX-MIN ant system and local search for the traveling salesman problem\/\/Proceedings of the 4th IEEE International Conference on Evolutionary Computation. 1997: 309--314"},{"key":"key-10.1145\/3335484.3335490-8","unstructured":"Han Huang, Zhifeng Hao, Chunguo Wu, Yong Qin. The convergence speed of ant colony optimization. Chinese Journal of Computers. 2007,30(8): 1344--1353"},{"key":"key-10.1145\/3335484.3335490-9","doi-asserted-by":"crossref","unstructured":"Yamei Xia, Bo Cheng, Junliang Chen, Xiangwu Meng, Dong Liu. Service portfolio optimization based on improved ant colony algorithm. Journal of Computer Science.2012,35(2): 270--281","DOI":"10.3724\/SP.J.1016.2012.00270"},{"key":"key-10.1145\/3335484.3335490-10","unstructured":"Yabo Yuan, Yi Liu, Bin Wu. Improved ant colony algorithm for solving shortest path problem. Computer Engineering and Application. 2016,52(6): 8--12"},{"key":"key-10.1145\/3335484.3335490-11","unstructured":"Bo Liu, Peisheng Meng, using ant colony algorithm based on simulated annealing to solve the traveling salesman problem. Journal of Huazhong University of Science and Technology (natural science edition). 2009,37 (11), 26-30"},{"key":"key-10.1145\/3335484.3335490-12","unstructured":"Yuxian Zhang, Xiukun Ding, Dianchun Xue, Xiaoting Wang. Study on Improved Ant Colony Algorithm for Solving Traveling Salesman Problems. Computer Engineering and Science. 2017,.39 (8): 1576--1580"},{"key":"key-10.1145\/3335484.3335490-13","unstructured":"Minghai Yao, Na Wang. Solving TSP problem based on Improved Simulated Annealing Algorithm. Journal of Bohai University (Natural Science Edition). 2013.34 (1): 79--84"},{"key":"key-10.1145\/3335484.3335490-14","unstructured":"Zhiwei Ye, Zhaobao Zheng. Study on Parameter Setting in Ant Colony Algorithm ---- Taking TSP Problem as an example. Journal of Wuhan university.2004, 29(7): 597--601"}],"event":{"number":"4","sponsor":["Shenzhen University","Sun Yat-Sen University"],"acronym":"ICBDC 2019","name":"the 2019 4th International Conference","start":{"date-parts":[[2019,5,10]]},"location":"Guangzhou, China","end":{"date-parts":[[2019,5,12]]}},"container-title":["Proceedings of the 2019 4th International Conference on Big Data and Computing  - ICBDC 2019"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3335484.3335490","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3335490&ftid=2070093&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:19Z","timestamp":1750206379000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3335484.3335490"}},"subtitle":["An Algorithm for Distributed Database Query Optimization"],"proceedings-subject":"Big Data and Computing","short-title":[],"issued":{"date-parts":[[2019]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1145\/3335484.3335490","relation":{},"subject":[],"published":{"date-parts":[[2019]]}}}