Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search
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 r...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
Science Publications
2008
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/8402/ |
| _version_ | 1848891679648514048 |
|---|---|
| author | Ismail, Zuhaimy Irhamah, Irhamah |
| author_facet | Ismail, Zuhaimy Irhamah, Irhamah |
| author_sort | Ismail, Zuhaimy |
| building | UTeM Institutional Repository |
| collection | Online Access |
| description | 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 |
| first_indexed | 2025-11-15T21:01:48Z |
| format | Article |
| id | utm-8402 |
| institution | Universiti Teknologi Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-15T21:01:48Z |
| publishDate | 2008 |
| publisher | Science Publications |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | utm-84022010-09-21T07:46:05Z http://eprints.utm.my/8402/ Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search Ismail, Zuhaimy Irhamah, Irhamah QA Mathematics 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 Science Publications 2008 Article PeerReviewed 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 http://www.scipub.org/fulltext/jms2/jms243161-167.pdf |
| spellingShingle | QA Mathematics Ismail, Zuhaimy Irhamah, Irhamah Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search |
| title | Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search |
| title_full | Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search |
| title_fullStr | Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search |
| title_full_unstemmed | Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search |
| title_short | Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search |
| title_sort | solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search |
| topic | QA Mathematics |
| url | http://eprints.utm.my/8402/ http://eprints.utm.my/8402/ |