Optimasi Vehicle Routing Problem with Time Windows pada Rute Patroli Polisi di Kecamatan Dramaga, Kabupaten Bogor

Abstract

Rute patroli polisi yang efisien akan mempertimbangkan alokasi titik rawan potensial yang dapat memudahkan polisi dalam melakukan pencegahan tindak kriminalitas sekaligus meminimumkan biaya operasional patroli polisi. Setiap titik rawan akan memiliki suatu time windows yang harus dipantau polisi dalam rentang time windows tersebut. Masalah optimasi rute ini dapat dimodelkan sebagai Vehicle Routing Problem with Time Windows dan diselesaikan secara eksak menggunakan Mixed Integer Linear Programming. Penelitian ini akan membahas studi kasus terkait optimasi rute patroli polisi di Kecamatan Dramaga, Kabupaten Bogor, Jawa Barat. Proses optimasi dilakukan dengan bantuan software LINGO 19.0. Penelitian ini memperoleh hasil optimasi berupa total biaya minimum operasional patroli polisi, waktu mulai patroli polisi di titik rawan, dan rute patroli polisi optimal berdasarkan tipe kendaraan yang berbeda.

Efficient police patrol route will consider the allocation of potential hotspot which would make it easier for police to conduct the crime prevention as well as minimize police patrol operational cost. Each hotspot will be applied with time windows, hence police must observe the hotspot within the time windows. This route optimization problem can be modelled as Vehicle Routing Problem with Time Windows and can be solved by Mixed Integer Linear Programming as the exact approach. This research will discuss the case study of police patrol route optimization in Dramaga District, Bogor Regency, West Java. Optimization process was performed by using LINGO 19.0 software. Results of optimization from this research include the minimum police patrol total operational cost, starting time of police patrol at the hotspot, and optimal police patrol route based on distinct type of vehicles.