{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T07:02:29Z","timestamp":1726470149466},"reference-count":56,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["2017-05617","2020-06311"],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1016\/j.cor.2021.105507","type":"journal-article","created":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T15:22:56Z","timestamp":1629472976000},"page":"105507","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Visual attractiveness in vehicle routing via bi-objective optimization"],"prefix":"10.1016","volume":"137","author":[{"given":"Diego","family":"Rocha","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Aloise","sequence":"additional","affiliation":[]},{"given":"Dario J.","family":"Aloise","sequence":"additional","affiliation":[]},{"given":"Claudio","family":"Contardo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"2013","series-title":"Data Clustering: Algorithms and Applications","author":"Aggarwal","key":"10.1016\/j.cor.2021.105507_b0005"},{"key":"10.1016\/j.cor.2021.105507_b0010","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","article-title":"Np-hardness of Euclidean sum-of-squares clustering","volume":"75","author":"Aloise","year":"2009","journal-title":"Machine Learning"},{"key":"10.1016\/j.cor.2021.105507_b0015","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1109\/TPAMI.2010.85","article-title":"Coordination of cluster ensembles via exact methods","volume":"33","author":"Christou","year":"2011","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/j.cor.2021.105507_b0020","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clarke","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/j.cor.2021.105507_b0025","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/j.ejor.2015.01.042","article-title":"The mixed capacitated arc routing problem with non-overlapping routes","volume":"244","author":"Constantino","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2021.105507_b0030","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.21748","article-title":"Aesthetic considerations for the min-max k-windy rural postman problem","volume":"70","author":"Corber\u00e1n","year":"2017","journal-title":"Networks"},{"key":"10.1016\/j.cor.2021.105507_b0035","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Management Science"},{"key":"10.1016\/j.cor.2021.105507_b0040","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/opre.2.4.393","article-title":"Solution of a large-scale traveling-salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Journal of the Operations Research Society of America"},{"key":"10.1016\/j.cor.2021.105507_b0045","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1093\/comjnl\/20.4.364","article-title":"An efficient algorithm for a complete link method","volume":"20","author":"Defays","year":"1977","journal-title":"The Computer Journal"},{"key":"10.1016\/j.cor.2021.105507_b0050","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1109\/TPAMI.1980.4767027","article-title":"Bicriterion cluster analysis","volume":"4","author":"Delattre","year":"1980","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/j.cor.2021.105507_b0055","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/j.ejor.2013.08.002","article-title":"The bi-objective pollution-routing problem","volume":"232","author":"Demir","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2021.105507_b0060","doi-asserted-by":"crossref","first-page":"362","DOI":"10.2307\/2528096","article-title":"A method for cluster analysis","author":"Edwards","year":"1965","journal-title":"Biometrics"},{"key":"10.1016\/j.cor.2021.105507_b0065","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","article-title":"A generalized assignment heuristic for vehicle routing","volume":"11","author":"Fisher","year":"1981","journal-title":"Networks"},{"key":"10.1016\/j.cor.2021.105507_b0070","first-page":"768","article-title":"Cluster analysis of multivariate data: efficiency versus interpretability of classifications","volume":"21","author":"Forgy","year":"1965","journal-title":"Biometrics"},{"key":"10.1016\/j.cor.2021.105507_b0075","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.cor.2004.07.001","article-title":"A multiplicatively-weighted voronoi diagram approach to logistics districting","volume":"33","author":"Galv\u00e3o","year":"2006","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cor.2021.105507_b0080","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","article-title":"A heuristic algorithm for the vehicle dispatch problem","volume":"22","author":"Gillet","year":"1974","journal-title":"Operations Research"},{"key":"10.1016\/j.cor.2021.105507_b0085","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","article-title":"A heuristic algorithm for the vehicle-dispatch problem","volume":"22","author":"Gillett","year":"1974","journal-title":"Operations Research"},{"key":"10.1016\/j.cor.2021.105507_b0090","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0305-0548(84)90007-8","article-title":"The fleet size and mix vehicle routing problem","volume":"11","author":"Golden","year":"1984","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cor.2021.105507_b0095","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1080\/01621459.1978.10481589","article-title":"Complete-link cluster analysis by graph coloring","volume":"73","author":"Hansen","year":"1978","journal-title":"Journal of the American Statistical Association"},{"key":"10.1016\/j.cor.2021.105507_b0100","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02614317","article-title":"Cluster analysis and mathematical programming","volume":"79","author":"Hansen","year":"1997","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.cor.2021.105507_b0105","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","article-title":"Variable neighborhood search: basics and variants","volume":"5","author":"Hansen","year":"2017","journal-title":"EURO Journal of Computational Optimization"},{"key":"10.1016\/j.cor.2021.105507_b0110","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1016\/j.ejor.2005.11.070","article-title":"Designing delivery districts for the vehicle routing problem with stochastic demands","volume":"180","author":"Haugland","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2021.105507_b0115","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0925-5273(98)00250-3","article-title":"A heuristic for bi-objective vehicle routing with time window constraints","volume":"62","author":"Hong","year":"1999","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.cor.2021.105507_b0120","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","article-title":"Data clustering: a review","volume":"31","author":"Jain","year":"1999","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"10.1016\/j.cor.2021.105507_b0125","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1287\/inte.1070.0331","article-title":"Coca-cola enterprises optimizes vehicle routes for efficient product delivery","volume":"38","author":"Kant","year":"2008","journal-title":"Interfaces"},{"key":"10.1016\/j.cor.2021.105507_b0130","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/j.asoc.2014.11.005","article-title":"A survey of genetic algorithms for solving multi depot vehicle routing problem","volume":"27","author":"Karakatic","year":"2015","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.cor.2021.105507_b0135","doi-asserted-by":"crossref","first-page":"3624","DOI":"10.1016\/j.cor.2005.02.045","article-title":"Waste collection vehicle routing problem with time windows","volume":"33","author":"Kim","year":"2006","journal-title":"Computers & Operations Research"},{"first-page":"439","year":"2015","series-title":"A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems","author":"Kloim\u00fcllner","key":"10.1016\/j.cor.2021.105507_b0140"},{"key":"10.1016\/j.cor.2021.105507_b0145","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1002\/net.21565","article-title":"Vehicle routing problems in which consistency considerations are important: A survey","volume":"64","author":"Kovacs","year":"2014","journal-title":"Networks"},{"key":"10.1016\/j.cor.2021.105507_b0150","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1002\/net.3230230706","article-title":"A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows","volume":"23","author":"Langevin","year":"1993","journal-title":"Networks"},{"key":"10.1016\/j.cor.2021.105507_b0155","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1287\/opre.33.5.1050","article-title":"Optimal routing under capacity and distance restrictions","volume":"33","author":"Laporte","year":"1985","journal-title":"Operations Research"},{"key":"10.1016\/j.cor.2021.105507_b0160","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","article-title":"Complexity of vehicle routing and scheduling problems","volume":"11","author":"Lenstra","year":"1981","journal-title":"Networks"},{"key":"10.1016\/j.cor.2021.105507_b0165","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1016\/j.ejor.2005.05.012","article-title":"A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows","volume":"175","author":"Lu","year":"2006","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2021.105507_b0170","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1002\/net.21730","article-title":"Partitioning a street network into compact, balanced, and visually appealing routes","volume":"69","author":"Lum","year":"2017","journal-title":"Networks"},{"key":"10.1016\/j.cor.2021.105507_b0175","doi-asserted-by":"crossref","first-page":"230","DOI":"10.3846\/1648-4142.2008.23.230-235","article-title":"Decision support system for solving the street routing problem","volume":"23","author":"Matis","year":"2008","journal-title":"Transport"},{"key":"10.1016\/j.cor.2021.105507_b0180","first-page":"1","article-title":"A cluster-first route-second approach for the swap body vehicle routing problem","author":"Miranda-Bront","year":"2016","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.cor.2021.105507_b0185","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1057\/jors.1976.95","article-title":"A sequential route-building algorithm employing a generalised savings criterion","volume":"27","author":"Mole","year":"1976","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.cor.2021.105507_b0190","doi-asserted-by":"crossref","first-page":"1028","DOI":"10.1016\/j.ejor.2006.02.030","article-title":"Column generation based heuristic for tactical planning in multi-period vehicle routing","volume":"183","author":"Mourgaya","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2021.105507_b0195","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1016\/S0377-2217(98)00344-0","article-title":"Designing multi-vehicle delivery tours in a grid-cell format","volume":"119","author":"Novaes","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2021.105507_b0200","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1016\/S0305-0548(99)00063-5","article-title":"A continuous approach to the design of physical distribution systems","volume":"27","author":"Novaes","year":"2000","journal-title":"Computers & Operations Research"},{"journal-title":"Librairie Droz","article-title":"Cours d\u2019\u00e9conomie politique, vol. 1","year":"1964","author":"Pareto","key":"10.1016\/j.cor.2021.105507_b0205"},{"key":"10.1016\/j.cor.2021.105507_b0210","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1057\/palgrave\/jors\/2601252","article-title":"A savings based method for real-life vehicle routing problems","volume":"53","author":"Poot","year":"2002","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.cor.2021.105507_b0215","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","article-title":"A simple and effective evolutionary algorithm for the vehicle routing problem","volume":"31","author":"Prins","year":"2004","journal-title":"Computers & OR"},{"key":"10.1016\/j.cor.2021.105507_b0220","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1016\/j.ejor.2015.09.009","article-title":"Fuel emissions optimization in vehicle routing problems with time-varying speeds","volume":"248","author":"Qian","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2021.105507_b0225","first-page":"749","article-title":"Improving visual attractiveness in capacitated vehicle routing problems: a heuristic algorithm","author":"Rossit","year":"2016","journal-title":"XVIII Latin-Iberoamerican Conference on Operations Research-CLAIO"},{"key":"10.1016\/j.cor.2021.105507_b0230","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.cor.2018.10.012","article-title":"Visual attractiveness in routing problems: A review","volume":"103","author":"Rossit","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cor.2021.105507_b0235","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/inte.1040.0109","article-title":"Routing optimization for waste management","volume":"35","author":"Sahoo","year":"2005","journal-title":"Interfaces"},{"key":"10.1016\/j.cor.2021.105507_b0240","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","article-title":"Parallel iterative search methods for vehicle routing problems","volume":"23","author":"Taillard","year":"1993","journal-title":"Networks"},{"key":"10.1016\/j.cor.2021.105507_b0245","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","article-title":"A tabu search heuristic for the vehicle routing problem with soft time windows","volume":"31","author":"Taillard","year":"1997","journal-title":"Transportation Science"},{"key":"10.1016\/j.cor.2021.105507_b0250","first-page":"9","article-title":"Interactive heuristic for practical vehicle routing problem with solution shape constraints","volume":"2006","author":"Tang","year":"1964","journal-title":"Transportation Research Record"},{"key":"10.1016\/j.cor.2021.105507_b0255","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1287\/trsc.2015.0584","article-title":"Large neighborhoods with implicit customer selection for vehicle routing problems with profits","volume":"50","author":"Vidal","year":"2016","journal-title":"Transportation Science"},{"journal-title":"na","article-title":"Aggregation of binary relations: algorithmic and polyhedral investigations","year":"1986","author":"Wakabayashi","key":"10.1016\/j.cor.2021.105507_b0260"},{"key":"10.1016\/j.cor.2021.105507_b0265","unstructured":"Waltenberger, M., 2018. A comparative study of logistics districting and daily vehicle routing, Ph.D. thesis, University of Vienna."},{"key":"10.1016\/j.cor.2021.105507_b0270","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","article-title":"Multiobjective evolutionary algorithms: A survey of the state of the art","volume":"1","author":"Zhou","year":"2011","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.1016\/j.cor.2021.105507_b0275","doi-asserted-by":"crossref","unstructured":"Zitzler, E., Thiele, L., 1998. Multiobjective optimization using evolutionary algorithms\u2013a comparative case study, in: International Conference on Parallel Problem Solving from Nature, Springer, pp. 292\u2013301.","DOI":"10.1007\/BFb0056872"},{"key":"10.1016\/j.cor.2021.105507_b0280","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","article-title":"Performance assessment of multiobjective optimizers: An analysis and review","volume":"7","author":"Zitzler","year":"2003","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054821002513?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054821002513?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T01:59:05Z","timestamp":1674957545000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054821002513"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":56,"alternative-id":["S0305054821002513"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2021.105507","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[2022,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Visual attractiveness in vehicle routing via bi-objective optimization","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2021.105507","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"105507"}}