Claim Missing Document
Check
Articles

Found 3 Documents
Search

Development Of A Vehicle Routing Problem Model To Reduce Service Delays In Pickup And Delivery Operations Stefhen, Gilbert; Suryadi, Dedy; Iswari, Titi
Journal of Social Research Vol. 4 No. 8 (2025): Journal of Social Research
Publisher : International Journal Labs

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55324/josr.v4i7.2683

Abstract

The rapid growth of the e-commerce sector in Indonesia has increased the demand for reliable and timely logistics services. However, challenges such as delayed pickups and deliveries continue to occur, leading to the accumulation of operational penalties. This study aims to develop a mathematical model based on the Vehicle Routing Problem (VRP) that addresses the complexities of modern logistics distribution. The proposed model, named HFMTVRPDPTW (Heterogeneous Fleet Multi-Trip Vehicle Routing Problem with Delivery and Pickup and Time Windows), incorporates five key elements: vehicle capacity, fleet heterogeneity, service time windows, simultaneous pickup and delivery, and multi-trip operations within a single working period. A systematic literature review of twenty-one prior studies was conducted to identify research gaps and inform the model’s development. The model is formulated using an integer linear programming (ILP) approach and aims to optimize service time accuracy while minimizing delays. The findings suggest that this model provides a more comprehensive and realistic approach to distribution challenges and offers an original contribution to the development of adaptive and efficient VRP models for logistics operations.
Pengembangan Model Sinkronisasi Distribusi Dua Eselon pada Urban Consolidation Center (UCC) di Sistem Logistik Perkotaan Iswari, Titi
Jurnal PASTI (Penelitian dan Aplikasi Sistem dan Teknik Industri) Vol 19, No 2 (2025): Jurnal PASTI
Publisher : Universitas Mercu Buana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22441/pasti.2025.v19i2.002

Abstract

Distribusi logistik dua eselon di kawasan perkotaan menghadapi tantangan kompleks, seperti keterbatasan kapasitas kendaraan, kapasitas penyimpanan, dan optimasi rute distribusi. Penelitian ini bertujuan mengembangkan model matematis untuk menyinkronkan distribusi dua eselon pada sistem Urban Consolidation Center (UCC), dengan mengintegrasikan aspek inventori dan perutean kendaraan secara simultan. Model mencakup tiga skema distribusi pada eselon pertama (Direct & No Inventory, Direct–Inventory, dan Route–Inventory). Optimasi pada eselon pertama diselesaikan menggunakan AMPL dengan solver CPLEX, sedangkan persoalan distribusi pada eselon kedua diseleaikan dengan pendekatan Economic Order Quantity (EOQ) dan algoritma Large Neighborhood Search (LNS). Eksperimen dilakukan dengan berbagai skenario, seperti jumlah retailer, supplier, dan biaya penyimpanan. Skema ketiga (Route & Inventory) terbukti menghasilkan total biaya logistik paling rendah, dengan efisiensi biaya yang konsisten di berbagai konfigurasi, mencapai penghematan sebesar 20 - 60%. Model ini berkontribusi dalam perancangan sistem logistik perkotaan yang lebih hemat biaya dan efisien.
Sequential Routing-Loading Algorithm for Optimizing One-Door Container Closed-Loop Logistics Operations Ariningsih, Paulina Kus; Iswari, Titi; Poetra, Kevin Djoenneady; Aritonang, Yoon Mac Kinley
Jurnal Optimasi Sistem Industri Vol. 19 No. 2 (2020): Published in October 2020
Publisher : The Industrial Engineering Department of Engineering Faculty at Universitas Andalas

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (169.165 KB) | DOI: 10.25077/josi.v19.n2.p122-132.2020

Abstract

One-door container type of vehicle is the main tool for urban logistics in Indonesia which may take the form of truck, car, or motorcycle container. The operations would be more effective when it is performed through pickup-delivery or forward-reverse at a time. However, there is difficulty to optimize the operation of routing and container loading processes in such a system. This article is proposing an improvement for algorithm for sequential routing- loading process which had been tested in the small datasets but not yet tested in the case of big data set and vehicle routing problem with time windows. The improvement algorithm is tested in big data set with the input of the vehicle routing problem with time windows (VRP-TW) using the solution optimization of the Simulated Annealing process with restart point procedure (SA-R) for the routing optimization and Genetic Algorithm (GA) to optimize the container loading algorithm. The large data sets are hypothetical generated data for 800-2500 single-sized products, 4 types of container capacity, and 100-400 consumer spots. As result, the performance of the proposed algorithm in terms of cost is influenced by the number of spots to be visited by the vehicle and the vehicle capacity. Limitations and further analysis are also described in this article.