Genetic Algorithm and Tabu Search for Vehicle Routing Problems with Stochastic Demand
Journal Article
·
· AIP Conference Proceedings
- Department of Mathematics, Universiti Teknologi Malaysia, Skudai, Johor (Malaysia)
- Department of Statistics, Institut Teknologi Sepuluh Nopember, Surabaya (Indonesia)
This paper presents a problem of designing solid waste collection routes, involving scheduling of vehicles where each vehicle begins at the depot, visits customers and ends at the depot. It is modeled as a Vehicle Routing Problem with Stochastic Demands (VRPSD). A data set from a real world problem (a case) is used in this research. We developed Genetic Algorithm (GA) and Tabu Search (TS) procedure and these has produced the best possible result. 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.
- OSTI ID:
- 22589281
- Journal Information:
- AIP Conference Proceedings, Journal Name: AIP Conference Proceedings Journal Issue: 1 Vol. 1309; ISSN APCPCS; ISSN 0094-243X
- Country of Publication:
- United States
- Language:
- English
Similar Records
An exact algorithm for the vehicle routing problem with stochastic demands
Goal-programming model of the stochastic vehicle-routing problem
New exact algorithms for the vehicle routing problem
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36238
Goal-programming model of the stochastic vehicle-routing problem
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:5909284
New exact algorithms for the vehicle routing problem
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36283