Optimasi Rute Pengiriman pada CV. X Menggunakan Metode Evolutionary Algorithm

Authors

  • Setiadi Setiadi Yulianto Industrial Engineering Department, Petra Christian University, Indonesia
  • I Gede Agus Widyadana Industrial Engineering Department, Petra Christian University, Indonesia
  • Nova Nova Sepadyati Industrial Engineering Department, Petra Christian University, Indonesia

Keywords:

Deep Convolutional Generative Adversarial Network, Music Generation, Tensorflow, Keras, Pianoroll, Background Game Music.

Abstract

CV. X is an ice cube distributor. The company faced a problem that ice cube distribution time ussually longer than time window that has been set by the company. This research is focused on minimization delivery time therefore the total delivery time will not exceed the time window. Currently, the company operates two cars and two treecycle motorbikes. Every vehicle has more than one route every day. Therefore this research problem is Vehicle Routing Problem With Time Window. This problem is solved using the Evolutionary Algorithm method in Microsoft Excel software. The proposed routes can reduce delivery time on two different days by 9.85% and 4.02% for cars, as well as 9.85% and 11.8% on treecycle motorbikes

References

Toth, P., dan Vigo, D. The Vehicle Routing Problem Philadelpia Society For Industry And Applied Mathematics Adwad, Philadelpia, 2002.

Prana, R., Aplikasi Kombinatorial pada Vehicle Routing Problem., skripsi, Institut Teknik Bandung, Bandung, 2008.

Hillier, F.S., dan Lieberman, G. J. Introduction To Operations Research Tenth Edition, MCGRAW- HILL, New York, 2015.

Niebel, B., dan Freivalds, A., Industrial Engineering: Methods, standards and work design” 12th edition. McGraw-Hill Education, Boston, 2009.

Wignjosoebroto, S. Ergonomi: Studi Gerak dan Waktu. Surabaya, 2008.

Published

2022-09-26

Issue

Vol. 10 No. 1 (2022): Jurnal Titra Januari 2022

Section

Articles