A breeder genetic algorithm for vehicle routing problem with stochastic demands
This paper considers a version of VRP known as VRP with Stochastic Demands (VRPSD) where the demands are unknown when the route is designed. The problem objective is to find a priori route under preventive restocking that minimize the total expected cost, including travel cost and the expected re...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
INSInet Publication
2009
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/9965/1/IrhamahIrhamah2009_ABreederGeneticAlgorithmForVehicleRoutingProblem.pdf http://eprints.utm.my/id/eprint/9965/ http://www.insipub.com/jasr/2009/1998-2005.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper considers a version of VRP known as VRP with Stochastic Demands (VRPSD)
where the demands are unknown when the route is designed. The problem objective is to find a priori
route under preventive restocking that minimize the total expected cost, including travel cost and the
expected recourse cost, subject to the routing constraints, under the stochastic demands setting. The
Breeder Genetic Algorithm is proposed to solve this problem. BGA is a kind of GAs, which is especially
powerful and reliable in global searching. The BGA was compared to the standard Genetic Algorithm on
a set of randomly generated problems following some discrete probability distributions. The problem data
are inspired by real case of VRPSD in waste collection. From the results, it was found that the BGA was
clearly superior to standard GA in terms of solution quality. Compared to Bianchi et al’s GA, the BGA
also may lead to a better performance |
|---|