A Simulated Annealing Algorithm for Solving Two-Echelon Vehicle Routing Problem with Locker Facilities

Redi, Anak Agung Ngurah Perwira; Jewpanya, Parida; Kurniawan, Adji Candra; Persada, Satria Fadil; Nadlifatin, Reny; Dewi, Oki Anita Candra

doi:10.3390/a13090218

Cited by 23 publications

(14 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The mathematical model of the 2EVRPA was developed based on the basic model of the two-echelon vehicle routing problem (2EVRP) developed by Perboli, et al [39], which was then modified to facilitate single point-to-point assignment in the second echelon for the present study. A comparable model has been developed for the city logistics context [40]. The 2EVRPA is formulated as the following.…”

Section: Two-echelon Vehicle Routing Problem Combined With Assignment...mentioning

confidence: 99%

Collaborative Hybrid Aerial and Ground Vehicle Routing for Post-Disaster Assessment

et al. 2021

Self Cite

View full text Add to dashboard Cite

Hybrid aerial and ground vehicles are seen as a promising option for deployment in a post-disaster assessment due to the risk of infrastructure damage that may hinder the assessment operation. The efficient operation of the hybrid aerial and ground vehicle, particularly routings, remains a challenge. The present study proposed a collaborative hybrid aerial and ground vehicle to support the operation of post-disaster assessment. The study developed two models, i.e., the Two-Echelon Vehicle Routing Problem combined with Assignment (2EVRPA) and the Two-Echelon Collaborative Vehicle Routing Problem (2ECoVRP) to evaluate optimal routings for both aerial and ground vehicles. The difference lies in the second echelon in which the 2EVRPA uses a single point-to-point assignment, whereas the 2ECoVRP considers the collaborative routings between the ground vehicle and the aerial vehicle. To demonstrate its applicability, the developed models were applied to solve the post-disaster assessment for the Mount Merapi eruption in Yogyakarta, Indonesia. Sets of numerical experiments based on the empirical case were conducted. The findings indicate that the 2ECoVRP performs better than 2EVRPA in terms of the total operation time. The tabu search algorithm was found to be a promising method to solve the models due to its good quality solution and computational efficiency. The deployment of eight drones appears to be optimum for the given network configuration of the studied case. Flight altitude and battery capacity were found to be influential to the operation time, hence requiring further exploration. Other potential avenues for future research are also discussed.

show abstract

Section: Two-echelon Vehicle Routing Problem Combined With Assignment...mentioning

confidence: 99%

Collaborative Hybrid Aerial and Ground Vehicle Routing for Post-Disaster Assessment

et al. 2021

Self Cite

View full text Add to dashboard Cite

show abstract

“…The total profit was made up of the revenue from the end customer using the service, deducting the fixed costs and the costs of setting up facilities, discounted shipping costs for the customers, and the potential loss of customers who do not wish to use facilities. Research conducted by Redi [10] developed a two-echelon vehicle route problem model by considering the locker facility denoted by 2E-VRPLF. The study compared the results of the 2E-VRPLF calculation with the home-delivery method, indicating that 2E-VRPLF can reduce transportation costs by 70.4%.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Furthermore, a simulated annealing (SA) heuristic is proposed to solve 2EVRP-DF. This is motivated by the success of SA algorithms in solving various VRP variants [10,[21][22][23]. It also addresses the inability of the exact solution approach in solving larger size instances.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Thus, consideration of emission costs is often included when discussing sustainable and green logistics activity. Furthermore, studies regarding the utilization of parcel lockers to enhance reverse logistics are also gaining increasing interest from researchers [10][11][12]. However, among the research available on parcel lockers applied in reverse logistics, to the best of our knowledge no available study proposes the analysis of using parcel lockers or drop box facilities for reverse logistics considering emission cost.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Solving the Two Echelon Vehicle Routing Problem Using Simulated Annealing Algorithm Considering Drop Box Facilities and Emission Cost: A Case Study of Reverse Logistics Application in Indonesia

et al. 2021

Self Cite

View full text Add to dashboard Cite

A two echelon distribution system is often used to solve logistics problems. This study considers a two-echelon distribution system in reverse logistics context with the use of drop box facility as an intermediary facility. An optimization model of integer linear programming is proposed, representing a two-echelon vehicle routing problem with a drop box facility (2EVRP-DF). The aim is to find the minimum total costs consisting of vehicle transportation costs and the costs to compensate customers who have to travel to access these intermediary facilities. The results are then compared to those of common practice in reverse logistics. In common practice, customers are assumed to go directly to the depot to drop their goods. In addition, this study analyzes the environmental impact by adding a component of carbon emissions emitted by the vehicles. A set of comprehensive computational experiments is conducted. The results indicate that the 2EVRP-DF model can provide optimal costs and lower carbon emissions than the common practice.

show abstract

“…In both studies by A. A. N. P. Redi, 12,13 SA algorithms have been applied in routing problems. In the first study, 12 the objective was to find minimum routes that require less transportation time whereas, in the second study, 13 the research aimed to reduce the transportation expenses.…”

Section: Literature Reviewmentioning

confidence: 99%

Performance Analysis of Simulated Annealing and Genetic Algorithm on systems of linear equations

et al. 2021

View full text Add to dashboard Cite

Problem solving and modelling in traditional substitution methods at large scale for systems using sets of simultaneous equations is time consuming. For such large scale global-optimization problem, Simulated Annealing (SA) algorithm and Genetic Algorithm (GA) as meta-heuristics for random search technique perform faster. Therefore, this study applies the SA to solve the problem of linear equations and evaluates its performances against Genetic Algorithms (GAs), a population-based search meta-heuristic, which are widely used in Travelling Salesman problems (TSP), Noise reduction and many more. This paper presents comparison between performances of the SA and GA for solving real time scientific problems. The significance of this paper is to solve the certain real time systems with a set of simultaneous linear equations containing different unknown variable samples those were simulated in Matlab using two algorithms-SA and GA. In all of the experiments, the generated random initial solution sets and the random population of solution sets were used in the SA and GA respectively. The comparison and performances of the SA and GA were evaluated for the optimization to take place for providing sets of solutions on certain systems. The SA algorithm is superior to GA on the basis of experimentation done on the sets of simultaneous equations, with a lower fitness function evaluation count in MATLAB simulation. Since, complex non-linear systems of equations have not been the primary focus of this research, in future, performances of SA and GA using such equations will be addressed. Even though GA maintained a relatively lower number of average generations than SA, SA still managed to outperform GA with a reasonably lower fitness function evaluation count. Although SA sometimes converges slowly, still it is efficient for solving problems of simultaneous equations in this case. In terms of computational complexity, SA was far more superior to GAs.

show abstract

A Simulated Annealing Algorithm for Solving Two-Echelon Vehicle Routing Problem with Locker Facilities

Cited by 23 publications

References 22 publications

Collaborative Hybrid Aerial and Ground Vehicle Routing for Post-Disaster Assessment

Collaborative Hybrid Aerial and Ground Vehicle Routing for Post-Disaster Assessment

Solving the Two Echelon Vehicle Routing Problem Using Simulated Annealing Algorithm Considering Drop Box Facilities and Emission Cost: A Case Study of Reverse Logistics Application in Indonesia

Performance Analysis of Simulated Annealing and Genetic Algorithm on systems of linear equations

Contact Info

Product

Resources

About