Claim Missing Document
Check
Articles

Found 2 Documents
Search

Developing An Intelligent Logistics and Distribution System For A Large Number of Retail Outlets: A Big Data Analytics Approach Zulkarnain, Zulkarnain; Komarudin, Komarudin; Arofah, Fauziah; Rahman, Irvanu
CSID Journal of Infrastructure Development Vol 3, No 1 (2020)
Publisher : Universitas Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32783/csid-jid.v3i1.106

Abstract

The logistics and distribution system in the retail industry in Indonesia has its own complexity. The growth and productivity of the retail outlets in Indonesia have been increasing from year to year. Distribution activities in this study are related to the formation of salesman visit routes involving around 38,900 customer base retail outlets, which are quite numerous in number, calling for a challenging approach to find the optimized solution. Therefore, the case study in this research will be discussed on the concept of the Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP), considering the work balance and visit pattern constraints. The methods used in this research are the balanced K-means and the Minimum Span Tree – Kruskal’s Walk algorithm, which are proven to solve the problem with a shorter computation time and a more balanced daily route than the current conditions as the results.
Investigating the Vehicle Routing Problem with Simultaneous Pickup and Delivery in Multi-Product Distribution: An Optimization Approach Irvanu Rahman; Komarudin Komarudin; Frans Samuel
International Journal of Supply Chain Management Vol 9, No 3 (2020): International Journal of Supply Chain Management (IJSCM)
Publisher : International Journal of Supply Chain Management

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (478.297 KB)

Abstract

This study addresses a method to solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD), which carries multi-products in multiple compartments within a single-vehicle. The unique characteristics of the study is on the route determination of the vehicle from the depot to customers because not only does it consider the vehicle’s capacity but also the compartment capacity of each product as a limitation We calculate the set of instances using two customer grouping methods namely smallest maximum load (SML) and largest maximum load (LML). The solution obtained by the cheapest insertion method can be improved by the Tabu Search algorithm. Finally, the computational result is reported from the test instance.