Ismail, Zuhaimy and Irhamah, Irhamah (2008) Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search. Journal of Mathematics and Statistics, 4 (3). pp. 161-167. ISSN 1549-3644
Full text not available from this repository.
Official URL: http://www.scipub.org/fulltext/jms2/jms243161-167....
This study considers a version of the stochastic vehicle routing problem where customer demands are random variables with known probability distribution. A new scheme based on a hybrid GA and Tabu Search heuristic is proposed for this problem under a priori approach with preventive restocking. The relative performance of the proposed HGATS is compared to each GA and TS alone, 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. Results from the experiment show the advantages of the proposed algorithm that are its robustness and better solution qualities resulted
|Uncontrolled Keywords:||vehicle routing problem with stochastic demands, genetic algorithm, tabu search, hybrid algorithm|
|Subjects:||Q Science > QA Mathematics|
|Deposited By:||Norshiela Buyamin|
|Deposited On:||04 May 2009 08:55|
|Last Modified:||21 Sep 2010 07:46|
Repository Staff Only: item control page