Improved Memetic Algorithm Based on Route Distance Grouping for Multiobjective Large Scale Capacitated Arc Routing Problems

Abstract

The capacitated arc routing problem (CARP) has attracted considerable attention from researchers due to its broad potential for social applications. This paper builds on, and develops beyond, the cooperative coevolutionary algorithm based on route distance grouping (RDG-MAENS), recently proposed by Mei et al. Although Mei's method has proved superior to previous algorithms, we discuss several remaining drawbacks and propose solutions to overcome them. First, although RDG is used in searching for potential better solutions, the solution generated from the decomposed problem at each generation is not the best one, and the best solution found so far is not used for solving the current generation. Second, to determine which sub-population the individual belongs to simply according to the distance can lead to an imbalance in the number of the individuals among different sub-populations and the allocation of resources. Third, the method of Mei et al. was only used to solve single-objective CARP. To overcome the above issues, this paper proposes improving RDG-MAENS by updating the solutions immediately and applying them to solve the current solution through areas shared, and then according to the magnitude of the vector of the route direction, and a fast and simple allocation scheme is proposed to determine which decomposed problem the route belongs to. Finally, we combine the improved algorithm with an improved decomposition-based memetic algorithm to solve the multiobjective large scale CARP (LSCARP). Experimental results suggest that the proposed improved algorithm can achieve better results on both single-objective LSCARP and multiobjective LSCARP.

Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems

“…For the future work, the dynamic version of other routing problems that are basically variations [33] or direct extensions of the fundamental TSP, e.g., capacitated vehicle routing problems [48] and capacitated arc routing problems [49], [58], can be considered. For these problems, multiple routes are considered, which makes them closer to even more real-world applications in the important area of logistics.…”

A Decision Variable Clustering-Based Evolutionary Algorithm for Large-Scale Many-Objective Optimization

“…Experimental results confirmed the competitiveness of the algorithm on large-scale MOPs with two and three objectives. Following this line, in [66], the idea of cooperative coevolution was also adopted to deal with large-scale multi-objective capacitated arc routing problems.…”

A New Differential Mutation Based Adaptive Harmony Search Algorithm for Global Optimization

“…The CEC2014 benchmark suite consists of 30 test functions, which include three unimodal functions, 13 multimodal functions, six hybrid functions and eight composite functions. In particular, these hybrid functions (f17-f22) are very similar to real world problems, such as transportation networks [46], circuit theory [47], image processing [48], capacitated arc routing problems [49] and flexible job-shop scheduling problems [50]. The search range for each function is [−100, 100] DIM , where DIM is the dimension of the problem.…”