Penerapan Algoritma Sequential Insertion Dalam Pendistribusian BBM di Kawasan TImur Indonesia (Studi Kasus Pada PT. Pertamina UPMS VIII Terminal Transit Wayame-Ambon)
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
An author who publishes in the ARIKA Jurnal agrees to the following terms:
- The author retains the copyright and grants ARIKA journal the right of first publication of the work simultaneously licensed under the Creative Commons Attribution-ShareAlike 4.0 License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- The author is able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book) with the acknowledgment of its initial publication in this journal.
- The author is permitted and encouraged to post his/her work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of the published work (See The Effect of Open Access).
