Access the full text.
Sign up today, get DeepDyve free for 14 days.
F Glover, M Laguna, E Taillard, D Werra (1993)
Tabu Search
Maryam Abbasi, L. Paquete, F. Pereira (2015)
Local Search for Multiobjective Multiple Sequence Alignment
M. Geiger (2008)
Randomised Variable Neighbourhood Search for Multi Objective OptimisationArXiv, abs/0809.0271
B. Suman (2003)
Simulated annealing-based multiobjective algorithms and their application for system reliabilityEngineering Optimization, 35
M. Laumanns, L. Thiele, K. Deb, E. Zitzler (2002)
Combining Convergence and Diversity in Evolutionary Multiobjective OptimizationEvolutionary Computation, 10
Joshua Knowles, D. Corne (2000)
Approximating the Nondominated Front Using the Pareto Archived Evolution StrategyEvolutionary Computation, 8
A. Suppapitnarm, G. Parks (1999)
Simulated annealing: An alternative approach to true multiobjective optimization
P. Hansen, N. Mladenović (2018)
Variable Neighborhood Search
Joshua Knowles, D. Corne (2000)
M-PAES: a memetic algorithm for multiobjective optimizationProceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512), 1
J Dubois-Lacoste, M López-Ibáñez, T Stützle (2011)
A hybrid TP $$+$$ + PLS algorithm for bi-objective flow-shop scheduling problemsComput. Oper. Res., 38
Mădălina Drugan, D. Thierens (2010)
Path-Guided Mutation for Stochastic Pareto Local Search Algorithms
Helena Lourenço, Olivier Martin, Thomas Stützle (2001)
Iterated Local SearchMicroeconomic Theory eJournal
G. Moslehi, M. Mahnam (2011)
A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local searchInternational Journal of Production Economics, 129
A. Jaszkiewicz (2002)
Genetic local search for multi-objective combinatorial optimizationEur. J. Oper. Res., 137
M. Hansen (1997)
Tabu Search for Multiobjective Optimization: MOTS
M Gendreau, JY Potvin (2010)
Handbook of Metaheuristics
Mădălina Drugan, D. Thierens (2012)
Stochastic Pareto local search: Pareto neighbourhood exploration and perturbation strategiesJournal of Heuristics, 18
R. Beausoleil (2001)
Multiple Criteria Scatter Search
Maarten Inja, Chiel Kooijman, Maarten de Waard, Diederik M. Roijers, Shimon Whiteson (2014)
Parallel Problem Solving from Nature – PPSN XIII
Jérémie Dubois-Lacoste, Manuel López-Ibáñez, T. Stützle (2011)
A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problemsComput. Oper. Res., 38
F Tricoire (2012)
Multi-directional local searchComput. OR, 39
D. Vianna, J. Arroyo (2004)
A GRASP algorithm for the multi-objective knapsack problemXXIV International Conference of the Chilean Computer Science Society
Joshua Knowles, D. Corne (1999)
The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisationProceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), 1
E. Ulungu, J. Teghem, P. Fortemps, D. Tuyttens (1999)
MOSA method: a tool for solving multiobjective combinatorial optimization problemsJournal of Multi-criteria Decision Analysis, 8
T. Murata, H. Ishibuchi, M. Gen (2000)
Cellular Genetic Local Search for Multi-Objective Optimization
J. Luque, M. Laguna, R. Martí, R. Caballero (2007)
SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective OptimizationINFORMS J. Comput., 19
R. Suresh, K. Mohanasundaram (2004)
Pareto archived simulated annealing for permutation flow shop scheduling with multiple objectivesIEEE Conference on Cybernetics and Intelligent Systems, 2004., 2
H. Hoos, T. Stützle (2004)
Stochastic Local Search: Foundations & Applications
E. Talbi, M. Rahoual, Mohamed-Hakim Mabed, Clarisse Dhaenens (2001)
A Hybrid Evolutionary Approach for Multicriteria Optimization Problems: Application to the Flow Shop
H. Ishibuchi, Noritaka Tsukamoto, Y. Nojima (2008)
Evolutionary many-objective optimization: A short review2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)
K. Deb (2001)
Multi-objective optimization using evolutionary algorithms
S. Bandyopadhyay, S. Saha, U. Maulik, K. Deb (2008)
A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSAIEEE Transactions on Evolutionary Computation, 12
E. Zitzler, S. Künzli (2004)
Indicator-Based Selection in Multiobjective Search
E. Zitzler, L. Thiele (1999)
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Trans. Evol. Comput., 3
S. Kirkpatrick, C. Gelatt, Mario Vecchi (1983)
Optimization by Simulated AnnealingScience, 220
Aymeric Blot, Hernán Aguirre, Clarisse Dhaenens, Laetitia Jourdan, Marie-Eléonore Marmion, Kiyoshi Tanaka (2015)
Lecture Notes in Computer Science
P Serafini (1994)
Multiple Criteria Decision Making
Jérémie Dubois-Lacoste, Manuel López-Ibáñez, T. Stützle (2015)
Anytime Pareto local searchEur. J. Oper. Res., 243
Jérémie Dubois-Lacoste, Manuel López-Ibáñez, T. Stützle (2012)
Pareto Local Search Algorithms for Anytime Bi-objective Optimization
H. Lourenço, O. Martin, T. Stützle (2018)
Iterated Local Search: Framework and ApplicationsHandbook of Metaheuristics
Aymeric Blot, H. Hoos, Laetitia Vermeulen-Jourdan, Marie-Éléonore Kessaci-Marmion, H. Trautmann (2016)
MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework
T. Lust, J. Teghem (2010)
Two-phase Pareto local search for the biobjective traveling salesman problemJournal of Heuristics, 16
L. Moalic, A. Caminada, S. Lamrous (2013)
A Fast Local Search Approach for Multiobjective Problems
Daniel Jaeggi, Chris Asselin-Miller, G. Parks, T. Kipouros, Theo Bell, P. Clarkson (2004)
Multi-objective Parallel Tabu Search
Eric Angel, E. Bampis, L. Gourvès (2004)
Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problemTheor. Comput. Sci., 310
Aymeric Blot, Alexis Pernet, Laetitia Vermeulen-Jourdan, Marie-Éléonore Kessaci-Marmion, H. Hoos (2017)
Automatically Configuring Multi-objective Local Search Using Multi-objective Optimisation
Maarten Inja, C. Kooijman, M. Waard, Diederik Roijers, Shimon Whiteson (2014)
Queued Pareto Local Search for Multi-Objective Optimization
M. Basseur, E. Burke (2007)
Indicator-based multi-objective local search2007 IEEE Congress on Evolutionary Computation
M. Basseur, Rong-Qiang Zeng, Jin-Kao Hao (2012)
Hypervolume-based multi-objective local searchNeural Computing and Applications, 21
D. Jaeggi, G. Parks, T. Kipouros, P. Clarkson (2008)
The development of a multi-objective Tabu Search algorithm for continuous optimisation problemsEur. J. Oper. Res., 185
A. Baykasoğlu, S. Owen, N. Gindy (1999)
A TABOO SEARCH BASED APPROACH TO FIND THE PARETO OPTIMAL SET IN MULTIPLE OBJECTIVE OPTIMIZATIONEngineering Optimization, 31
Aymeric Blot, Laetitia Vermeulen-Jourdan, Marie-Éléonore Kessaci-Marmion (2017)
Automatic design of multi-objective local search algorithms: case study on a bi-objective permutation flowshop scheduling problemProceedings of the Genetic and Evolutionary Computation Conference
E Zitzler, L Thiele (1999)
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE TEVC, 3
H. Aguirre, Kiyoshi Tanaka (2005)
Random Bit Climbers on Multiobjective MNK-Landscapes: Effects of Memory and Population ClimbingIEICE Trans. Fundam. Electron. Commun. Comput. Sci., 88-A
P. Serafini (1994)
Simulated Annealing for Multi Objective Optimization Problems
(1995)
Heuristic for multi-objective combinatorial optimization problems by simulated annealing
J. Arroyo, Rafael Ottoni, A. Oliveira (2011)
Multi-objective Variable Neighborhood Search Algorithms for a Single Machine Scheduling Problem with Distinct due Windows
L. Paquete, T. Stützle (2003)
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem
Piotr Czyzżak, A. Jaszkiewicz (1998)
Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimizationJournal of Multi-criteria Decision Analysis, 7
(1996)
A multiobjective metaheuristic approach to the location of petrol stations by the capital budgeting model
H. Ishibuchi, T. Murata (1996)
Multi-objective genetic local search algorithmProceedings of IEEE International Conference on Evolutionary Computation
L. Paquete, Marco Chiarandini, T. Stützle (2004)
Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study
A. Liefooghe, J. Humeau, S. Mesmoudi, Laetitia Vermeulen-Jourdan, E. Talbi (2012)
On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problemsJournal of Heuristics, 18
R. Martí, V. Campos, M. Resende, A. Duarte (2015)
Multiobjective GRASP with Path RelinkingEur. J. Oper. Res., 240
(1998)
A multi-objective optimization approach based on simulated annealing and its application to nuclear fuel management
L Paquete, M Chiarandini, T Stützle (2004)
Metaheuristics for Multiobjective Optimisation
Fabien Tricoire (2012)
Multi-directional local searchComputers & Operations Research, 39
B. Suman, P. Kumar (2006)
A survey of simulated annealing as a tool for single and multiobjective optimizationJournal of the Operational Research Society, 57
Alexander Thomasian, C. Han, G. Fu, C. Liu (2004)
A GRASP algorithm for the multi-objective knapsack problem
T. Feo, M. Resende, Stuart Smith (1994)
A Greedy Randomized Adaptive Search Procedure for Maximum Independent SetOper. Res., 42
Aymeric Blot, H. Aguirre, Clarisse Dhaenens, Laetitia Vermeulen-Jourdan, M. Marmion, Kiyoshi Tanaka (2015)
Neutral but a Winner! How Neutrality Helps Multiobjective Local Search Algorithms
Metaheuristics are algorithms that have proven their efficiency on multi-objective combinatorial optimisation problems. They often use local search techniques, either at their core or as intensification mechanisms, to obtain a well-converged and diversified final result. This paper surveys the use of local search techniques in multi-objective metaheuristics and proposes a general structure to describe and unify their underlying components. This structure can instantiate most of the multi-objective local search techniques and algorithms in literature.
Journal of Heuristics – Springer Journals
Published: May 29, 2018
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.