Penerapan Algoritma Sequential Insertion Dalam Pendistribusian BBM di Kawasan TImur Indonesia (Studi Kasus Pada PT. Pertamina UPMS VIII Terminal Transit Wayame-Ambon)

  • D. B. Paillin Universitas Pattimura
  • Erlon Wattimena Universitas Pattimura
Keywords: Vehicle Routing Problem (VRP), VRP with heterogeneous fleet of vehicle, VRP with multiple trips, VRP with split deliveries, VRP with multiple products and multiple compartements, sequential insertion

Abstract

Problems distribution where the transport vehicle departs from depot to get to some destination point by passing through multiple routes and come back to the same depot better known as the Vehicle Routing Problem ( VRP ) . VRP is an NP - hard problem Combinatorial means more size or variable problem, efforts to make computing will also increase exponentially. This is the background of this research by applying algorithms Sequential Insertion resolve the problems of VRP to determine the optimum (minimum of vehicles and duration ) in the distribution of fuel in the eastern region of Indonesia with the characteristics of VRP with heterogeneous fleet of vehicles , VRP with multiple trips , VRP with split deliveries, VRP with multiple products and multiple compartements.

Downloads

Download data is not yet available.
Published
2015-03-09
How to Cite
Paillin, D. B., & Wattimena, E. (2015). Penerapan Algoritma Sequential Insertion Dalam Pendistribusian BBM di Kawasan TImur Indonesia (Studi Kasus Pada PT. Pertamina UPMS VIII Terminal Transit Wayame-Ambon). ARIKA, 9(1), 53-62. Retrieved from https://ojs3.unpatti.ac.id/index.php/arika/article/view/414
Section
Articles

Most read articles by the same author(s)