Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Genetic algorithm for vehicle routing problem with time window with uncertain vehicle number

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zou Tong ; Dept. of Control Sci. & Eng., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Li Ning ; Sun Debao

Vehicle routing problem with time window (VRPTW) has been investigated by many researchers, in which the vehicle number is fixed in advance. In fact, the vehicle number can't be determined beforehand for practical problems. Because the fixed cost of a vehicle is much more than the running cost, and it is effective to cut down the total cost to seek the minimum number of vehicles in VRPTW. So, both the number and the routes of vehicles should be objectives of the VRPTW, which are described here. This paper presents a mathematical model of vehicle routing problem with time window with uncertain vehicle number. An improved chromosome representation that expresses the various vehicle numbers is proposed on the basis of customers. It is proved by an experiment that the genetic algorithm can search for the optimal solution for both route length and vehicle number.

Published in:

Intelligent Control and Automation, 2004. WCICA 2004. Fifth World Congress on  (Volume:4 )

Date of Conference:

15-19 June 2004