scholarly journals PERENCANAAN JADWAL DAN RUTE DISTRIBUSI ROKOK UNTUK MENEKAN TOTAL BIAYA TRANSPORTASI

2012 ◽  
Vol 13 (2) ◽  
pp. 151 ◽  
Author(s):  
Thomy Eko Saputro ◽  
Aprilia Prihatina

Thomy Eko Saputro DAN Aprilia PrihatinaJurusan Teknik Industri, Fakultas Teknik, Universitas Muhammadiyah MalangLaman: [email protected] satu hal yang berpengaruh dalam meningkatkan pelayanan konsumen adalah bagaimana mengirimkan produkyang tepat waktu kepada seluruh konsumen. Oleh karena itu pelaku bisnis perlu menerapkan suatu strategi yang tepat agardapat mengefisienkan dan mengefektifkan proses distribusinya. PR 567 sebagai distributor rokok perwakilan Purwodadiberupaya agar pendistribusian berjalan dengan baik karena mengingat proses distribusi dengan jumlah agen yang cukupbanyak seringkali mempersulit distributor untuk menentukan jadwal dan rute yang tepat. Permasalahan pendistribusianini termasuk dalam PVRP (Periodic Vehicle Routing Problem). Penyelesaian dilakukan menggunakan metode clusterfirst-second route dengan penugasan agen ke hari kunjungan menggunakan metode optimasi. Solusi akhir nantinyaakan memberikan jadwal dan rute kendaraan dengan total biaya tranportasi yang paling minimum. Pada penelitian iniwilayah distribusi dibagi menjadi 2 cluster dan dari penyelesaian model PVRP diperoleh frekuensi kunjungan yang tepatuntuk cluster 1 adalah sebanyak sekali dalam seminggu. Sedangkan untuk cluter 2 dikunjungi sebanyak 3 kali dalamseminggu. Hasil penentuan jadwal dan rute dari penelitian inimemberikan total biaya transportasi sebesar Rp725.805per minggu. Dengan kata lain terjadi penghematan sebesar Rp320.189/minggu atau menghemat sebesar 44% per minggudari biaya awal yang harus dikeluarkan.Kata kunci: Vehicle routing, periodic, nearest neighbour, optimasiABSTRACTOne of the main issue in improving the customer service is how to deliver the product on time to customers. Therefore,the stakeholders need to apply an appropriate strategy in order to make distribustion process become more efficient andeffective. Because it is hard to determine appropriate schedule and route when dealing with a lot agents, PR 567 as arepresentative distributor of cigarette in Purwodadi attempts to make its distribution process better. This was done by usingPVRP (Periodic Vehicle Routing Problem) model with cluster first-second route approach and optimization method forassigning vehicle. The result of this research were frequency, schedule, and route with the most minimum transportationcost. In this research, the distribution area was defined into two cluster. The best delivery frequency for cluster one was onceweek, while cluster two was three times a week. The transportation cost was Rp725805/week. In the other hand, the savingcost was Rp320189/week or 44%/week from the initial cost.Key words: Vehicle routing, periodic, nearest neighbour, optimization

2019 ◽  
Vol 20 (2) ◽  
pp. 68
Author(s):  
Annisa Kesy Garside ◽  
Nabila Rohmatul Laili

This paper discusses periodic vehicle routing problems that allow vehicles to travel on multiple trips in a single day. It is known as the Multi-Trip Periodic Vehicles (MTPVRP) Problem Route. Cluster-first route-second (CFRS) heuristics to solve MTPVRP was proposed in this study. In phase 1, customers were divided into clusters using the formulation of integer programming. Phase 2 determined the route of the cluster and verifies that the total journey time to visit the trips does not exceed the working hours of the vehicle. The implementation of the heuristic CFRS to solve the real problem faced by the LPG distributor shows that the procedure could provide a better routing solution.


2019 ◽  
Vol 53 (3) ◽  
pp. 850-866 ◽  
Author(s):  
Ann-Kathrin Rothenbächer

This paper addresses the periodic vehicle routing problem with time windows (PVRPTW). Therein, customers require one or several visits during a planning horizon of several periods. The possible visiting patterns (schedules) per customer are limited. In the classical PVRPTW, it is common to assume that each customer requires a specific visit frequency and offers all corresponding schedules with regular intervals between the visits. In this paper, we permit all kinds of schedule structures and the choice of the service frequency. We present an exact branch-and-price-and-cut algorithm for the classical PVRPTW and its variant with flexible schedules. The pricing problems are elementary shortest-path problems with resource constraints. They can be based on one of two new types of networks and solved with a labeling algorithm, which uses several known acceleration techniques, such as the [Formula: see text]-path relaxation and dynamic halfway points within bidirectional labeling. For instances in which schedule sets fulfill a certain symmetry condition, we present specialized improvements of the algorithm, such as constraint aggregation and symmetry breaking. Computational tests on benchmark instances for the PVRPTW show the effectiveness of our algorithm. Furthermore, we analyze the impact of different schedule structures on run times and objective function values. The online appendix is available at https://doi.org/10.1287/trsc.2018.0855 .


Sign in / Sign up

Export Citation Format

Share Document