scholarly journals Iterated local search with Trellis-neighborhood for the partial Latin square extension problem

2016 ◽  
Vol 22 (5) ◽  
pp. 727-757 ◽  
Author(s):  
Kazuya Haraguchi
2004 ◽  
Vol 32 (5) ◽  
pp. 479-484 ◽  
Author(s):  
Carla P. Gomes ◽  
Rommel G. Regis ◽  
David B. Shmoys

Algorithms ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 45
Author(s):  
Rafael D. Tordecilla ◽  
Pedro J. Copado-Méndez ◽  
Javier Panadero ◽  
Carlos L. Quintero-Araujo ◽  
Jairo R. Montoya-Torres ◽  
...  

The location routing problem integrates both a facility location and a vehicle routing problem. Each of these problems are NP-hard in nature, which justifies the use of heuristic-based algorithms when dealing with large-scale instances that need to be solved in reasonable computing times. This paper discusses a realistic variant of the problem that considers facilities of different sizes and two types of uncertainty conditions. In particular, we assume that some customers’ demands are stochastic, while others follow a fuzzy pattern. An iterated local search metaheuristic is integrated with simulation and fuzzy logic to solve the aforementioned problem, and a series of computational experiments are run to illustrate the potential of the proposed algorithm.


Sign in / Sign up

Export Citation Format

Share Document