Locker Facility Allocation for Delivery of Goods in the E-Commerce Business
Oki Anita Candra Dewi
Department of Logistics Engineering, Universitas Internasional Semen Indonesia,
Gresik 61122 Indonesia, E-mail: oki.dewi@uisi.ac.id
Siti Nurminarsih
Department of Logistics Engineering, Universitas Internasional Semen Indonesia,
Gresik 61122 Indonesia, E-mail: siti.nurminarsih@uisi.ac.id
Maulin Masyito Putri
Department of Logistics Engineering, Universitas Internasional Semen Indonesia,
Gresik 61122 Indonesia, E-mail: maulin.putri@uisi.ac.id
Muhammad Faisal Ibrahim
Department of Logistics Engineering, Universitas Internasional Semen Indonesia,
Gresik 61122 Indonesia, E-mail: muhammad.ibrahim@uisi.ac.id
Winda Narulidea
Department of Logistics Engineering, Universitas Internasional Semen Indonesia,
Gresik 61122 Indonesia, E-mail: winda.narulidea@uisi.ac.id
Abstrct
In urban logistics, long distance shipments from warehouses to consumer are becoming difficult with continued e-commerce growth. This requires complex planning and scheduling to minimize global travel costs, but often experiences challenges such as lowering the economies of scale in the transportation system, including high levels of load fragmentation and low use of vehicle load compartments. In this study, we propose allocation of locker facilities for delivery point of goods in the e-commerce business. Automatic lockers are spread out at the location determined from the model developed in this study. This locker serves as an effective alternative solution to a gathering point of goods sent by the seller, as well as a gathering point for end customers who take items purchased from the e-commerce. We specifically discuss the set covering problem by considering the population density in each region. We attempt to optimize the location facilities by providing several options of the scope to cover the maximum customer. This problem is applied to a 42-node census tract representation of city center of Gresik.
Keywords : Locker allocation, e-commerce, city logistics, set covering problem.
Full Paper: Download Full Paper
Plagiarism Check I: Download Check Plagiarism
Peer Review I: Download Peer Review
Plagiarism Check II: Download Check Plagiarism
Peer Review II: Download Peer Review
