PERANCANGAN ALGORITMA SIMULATED ANNEALING UNTUK RUTE KENDARAAN YANG MEMPERTIMBANGKAN BACKHAUL,RUTE MAJEMUK, DAN TIME WINDOW

Authors

  • Ferdian Cahyadi Departemen Sistem Informasi, Institut Teknologi Harapan Bangsa
  • Johan Oscar Ong Departemen Teknik Industri, Institut Teknologi Harapan Bangsa
  • Jusak Sali Kosasih Departemen Sistem Informasi, Institut Teknologi Harapan Bangsa

DOI:

https://doi.org/10.61769/telematika.v7i1.53

Keywords:

Vehicle Routing Problem, Backhaul, Multiple Trip, Time Window, Simulated Annealing

Abstract

Vehicle Routing Problem (VRP) menjadi hal yang sangat penting dalam masalah  pendistribusian barang, karena perusahaan ingin mencapai hasil yang seefektif dan seefisien mungkin agar biaya yang dikeluarkan dapat diperkecil. Dalam VRP, perlu diperhatikan juga jumlah kendaraan yang digunakan dan waktu bongkar muat (loading/unloading) di tempat pelanggan, hal itu yang menjadi pembatas dalam VRP.
Tujuan dari jurnal ini adalah untuk menyelesaikan masalah rute kendaraan yang  mempertimbangkan backhaul, rute majemuk (multiple trips), dan time window atau yang dikenal dengan model/varian VRPBMTTW, dan akan menghitung jumlah kendaraan, total duration time (TDT), dan range of duration time (RDT). Untuk memecahkan masalah ini digunakan teknik Simulated Annealing (SA) yang merupakan suatu pendekatan algoritma yang efisien untuk memecahkan masalah optimasi kombinatorial yang sulit. Solusi awal ditingkatkan berulang-kali dengan membuat perubahan kecil hingga ditemukan solusi yang lebih baik.

 

Vehicle Routing Problem (VRP) become very important in the problem of distribution of goods, because the company wants to achieve results effectively and efficiently as possible so the cost
can be reduced. In VRP, the number of vehicles used and the time of loading and unloading at the customer site, need to be considered too, it is a constraint in the VRP. The purpose of this journal is to solve the vehicle routing problem considering backhaul, multiple trips, and the time window, known as the model/variant VRPBMTTW, and will count the number of vehicles, the total duration time (TDT), and range of duration time (RDT). To solve this problem used technique Simulated Annealing (SA) which is an efficient algorithm approach to solve difficult combinatorial optimization problems. Initial solution repeatedly improved by making small changes to find a better solution. Keywords— Vehicle Routing Problem, Backhaul, Multiple Trip, Time Window, Simulated Annealing

References

Braysy, O., 2001. Genetic Algorithms for the Vehicle Routing Problem

with Time Windows, PhD thesis, Department of mathematics and

Statistics, University of Vaasa, Finlandia.

Dowsland. 1993. Chapter 2 in Reeves, Modern Heuristic Techniques

for Combinatorial Problems.

Fitria, Lisye., dkk. Penentuan Rute Truk Pengumpulan dan

Pengangkutan Sampah di Bandung, Jurnal Teknik Industri, Vol. 11, No.

, Juni 2009.

Goetschalckx, Marc., Jacobs-Blecha, Charlotte. 1989. European

Journal of Operational Research 42, 39-51.

Ong, Johan Oscar dan Suprayogi. 2010. Vehicle Routing Problem With

Backhaul, Multiple Trips and Time Window. International Seminar on

Industrial Engineering and Management.

Panggabean, Henry. P., 2002. Penjadwalan Job Shop Statik dengan

Algoritma Simulated Annealing.

Sutapa, I Nyoman., Widyadana, I Gede., dan Christine, Studi Tentang

Travelling Salesman dan Vehicle Routing Problem Dengan Time

Windows.

Thangiah, Sam. R., Potvin, Jeans-Yves., Sun, Tong. Heuristic

Approaches to Vehicle Routing with Backhauls and Time Windows.

International Journal of Computers and Operations Research.

Toth, Paolo dan Vigo, Daniele. 2002. The Vehicle Routing Problem.

Downloads

Published

2015-05-07

Issue

Vol. 7 No. 1 (2011)

Section

Articles

License

 

You are free to:

  1. Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
  2. Adapt — remix, transform, and build upon the material for any purpose, even commercially.
  3. The licensor cannot revoke these freedoms as long as you follow the license terms.

Under the following terms:

  1. Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  2. ShareAlike — If you remix, transform, or build upon the material, you must distribute your contributions under the same license as the original.
  3. No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.

Notices:

You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation.

No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.