Show simple item record

dc.contributor.advisorTran, Van Ly
dc.contributor.authorTran, Nguyen Phuong Linh
dc.date.accessioned2024-03-22T07:46:47Z
dc.date.available2024-03-22T07:46:47Z
dc.date.issued2023-03
dc.identifier.urihttp://keep.hcmiu.edu.vn:8080/handle/123456789/5238
dc.description.abstractThe logistics industry still faces many challenges and is undergoing development from tech firms that offer 3PLs to manufacturers with skilled technical consultants and advanced software platforms that are equipped with optimization algorithms to address complex and multi-constraint problems in actual transportation problems. Vehicle Routing Problem is becoming a significant issue in the real world, particularly in the ecommerce industry for last-mile delivery of goods to customers. As online shopping grows in popularity and increases considerably, more items are increasingly being canceled or redelivered by customers. In order to compute the penalty costs that raise the degree of customer service while both reducing transportation costs and increasing successful delivery, this thesis considers the Vehicle Routing Problem with a new condition: customer presence, to compute the penalty costs that enhance the successful delivery rate while reducing transportation costs and improving customer service levels. The two methods: ALNS algorithm and ACO algorithm will be considered and programed by Python. The result is to find out better solution as optimal routes, shorter delivery time and minimize the cost. This effort used the suggested model for a district 7 hub of an e-commerce company.en_US
dc.language.isoenen_US
dc.subjectVRPen_US
dc.subjectVRSPTDCen_US
dc.subjectAnt Colony Optimization (ACO)en_US
dc.subjectAdaptive Large Neighborhood Search (ALNS)en_US
dc.subjectEPCCen_US
dc.titleInventory Last-Mile Delivery Problem: A Case Study Of E-Comerceen_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record