Genetic local search algorithm for a new bi-objective arc routing problem with profit collection and dispersion of vehicles

On the Np-Hardness of the Minimum Dispersion Routing Problem

“…Solutions for MDRP instances are constructed in order to minimize an objective function that evaluates the dispersion of vehicles while executing tours. This dispersion metric was also used in a different problem (Dhein et al, 2018), composing an objective function designed to scatter vehicles. The MDRP objective function is computed as follows.…”

Arc routing problems: A review of the past, present, and future

“…As for the solution methods most commonly used for multiobjective ARPs, different variants of evolutionary algorithms seem to be the most frequent ones [8,70,93,134,154,158,208,209]. Other heuristic and metaheuristic methods are proposed in [96,107,148,227].…”

“…Corberán et al [64] and Lum et al [148] incorporate different aesthetic measures to make the routes visually appealing in addition to minimizing the makespan. A nonlinear dispersion metric that tries to keep vehicles as far from each other as possible is also observed by Dhein et al [70], while Fröhlich and Dörner [96] study the route inconsistency in order to construct routes that are as different from each other as possible. All these alternative objectives have been studied only recently, and will probably receive more attention in the near future.…”