Referenced Items are not available for this document.
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
- Page(s):
- 189 - 193
- E-ISBN :
- 978-1-4244-8679-3
- Print ISBN:
- 978-1-4244-8678-6
- INSPEC Accession Number:
- 12096447
- Conference Location :
- Kanyakumari
- Digital Object Identifier :
- 10.1109/ICECTECH.2011.5941682
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
