Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem
نویسندگان
چکیده
منابع مشابه
An Improved Decomposition-Based Memetic Algorithm for Multi-Objective Capacitated Arc Routing Problem
The Capacitated Arc Routing Problem (CARP) is a challenging combinatorial optimization problem with many real-world applications, e.g., salting route optimization and fleet management. There have been many attempts at solving CARP using heuristic and meta-heuristic approaches, including evolutionary algorithms. However, almost all such attempts formulate CARP as a single-objective problem altho...
متن کاملMultiobjective Capacitated Arc Routing Problem
The Capacitated Arc Routing Problem (CARP) is a very hard vehicle routing problem raised for instance by urban waste collection. In addition to the total route length (the only criterion minimized in the academic problem), waste management companies seek to minimize also the length of the longest trip. A bi-objective genetic algorithm is presented for this more realistic CARP, never studied bef...
متن کاملMemetic algorithm with route decomposing for periodic capacitated arc routing problem
In this paper, the Periodic Capacitated Arc Routing Problem (PCARP) is investigated. PCARP is an extension of the well-known CARP from a single period to a multi-period horizon. In PCARP, two objectives are to be minimized. One is the number of required vehicles (nv), and the other is the total cost (tc). Due to the multi-period nature, given the same graph or road network, PCARP can have a muc...
متن کاملMulti-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem
The goal of this paper is to propose and test a new memetic algorithm for the capacitated vehicle routing problem in parallel computing environment. In this paper we consider a simple variation of the vehicle routing problem in which the only parameter is the capacity of the vehicle and each client only needs one package. We analyze the efficiency of the algorithm using the hierarchical Paralle...
متن کاملAn Approximation Algorithm for the Capacitated Arc Routing Problem
In this paper we consider approximation of the Capacitated Arc Routing Problem, which is the problem of servicing a set of edges in a graph using a fleet of capacity constrained vehicles. We present a 7 3 2 W approximation algorithm for the problem and prove that this algorithm outperforms the only existing approximation algorithm for the problem. Furthermore, we give computational results show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2011
ISSN: 1089-778X,1941-0026
DOI: 10.1109/tevc.2010.2051446