Visual attractiveness in routing problems: A review

被引:27
作者
Gabriel Rossit, Diego [1 ]
Vigo, Daniele [2 ]
Tohme, Fernando [3 ]
Frutos, Mariano [1 ]
机构
[1] UNS, CONICET, Dept Engn, IIESS, Alem Ave 1253,B8000CPB, Bahia Blanca, Buenos Aires, Argentina
[2] Univ Bologna, Dept Elect Elect & Informat Engn, Viale Risorgimento 2, I-40136 Bologna, Italy
[3] UNS, CONICET, Dept Econ, INMABB, Alem Ave 1253,B8000CPB, Bahia Blanca, Buenos Aires, Argentina
关键词
Visual attractiveness; Vehicle routing problem; DECISION-SUPPORT-SYSTEM; TRAVELING-SALESMAN; HUMAN-PERFORMANCE; CONVEX-HULL; DELIVERY PROBLEM; VEHICLE; DESIGN; ALGORITHMS; PICKUP; COMPACTNESS;
D O I
10.1016/j.cor.2018.10.012
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Enhancing visual attractiveness in a routing plan has proven to be an effective way to facilitate practical implementation and positive collaboration among planning and operational levels in transportation. Several authors, driven by the requests of practitioners, have considered, either explicitly or implicitly, such aspect in the optimization process for different routing applications. However, due to its subjective nature, there is not a unique way of evaluating the visual attractiveness of a routing solution. The aim of this paper is to provide an overview of the literature on visual attractiveness. In particular, we analyze and experimentally compare the different metrics that were used to model the visual attractiveness of a routing plan and provide guidelines that planners and researchers can use to select the method that better suits their needs. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:13 / 34
页数:22
相关论文
共 85 条
[1]   Multiobjective scatter search for a commercial territory design problem [J].
Angelica Salazar-Aguilar, M. ;
Rios-Mercado, Roger Z. ;
Gonzalez-Velarde, Jose L. ;
Molina, Julian .
ANNALS OF OPERATIONS RESEARCH, 2012, 199 (01) :343-360
[2]   Exact Algorithms for the Clustered Vehicle Routing Problem [J].
Battarra, Maria ;
Erdogan, Guenes ;
Vigo, Daniele .
OPERATIONS RESEARCH, 2014, 62 (01) :58-71
[3]   Lower and upper bounds for the mixed capacitated arc routing problem [J].
Belenguer, Jose-Manuel ;
Benavent, Enrique ;
Lacomme, Philippe ;
Prins, Christian .
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (12) :3363-3383
[4]   A decision support system for the electrical power districting problem [J].
Bergey, PK ;
Ragsdale, CT ;
Hoskote, M .
DECISION SUPPORT SYSTEMS, 2003, 36 (01) :1-17
[5]  
BERTERO F., 2015, OPTIMIZACION RECORRI
[6]  
Bosch A, 2014, SEED SELECTION MULTI
[7]   A tabu search heuristic and adaptive memory procedure for political districting [J].
Bozkaya, B ;
Erkut, E ;
Laporte, G .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 144 (01) :12-26
[8]  
Bräysy O, 2014, MOS-SIAM SER OPTIMIZ, P351
[9]   Districting for Arc Routing [J].
Butsch, Alexander ;
Kalcsics, Joerg ;
Laporte, Gilbert .
INFORMS JOURNAL ON COMPUTING, 2014, 26 (04) :809-824
[10]   SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].
CLARKE, G ;
WRIGHT, JW .
OPERATIONS RESEARCH, 1964, 12 (04) :568-&