A simulated annealing-based approach for a real case study of vehicle routing problem with a heterogeneous fleet and time windows

Bernal, José; Escobar, John Willmer; Linfati, Rodrigo

doi:10.1504/ijstl.2021.112923

Cited by 10 publications

(5 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Metaheuristic algorithms based on granular search space for similar routing problems could be implemented for phase 2, as proposed by Ref. [ [33] , [34] , [35] , [36] , [37] , [38] , [39] , [40] ]. Finally, population-based algorithms could be used in phase 2, generating multiple solutions in phase 1, such as proposed for similar problems by Santa Chávez et al [ 41 ], Chávez et al [ 42 ], Bolanos et al [ 43 ], Escobar-Falcón et al [ 44 ] and Londoño et al [ 45 ].…”

Section: Discussionmentioning

confidence: 99%

A three-phase algorithm for the pollution traveling Salesman problem

García-Vasquez,

Linfati,

Escobar

2024

Heliyon

Self Cite

View full text Add to dashboard Cite

Section: Discussionmentioning

confidence: 99%

A three-phase algorithm for the pollution traveling Salesman problem

García-Vasquez,

Linfati,

Escobar

2024

Heliyon

Self Cite

View full text Add to dashboard Cite

“…We could also limit the capacity of the electricity grid, the number of vehicles that recharge simultaneously, and the geographical arrangement of the terrain, considering the energy from the regenerative brake, and include circulation constraints, among others. Finally, granular tabu search strategies could be extended from similar problems [55][56][57][58][59][60] to solve large-size instances of the problem.…”

Section: Discussionmentioning

confidence: 99%

Mathematical Model for the Electric Vehicle Routing Problem Considering the State of Charge of the Batteries

2022

Self Cite

View full text Add to dashboard Cite

In recent decades, scientific interest has grown in tackling the vehicle routing problem with a sustainable approach (Green VRP). There are numerous studies in the literature addressing environmental problems from the point of view of efficient planning that allows visualizing the benefits associated with the use of the new technologies in electric vehicles. This paper focuses on the electric vehicle routing problem and considers the batteries’ state of charge (SoC). The problem considers a set of customers, where each one has a specific demand and a time window. Deliveries are performed through a homogeneous fleet of electric vehicles with a fixed charging capacity and limited autonomy. In particular, when the vehicle is traveling, it consumes an amount of energy proportional to the distance it travels; therefore, it must visit battery recharging stations to continue and complete its route. The objective is to determine the performed routes with the minimum cost (time), while seeking to visit the recharging stations as many times as possible. In this way, overcharging and deep discharges are avoided by protecting the battery from degradation. In this paper, four models are proposed: the first model requires that the battery be fully charged in the stations; the second model allows partial recharging; the third formulation limits deep discharge; and a fourth formulation adheres to a limitation associated with overcharging and tries to keep the battery in its most comfortable place. The efficiency of the proposed formulations is tested in structured instances of different sizes. The results obtained show the efficiency of the formulations proposed for the electric vehicle routing problem when considering battery degradation.

show abstract

“…The probability of accepting a worse solution is determined by a formula that considers the gap of solution quality with the earlier solution and the parameter denoted as temperature. Several other studies have proven that SA successfully solved the problem of VRP and its variants [28][29][30].…”

Section: Solving 2evrp-df With Simulated Annealingmentioning

confidence: 99%

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

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

A simulated annealing-based approach for a real case study of vehicle routing problem with a heterogeneous fleet and time windows

Cited by 10 publications

References 0 publications

A three-phase algorithm for the pollution traveling Salesman problem

A three-phase algorithm for the pollution traveling Salesman problem

Mathematical Model for the Electric Vehicle Routing Problem Considering the State of Charge of the Batteries

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

Contact Info

Product

Resources

About