Solving Time Constrained Vehicle Routing Problem Using Hybrid Genetic Algorithm


Authors

Bhawna Minocha - Amity School of Computer Sciences, Noida, India Saswati Tripathi - Indian Institute of Foreign Trade, Kolkata, India


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 algorithms which incorporate new local search techniques with genetic algorithm approach to solve VRPTW scheduling problems in various scenarios.


Share and Cite

  • Share on Facebook
  • Share on Twitter
  • Share on LinkedIn
ISRP Style

Bhawna Minocha, Saswati Tripathi, Solving Time Constrained Vehicle Routing Problem Using Hybrid Genetic Algorithm, Journal of Mathematics and Computer Science, 3 (2011), no. 2, 192--201

AMA Style

Minocha Bhawna, Tripathi Saswati, Solving Time Constrained Vehicle Routing Problem Using Hybrid Genetic Algorithm. J Math Comput SCI-JM. (2011); 3(2):192--201

Chicago/Turabian Style

Minocha, Bhawna, Tripathi, Saswati. "Solving Time Constrained Vehicle Routing Problem Using Hybrid Genetic Algorithm." Journal of Mathematics and Computer Science, 3, no. 2 (2011): 192--201


Keywords


MSC


References