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, 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
Similar Records
An exact algorithm for the vehicle routing problem with stochastic demands
Goal-programming model of the stochastic vehicle-routing problem
Routing Problem for Unmanned Aerial Vehicle Patrolling Missions - A Progressive Hedging Algorithm
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:22589281
Goal-programming model of the stochastic vehicle-routing problem
Thesis/Dissertation
·
Wed Jan 01 00:00:00 EST 1986
·
OSTI ID:22589281
Routing Problem for Unmanned Aerial Vehicle Patrolling Missions - A Progressive Hedging Algorithm
Journal Article
·
Sat Feb 05 00:00:00 EST 2022
· Computers and Operations Research
·
OSTI ID:22589281