An optimization model for vehicle routing problem in last-mile delivery

Tiwari, Krishna Veer; Sharma, Satyendra Kumar

doi:10.1016/j.eswa.2023.119789

Cited by 15 publications

(6 citation statements)

References 74 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Ketika sebuah perusahaan distribusi menghadapi situasi di mana total permintaan pelanggan melebihi total kapasitas muatan armada kendaraan yang dimiliki, maka salah satu penyelesaian yang dapat dilakukan ialah dengan mengizinkan satu atau lebih kendaraan melakukan perjalanan (ritasi) tambahan untuk menyelesaikan pengiriman. Masalah ini dikenal sebagai VRP multiperjalanan (VRP with multiple trips, VRPMT) dan menjadi penting karena memiliki aplikasi yang luas dalam manajemen rantai pasok, misalnya last-mile delivery [21]. Dengan memecahkan VRP multiperja-lanan secara efisien, perusahaan dapat mengoptimumkan penggunaan armada kendaraan sehingga mengurangi biaya operasional.…”

Section: Pendahuluanunclassified

See 1 more Smart Citation

Optimalitas Rute pada Pengiriman Multiperjalanan dengan Armada Kendaraan Listrik Heterogen

Salsabilla,

Bakhtiar,

Hanum

2024

Jambura J. Math

View full text Add to dashboard Cite

Electric vehicles are emerging as a key trend in sustainable mobility, mitigating emissions, and reducing dependence on fossil fuels. The challenge in optimizing route modeling lies in some limitations, such as battery range, charging time, and the diversity of electric vehicle types. This article explores the optimality of routes in a multiple-trip distribution system using a heterogeneous fleet of electric vehicles. The electric vehicle routing problem is formulated as a mixed-integer linear programming aiming to find the most cost-efficient optimal route. A notable feature of the model allows electric vehicle fleets to undertake additional travel to complete distribution tasks, i.e., multiple trips. The model is implemented in two illustrative examples involving the delivery of goods using homogeneous and heterogeneous electric vehicle fleets characterized by loading and battery capacities. Each case includes one depot, 8 and 10 customers, and 2 battery swapping stations, solved using the branch-and-bound method through Lingo 18.0. Simulation results indicate that battery capacity and the presence of battery swapping stations significantly influence the routes selection.

show abstract

Section: Pendahuluanunclassified

“…Model EVRPMT yang menjadi fokus pembahasan dalam artikel ini dapat dinyatakan sebagai meminimumkan biaya operasional (2) terhadap kendala-kendala ( 5)- (21). Pada bab ini, dibahas penerapan model pada masalah distribusi barang multiperjalanan.…”

Section: Hasil Dan Pembahasanunclassified

Optimalitas Rute pada Pengiriman Multiperjalanan dengan Armada Kendaraan Listrik Heterogen

Salsabilla,

Bakhtiar,

Hanum

2024

Jambura J. Math

View full text Add to dashboard Cite

show abstract

“…Ref. [19] focused on multiple vehicle routing problems under a maximum capacity constraint and no time constraint, comparing three optimization algorithms: intra-route local search, inter-route local search, and tabu search.…”

Section: The Vehicle Routing Problem Under Front Warehouse Modementioning

confidence: 99%

A Two-Echelon Multi-Trip Capacitated Vehicle Routing Problem with Time Windows for Fresh E-Commerce Logistics under Front Warehouse Mode

Guo,

Hu,

Xue

2024

Systems

View full text Add to dashboard Cite

Given the swift expansion of fresh e-commerce, the front warehouse mode can respond quickly and ensure the quality of fresh products. However, the complexity of the supply chain structure under front warehouse mode poses a challenge in reducing logistics costs and improving distribution efficiency while meeting consumers’ immediate delivery demands. Therefore, this paper studies the vehicle routing problem of two-echelon fresh e-commerce under front warehouse mode. Considering trans-shipment time constraints between the two echelons and the characteristics of terminal distribution, this paper initially models the vehicle routing problem for front warehouses as a two-echelon multi-trip capacitated vehicle routing problem with time windows. A mixed-integer linear programming model is subsequently established. To solve the model, a hybrid genetic algorithm integrated with neighborhood search is developed. Matrix coding is employed to merge vehicle selection and route assignment decisions. Simultaneously, neighborhood search is applied to enhance the search capability of algorithms, thereby improving the quality of solutions. Furthermore, the effectiveness and efficiency of the model and algorithm are verified through experiments of varying scales. Finally, comparative strategies and sensitivity analysis highlight the advantages of multi-trip strategies and provide insights into the optimal vehicle capacity limit.

show abstract

“…The purpose of work [20] was to find the most efficient routes for several delivery vehicles with the same capacity if the demand at each point was fully satisfied by one vehicle, but the calculation does not take into account when demand fluctuates constantly. The use of information technology in logistics systems in [21] the use of information technology in logistics systems is aimed at interaction between enterprises in the process of supply and marketing of goods.…”

Section: Literature Review and Problem Statementmentioning

confidence: 99%

Construction of a simulation model for the transportation of perishable goods along variable routes

Anufriyeva

Matsiuk

Shramenko

et al. 2023

EEJET

View full text Add to dashboard Cite

The object of research is the system of organization of transportation of perishable goods. The study subject is the technological process of transportation of perishable goods by small shipments. The problem solved was a multicriteria optimization of the technological process of delivery of perishable goods by small shipments. The results are the built simulation model for the distribution of small consignments of perishable goods and the optimization according to the criterion of minimizing delivery time while limiting the rational use of available vehicles. To construct a simulation model, discrete-event and agent-based principles were used. The model built combines the solution to the transport problem and the traveling salesman problem simultaneously with taking into account the stochastic duration of technological operations. When forming the distribution route, the model algorithm takes into account the minimum allowable batch size to the i-th destination, which allows each time to build a new unique route of the vehicle. Unlike existing ones, the model constructed allows taking into account the peculiarities of the distribution network, the minimum consignment of cargo, and dynamically changing the route in accordance with the available cargo. Each time the cargo mass arrives at the logistics terminal, the condition of a sufficient quantity of goods intended for delivery to points of sale is checked. If the quantity of cargo sufficient for shipment is equal to the capacity of the car body, a new information message is generated on the availability of goods ready for shipment. Scope and conditions of practical use of the obtained results include transport companies, retail chains, distribution logistics

show abstract

An optimization model for vehicle routing problem in last-mile delivery

Cited by 15 publications

References 74 publications

Optimalitas Rute pada Pengiriman Multiperjalanan dengan Armada Kendaraan Listrik Heterogen

Optimalitas Rute pada Pengiriman Multiperjalanan dengan Armada Kendaraan Listrik Heterogen

A Two-Echelon Multi-Trip Capacitated Vehicle Routing Problem with Time Windows for Fresh E-Commerce Logistics under Front Warehouse Mode

Construction of a simulation model for the transportation of perishable goods along variable routes

Contact Info

Product

Resources

About