Aesthetic considerations for the min-max K-Windy Rural Postman Problem

被引:8
作者
Corberan, Angel [1 ]
Golden, Bruce [2 ]
Lum, Oliver [3 ]
Plana, Isaac [4 ]
Sanchis, Jose M. [5 ]
机构
[1] Univ Valencia, Dept Estadist & Invest Operat, Valencia, Spain
[2] Univ Maryland, RH Smith Sch Business, College Pk, MD 20742 USA
[3] Univ Maryland, Dept Appl Math & Sci Computat, College Pk, MD 20742 USA
[4] Univ Valencia, Dept Matemat Econ & Empresa, Valencia, Spain
[5] Univ Politecn Valencia, Dept Matemat Aplicada, Valencia, Spain
关键词
arc routing problems; min-max objective; aesthetic objective; multi-objective problems; VEHICLE-ROUTING PROBLEM; BRANCH-AND-CUT; ALGORITHM;
D O I
10.1002/net.21748
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The aesthetic quality of routes is a feature of route planning that is of practical importance, but receives relatively little attention in the literature. Several practitioners have pointed out that the visual appeal of a proposed set of routes can have a strong influence on the willingness of a client to accept or reject a specific routing plan. While some work has analyzed algorithmic performance relative to traditional min-sum or min-max objective functions and aesthetic objective functions, we are not aware of any work that has considered a multi-objective approach. This work considers a multi-objective variant of the Min-Max K-Vehicles Windy Rural Postman Problem, discusses several formulations of the problem, and presents computational experiments with a heuristic algorithm. After exploring several formulations, we choose to study the problem with a bi-objective function that includes contributions from the route overlap index and average task distance aesthetic measures. The heuristic extends the cluster-first procedure presented in Lum et al. (Networks 69 (2017), 290-303) by incorporating the new objective function into the improvement phase and adding a perturbation routine. (c) 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 70(3), 216-232 2017
引用
收藏
页码:216 / 232
页数:17
相关论文
共 26 条
  • [1] Multi-objective evolutionary routing protocol for efficient coverage in mobile sensor networks
    Attea, Bara'a A.
    Khalil, Enan A.
    Cosar, Ahmet
    [J]. SOFT COMPUTING, 2015, 19 (10) : 2983 - 2995
  • [2] A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows
    Banos, Raul
    Ortega, Julio
    Gil, Consolacion
    Marquez, Antonio L.
    de Toro, Francisco
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2013, 65 (02) : 286 - 296
  • [3] New heuristic algorithms for the windy rural postman problem
    Benavent, E
    Corberán, A
    Piñana, E
    Plana, I
    Sanchis, JM
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (12) : 3111 - 3128
  • [4] A Branch-Price-and-Cut Algorithm for the Min-Max k-Vehicle Windy Rural Postman Problem
    Benavent, Enrique
    Corberan, Angel
    Desaulniers, Guy
    Lessard, Francois
    Plana, Isaac
    Sanchis, Jose M.
    [J]. NETWORKS, 2014, 63 (01) : 34 - 45
  • [5] A metaheuristic for the min-max windy rural postman problem with K vehicles
    Benavent E.
    Corberán A.
    Sanchis J.M.
    [J]. Computational Management Science, 2010, 7 (3) : 269 - 287
  • [6] New Facets and an Enhanced Branch-and-Cut for the Min-Max K-Vehicles Windy Rural Postman Problem
    Benavent, Enrique
    Corberan, Angel
    Plana, Isaac
    Sanchis, Jose M.
    [J]. NETWORKS, 2011, 58 (04) : 255 - 272
  • [7] Min-Max K-vehicles Windy Rural Postman Problem
    Benavent, Enrique
    Corberan, Angel
    Plana, Isaac
    Sanchis, Jose M.
    [J]. NETWORKS, 2009, 54 (04) : 216 - 226
  • [8] Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
    Bode, Claudia
    Irnich, Stefan
    [J]. OPERATIONS RESEARCH, 2012, 60 (05) : 1167 - 1182
  • [9] Bräysy O, 2014, MOS-SIAM SER OPTIMIZ, P351
  • [10] The mixed capacitated arc routing problem with non-overlapping routes
    Constantino, Miguel
    Gouveia, Luis
    Mourao, Maria Candida
    Nunes, Ana Catarina
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 244 (02) : 445 - 456