A probabilistic granular tabu search for the distance constrained capacitated vehicle routing problem

Bernal, José; Escobar, John Willmer; Paz, Juan Camilo; Linfati, Rodrigo; Gatica, Gustavo

doi:10.1504/ijise.2018.10015425

Cited by 4 publications

(3 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

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

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

“…• Inclusion of dynamic probabilistic operators that change during the search, privileging the neighborhoods that generate better solutions [34][35].…”

Section: Investigationsmentioning

confidence: 99%

Comparative analysis of granular neighborhoods in a Tabu Search for the vehicle routing problem with heterogeneous fleet and variable costs (HFVRP)

2017

View full text Add to dashboard Cite

In the vehicle routing problem with heterogeneous fleet and variable costs (HFVRP), the group of routes to be developed to satisfy the demand of the customer must be determined, considering the minimization of the total costs of the travelled distance. Heuristic algorithms based on local searches use simple movements (neighborhoods) to generate feasible solutions to problems related to route design. In this article, we conduct a comparative analysis of granular neighborhoods in a Tabu Search for the HFVRP, in terms of the quality of the obtained solution. The computational experiments, performed on instances of benchmarking for the HFVRP, showed the efficiency and effectiveness of implementing some neighborhoods in metaheuristic algorithms of path, such as the Tabu Search.

show abstract

A probabilistic granular tabu search for the distance constrained capacitated vehicle routing problem

Cited by 4 publications

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

Comparative analysis of granular neighborhoods in a Tabu Search for the vehicle routing problem with heterogeneous fleet and variable costs (HFVRP)

Contact Info

Product

Resources

About