A granular tabu search for the refrigerated vehicle routing problem with homogeneous fleet

Escobar, John Willmer; Duque, José Luis Ramírez; Cáceres, Rafael Guillermo García

doi:10.5267/j.ijiec.2021.6.001

Cited by 8 publications

(7 citation statements)

References 45 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

“…Besides, developing a stochastic solution of the proposed model using Sample Average Approximation (SAA) (Escobar et al 2013b ; Mafia and Escobar, 2015 ; Paz et al 2015 ; Rodado et al 2017 , Vélez et al 2021 ) would be considered. Finally, heuristic or metaheuristic based on granular search (Escobar and Linfati 2012 ; Escobar et al 2013a ; Escobar et al 2014a ; Escobar et al 2014b ; Puenayán et al 2014 ; Bernal et al 2017 ; Bernal et al 2018 ; Bernal et al 2021 ; Escobar 2022 and Riaño et al 2022 ) for solving large size instances could be considered.…”

Section: Concluding Remarks and Future Workmentioning

confidence: 99%

Two-stage optimization scheme of routing scheduling from a single distribution center to multiple customers

2023

View full text Add to dashboard Cite

This paper proposes a solution scheme for the problem of scheduling deliveries from distribution centers. The solution scheme is developed in two phases. The first phase corresponds to the collection and processing of data, and the second phase includes the design of a customer assignment model based on the data of the first phase. The first phase provides the characteristics of the customers, the number of orders to be dispatched, and the number of visited customers. In the second phase, optimization techniques are used, considering scheduling and assignment problem-solving methodologies. The optimization model provides the correct assignment of customer orders to vehicles, reducing the number of trips and the fleet's size and occupation percentage. The proposed solution scheme is developed with a company operating a distribution center responsible for dispatching vehicles to all retail customers, wholesalers, and distributors in the Province of Concepción, Province of Arauco, and Province of Itata in Chile. The obtained results are prominent and show that the proposed methodology can be extended to companies performing storage, transportation, and distribution tasks with similar characteristics.

show abstract

“…In this way, compactness allows comparison between different routes [9]. In addition, compactness is maximized when the metric is minimized according to (1). Route proximity i (PROX i ) is calculated according to (2).…”

Section: Customer Compactnessmentioning

confidence: 99%

“…The use and experience of the published works over the years have led to the identification of certain shortcomings of the VRP in practice [1].…”

Section: Introductionmentioning

confidence: 99%

Mathematical Models for the Vehicle Routing Problem by Considering Balancing Load and Customer Compactness

2022

Self Cite

View full text Add to dashboard Cite

The vehicle routing problem seeking to minimize the traveled distance and the deviation of the total workload is known as the vehicle routing problem with workload balance (WBVRP). In the WBVRP, several elements are considered: (i) the total distance or driving time, (ii) the number of customers to be visited, and (iii) the total weight or amount of delivered goods. We have considered the WBVRP by adding a concept called customer compactness and the visual attractiveness of the routes. The WBVRP allows a similar workload for drivers to improve their well-being and social development. Unbalanced routes could generate high costs due to potential strikes by drivers seeking an equitable workload. We have proposed three mathematical formulations for solving the WBVRP by minimizing the customer compactness and the distance with and without considering workload balancing. The workload balancing is based on the deviation concerning the average load of the routes and considering waiting and driving time. We have tested the efficiency of the proposed models on a synthetic set of instances, analyzing different aspects such as depot location, customer location, and demand. The analysis of the results has been performed considering customer compactness and the visual attractiveness of the obtained solution. Computational experiments on generated random instances show the efficiency of the proposed approaches.

show abstract

A granular tabu search for the refrigerated vehicle routing problem with homogeneous fleet

Cited by 8 publications

References 45 publications

A three-phase algorithm for the pollution traveling Salesman problem

A three-phase algorithm for the pollution traveling Salesman problem

Two-stage optimization scheme of routing scheduling from a single distribution center to multiple customers

Mathematical Models for the Vehicle Routing Problem by Considering Balancing Load and Customer Compactness

Contact Info

Product

Resources

About