A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Relative Performance of Certain Meta Heuristics on Vehicle Routing Problem with Time Windows
2015
International Journal of Information Technology and Computer Science
Solving Vehicle Routing Problem (VRP) and its variants arise in many real life distribution systems. Classical VRP can be described as the problem of finding minimum cost routes with identical vehicles having fixed capacity which starts from a depot and reaches a number of customers with known demands with the proviso that each route starts and ends at the depot and the demand of each customer does not exceed the vehicle capacity is met. One of the generalizations of standard VRP is Vehicle
doi:10.5815/ijitcs.2015.12.05
fatcat:i322igrztrgzfkqfee5nvjygwq