{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T20:13:21Z","timestamp":1720296801751},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Industrial Engineering"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1016\/j.cie.2019.06.045","type":"journal-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T23:13:22Z","timestamp":1561072402000},"page":"628-642","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A new use of the ant system algorithm for the max-mean dispersion problem"],"prefix":"10.1016","volume":"135","author":[{"given":"Tunchan","family":"Cura","sequence":"first","affiliation":[]},{"given":"Muhlis","family":"\u00d6zdemir","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.cie.2019.06.045_b0005","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1111\/j.1475-3995.2005.497_1.x","article-title":"Maximum diversity\/similarity models with extension to part grouping","volume":"12","author":"Adil","year":"2005","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.cie.2019.06.045_b0010","article-title":"An Ant Colony Optimization approach to the maximum diversity problem","volume":"109","author":"Aringhieri","year":"2007","journal-title":"Note del Polo"},{"issue":"1","key":"10.1016\/j.cie.2019.06.045_b0015","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10288-007-0033-9","article-title":"Tabu search versus GRASP for the maximum diversity problem","volume":"6","author":"Aringhieri","year":"2008","journal-title":"4OR"},{"issue":"2","key":"10.1016\/j.cie.2019.06.045_b0020","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1057\/jors.2010.104","article-title":"Comparing local search metaheuristics for the maximum diversity problem","volume":"62","author":"Aringhieri","year":"2011","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"10.1016\/j.cie.2019.06.045_b0025","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.ejor.2014.09.058","article-title":"Construction and improvement algorithms for dispersion problems","volume":"242","author":"Aringhieri","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2019.06.045_b0030","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.ins.2016.12.021","article-title":"Less is more: Solving the max-mean diversity problem with variable neighborhood search","volume":"382","author":"Brimberg","year":"2017","journal-title":"Information Sciences"},{"key":"10.1016\/j.cie.2019.06.045_b0035","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/j.knosys.2015.05.011","article-title":"Tabu search for the max\u2013mean dispersion problem","volume":"85","author":"Carrasco","year":"2015","journal-title":"Knowledge-Based Systems"},{"issue":"8","key":"10.1016\/j.cie.2019.06.045_b0040","doi-asserted-by":"crossref","first-page":"2429","DOI":"10.1016\/j.cor.2008.09.007","article-title":"A heuristic approach for the max\u2013min diversity problem based on max-clique","volume":"36","author":"Della Croce","year":"2009","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2019.06.045_b0045","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.cor.2016.01.003","article-title":"A hybrid three-phase approach for the max-mean dispersion problem","volume":"71","author":"Della Croce","year":"2016","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.cie.2019.06.045_b0050","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","article-title":"A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms","volume":"1","author":"Derrac","year":"2011","journal-title":"Swarm and Evolutionary Computation"},{"issue":"1","key":"10.1016\/j.cie.2019.06.045_b0055","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1198\/073500102753410444","article-title":"Comparing predictive accuracy","volume":"20","author":"Diebold","year":"2002","journal-title":"Journal of Business & Economic Statistics"},{"issue":"4","key":"10.1016\/j.cie.2019.06.045_b0060","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.3390\/en11041009","article-title":"A hybrid seasonal mechanism with a chaotic cuckoo search algorithm with a support vector regression model for electric load forecasting","volume":"11","author":"Dong","year":"2018","journal-title":"Energies"},{"issue":"1","key":"10.1016\/j.cie.2019.06.045_b0065","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","article-title":"Ant system: Optimization by a colony of cooperating agents","volume":"26","author":"Dorigo","year":"1996","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics"},{"issue":"1","key":"10.1016\/j.cie.2019.06.045_b0070","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.ejor.2006.01.021","article-title":"Tabu search and GRASP for the maximum diversity problem","volume":"178","author":"Duarte","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2019.06.045_b0075","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.ins.2014.10.010","article-title":"Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization","volume":"296","author":"Duarte","year":"2015","journal-title":"Information Sciences"},{"key":"10.1016\/j.cie.2019.06.045_b0080","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.apenergy.2018.04.075","article-title":"Short term load forecasting based on phase space reconstruction algorithm and bi-square kernel regression model","volume":"224","author":"Fan","year":"2018","journal-title":"Applied Energy"},{"issue":"3","key":"10.1016\/j.cie.2019.06.045_b0085","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s10589-007-9161-6","article-title":"Hybrid heuristics for the maximum diversity problem","volume":"44","author":"Gallego","year":"2009","journal-title":"Computational Optimization and Applications"},{"issue":"4","key":"10.1016\/j.cie.2019.06.045_b0090","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0167-6377(96)00025-9","article-title":"Computational aspects of the maximum diversity problem","volume":"19","author":"Ghosh","year":"1996","journal-title":"Operations Research Letters"},{"issue":"1","key":"10.1016\/j.cie.2019.06.045_b0095","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1080\/02522667.1998.10699366","article-title":"Heuristic algorithms for the maximum diversity problem","volume":"19","author":"Glover","year":"1998","journal-title":"Journal of information and Optimization Sciences"},{"key":"10.1016\/j.cie.2019.06.045_b0100","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/j.endm.2014.11.033","article-title":"VNS variants for the max-mean dispersion problem","volume":"47","author":"Gort\u00e1zar","year":"2015","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"10.1016\/j.cie.2019.06.045_b0105","series-title":"Proceedings of the 2008 SIAM international conference on data mining","first-page":"346","article-title":"The pagetrust algorithm: How to rank web pages when negative links are allowed?","author":"Kerchove","year":"2008"},{"key":"10.1016\/j.cie.2019.06.045_b0110","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.cor.2016.02.016","article-title":"A tabu search based memetic algorithm for the max-mean dispersion problem","volume":"72","author":"Lai","year":"2016","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.cie.2019.06.045_b0115","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ejor.2008.12.023","article-title":"A branch and bound algorithm for the maximum diversity problem","volume":"200","author":"Mart\u00ed","year":"2010","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"10.1016\/j.cie.2019.06.045_b0120","doi-asserted-by":"crossref","first-page":"3091","DOI":"10.1016\/j.cor.2012.04.005","article-title":"GRASP and path relinking for the equitable dispersion problem","volume":"40","author":"Mart\u00ed","year":"2013","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.cie.2019.06.045_b0125","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.amc.2006.11.090","article-title":"Iterated tabu search for the maximum diversity problem","volume":"189","author":"Palubeckis","year":"2007","journal-title":"Applied Mathematics and Computation"},{"issue":"1","key":"10.1016\/j.cie.2019.06.045_b0130","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10479-011-0898-z","article-title":"A simple and effective algorithm for the MaxMin diversity problem","volume":"186","author":"Porumbel","year":"2011","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/j.cie.2019.06.045_b0135","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.ejor.2008.06.005","article-title":"The equitable dispersion problem","volume":"197","author":"Prokopyev","year":"2009","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.cie.2019.06.045_b0140","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.cor.2008.05.011","article-title":"GRASP and path relinking for the max\u2013min diversity problem","volume":"37","author":"Resende","year":"2010","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2019.06.045_b0145","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.cor.2013.09.017","article-title":"MaxMinMin p-dispersion problem: A variable neighborhood search approach","volume":"52","author":"Saboonchi","year":"2014","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2019.06.045_b0150","series-title":"Recent advances on meta-heuristics and their application to real scenarios","article-title":"Grasp and path relinking to solve the problem of selecting efficient work teams","author":"Sandoya","year":"2013"},{"key":"10.1016\/j.cie.2019.06.045_b0155","first-page":"1","article-title":"An effective multi-wave algorithm for solving the max-mean dispersion problem","author":"Song","year":"2018","journal-title":"Journal of Heuristics"},{"issue":"8","key":"10.1016\/j.cie.2019.06.045_b0160","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"MAX\u2013MIN ant system","volume":"16","author":"St\u00fctzle","year":"2000","journal-title":"Future Generation Computer Systems"},{"issue":"2","key":"10.1016\/j.cie.2019.06.045_b0165","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/j.ejor.2013.06.002","article-title":"A hybrid metaheuristic method for the maximum diversity problem","volume":"231","author":"Wu","year":"2013","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"10.1016\/j.cie.2019.06.045_b0170","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1109\/TKDE.2007.1061","article-title":"Community mining from signed social networks","volume":"19","author":"Yang","year":"2007","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835219303754?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835219303754?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T11:41:55Z","timestamp":1568115715000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835219303754"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":34,"alternative-id":["S0360835219303754"],"URL":"https:\/\/doi.org\/10.1016\/j.cie.2019.06.045","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2019,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A new use of the ant system algorithm for the max-mean dispersion problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Industrial Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cie.2019.06.045","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}