Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2013, Article ID 325686, 9 pages
Research Article

Multiobjective Vehicle Routing Problem with Route Balance Based on Genetic Algorithm

1Institute of Mechanical Engineering, Hubei University of Technology, Wuhan, Hubei 430068, China
2Nanjing University of Information Science and Technology, No. 219, Ningliu Road, Nanjing, Jiangsu 210094, China

Received 2 July 2013; Revised 1 October 2013; Accepted 13 November 2013

Academic Editor: Tinggui Chen

Copyright © 2013 Wei Zhou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


This study proposes a genetic algorithm to solve the biobjective vehicle routing problem with time windows simultaneously considering total distance and distance balance of active vehicle fleet. A new complex chromosome is used to present the active vehicle route. Through tournament selection, one-point crossover, and migrating mutation operator, the solution of the problem is solved. In experiment on Solomon’s benchmark problems, considering the total distance and distance balance, the results are improved in all classes of problems. According to the experimental results, the suggested approach is sufficient and the average GA performance is good.