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

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. © 2017 Wiley Periodicals, Inc. NETWORKS, 2017

[1]  Geir Hasle,et al.  Software Tools and Emerging Technologies for Vehicle Routing and Intermodal Transportation , 2014, Vehicle Routing.

[2]  Maged M. Dessouky,et al.  A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows , 2006, Eur. J. Oper. Res..

[3]  Dario Pacciarelli,et al.  A memetic NSGA-II for the bi-objective mixed capacitated general routing problem , 2015, Journal of Heuristics.

[4]  Peter Matis,et al.  Decision Support System for Solving the Street Routing Problem , 2008 .

[5]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[6]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..

[7]  Julio Ortega Lopera,et al.  A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows , 2013, Comput. Ind. Eng..

[8]  Ángel Corberán,et al.  Min‐Max K‐vehicles windy rural postman problem , 2009, Networks.

[9]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[10]  Beatrice M. Ombuki-Berman,et al.  Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows , 2006, Applied Intelligence.

[11]  Ángel Corberán,et al.  New heuristic algorithms for the windy rural postman problem , 2005, Comput. Oper. Res..

[12]  Belén Melián-Batista,et al.  A bi-objective vehicle routing problem with time windows: A real case in Tenerife , 2014, Appl. Soft Comput..

[13]  Bruce L. Golden,et al.  The period vehicle routing problem: New heuristics and real-world variants , 2011 .

[14]  Bruce L. Golden,et al.  Partitioning a street network into compact, balanced, and visually appealing routes , 2017, Networks.

[15]  Miguel Correia,et al.  A multi-objective routing algorithm for Wireless Multimedia Sensor Networks , 2015, Appl. Soft Comput..

[16]  Ruhan He,et al.  Balanced K-Means Algorithm for Partitioning Areas in Large-Scale Vehicle Routing Problem , 2009, 2009 Third International Symposium on Intelligent Information Technology Application.

[17]  Ángel Corberán,et al.  A metaheuristic for the min–max windy rural postman problem with K vehicles , 2010, Comput. Manag. Sci..

[18]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[19]  Ahmet Cosar,et al.  Multi-objective evolutionary routing protocol for efficient coverage in mobile sensor networks , 2014, Soft Computing.

[20]  Miguel Fragoso Constantino,et al.  The mixed capacitated arc routing problem with non-overlapping routes , 2015, Eur. J. Oper. Res..

[21]  Ángel Corberán,et al.  Min-Max K-vehicles windy rural postman problem , 2009 .

[22]  Jonathan E. Fieldsend,et al.  Multi-objective routing optimisation for battery-powered wireless sensor mesh networks , 2014, GECCO.

[23]  Ángel Corberán,et al.  New facets and an enhanced branch‐and‐cut for the min–max K‐vehicles windy rural postman problem , 2011, Networks.

[24]  Dirk Cattrysse,et al.  Multi-objective microzone-based vehicle routing for courier companies: From tactical to operational planning , 2015, Eur. J. Oper. Res..

[25]  Albert P. M. Wagelmans,et al.  A savings based method for real-life vehicle routing problems , 1999, J. Oper. Res. Soc..

[26]  Stefan Irnich,et al.  Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem , 2012, Oper. Res..

[27]  Ángel Corberán,et al.  A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem , 2014, Networks.

[28]  Elise Miller-Hooks,et al.  Interactive Heuristic for Practical Vehicle Routing Problem with Solution Shape Constraints , 2006 .