By Topic

Solving Vehicle Routing and scheduling problems using hybrid genetic algorithm

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)
Minocha, B. ; Amity Sch. of Comput. Sci., Noida, India ; Tripathi, S. ; Mohan, C.

Vehicle Routing Problem with Time windows (VRPTW) is an example of scheduling in constrained environment. It is a well known NP hard combinatorial scheduling optimization problem in which minimum number of routes have to be determined to serve all the customers within their specified time windows. So far different analytic and heuristic approaches have been tried to solve such problems. In this paper we proposed an algorithm which incorporates a new local search technique with genetic algorithm approach to solve VRPTW scheduling problems in various scenarios.

Published in:

Electronics Computer Technology (ICECT), 2011 3rd International Conference on  (Volume:2 )

Date of Conference:

8-10 April 2011