scholarly journals SimILS: a simulation-based extension of the iterated local search metaheuristic for stochastic combinatorial optimization

2016 ◽  
Vol 10 (1) ◽  
pp. 69-77 ◽  
Author(s):  
Alex Grasas ◽  
Angel A Juan ◽  
Helena R Lourenço
Keyword(s):  
Combinatorial Optimization ◽  
Local Search ◽  
Iterated Local Search ◽  
Stochastic Combinatorial Optimization ◽  
Simulation Based

scholarly journals Iterated Local Search in Combinatorial Optimization Problem

2019 ◽  
pp. 405-412
Author(s):  
Mehedi Hasan
Keyword(s):  
Combinatorial Optimization ◽  
Local Search ◽  
Optimization Problems ◽  
Optimization Method ◽  
Iterated Local Search ◽  
Military Operations ◽  
Combinatorial Optimization Problems ◽  
Military Operations Research ◽  
The Military ◽  
The Mathematical Model

Iterated local search (ILS) is a very powerful optimization method for continuous-valued numerical optimization. However, ILS has seldom been used to solve combinatorial integer-valued optimization problems. In this paper, the iterated local search (ILS) with random restarts algorithm is applied to solve combinatorial optimization problems, e.g., the classical weapon-target allocation (WTA) problem which arises from the military operations research. The mathematical model of the WTA problem is explained in detail. Then the idea of ILS with random restarts is explained. A comparison of the algorithm with several existing search approaches shows that the ILS outperforms its competitors on the tested WTA problem.

scholarly journals Combining Heuristics with Simulation and Fuzzy Logic to Solve a Flexible-Size Location Routing Problem under Uncertainty

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 ◽  
...  
Keyword(s):  
Fuzzy Logic ◽  
Local Search ◽  
Vehicle Routing Problem ◽  
Large Scale ◽  
Iterated Local Search ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Fuzzy Pattern ◽  
Reasonable Computing

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