TITLE

An Evolutionary Algorithm Based on Repeated Mutations for Solving the Capacitated Vehicle Routing Problem

AUTHOR(S)
Puljić, Krunoslav
PUB. DATE
March 2012
SOURCE
Journal of Computing & Information Technology;Mar2012, Vol. 20 Issue 1, p51
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
An evolutionary algorithm for solving the capacitated vehicle routing problem is described. The algorithm employs repeated mutations in a manner similar to local search. Experiments are presented, where the algorithm has been implemented and tested on some benchmark problem instances.
ACCESSION #
79542889

 

Related Articles

  • A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem. Layeb, Abdesslem; Ammi, Meryem; Chikhi, Salim // Journal of Computing & Information Technology;Mar2013, Vol. 21 Issue 1, p35 

    This paper presents a novel GRASP algorithm based on a new randomized heuristic for solving the capacitated vehicle routing problem. This problem is characterized by a fleet of homogenous vehicle capacity that will start from one depot, to serve a number of customers with demands that are less...

  • Research on the Vehicle Routing Problem with Time Windows Using Firefly Algorithm. Fengshan Pan; Chunming Ye; Kefeng Wang; Jiangbo Cao // Journal of Computers;Sep2013, Vol. 8 Issue 9, p2256 

    As a key factor of logistics distribution, vehicle routing problem (VRP) is a hot research topic in management and computation science. In this paper the principle and algorithm process of firefly algorithm are introduced in detail. Then the algorithm process and solving steps are designed for...

  • Some extensions to the sweep algorithm. Na, Byungsoo; Jun, Yeowoon; Kim, Byung-In // International Journal of Advanced Manufacturing Technology;Oct2011, Vol. 56 Issue 9-12, p1057 

    The sweep algorithm has been widely used for the vehicle routing problem and its variants since it was published in 1971. It clusters a group of stops into a route according to the polar angle between the stops and the depot. In this paper, we point out the weakness of grouping stops solely by...

  • Evolutionary Algorithms for Vehicle Routing. Potvin, Jean-Yves // INFORMS Journal on Computing;Fall2009, Vol. 21 Issue 4, p518 

    This paper is a survey of the literature on applications of evolutionary algorithms for vehicle routing problems. It reports on genetic algorithms, evolution strategies, and particle swarm optimization when applied to the classical capacitated vehicle routing problem and many of its variants....

  • A Firework Algorithm for Solving Capacitated Vehicle Routing Problem. Abdulmajeed, Noora Hani; Ayob, Masri // International Journal of Advancements in Computing Technology;Jan2014, Vol. 6 Issue 1, p79 

    The capacitated vehicle routing problem (CVRP) is a combinatorial optimization problem that is very hard to solve for optimality. In CVRP, a set of vehicles of the same capacity located at a central depot need to be routed to serve a set of customers with known demands. This work presents a...

  • Application of Memetic Algorithm to Solve Truck and Trailer Routing Problems. Mirmohammadsadeghi, Seyedmehdi; Ahmed, Shamsuddin; Roslin, Eida Nadirah binti // Proceedings of the International Conference on Industrial Engine;2014, p747 

    Application of memetic algorithm (MA) is considered in this work to solve the truck and trailer routing problem (TTRP). In TTRP, some customers can be designated as vehicle customers and can be serviced either by a complete vehicle (a trailer pulling by truck) or a single truck. However, some...

  • TWO-PHASE ALGORITHM FOR SOLVING HETEROGENEOUS TRAVELLING REPAIRMEN PROBLEM WITH TIME WINDOWS. Bjelić, Nenad; Popović, Dražen // International Journal for Traffic & Transport Engineering;2015, Vol. 5 Issue 1, p64 

    Heterogeneous travelling repairmen problem with time windows (hetTRPTW) is customer oriented problem with large possibilities for practical applications in logistics area. Models and algorithms developed for solving one problem with a cumulative objective function may be, with a little effort,...

  • Hybridizing PSM and RSM Operator for Solving NP-Complete Problems: Application to Traveling Salesman Problem. Abdoun, Otman; Tajani, Chakir; Abouchabka, Jaafar // International Journal of Computer Science Issues (IJCSI);Jan2012, Vol. 9 Issue 1, p374 

    In this paper, we present a new mutation operator, Hybrid Mutation (HPRM), for a genetic algorithm that generates high quality solutions to the Traveling Salesman Problem (TSP). The Hybrid Mutation operator constructs an offspring from a pair of parents by hybridizing two mutation operators, PSM...

  • Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems. Muter, İbrahim; Birbil, Ş. İlker; ŞŞSahin, Güvenç // INFORMS Journal on Computing;Fall2010, Vol. 22 Issue 4, p603 

    No abstract available.

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics