Internet Archive Scholar
Filters
























8,088 Hits in 3.0 sec

Research Report on Automatic Synthesis of Local Search Neighborhood Operators

Mateusz Ślażyński
2019 Electronic Proceedings in Theoretical Computer Science  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (232.6 kB)
https://web.archive.org/web/20200906232311/https://arxiv.org/pdf/1909.08261v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:

2019 pre-print arXiv:1909.08261v1 fatcat:3x3c2jtixjcmbo5fhb2sfkwhbu
Constraint Programming (CP) and Local Search (LS) are different paradigms for dealing with combinatorial search and optimization problems.  ...  We consider a limited formal language that we call a Neighborhood Definition Language, used to specify the neighborhood operators in a fine-grained and declarative manner.  ...  It supports several search strategies, including LS, and allows the definition of the neighborhood in a declarative manner as a composition of basic moves.  ... 
doi:10.4204/eptcs.306.59 fatcat:c6iatvjdvbasjdqoney33rqqhi
DOAJ Multiple Versions
Citation

Mateusz Ślażyński. "Research Report on Automatic Synthesis of Local Search Neighborhood Operators." Electronic Proceedings in Theoretical Computer Science (2019) 433-440

Enhancing Differential Evolution Utilizing Proximity-Based Mutation Operators

Michael G. Epitropakis, Dimitris K. Tasoulis, Nicos G. Pavlidis, Vassilis P. Plagianakos, Michael N. Vrahatis
2011 IEEE Transactions on Evolutionary Computation  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (2.4 MB)
https://web.archive.org/web/20170809090213/http://www.math.upatras.gr/~vrahatis/papers/journals/EpitropakisTPPV11_IEEE_T_EVOLUT_COMPUT_15_pp99-119_2011.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

The proposed framework can be applied to any mutation strategy with minimal changes.  ...  Motivated by the different manner in which various search operators behave, we propose a novel framework based on the proximity characteristics among the individual solutions as they evolve.  ...  , e.g., Hooke Jeeves algorithm, a stochastic local search, and simulated annealing.  ... 
doi:10.1109/tevc.2010.2083670 fatcat:k2z2j5grn5cgllinmanbbzxhsm
Citation

Michael G. Epitropakis, Dimitris K. Tasoulis, Nicos G. Pavlidis, Vassilis P. Plagianakos, Michael N. Vrahatis. "Enhancing Differential Evolution Utilizing Proximity-Based Mutation Operators." IEEE Transactions on Evolutionary Computation 15.1 (2011) 99-119

Metaheuristics in combinatorial optimization

Christian Blum, Andrea Roli
2003 ACM Computing Surveys  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (228.9 kB)
https://web.archive.org/web/20170829053128/http://csd.ijs.si/korosec/documents/Metaheuristics%20-%201%20-%20Introduction.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

Neighborhood Search & Scatter Search • Guided Local Search & Fast Local Search • Cellular Automata & Artificial Immune Systems • Oral Presentations & Competition Grading • Project: 50% • Final  ...  . • FLS -Fast Local Search -A way of reducing the size of the neighborhood so as to improve the efficiency of LS.  ... 
doi:10.1145/937503.937505 fatcat:nvqxwlqkyjfvvavs55z5xroomm
Citation

Christian Blum, Andrea Roli. "Metaheuristics in combinatorial optimization." ACM Computing Surveys 35.3 (2003) 268-308

Scenario-based Modeling Approach and Scatter Search Algorithm for the Stochastic Slab Allocation Problem in Steel Industry

Yana Lv, Gongshu Wang, Lixin Tang
2014 ISIJ International  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (634.5 kB)
https://web.archive.org/web/20181102040332/https://www.jstage.jst.go.jp/article/isijinternational/54/6/54_1324/_pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL. The file type is application/pdf.

Moreover, we introduce a random perturbation strategy to avoid search process being tapped in local optimum.  ...  Thus, a scatter search algorithm with directed local search based on follow-up technique is proposed to solve the problem approximately.  ...  Solution Improvement Method We adopt the local search method based on follow-up technique and a speedup strategy. The key of local search is constructing the neighborhood.  ... 
doi:10.2355/isijinternational.54.1324 fatcat:o6jdcmgcaneyhgslmj4vit4agi
DOAJ
Citation

