Design of a Hybrid Local Search for the Multiobjective Quadratic Assignment...  Home/Search
Context
Related
| lania.mx/~ccoello/E...knowles02c.pdf.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lania.mx/~ccoello/EMOO/EMOObib (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The quadratic assignment problem (QAP) is a very difficult and practically relevant combinatorial optimization problem which has attracted much research effort. Local search (LS) moves can be quickly evaluated on the QAP, and hence favoured methods tend to be hybrids of global optimization schemes and LS. Here we introduce the multiobjective QAP (mQAP) where distinct QAPs must be minimized simultaneuously over the same permutation space, and hence we require a set of solutions... (Update)
Active bibliography (related documents): More All
0.7: Multiple Objective Metaheuristic Algorithms For Combinatorial.. - Jaszkiewicz (2001) (Correct)
0.6: Local-Search and Hybrid Evolutionary Algorithms for Pareto.. - Knowles (2002) (Correct)
0.1: A Comparative Study of Multiple-Objective metaheuristics on the .. - Jaszkiewicz (2001) (Correct)
Similar documents based on text: More All
0.5: A Comparison of Encodings and Algorithms for Multiobjective.. - Knowles, Corne (1997) (Correct)
0.5: Benchmark Problem Generators and Results for the.. - Knowles, Corne (1997) (Correct)
0.5: Approximating the Nondominated Front Using the Pareto.. - Knowles, Corne (2000) (Correct)
BibTeX entry: (Update)
@inproceedings{ knowles2002his,
author = {Joshua Knowles and David Corne},
title = {Towards {L}andscape {A}nalyses to {I}nform the {D}esign of {H}ybrid {L}ocal
{S}earch for the {M}ultiobjective {Q}uadratic {A}ssignment {P}roblem},
editor = {A. Abraham and J. Ruiz-del-Solar and M. Koppen},
booktitle = {Soft Computing Systems: Design, Management and
Applications},
year = {2002},
publisher = {IOS Press},
address = {Amsterdam},
pages = {271--279},
note = {ISBN 1-58603-297-6},
url = {citeseer.ist.psu.edu/611771.html} }
Citations (may not include all citations):162 Genetic algorithms for multiobjective optimization: Formulat.. - Fonseca, Fleming - 1993
107 complete approximation problems (context) - Sahni, Gonzalez - 1976
87 Fitness distance correlation as a measure of problem difficu.. - Jones, Forrest - 1995
44 Genetic hybrids for the quadratic assignment problem - et, Ferland - 1994
38 A comparison of iterative searches for the quadratic assignm.. (context) - Taillard - 1995
19 Evaluating the quality of approximations to the non-dominate.. - Hansen, Jaszkiewicz - 1998
10 the performance of multiple objective genetic local search o.. - Jaszkiewicz - 2000
6 Iterated local search for the quadratic assignment problem - Stutzle - 1999
3 Pareto Simulated Annealing (context) - Czyzak, Jaszkiewicz - 1997
2 Tabu search in multiobjective optimisation : MOTS (context) - Hansen - 1997
1 etaheuristiques Parall eles Hybrides: Application au Probl e.. (context) - Bachelet - 1999
1 The facilities layout problem in perspactive (context) - Vollmann, Buffa - 1966
Documents on the same site (http://www.lania.mx/~ccoello/EMOO/EMOObib.html): More
Genetic Algorithms with Gender for Multi-function Optimisation - Allenson (1992) (Correct)
A Genetic Algorithm for Multiobjective Design.. - Mäkinen.. (1998) (Correct)
Evolving Data Structures with Genetic Programming - Langdon (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC