THE CHARACTERISTICS STUDY OF SOLVING VARIANTS OF VEHICLE ROUTING PROBLEM AND ITS APPLICATION ON DISTRIBUTION PROBLEM

Sapti Wahyuningsih, . and Darmawan Satyananda, . (2015) THE CHARACTERISTICS STUDY OF SOLVING VARIANTS OF VEHICLE ROUTING PROBLEM AND ITS APPLICATION ON DISTRIBUTION PROBLEM. Proceeding of International Conference On Research, Implementation And Education Of Mathematics And Sciences 2015 (ICRIEMS 2015), Yogyakarta State University, 17-19 May 2015. ISSN 978-979-96880-8-8

[img]
Preview
Text
M -14.pdf

Download (533kB) | Preview
Official URL: http://fmipa.uny.ac.id

Abstract

Vehicle Routing Problem (VRP) is one of the most challenging problems in combinatorial optimization. Objective of VRP is to find minimum length route starts and ends in a depot. There are some additional constraints such as more than one depot, service time, time window, capacity of vehicle, and many more. These are cause of VRP variants. Vehicle Routing Problem with Time Windows (VRPTW) is a variant of VRP with some additional constrains, that are number of requests may not exceed the vehicle capacity, as well as travel time and service time may not exceed the time window. Multi Depot Vehicle Routing Problem (MDVRP) has number of depots serving all customers, a number of vehicles distributing goods to customers with a minimum distance of distribution route without exceeding the capacity of the vehicle. Many researches have presented algorithms to solve VRPTW and MDVRP. This article discusses solution characteristics of VRPTW and MDVRP algorithms, and their performance. VRPTW algorithms reviewed are Tabu Search, Clarke and Wright, Nearest Insertion Heuristics, Harmony Search, Simulated Annealing, and Improved Ant Colony System algorithm. Performance of MDVRP algorithms studied are Self-developed Algorithm, Upper Bound, Clarke and Wright, Ant Colony Optimization, and Genetic Algorithm. Each algorithm is studied on its performance, process, advantages, and disadvantages. This article presents example of distribution problem in VRPTW and MDVRP, based on characteristic of the real problem. A computer program created using Delphi is implemented for VRPTW and MDVRP, to solve distribution problem for any number of vehicles and customer locations. Keywords: VRPTW, MDVRP, Distribution problem

Item Type: Article
Subjects: Prosiding > ICRIEMS 2015 > Mathematics & Mathematics Education
Divisions: Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Pendidikan Matematika > Pendidikan Matematika
Depositing User: Administrator
Date Deposited: 10 Jul 2015 12:27
Last Modified: 10 Jul 2015 12:27
URI: http://eprints.uny.ac.id/id/eprint/23319

Actions (login required)

View Item View Item