Adaptive permutation-based genetic algorithm for solving VRP with stochastic demands
The primary objective of this study is to solve the Vehicle Routing Problem with Stochastic Demands (VRPSD) under restocking policy by using adaptive Genetic Algorithm (GA). The problem of VRPSD is one of the most important and studied combinatorial optimization problems, which finds its application...
Saved in:
Main Authors: | Ismail, Zuhaimy, Irhamah, Irhamah |
---|---|
Format: | Conference or Workshop Item |
Published: |
2009
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/14721/ http://scialert.net/abstract/?doi=jas.2008.3228.3234 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Adaptive heuristics for solving VRP with stochastic demands
by: Ismail, Zuhaimy
Published: (2012) -
Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search
by: Ismail, Zuhaimy, et al.
Published: (2008) -
A breeder genetic algorithm for vehicle routing problem with stochastic demands
by: Irhamah, Irhamah, et al.
Published: (2009) -
Metaheuristics based on genetic algorithm and tabu search for vehicle routing problem with stochastic demands
by: Irhamah, Irhamah
Published: (2008) -
Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem
by: Ismail, Zuhaimy, et al.
Published: (2008)