Yana Lv, Gongshu Wang, Lixin Tang. "Scenario-based Modeling Approach and Scatter Search Algorithm for the Stochastic Slab Allocation Problem in Steel Industry." ISIJ International 54.6 (2014) 1324-1333

Simulation optimization using metamodels

Russell R. Barton
2009 Proceedings of the 2009 Winter Simulation Conference (WSC)  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (572.1 kB)
https://web.archive.org/web/20170813080956/http://www.informs-sim.org/wsc09papers/019.pdf?origin=publication_detail

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

Many iterative optimization methods are designed to be used in conjunction with deterministic objective functions.  ...  This tutorial surveys both local and global metamodel-based optimization methods.  ...  For local fitting strategies, the fitting and optimization steps alternate: as the optimization search moves, new local regions of θ space are explored, and new metamodel approximations are fitted.  ... 
doi:10.1109/wsc.2009.5429328 dblp:conf/wsc/Barton09 fatcat:frnjtoonjnfchdp5l3wowsrlsi
Citation

Russell R. Barton. "Simulation optimization using metamodels." Proceedings of the 2009 Winter Simulation Conference (WSC) (2009) 230-238

Gnowee: A Hybrid Metaheuristic Optimization Algorithm for Constrained, Black Box, Combinatorial Mixed-Integer Design [article]

James Bevins, Rachel Slaybaugh
2018 arXiv   pre-print

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (4.3 MB)
https://web.archive.org/web/20200904140814/https://arxiv.org/pdf/1804.05429v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

developed to optimize complex nuclear design problems; the motivating research problem was the design of material stack-ups to modify neutron energy spectra to specific targeted spectra for applications in  ...  Gnowee's hybrid metaheuristic framework is a new combination of a set of diverse, robust heuristics that appropriately balance diversification and intensification strategies across a wide range of optimization  ...  SA heavily relies on the directional search, neighborhood search, and hill climbing heuristics, resulting in rapid convergence to a local optimum.  ... 
arXiv:1804.05429v1 fatcat:qk6qbjkquzfbhhprsxtkv32al4
Citation

James Bevins, Rachel Slaybaugh. "Gnowee: A Hybrid Metaheuristic Optimization Algorithm for Constrained, Black Box, Combinatorial Mixed-Integer Design." arXiv (2018)

Comprehensive learning particle swarm optimizer for global optimization of multimodal functions

J.J. Liang, A.K. Qin, P.N. Suganthan, S. Baskar
2006 IEEE Transactions on Evolutionary Computation  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (1.3 MB)
https://web.archive.org/web/20170811111853/http://dsp.szu.edu.cn/dsp2006/student/hlliao/web_all/pso_pd/download/Comprehensive%20learning%20particle%20swarm%20optimizer%20for%20global%20optimization%20of%20multimodal%20functions.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

The results demonstrate good performance of the CLPSO in solving multimodal problems when compared with eight other recent variants of the PSO.  ...  This strategy enables the diversity of the swarm to be preserved to discourage premature convergence.  ...  In [17] , Hu and Eberhart also used a dynamic neighborhood where closest particles in the performance space are selected to be its new neighborhood in each generation.  ... 
doi:10.1109/tevc.2005.857610 fatcat:z25iygonz5be5ms423b2okrfrq
Citation

J.J. Liang, A.K. Qin, P.N. Suganthan, S. Baskar. "Comprehensive learning particle swarm optimizer for global optimization of multimodal functions." IEEE Transactions on Evolutionary Computation 10.3 (2006) 281-295

Collaborative Strategy for Grey Wolf Optimization Algorithm

Esra F. Alzaghoul, Sandi N. Fakhouri
2018 Modern Applied Science  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (2.2 MB)
https://web.archive.org/web/20180713080557/http://www.ccsenet.org:80/journal/index.php/mas/article/viewFile/72396/42114

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL. The file type is application/pdf.

