Solving Vehicle Routing and scheduling problems using hybrid genetic algorithm

Author

Minocha, Bhawna ; Tripathi, Saswati ; Mohan, C.

Author_Institution

Amity Sch. of Comput. Sci., Noida, India

Volume

2

fYear

2011

fDate

8-10 April 2011

Firstpage

189

Lastpage

193

Abstract

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.

Keywords

computational complexity; genetic algorithms; scheduling; search problems; transportation; NP hard combinatorial scheduling optimization problem; analytic approach; constrained environment; heuristic approach; hybrid genetic algorithm; local search technique; scheduling problem; time windows; vehicle routing problem; Biological cells; Genetic algorithms; Operations research; Optimization; Routing; Search problems; Vehicles; Vehicle routing problem; genetic algorithm; heuristics based search techniques;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Kanyakumari

Print_ISBN

978-1-4244-8678-6

Electronic_ISBN

978-1-4244-8679-3

Type

conf

DOI

10.1109/ICECTECH.2011.5941682

Filename

5941682