Genetic Algorithm and Tabu Search for Vehicle Routing Problems with Stochastic Demand

Journal Article · Thu Nov 11 00:00:00 EST 2010 · AIP Conference Proceedings

DOI:https://doi.org/10.1063/1.3525151· OSTI ID:22589281

Ismail, Zuhaimy ^[1]; Irhamah, ^[2]

---

1. Department of Mathematics, Universiti Teknologi Malaysia, Skudai, Johor (Malaysia)
2. 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, Vol. 1309, Issue 1; Conference: ICMS international conference on mathematical science, Bolu (Turkey), 23-27 Nov 2010; Other Information: (c) 2010 American Institute of Physics; Country of input: International Atomic Energy Agency (IAEA); ISSN 0094-243X
• Country of Publication: United States
• Language: English

Related Subjects

71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
ALGORITHMS
COMPUTER CODES
COMPUTERIZED SIMULATION
DATASETS
MATHEMATICAL SOLUTIONS
ROUTING
SOLID WASTES
STOCHASTIC PROCESSES
VEHICLES