In this paper, we proposed a novel optimization algorithm called collaborative strategy for grey wolf optimizer (CSGWO).  ...  This algorithm enhances the behaviour of GWO that enhances the search feature to search for more points in the search space, whereas more groups will search for the global minimal points.  ...  In fact, stagnation in local solutions can be resolved by promoting exploration. local optima avoidance of CSGWO is also competitive as seen in the results of the hybrid Composite test functions that provide  ... 
doi:10.5539/mas.v12n7p73 fatcat:vhut5uui2jd6nogf226aqxvlpe
Citation

Esra F. Alzaghoul, Sandi N. Fakhouri. "Collaborative Strategy for Grey Wolf Optimization Algorithm." Modern Applied Science 12.7 (2018) 73

A comparative study of particle swarm optimization and its variants for phase stability and equilibrium calculations in multicomponent reactive and non-reactive systems

Adrián Bonilla-Petriciolet, Juan Gabriel Segovia-Hernández
2010 Fluid Phase Equilibria  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (577.1 kB)
https://web.archive.org/web/20170809025448/http://www.segovia-hernandez.com/publicaciones/articulo%20(adrian2_2010).pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

Particle swarm optimization is a novel evolutionary stochastic global optimization method that has gained popularity in the chemical engineering community.  ...  This optimization strategy has been successfully used for several applications including thermodynamic calculations.  ...  Local search methods with and without decoupling strategies are frequently used to solve these equations in conjunction with mass balance restrictions.  ... 
doi:10.1016/j.fluid.2009.11.008 fatcat:e3x3unedufav7cjy2wgilyo4fu
Citation

Adrián Bonilla-Petriciolet, Juan Gabriel Segovia-Hernández. "A comparative study of particle swarm optimization and its variants for phase stability and equilibrium calculations in multicomponent reactive and non-reactive systems." Fluid Phase Equilibria 289.2 (2010) 110-121

Modified Local Search Heuristics for the Symmetric Traveling Salesman Problem

A. Blažinskas, A. Lenkevičius
2013 Information Technology and Control  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (801.2 kB)
https://web.archive.org/web/20131121081743/http://www.inzeko.ktu.lt:80/index.php/ITC/article/download/1301/2805

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL. The file type is application/pdf.

We are also examining the performance of these extensions being used in an iterated local search (ILS) paradigm.  ...  In this paper, we investigate some modified local search (LS) heuristics for the solution of symmetric traveling salesman problem (TSP).  ...  The introduced strategies for extending the neighborhoods and integrating the descending local search and stochastic perturbations seem to be of rather general character, so they may be applicable for  ... 
doi:10.5755/j01.itc.42.3.1301 fatcat:el6ilffer5gq7fbei6epold644
DOAJ
Citation

A. Blažinskas, A. Lenkevičius. "Modified Local Search Heuristics for the Symmetric Traveling Salesman Problem." Information Technology and Control 42.3 (2013)

A Guaranteed Global Convergence Social Cognitive Optimizer

Jia-ze Sun, Shu-yan Wang, Hao Chen
2014 Mathematical Problems in Engineering  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (2.4 MB)
https://web.archive.org/web/20170820195159/http://downloads.hindawi.com/journals/mpe/2014/534162.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

The global convergence of the improved SCO algorithm is guaranteed by the strategy of periodic restart in use under the conditions of participating in comparison, which helps to avoid the premature convergence  ...  From the analysis of the traditional social cognitive optimization (SCO) in theory, we see that traditional SCO is not guaranteed to converge to the global optimization solution with probability one.  ...  agents, on behalf of human individuals, in possession of a knowledge point in the knowledge library, act observational learning via the neighborhood local searching by observing the selected model from  ... 
doi:10.1155/2014/534162 fatcat:chmh45nvm5adri5iafwhf3eyiu
DOAJ Szczepanski
Citation

Jia-ze Sun, Shu-yan Wang, Hao Chen. "A Guaranteed Global Convergence Social Cognitive Optimizer." Mathematical Problems in Engineering (2014) 1-8

Optimal Stochastic Process Optimizer: A New Metaheuristic Algorithm with Adaptive Exploration-Exploitation Property

Jiahong Xu, Lihong Xu
2021 IEEE Access  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (2.9 MB)
https://web.archive.org/web/20210804103012/https://ieeexplore.ieee.org/ielx7/6287639/6514899/09503395.pdf?tp=&arnumber=9503395&isnumber=6514899&ref=

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL. The file type is application/pdf.

