Optimization of the Multiechelon System for Repairable Spare Parts Using Swarm Intelligence Combined with a Local Search Strategy

2014 ◽  
pp. 747-761 ◽  
Author(s):  
Orlando Duran ◽  
Luis Perez
Keyword(s):  
Local Search ◽  
Swarm Intelligence ◽  
Search Strategy ◽  
Spare Parts ◽  
Local Search Strategy

scholarly journals A Local Search-Based Generalized Normal Distribution Algorithm for Permutation Flow Shop Scheduling

2021 ◽  
Vol 11 (11) ◽  
pp. 4837
Author(s):  
Mohamed Abdel-Basset ◽  
Reda Mohamed ◽  
Mohamed Abouhawwash ◽  
Victor Chang ◽  
S. S. Askar
Keyword(s):  
Local Search ◽  
Search Strategy ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Discrete Problem ◽  
Mutation Operator ◽  
Shop Scheduling ◽  
Permutation Flow Shop Scheduling ◽  
Local Search Strategy ◽  
Generalized Normal Distribution

This paper studies the generalized normal distribution algorithm (GNDO) performance for tackling the permutation flow shop scheduling problem (PFSSP). Because PFSSP is a discrete problem and GNDO generates continuous values, the largest ranked value rule is used to convert those continuous values into discrete ones to make GNDO applicable for solving this discrete problem. Additionally, the discrete GNDO is effectively integrated with a local search strategy to improve the quality of the best-so-far solution in an abbreviated version of HGNDO. More than that, a new improvement using the swap mutation operator applied on the best-so-far solution to avoid being stuck into local optima by accelerating the convergence speed is effectively applied to HGNDO to propose a new version, namely a hybrid-improved GNDO (HIGNDO). Last but not least, the local search strategy is improved using the scramble mutation operator to utilize each trial as ideally as possible for reaching better outcomes. This improved local search strategy is integrated with IGNDO to produce a new strong algorithm abbreviated as IHGNDO. Those proposed algorithms are extensively compared with a number of well-established optimization algorithms using various statistical analyses to estimate the optimal makespan for 41 well-known instances in a reasonable time. The findings show the benefits and speedup of both IHGNDO and HIGNDO over all the compared algorithms, in addition to HGNDO.

scholarly journals Noninferior Solution Grey Wolf Optimizer with an Independent Local Search Mechanism for Solving Economic Load Dispatch Problems

Energies ◽  
2019 ◽  
Vol 12 (12) ◽  
pp. 2274 ◽  
Author(s):  
Jianzhong Xu ◽  
Fu Yan ◽  
Kumchol Yun ◽  
Lifei Su ◽  
Fengshu Li ◽  
...  
Keyword(s):  
Power Systems ◽  
Local Search ◽  
Optimization Problem ◽  
Search Strategy ◽  
Local Optimum ◽  
Economic Load Dispatch ◽  
Problem Solution ◽  
Main Task ◽  
Grey Wolf ◽  
Local Search Strategy

The economic load dispatch (ELD) problem is a complex optimization problem in power systems. The main task for this optimization problem is to minimize the total fuel cost of generators while also meeting the conditional constraints of valve-point loading effects, prohibited operating zones, and nonsmooth cost functions. In this paper, a novel grey wolf optimization (GWO), abbreviated as NGWO, is proposed to solve the ELD problem by introducing an independent local search strategy and a noninferior solution neighborhood independent local search technique to the original GWO algorithm to achieve the best problem solution. A local search strategy is added to the standard GWO algorithm in the NGWO, which is called GWOI, to search the local neighborhood of the global optimal point in depth and to guarantee a better candidate. In addition, a noninferior solution neighborhood independent local search method is introduced into the GWOI algorithm to find a better solution in the noninferior solution neighborhood and ensure the high probability of jumping out of the local optimum. The feasibility of the proposed NGWO method is verified on five different power systems, and it is compared with other selected methods in terms of the solution quality, convergence rate, and robustness. The compared experimental results indicate that the proposed NGWO method can efficiently solve ELD problems with higher-quality solutions.

Automated clustering by support vector machines with a local-search strategy and its application to image segmentation

Optik ◽  
2015 ◽  
Vol 126 (24) ◽  
pp. 4964-4970 ◽  
Author(s):  
Chih-Hung Wu ◽  
Chih-Chin Lai ◽  
Chun-Yen Chen ◽  
Yan-He Chen
Keyword(s):  
Image Segmentation ◽  
Support Vector Machines ◽  
Local Search ◽  
Search Strategy ◽  
Support Vector ◽  
Vector Machines ◽  
Local Search Strategy

A hybrid multi-objective PSO algorithm with local search strategy for VLSI partitioning

2014 ◽  
Vol 8 (2) ◽  
pp. 203-216 ◽  
Author(s):  
Wenzhong Guo ◽  
Genggeng Liu ◽  
Guolong Chen ◽  
Shaojun Peng
Keyword(s):  
Local Search ◽  
Search Strategy ◽  
Pso Algorithm ◽  
Multi Objective ◽  
Local Search Strategy

An Effective Chaotic Cultural-Based Particle Swarm Optimization for Constrained Engineering Design Problems

2010 ◽  
Vol 20-23 ◽  
pp. 64-69 ◽  
Author(s):  
Yong Quan Zhou ◽  
Lingzi Liu
Keyword(s):  
Particle Swarm Optimization ◽  
Local Search ◽  
Engineering Design ◽  
Search Strategy ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Design Problems ◽  
Swarm Optimization ◽  
Engineering Design Problems ◽  
Local Search Strategy

In this paper, a novel chaotic cultural-based particle swarm optimization algorithm (CCPSO) is proposed for constrained optimization problems by employing cultural-based particle swarm optimization (CPSO) algorithm and the notion of chaotic local search strategy. In the CCPSO, the shortcoming of cultural-based particle swarm optimization (CPSO) that it is easy to trap into local minimum be overcome, the chaotic local search strategy is introduced in the influence functions of cultural algorithm. Simulation results based on well-known constrained engineering design problems demonstrate the effectiveness, efficiency and robustness on initial populations of the proposed method.

Sign in / Sign up

Export Citation Format

Share Document