USULAN RUTE DISTRIBUSI MENGGUNAKAN ALGORITMA SWEEP DAN LOCAL SEARCH (STUDI KASUS DI PERUSAHAAN X)

  • Muhamad Ruben Institut Teknologi Nasional Bandung
  • Arif Imran Institut Teknologi Nasional

Abstract

A company has to deliver its product to thirty-five points/customers. In delivering process, there are limitations such as the number of vehicles, vehicle capacity, and driver's working hours. The company wants to find a better/shorter route in distributing its product to customer in order to minimize the transportation cost. The problem can considered as the Capacited Vehicle Routing Problem. In this paper, the Sweep algorithm are first used to find the initial solution. The local search procedures are used to the solution obtained by the Sweep algorithm. Four local searches are applied, 1-insertion intra-route, 1- insertion inter-route, 1-1 intra –route and 1-1 inter-route. The solutions produced by each local search are then compared, and the best one is selected. The best solution is given by the 1-Insertion intra-route procedure. It is 27,923 km shorter (15% better) than the current routes.

Published
2020-11-28
How to Cite
RUBEN, Muhamad; IMRAN, Arif. USULAN RUTE DISTRIBUSI MENGGUNAKAN ALGORITMA SWEEP DAN LOCAL SEARCH (STUDI KASUS DI PERUSAHAAN X). JURNAL REKAYASA SISTEM INDUSTRI, [S.l.], v. 6, n. 1, p. 40-44, nov. 2020. ISSN 2621-1262. Available at: <http://ejournal.upbatam.ac.id/index.php/rsi/article/view/2491>. Date accessed: 25 feb. 2021. doi: https://doi.org/10.33884/jrsi.v6i1.2491.

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.