Academic Journals Database
Disseminating quality controlled scientific knowledge

Solving Min-Max Vehicle Routing Problem

ADD TO MY LIST
 
Author(s): chunyu ren

Journal: Journal of Software
ISSN 1796-217X

Volume: 6;
Issue: 9;
Start page: 1851;
Date: 2011;
Original page

Keywords: MMVRP | improved insertion method | simulated annealing mechanism | hill-climbing algorithm | hybrid genetic algorithm

ABSTRACT
The present study is focused on the Min-Max Vehicle Routing Problem (MMVRP). According to the characteristics of model, hybrid genetic algorithm is used to get the optimization solution. First of all, use natural number coding so as to simplify the problem; apply improved insertion method so as to improve the feasibility of the solution; retain the best selection so as to guard the diversity of group. The study adopts 2- exchange mutation operator, combine hill-climbing algorithm to strengthen the partial searching ability of chromosome. Secondly, Boltzmann simulated annealing mechanism for control genetic algorithm crossover and mutation operations improve the convergence speed and search efficiency. At last, it uses simulated experiments to prove the effectiveness and feasibility of this algorithm, and provides clues for massively solving practical problems.
Affiliate Program      Why do you need a reservation system?