those regions of a search space within the neighborhood of previously visited points."  ...  The receding sampling strategy helps OSPO to avoid falling into local optima.  ... 
doi:10.1109/access.2021.3101939 fatcat:rjfbtwa3qbdtvecggnedlyzgeu
DOAJ
Citation

Jiahong Xu, Lihong Xu. "Optimal Stochastic Process Optimizer: A New Metaheuristic Algorithm with Adaptive Exploration-Exploitation Property." IEEE Access (2021) 1-1

Applying Multi-Moves in Parallel Genetic Algorithm for the Flow Shop Problem

W. Bozejko, M. Wodecki, Theodore E. Simos, George Maroulis
2007 AIP Conference Proceedings  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (301.6 kB)
https://web.archive.org/web/20170808233414/http://staff.iiar.pwr.wroc.pl/wojciech.bozejko/papers/2008/aip_bozwod.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

The matter of using multi-moves in parallel genetic algorithms is discussed in the paper Computational experiments are done for the flow shop, the classic NP-hard problem of the combinatorial optimization  ...  Because of a NP-hardness of determining the optimal multi-swap, an heuristic method of the neighborhood searching is apphed. It consists in stochastic sampling of the neighborhood space.  ...  Practical approaches to solve such problems are local search algorithms based on the neighborhood's search.  ... 
doi:10.1063/1.2835952 fatcat:owss52ffsvfpdccblbpugfn2tm
Citation

W. Bozejko, M. Wodecki, Theodore E. Simos, George Maroulis. "Applying Multi-Moves in Parallel Genetic Algorithm for the Flow Shop Problem." AIP Conference Proceedings (2007)

LFA: A Lévy Walk and Firefly-Based Search Algorithm: Application to Multi-Target Search and Multi-Robot Foraging

Ouarda Zedadra, Antonio Guerrieri, Hamid Seridi
2022 Big Data and Cognitive Computing  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (355.3 kB)
https://web.archive.org/web/20220503023553/https://mdpi-res.com/d_attachment/BDCC/BDCC-06-00022/article_deploy/BDCC-06-00022-v2.pdf?version=1645492824

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL. The file type is application/pdf.

It is beneficial when targets are sparsely distributed in the search space.  ...  In this paper, we propose a swarm intelligence-based search algorithm called Lévy walk and Firefly-based Algorithm (LFA), which is a hybridization of the two aforementioned algorithms.  ...  Robots use six elementary states: Global search (in the composite state Global exploration), Local search (in the composite state Local exploration), Follow robot light (in the composite state Following  ... 
doi:10.3390/bdcc6010022 fatcat:5vbvtxbbgfgl3igumaprtz3fmi
DOAJ
Citation

Ouarda Zedadra, Antonio Guerrieri, Hamid Seridi. "LFA: A Lévy Walk and Firefly-Based Search Algorithm: Application to Multi-Target Search and Multi-Robot Foraging." Big Data and Cognitive Computing 6.1 (2022) 22

Why Local Search Excels in Expression Simplification [article]

Ben Ruijl, Aske Plaat, Jos Vermaseren, Jaap van den Herik
2014 arXiv   pre-print

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (626.9 kB)
https://web.archive.org/web/20191018195801/https://arxiv.org/pdf/1409.5223v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL. The file type is application/pdf.

As a result, the Horner space is appropriate to be explored by Stochastic Local Search (SLS), which has only two parameters: the number of iterations (computation time) and the neighborhood structure.  ...  In this work, we investigate the state space properties of Horner schemes and find that the domain is relatively flat and contains only a few local minima.  ...  ACKNOWLEDGMENTS This work is supported in part by the ERC Advanced Grant no. 320651, "HEPGAME".  ... 
arXiv:1409.5223v1 fatcat:shogso2jjzbgdlcflyoiy7dodu
Citation

Ben Ruijl, Aske Plaat, Jos Vermaseren, Jaap van den Herik. "Why Local Search Excels in Expression Simplification." arXiv (2014)

« Previous Showing results 1 — 15 out of 8,088 results