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 条
  • [11] A branch-and-cut algorithm for the dial-a-ride problem
    Cordeau, Jean-Francois
    [J]. OPERATIONS RESEARCH, 2006, 54 (03) : 573 - 586
  • [12] The period vehicle routing problem: New heuristics and real-world variants
    Gulczynski, Damon
    Golden, Bruce
    Wasil, Edward
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2011, 47 (05) : 648 - 668
  • [13] Balanced K-Means Algorithm for Partitioning Areas in Large-Scale Vehicle Routing Problem
    He, Ruhan
    Xu, Weibin
    Sun, Jiaxia
    Zu, Bingqiao
    [J]. 2009 THIRD INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY APPLICATION, VOL 3, PROCEEDINGS, 2009, : 87 - +
  • [14] Multi-objective microzone-based vehicle routing for courier companies: From tactical to operational planning
    Janssens, Jochen
    Van den Bergh, Joos
    Sorensen, Kenneth
    Cattrysse, Dirk
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 242 (01) : 222 - 231
  • [15] A fast and high quality multilevel scheme for partitioning irregular graphs
    Karypis, G
    Kumar, V
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) : 359 - 392
  • [16] Karypis G, METIS UNSTRUCTURED G
  • [17] A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
    Lu, Quan
    Dessouky, Maged M.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 175 (02) : 672 - 687
  • [18] Partitioning a Street Network into Compact, Balanced, and Visually Appealing Routes
    Lum, Oliver
    Cerrone, Carmine
    Golden, Bruce
    Wasil, Edward
    [J]. NETWORKS, 2017, 69 (03) : 290 - 303
  • [19] A multi-objective routing algorithm for Wireless Multimedia Sensor Networks
    Magaia, Naercio
    Horta, Nuno
    Neves, Rui
    Pereira, Paulo Rogerio
    Correia, Miguel
    [J]. APPLIED SOFT COMPUTING, 2015, 30 : 104 - 112
  • [20] A memetic NSGA-II for the bi-objective mixed capacitated general routing problem
    Mandal, Santosh Kumar
    Pacciarelli, Dario
    Lokketangen, Arne
    Hasle, Geir
    [J]. JOURNAL OF HEURISTICS, 2015, 21 (03) : 359 - 390