Effective Stochastic Local Search Algorithms for Biobjective Permutation Flow-shop Problems
|
|
- Kellie McDaniel
- 6 years ago
- Views:
Transcription
1 Effective Stochastic Local Search Algorithms for Biobjective Permutation Flow-shop Problems Jérémie Dubois-Lacoste, Manuel López-Ibáñez, and Thomas Stützle IRIDIA, CoDE, Université Libre de Bruxelles Brussels, Belgium iridia.ulb.ac.be/ stuetzle
2 Outline 1. Stochastic local search 2. Simple SLS method: IG Iterated Greedy for PFSP 3. Multi-objective Optimization Hybrid TPLS+PLS for biobjective PFSPs 4. Automatic Algorithm Configuration Automatic Configuration of Hybrid TPLS+PLS Algorithm
3 Combinatorial optimisation problems Examples finding minimum cost schedule to deliver goods finding optimal sequence of jobs in production line finding best allocation of flight crews to airplanes finding a best routing for Internet data packets... and many more Few facts arise in many real-world applications many have high computational complexity (N P-hard) in research, often abstract versions of real-world problems are treated
4 Search paradigms Systematic search traverse search space of instances in systematic manner complete: guaranteed to find optimal solution in finite amount of time (plus proof of optimality) Local search start at some initial solution iteratively move from search position to neighbouring one incomplete: not guaranteed to find optimal solutions
5 Search paradigms Perturbative (local) search search space = complete candidate solutions search step = modification of one or more solution components example: 2-opt algorithm for TSP
6 Search paradigms Constructive (local) search search space = partial candidate solutions search step = extension with one or more solution components example: nearest neighbor heuristic for TSP
7 Stochastic local search global view vertices: candidate solutions (search positions) edges: connect neighbouring positions s s: (optimal) solution c c: current search position
8 Stochastic local search local view s next search position is selected from local neighbourhood based on local information.
9 Stochastic local search (SLS) SLS algorithm defined through search space S set of solutions neighborhood relation finite set of memory states initialization function step function termination predicate evaluation function (for a formal definition see SLS:FA, Hoos & Stützle, 2005)
10 A simple SLS algorithm Iterative improvement start from some initial solution iteratively move from the current solution to an improving neighbouring one as long as such one exists Main problem getting stuck in local optima Solution general purpose SLS methods (aka metaheuristics) that direct the search and allow escapes from local optima
11 SLS methods (metaheuristics) modify neighbourhoods variable neighbourhood search accept occasionally worse neighbours simulated annealing tabu search modify evaluation function dynamic local search generate new (starting) solutions (for local search) EAs / memetic algorithms ant colony optimization iterated local search iterated greedy
12 Outline 1. Stochastic local search 2. Simple SLS method: IG Iterated Greedy for PFSP 3. Multi-objective Optimization Hybrid TPLS+PLS for biobjective PFSPs 4. Automatic Algorithm Configuration Automatic Configuration of Hybrid TPLS+PLS Algorithm
13 Iterated Greedy Key Idea: iterate over greedy construction heuristics through destruction and construction phases Motivation: start solution construction from partial solutions to avoid reconstruction from scratch keep features of the best solutions to improve solution quality if few construction steps are to be executed, greedy heuristics are fast adding a subsidiary local search phase may further improve performance
14 Iterated Greedy (IG): While termination criterion is not satisfied: generate candidate solution s using greedy constructive search While termination criterion is not satisfied: r := s apply solution destruction on s perform greedy constructive search on s perform local search on s based on acceptance criterion, keep s or revert to s := r Note: local search after solution reconstruction can substantially improve performance
15 IG main issues destruction phase fixed vs. variable size of destruction stochastic vs. deterministic destruction uniform vs. biased destruction construction phase not every construction heuristic is necessarily useful typically, adaptive construction heuristics preferable speed of the construction heuristic is an issue acceptance criterion determines tradeoff diversification intensification of the search
16 IG has been re-invented several times; names include simulated annealing, ruin and recreate, iterative flattening, iterative construction search, large neighborhood search,.. close relationship to iterative improvement in large neighbourhoods for some applications so far excellent results can give lead to effective combinations of tree search and local search heuristics
17 Outline 1. Stochastic local search 2. Simple SLS method: IG Iterated Greedy for PFSP 3. Multi-objective Optimization Hybrid TPLS+PLS for biobjective PFSPs 4. Automatic Algorithm Configuration Automatic Configuration of Hybrid TPLS+PLS Algorithm
18 Permutation flow-shop problem (PFSP) M 1 J 1 J 2 J 3 J 4 J 5 M 2 J 1 J 2 J 3 J 4 J 5 M 3 J 1 J 2 J 3 J 4 J time n jobs are to be processed on m machines (in canonical order of machines) input data: processsing times for each job on each machine and due dates of each job otherwise: usual PFSP characteristics
19 IG for PFSP Initial solution construction NEH heuristic Destruction heuristic randomly remove d jobs from sequence Construction heuristic follow the NEH heuristic considering jobs in random order Acceptance criterion Metropolis condition with fixed temperature
20 Iterative improvement for PFSP A B C D E F A C B D E F φ φ' transpose neighbourhood A B C D E F A E C D B F φ φ' exchange neighbourhood A B C D E F A C D B E F φ φ' insert neighbourhood best choice: insert; profits from speed-ups
21 IG for PFSP, example Initial NEH solution, C max = DESTRUCTION PHASE Choose d (3) jobs at random Partial sequence to reconstruct Jobs to reinsert ---CONSTRUCTION PHASE After reinserting job 5, C max = After reinserting job 1, C max = After reinserting job 4, C max = 8366
22 when combined with local search, IG is a state-of-the-art algorithm for permutation flow-shop scheduling Avrg. Relative Percentage Deviation (RPD) Means and 95.0 Percent LSD Intervals GA_AA GA_MIT GA_RMA IG_RS IG_RS LS NEHT SA_OP GA_CHEN GA_REEV HGA_RMA ILS M-MMAS PACO SPIRIT Algorithm
23 Outline 1. Stochastic local search 2. Simple SLS method: IG Iterated Greedy for PFSP 3. Multi-objective Optimization Hybrid TPLS+PLS for biobjective PFSPs 4. Automatic Algorithm Configuration Automatic Configuration of Hybrid TPLS+PLS Algorithm
24 Multi-objective Optimization Multiobjective Combinatorial Optimization Problems (MCOPs) many real-life problems are multiobjective timetabling and scheduling logistics and transportation telecommunications and computer networks... and many others example: objectives in PFSP makespan sum of flowtimes total weighted or unweighted tardiness
25 Pareto optimization multiple objective functions f(x) = (f 1 (x),..., f Q (x)) no a priori knowledge Pareto-optimality
26 Main SLS approaches to Pareto optimization SLS algorithms based on dominance criterion component-wise acceptance criterion example: Pareto local search (PLS) based on solving scalarizations convert MCOPs into single-objective problems min x X Q λ i f i (x) i=1 for obtaining many solution: vary weight vector λ example: two-phase local search (TPLS) hybrids of the two search models
27 CWAC Search Model input: candidate solution x Add x to Archive repeat Choose x from Archive X N = Neighbors(x) Add X N to Archive Filter Archive until all x in Archive are visited return Archive cost time
28 SAC Search Model input: weight vectors Λ for each λ Λ do x is a candidate solution x = SolveSAC(x, λ) Add x to Archive Filter Archive return Archive cost time
29 Hybrid Search Model input: weight vectors Λ for each λ Λ do x is a candidate solution x = SolveSAC(x, λ) X = CW(x ) Add X to Archive Filter Archive return Archive cost time
30 Outline 1. Stochastic local search 2. Simple SLS method: IG Iterated Greedy for PFSP 3. Multi-objective Optimization Hybrid TPLS+PLS for biobjective PFSPs 4. Automatic Algorithm Configuration Automatic Configuration of Hybrid TPLS+PLS Algorithm
31 Hybrid TPLS+PLS for biobjective PFSPs Engineering an effective TPLS+PLS algorithm context: development of effective SLS algorithms MCOPS example problem: bi-objective flow-shop problems (bpfsps) steps followed: 1. knowledge of state-of-the-art 2. development of powerful single-objective algorithms 3. experimental study of TPLS components 4. experimental study of PLS components 5. design of a hybrid algorithm 6. detailed comparison to state of the art
32 bi-objective permutation flow-shop problem permutation flow-shop problem n jobs are to be processed on m machines (in canonical order of machines) input data: processsing times for each job on each machine and due dates of each job otherwise: usual PFSP characteristics objective functions makespan sum of flowtimes total weighted or unweighted tardiness tackle all bi-objective problems for any combination of objectives
33 Step 2: IG for other single-objective problems Recall: we have state-of-the-art IG algorithm for PFSP with makespan criterion (part of step 1) main adaptations for other objectives constructive heuristics to provide good initial solutions neighborhood operators for local search step number of jobs to remove acceptance criterion: formula, temperature Remark: parameters have been fine-tuned using I/F-Race.
34 Evaluation of IG Sum of flowtimes comparison with the state-of-the-art (Tseng and Lin, 2009): Short runs size of instance R.D. Best R.D. Mean 20x x x x x x x x x Average Long runs size of instance R.D. Best R.D. Mean 50x x x Average on all sizes more than 50 new best known solutions for instance set of 90 instances state-of-the-art results
35 Evaluation of IG-Weighted tardiness few studies on this criterion in the literature more than 90% of best known solutions improved for a benchmark set of 540 instances (for total tardiness), in production mode
36 Experimental analysis Better relation [Jaszkiewicz and Hansen 1998] cost cost time time Blue is better than Red Blue is incomparable to Red
37 Experimental analysis Attainment functions [Grunert da Fonseca et al. 2001] AF : Probability that an outcome an arbitrary point EAF : How many runs an outcome an arbitrary point Is EAF Blue significantly different from EAF Red? Permutation tests with Smirnov distance as test statistic
38 Experimental analysis Visualization of differences [Paquete 2005] EAF Blue EAF Red positive differences negative differences
39 Step 3: Effective TPLS algorithm Two-phase local search Phase 1: generate high quality solution for single objective problem Phase 2: solve sequence of scalarizations use solution found for previous scalarization as initial solution for the next one
40 Studied TPLS components f 1 1. Search strategy 2. Number of scalarizations 3. Intensification mechanism f 2 2-phase Generate (i) high quality solution for f 1 and (ii) sequence of solutions
41 Studied TPLS components f 1 1. Search strategy 2. Number of scalarizations 3. Intensification mechanism f 2 Restart Independent runs of SLS algorithms using different weights
42 Studied TPLS components f 1 1. Search strategy 2. Number of scalarizations 3. Intensification mechanism f 2
43 Studied TPLS components f 1 1. Search strategy 2. Number of scalarizations 3. Intensification mechanism f 2 Higher solution quality returned by SLS algorithm
44 Adaptive Anytime TPLS Idea: dynamically generate weights to adapt to the shape of the Pareto front focus search on the largest gap in Pareto front seed new scalarizations with solutions from previous similar scalarizations weight generation inspired from dichotomic scheme
45 Adaptive Anytime TPLS vs. Restart C i T i 3.9e+05 4e e+05 [0.8, 1.0] [0.6, 0.8) [0.4, 0.6) [0.2, 0.4) [0.0, 0.2) C i Two Phase Restart
46 Step 4: Effective PLS algorithm Pareto local search iterative improvement algorithm that directly follows the CWAC search model (dominance-based acceptance criterion) studied PLS components neighborhood operators seeding the algorithm with different quality solutions
47 PLS: Neighborhhood operators C i 3.8e e e e+05 w i T i 5e+05 6e+05 7e+05 8e+05 [0.8, 1.0] [0.6, 0.8) [0.4, 0.6) [0.2, 0.4) [0.0, 0.2) 3.8e e e e+05 C i Exchange Exchange+Insertion
48 PLS: Seeding C j Objectives: C max and C j C max random set heuristic set IG set heuristic seeds IG seeds w j T j 6e+05 8e+05 1e+06 Objectives: C j and w j T j C j random set heuristic set IG set heuristic seeds IG seeds
49 Step 5: Hybrid algorithm, TPLS+PLS 1: TPLS uses roughly half of the overall time each objective and combination of objectives uses a dedicated Iterated Greedy 2: PLS both exchange and insertion operators bounded in time
50 Step 6: Comparison to state-of-the-art recent review (2008) by Minella et al.tests 23 algorithms for three biobjective PFSP problems. They also provide reference sets measured across all 23 algorithms often the median or even worst attainment surfaces of TPLS+PLS dominate reference sets! two state-of-the-art algorithms identified by Minella et al. multi-objective Simulated Annealing (MOSA) by Varadharajan & Rajendran, 2005 multi-objective Genetic Local Search (MOGLS) by Arroyo & Armentano, 2004 comparison to re-implementations of both algorithms; 10 runs per instance
51 Comparison to state-of-the-art: PFSP-(C max, SFT) nxm TPLS+PLS MOSA 20x x x x x x x x x x x Given: Percentage of times an outcome of an algorithm outperforms an outcome of the other one.
52 Comparison to state-of-the-art: PFSP-(C max, TT) nxm TPLS+PLS MOSA 20x x x x x x x x x x x Given: Percentage of times an outcome of an algorithm outperforms an outcome of the other one.
53 Comparison to state-of-the-art: PFSP-(SFT, TT) nxm TPLS+PLS MOSA 20x x x x x x x x x x x Given: Percentage of times an outcome of an algorithm outperforms an outcome of the other one.
54 Comparison to state-of-the-art: PFSP-(C max, SFT) C max C i 3.75e e+05 4e+05 [0.8, 1.0] [0.6, 0.8) [0.4, 0.6) [0.2, 0.4) [0.0, 0.2) C max TP+PLS MOSA
55 Comparison to state-of-the-art: PFSP-(C max, WT) C max w i T i 1.2e e e+05 [0.8, 1.0] [0.6, 0.8) [0.4, 0.6) [0.2, 0.4) [0.0, 0.2) C max TP+PLS MOSA
56 Comparison to state-of-the-art: PFSP-(SFT, WT) C i 3.69e e e e+05 w i T i 1.2e e e e e e e+05 C i TP+PLS [0.8, 1.0] [0.6, 0.8) [0.4, 0.6) [0.2, 0.4) [0.0, 0.2) MOSA
57 Summary of results for PFSP single-objective problems new best-known solutions for 50 out of 90 instances from PFSP-flowtime benchmarks new best-known solutions of 90% of available benchmarks for PFSP-total-tardiness multi-objective problems hybrid algorithms clearly outperforms the two previous state-of-the-art algorithms hybrid algorithms usually outperforms the non-dominated obtained from the best results in an extensive computational study of 23 algorithms
58 Outline 1. Stochastic local search 2. Simple SLS method: IG Iterated Greedy for PFSP 3. Multi-objective Optimization Hybrid TPLS+PLS for biobjective PFSPs 4. Automatic Algorithm Configuration Automatic Configuration of Hybrid TPLS+PLS Algorithm
59 Configuration of SLS algorithms SLS algorithm components categorical parameters type of construction method in IG choice of cross-over operator in evolutionary algorithms numerical parameters destruction strength operator application probability Configuration/design problem given an application scenario, choose categorical and numerical parameters to optimize some performance criterion finding a good configuration can be very time-consuming
60 Main configuration approaches Offline configuration configure algorithm before deploying it configuration done on training instances Online tuning (parameter control) adapt parameter setting while solving an instance typically limited to a set of known crucial algorithm parameters We focus on offline tuning
61 Importance of the configuration problem improvement over manual, ad-hoc methods for tuning reduction of development time and human intervention increase number of considerable degrees of freedom empirical studies, comparisons of algorithms support for end users of algorithms Methods for automated algorithm configuration are an important tool for engineering SLS algorithms
62 The configuration problem (Our) Configuration problem Given: (finite) set of candidate configurations set of training instances optimization criterion: solution quality, run-time Goal: find a best configuration (for future instances in production-mode)
63 The racing approach Θ start with a set of initial candidates consider a stream of instances sequentially evaluate candidates discard inferior candidates as sufficient evidence is gathered against them... repeat until a winner is selected or until computation time expires i
64 The F-Race algorithm Statistical testing 1. family-wise tests for differences among configurations Friedman two-way analysis of variance by ranks 2. if Friedman rejects H 0, perform pairwise comparisons to best configuration apply Friedman post-test
65 Sampling configurations F-race is a method for the selection of the best configuration and independent of the way the set of configurations is sampled Sampling configurations and F-race full factorial design random sampling design iterative refinement of a sampling model (iterative F-race) (Balaprakash, Birattari, Stützle, 2007; Birattari et al. 2010, López-Ibáñez et al. 2011)
66 Iterative F-race: an illustration sample configurations from initial distribution While not terminate() 1. apply F-Race 2. modify the distribution 3. sample configurations with selection probability
67 Outline 1. Stochastic local search 2. Simple SLS method: IG Iterated Greedy for PFSP 3. Multi-objective Optimization Hybrid TPLS+PLS for biobjective PFSPs 4. Automatic Algorithm Configuration Automatic Configuration of Hybrid TPLS+PLS Algorithm
68 Automatic configuration of multi-objective optimizers Goal: find the best parameter settings of multi-objective optimizer to solve unseen instances of a problem, given a flexible framework for the multi-objective optimizer a set of training instances representative of the same problem. a maximum budget (number of experiments / time limit) automatic configuration tool: I/F-Race designed for single-objective optimization. I/F-Race + hypervolume = multi-objective automatic configuration
69 Hypervolume measure
70 Automatic configuration of TPLS+PLS TPLS+PLS framework multi-objective part is modular and problem-independent TPLS+PLS framework can be easily parameterized Parameter name Type Domain tpls ratio ordered {0.1, 0.2,..., 0.9, 1} init scal ratio ordered {1, 1.5, 2, 3, 4, 6, 8, 10} nb scal integer [0, 30] two seeds categorical {yes, no} restart categorical {yes, no} theta real [0, 0.5] pls operator categorical {ex, ins, exins}
71 Hypervolume statistics, size 50x20 conf hand conf tun rnd conf tun ic mean sd mean sd mean sd (C max, SFT) (C max, TT) (C max, WT) (SFT, TT) (SFT, WT)
72 Hypervolume statistics, size 100x20 conf hand conf tun rnd conf tun ic mean sd mean sd mean sd (C max, SFT) (C max, TT) (C max, WT) (SFT, TT) (SFT, WT)
73 Comparison hand-tuned vs. automatically configured C max C max w iti 4e+04 8e e e+05 [0.8, 1.0] [0.6, 0.8) [0.4, 0.6) [0.2, 0.4) [0.0, 0.2) e+04 8e e e+05 w iti w iti 5e+04 1e e+05 [0.8, 1.0] [0.6, 0.8) [0.4, 0.6) [0.2, 0.4) [0.0, 0.2) e+04 1e e+05 w iti C max hand tuning 1 C max hand tuning 1 C max C max w iti 4e+04 8e e e+05 [0.8, 1.0] [0.6, 0.8) [0.4, 0.6) [0.2, 0.4) [0.0, 0.2) e+04 8e e e+05 w iti w iti 2e+04 6e+04 1e e+05 [0.8, 1.0] [0.6, 0.8) [0.4, 0.6) [0.2, 0.4) [0.0, 0.2) e+04 6e+04 1e e+05 w iti C max hand tuning 1 C max hand tuning 1
74 Conclusions automatic configuration of multi-objective optimizers well feasible new state-of-the-art algorithms for biobjective PFSPs have been obtained significant room for further research
75 Acknowledgments Special thanks to Mauro (F-Race), Luis (multi-objective part) for providing some of the graphics used in this talk
Computers & Operations Research
Computers & Operations Research 36 (2009) 2619 -- 2631 Contents lists available at ScienceDirect Computers & Operations Research journal homepage: www.elsevier.com/locate/cor Design and analysis of stochastic
More informationArchive-aware Scalarisation-based Multi-Objective Local Search For a Bi-objective Permutation Flowshop Problem
Archive-aware Scalarisation-based Multi-Objective Local Search For a Bi-objective Permutation Flowshop Problem Aymeric Blot, Manuel López-Ibáñez, Marie-Éléonore Kessaci, Laetitia Jourdan To cite this version:
More informationAutomatic Algorithm Configuration
Automatic Algorithm Configuration Thomas Stützle RDA, CoDE, Université Libre de Bruxelles Brussels, Belgium stuetzle@ulb.ac.be iridia.ulb.ac.be/~stuetzle Outline 1. Context 2. Automatic algorithm configuration
More informationAutomatically Configuring Algorithms. Some recent work
Automatically Configuring Algorithms Some recent work Thomas Stützle, Leonardo Bezerra, Jérémie Dubois-Lacoste, Tianjun Liao, Manuel López-Ibáñez, Franco Mascia and Leslie Perez Caceres IRIDIA, CoDE, Université
More informationProblem Solving and Search in Artificial Intelligence
Problem Solving and Search in Artificial Intelligence Algorithm Configuration Nysret Musliu Database and Artificial Intelligence Group, Institut of Logic and Computation, TU Wien Motivation Metaheuristic
More informationDeconstructing Multi-objective Evolutionary Algorithms: An Iterative Analysis on the Permutation Flow-Shop Problem
Deconstructing Multi-objective Evolutionary Algorithms: An Iterative Analysis on the Permutation Flow-Shop Problem Leonardo C. T. Bezerra, Manuel López-Ibáñez, and Thomas Stützle IRIDIA, Université Libre
More informationThe Automatic Design of Multi-Objective Ant Colony Optimization Algorithms
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle The Automatic Design of Multi-Objective Ant Colony Optimization Algorithms Manuel
More informationAutomated Design of Metaheuristic Algorithms
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle Automated Design of Metaheuristic Algorithms T. Stützle and M. López-Ibáñez IRIDIA
More informationUniversité Libre de Bruxelles
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle F-Race and iterated F-Race: An overview Mauro Birattari, Zhi Yuan, Prasanna Balaprakash,
More informationNote: In physical process (e.g., annealing of metals), perfect ground states are achieved by very slow lowering of temperature.
Simulated Annealing Key idea: Vary temperature parameter, i.e., probability of accepting worsening moves, in Probabilistic Iterative Improvement according to annealing schedule (aka cooling schedule).
More informationSimple mechanisms for escaping from local optima:
The methods we have seen so far are iterative improvement methods, that is, they get stuck in local optima. Simple mechanisms for escaping from local optima: I Restart: re-initialise search whenever a
More informationComparison of Acceptance Criteria in Randomized Local Searches
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle Comparison of Acceptance Criteria in Randomized Local Searches A. Franzin and
More informationAutomatically Improving the Anytime Behaviour of Optimisation Algorithms
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle Automatically Improving the Anytime Behaviour of Optimisation Algorithms Manuel
More informationUniversité Libre de Bruxelles
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle Adaptive Sample Size and Importance Sampling in Estimation-based Local Search
More informationANT colony optimization (ACO) [1] is a metaheuristic. The Automatic Design of Multi-Objective Ant Colony Optimization Algorithms
FINAL DRAFT PUBLISHED IN IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 The Automatic Design of Multi-Objective Ant Colony Optimization Algorithms Manuel López-Ibáñez and Thomas Stützle Abstract Multi-objective
More informationTABU search and Iterated Local Search classical OR methods
TABU search and Iterated Local Search classical OR methods tks@imm.dtu.dk Informatics and Mathematical Modeling Technical University of Denmark 1 Outline TSP optimization problem Tabu Search (TS) (most
More informationOutline. TABU search and Iterated Local Search classical OR methods. Traveling Salesman Problem (TSP) 2-opt
TABU search and Iterated Local Search classical OR methods Outline TSP optimization problem Tabu Search (TS) (most important) Iterated Local Search (ILS) tks@imm.dtu.dk Informatics and Mathematical Modeling
More informationDouble Archive Pareto Local Search
Double Archive Pareto Local Search Oded Maler CNRS-VERIMAG University of Grenoble Alpes, France Email: oded.maler@imag.fr Abhinav Srivastav VERIMAG University of Grenoble Alpes, France Email: abhinav.srivastav@imag.fr
More informationTuning Algorithms for Tackling Large Instances: An Experimental Protocol.
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle Tuning Algorithms for Tackling Large Instances: An Experimental Protocol. Franco
More informationContinuous optimization algorithms for tuning real and integer parameters of swarm intelligence algorithms
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle Continuous optimization algorithms for tuning real and integer parameters of swarm
More informationOptimization of Co-Rotating Twin-Screw Extruders Using Pareto Local Search
Optimization of Co-Rotating Twin-Screw Extruders Using Pareto Local Search C. Teixeira*, J.A. Covas*, T. Stützle**, A. Gaspar-Cunha* * IPC/I3N - Institute of Polymers and Composites, University of Minho,
More informationAn Ant Approach to the Flow Shop Problem
An Ant Approach to the Flow Shop Problem Thomas Stützle TU Darmstadt, Computer Science Department Alexanderstr. 10, 64283 Darmstadt Phone: +49-6151-166651, Fax +49-6151-165326 email: stuetzle@informatik.tu-darmstadt.de
More informationAutomatic Algorithm Configuration based on Local Search
Automatic Algorithm Configuration based on Local Search Frank Hutter 1 Holger Hoos 1 Thomas Stützle 2 1 Department of Computer Science University of British Columbia Canada 2 IRIDIA Université Libre de
More informationn Informally: n How to form solutions n How to traverse the search space n Systematic: guarantee completeness
Advanced Search Applications: Combinatorial Optimization Scheduling Algorithms: Stochastic Local Search and others Analyses: Phase transitions, structural analysis, statistical models Combinatorial Problems
More informationa local optimum is encountered in such a way that further improvement steps become possible.
Dynamic Local Search I Key Idea: Modify the evaluation function whenever a local optimum is encountered in such a way that further improvement steps become possible. I Associate penalty weights (penalties)
More informationAn experimental analysis of design choices of multi-objective ant colony optimization algorithms
Swarm Intell (2012) 6:207 232 DOI 10.1007/s11721-012-0070-7 An experimental analysis of design choices of multi-objective ant colony optimization algorithms Manuel López-Ibáñez Thomas Stützle Received:
More informationUniversité Libre de Bruxelles
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle Improvement Strategies for the F-Race algorithm: Sampling Design and Iterative
More informationAutomatic Algorithm Configuration based on Local Search
Automatic Algorithm Configuration based on Local Search Frank Hutter 1 Holger Hoos 1 Thomas Stützle 2 1 Department of Computer Science University of British Columbia Canada 2 IRIDIA Université Libre de
More informationAnt Colony Optimization: A Component-Wise Overview
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle Ant Colony Optimization: A Component-Wise Overview M. López-Ibáñez, T. Stützle,
More informationMetaheuristic Development Methodology. Fall 2009 Instructor: Dr. Masoud Yaghini
Metaheuristic Development Methodology Fall 2009 Instructor: Dr. Masoud Yaghini Phases and Steps Phases and Steps Phase 1: Understanding Problem Step 1: State the Problem Step 2: Review of Existing Solution
More informationAn Analysis of Algorithmic Components for Multiobjective Ant Colony Optimization: A Case Study on the Biobjective TSP
An Analysis of Algorithmic Components for Multiobjective Ant Colony Optimization: A Case Study on the Biobjective TSP Manuel López-Ibáñez and Thomas Stützle IRIDIA, CoDE, Université Libre de Bruxelles,
More informationAnt Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art
Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art Krzysztof Socha, Michael Sampels, and Max Manfrin IRIDIA, Université Libre de Bruxelles, CP 194/6, Av. Franklin
More informationEvolutionary Non-Linear Great Deluge for University Course Timetabling
Evolutionary Non-Linear Great Deluge for University Course Timetabling Dario Landa-Silva and Joe Henry Obit Automated Scheduling, Optimisation and Planning Research Group School of Computer Science, The
More informationOutline of the module
Evolutionary and Heuristic Optimisation (ITNPD8) Lecture 2: Heuristics and Metaheuristics Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ Computing Science and Mathematics, School of Natural Sciences University
More informationPre-requisite Material for Course Heuristics and Approximation Algorithms
Pre-requisite Material for Course Heuristics and Approximation Algorithms This document contains an overview of the basic concepts that are needed in preparation to participate in the course. In addition,
More informationA tabu search approach for makespan minimization in a permutation flow shop scheduling problems
A tabu search approach for makespan minimization in a permutation flow shop scheduling problems Sawat Pararach Department of Industrial Engineering, Faculty of Engineering, Thammasat University, Pathumthani
More informationGRASP. Greedy Randomized Adaptive. Search Procedure
GRASP Greedy Randomized Adaptive Search Procedure Type of problems Combinatorial optimization problem: Finite ensemble E = {1,2,... n } Subset of feasible solutions F 2 Objective function f : 2 Minimisation
More informationIncorporation of Scalarizing Fitness Functions into Evolutionary Multiobjective Optimization Algorithms
H. Ishibuchi, T. Doi, and Y. Nojima, Incorporation of scalarizing fitness functions into evolutionary multiobjective optimization algorithms, Lecture Notes in Computer Science 4193: Parallel Problem Solving
More informationNon-deterministic Search techniques. Emma Hart
Non-deterministic Search techniques Emma Hart Why do local search? Many real problems are too hard to solve with exact (deterministic) techniques Modern, non-deterministic techniques offer ways of getting
More informationVariable Neighbourhood Search (VNS)
Variable Neighbourhood Search (VNS) Key dea: systematically change neighbourhoods during search Motivation: recall: changing neighbourhoods can help escape local optima a global optimum is locally optimal
More informationA Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem Yan Li 1, a*, Zhigang Chen 2, b
International Conference on Information Technology and Management Innovation (ICITMI 2015) A Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem Yan Li 1, a*, Zhigang Chen
More informationVariable Neighbourhood Search (VNS)
Variable Neighbourhood Search (VNS) Key dea: systematically change neighbourhoods during search Motivation: recall: changing neighbourhoods can help escape local optima a global optimum is locally optimal
More informationEvolutionary Non-linear Great Deluge for University Course Timetabling
Evolutionary Non-linear Great Deluge for University Course Timetabling Dario Landa-Silva and Joe Henry Obit Automated Scheduling, Optimisation and Planning Research Group School of Computer Science, The
More informationND-Tree: a Fast Online Algorithm for Updating the Pareto Archive
ND-Tree: a Fast Online Algorithm for Updating the Pareto Archive i.e. return to Algorithms and Data structures Andrzej Jaszkiewicz, Thibaut Lust Multiobjective optimization " minimize" z1 f... " minimize"
More informationACO and other (meta)heuristics for CO
ACO and other (meta)heuristics for CO 32 33 Outline Notes on combinatorial optimization and algorithmic complexity Construction and modification metaheuristics: two complementary ways of searching a solution
More informationParallel Machine and Flow Shop Models
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING 1. Resume and Extensions on Single Machine Models Lecture 10 Parallel Machine and Flow Shop Models 2. Parallel Machine Models Marco Chiarandini 3. Flow
More informationAnt Colony Optimization Exercises
Outline DM6 HEURISTICS FOR COMBINATORIAL OPTIMIZATION Lecture 11 Ant Colony Optimization Exercises Ant Colony Optimization: the Metaheuristic Application Examples Connection between ACO and other Metaheuristics
More informationLamarckian Repair and Darwinian Repair in EMO Algorithms for Multiobjective 0/1 Knapsack Problems
Repair and Repair in EMO Algorithms for Multiobjective 0/ Knapsack Problems Shiori Kaige, Kaname Narukawa, and Hisao Ishibuchi Department of Industrial Engineering, Osaka Prefecture University, - Gakuen-cho,
More informationEuropean Journal of Operational Research
European Journal of Operational Research 222 (2012) 31 43 Contents lists available at SciVerse ScienceDirect European Journal of Operational Research journal homepage: www.elsevier.com/locate/ejor Discrete
More informationTravelling Salesman Problems
STOCHASTIC LOCAL SEARCH FOUNDATIONS & APPLICATIONS Travelling Salesman Problems Presented by Camilo Rostoker rostokec@cs.ubc.ca Department of Computer Science University of British Columbia Outline 1.
More informationVariable Neighborhood Search for Solving the Balanced Location Problem
TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Variable Neighborhood Search for Solving the Balanced Location Problem Jozef Kratica, Markus Leitner, Ivana Ljubić Forschungsbericht
More informationABSTRACT I. INTRODUCTION. J Kanimozhi *, R Subramanian Department of Computer Science, Pondicherry University, Puducherry, Tamil Nadu, India
ABSTRACT 2018 IJSRSET Volume 4 Issue 4 Print ISSN: 2395-1990 Online ISSN : 2394-4099 Themed Section : Engineering and Technology Travelling Salesman Problem Solved using Genetic Algorithm Combined Data
More informationunderlying iterative best improvement procedure based on tabu attributes. Heuristic Optimization
Tabu Search Key idea: Use aspects of search history (memory) to escape from local minima. Simple Tabu Search: I Associate tabu attributes with candidate solutions or solution components. I Forbid steps
More informationA CRITICAL REVIEW OF THE NEWEST BIOLOGICALLY-INSPIRED ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM
TASKQUARTERLY11No1 2,7 19 A CRITICAL REVIEW OF THE NEWEST BIOLOGICALLY-INSPIRED ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM JERZY DUDA AGH University of Science and Technology, Faculty of Management,
More informationSLS Methods: An Overview
HEURSTC OPTMZATON SLS Methods: An Overview adapted from slides for SLS:FA, Chapter 2 Outline 1. Constructive Heuristics (Revisited) 2. terative mprovement (Revisited) 3. Simple SLS Methods 4. Hybrid SLS
More informationA review and evaluation of multi-objective algorithms for the flowshop scheduling problem
A review and evaluation of multi-objective algorithms for the flowshop scheduling problem Gerardo Minella 1, Rubén Ruiz 1, Michele Ciavotta 2 1 Grupo de Sistemas de Optimización Aplicada, Instituto Tecnológico
More informationOPTIMIZING THE TOTAL COMPLETION TIME IN PROCESS PLANNING USING THE RANDOM SIMULATION ALGORITHM
OPTIMIZING THE TOTAL COMPLETION TIME IN PROCESS PLANNING USING THE RANDOM SIMULATION ALGORITHM Baskar A. and Anthony Xavior M. School of Mechanical and Building Sciences, VIT University, Vellore, India
More informationSLS Algorithms. 2.1 Iterative Improvement (revisited)
SLS Algorithms Stochastic local search (SLS) has become a widely accepted approach to solving hard combinatorial optimisation problems. An important characteristic of many recently developed SLS methods
More informationAutomatic Component-wise Design of Multi-Objective Evolutionary Algorithms
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle Automatic Component-wise Design of Multi-Objective Evolutionary Algorithms L.
More informationRecombination of Similar Parents in EMO Algorithms
H. Ishibuchi and K. Narukawa, Recombination of parents in EMO algorithms, Lecture Notes in Computer Science 341: Evolutionary Multi-Criterion Optimization, pp. 265-279, Springer, Berlin, March 25. (Proc.
More informationA Course on Meta-Heuristic Search Methods for Combinatorial Optimization Problems
A Course on Meta-Heuristic Search Methods for Combinatorial Optimization Problems AutOrI LAB, DIA, Roma Tre Email: mandal@dia.uniroma3.it January 16, 2014 Outline 1 An example Assignment-I Tips Variants
More informationPre-scheduled and adaptive parameter variation in MAX-MIN Ant System
Pre-scheduled and adaptive parameter variation in MAX-MIN Ant System Michael Maur, Manuel López-Ibáñez, and Thomas Stützle Abstract MAX-MIN Ant System (MMAS) is an ant colony optimization (ACO) algorithm
More informationA SIMULATED ANNEALING ALGORITHM FOR SOME CLASS OF DISCRETE-CONTINUOUS SCHEDULING PROBLEMS. Joanna Józefowska, Marek Mika and Jan Węglarz
A SIMULATED ANNEALING ALGORITHM FOR SOME CLASS OF DISCRETE-CONTINUOUS SCHEDULING PROBLEMS Joanna Józefowska, Marek Mika and Jan Węglarz Poznań University of Technology, Institute of Computing Science,
More informationOutline. No Free Lunch Theorems SMTWTP. Outline DM812 METAHEURISTICS
DM812 METAHEURISTICS Outline Lecture 9 Marco Chiarandini 1. Department of Mathematics and Computer Science University of Southern Denmark, Odense, Denmark 2. Outline 1. 2. Linear permutations
More informationContinuous optimization algorithms for tuning real and integer parameters of swarm intelligence algorithms
Swarm Intell (2012) 6:49 75 DOI 10.1007/s11721-011-0065-9 Continuous optimization algorithms for tuning real and integer parameters of swarm intelligence algorithms Zhi Yuan MarcoA.MontesdeOca Mauro Birattari
More informationAdaptive Multi-operator MetaHeuristics for quadratic assignment problems
Adaptive Multi-operator MetaHeuristics for quadratic assignment problems Madalina M. Drugan 1 and El-Ghazali Talbi 2 1 Artificial Intelligence lab, Vrije Universiteit Brussels, Pleinlaan 2, 1050-Brussels,
More informationHybridization EVOLUTIONARY COMPUTING. Reasons for Hybridization - 1. Naming. Reasons for Hybridization - 3. Reasons for Hybridization - 2
Hybridization EVOLUTIONARY COMPUTING Hybrid Evolutionary Algorithms hybridization of an EA with local search techniques (commonly called memetic algorithms) EA+LS=MA constructive heuristics exact methods
More informationLECTURE 20: SWARM INTELLIGENCE 6 / ANT COLONY OPTIMIZATION 2
15-382 COLLECTIVE INTELLIGENCE - S18 LECTURE 20: SWARM INTELLIGENCE 6 / ANT COLONY OPTIMIZATION 2 INSTRUCTOR: GIANNI A. DI CARO ANT-ROUTING TABLE: COMBINING PHEROMONE AND HEURISTIC 2 STATE-TRANSITION:
More informationReactive Stochastic Local Search Algorithms for the Genomic Median Problem
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem Renaud Lenne 1,2, Christine Solnon 1, Thomas Stützle 2, Eric Tannier 3, and Mauro Birattari 2 1 LIRIS, UMR CNRS 5205, Université
More informationImprovement Strategies for thef-racealgorithm: Sampling Design and Iterative Refinement
Improvement Strategies for thef-racealgorithm: Sampling Design and Iterative Refinement Prasanna Balaprakash, Mauro Birattari, and Thomas Stützle IRIDIA, CoDE, Université Libre de Bruxelles, Brussels,
More informationHeuristic Optimization
Heuristic Optimization Thomas Stützle RDA, CoDE Université Libre de Bruxelles stuetzle@ulb.ac.be iridia.ulb.ac.be/~stuetzle iridia.ulb.ac.be/~stuetzle/teaching/ho Example problems imagine a very good friend
More informationarxiv: v1 [cs.ai] 2 Sep 2008
MCDM 2006, Chania, Greece, June 19-23, 2006 FOUNDATIONS OF THE PARETO ITERATED LOCAL SEARCH METAHEURISTIC arxiv:0809.0406v1 [cs.ai] 2 Sep 2008 Martin Josef Geiger Lehrstuhl für Industriebetriebslehre Institut
More informationON SOLVING FLOWSHOP SCHEDULING PROBLEMS
THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Series A, OF THE ROMANIAN ACADEMY Volume 13, Number 1/2012, pp. 71 79 ON SOLVING FLOWSHOP SCHEDULING PROBLEMS Mircea ANCĂU Technical University
More informationBi-Objective Optimization for Scheduling in Heterogeneous Computing Systems
Bi-Objective Optimization for Scheduling in Heterogeneous Computing Systems Tony Maciejewski, Kyle Tarplee, Ryan Friese, and Howard Jay Siegel Department of Electrical and Computer Engineering Colorado
More informationCombining Two Local Searches with Crossover: An Efficient Hybrid Algorithm for the Traveling Salesman Problem
Combining Two Local Searches with Crossover: An Efficient Hybrid Algorithm for the Traveling Salesman Problem Weichen Liu, Thomas Weise, Yuezhong Wu and Qi Qi University of Science and Technology of Chine
More informationMO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework
MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework Aymeric Blot, Holger Hoos, Laetitia Jourdan, Marie-Éléonore Marmion, Heike Trautmann To cite this version: Aymeric Blot, Holger
More informationThe Traveling Salesman Problem: State of the Art
The Traveling Salesman Problem: State of the Art Thomas Stützle stuetzle@informatik.tu-darmstadt.de http://www.intellektik.informatik.tu-darmstadt.de/ tom. Darmstadt University of Technology Department
More informationAnt Colony Optimization
Ant Colony Optimization CompSci 760 Patricia J Riddle 1 Natural Inspiration The name Ant Colony Optimization was chosen to reflect its original inspiration: the foraging behavior of some ant species. It
More informationSudoku is a logic puzzle where one has to fill a grid with
1 A Hybrid Heuristic Approach for the Sudoku problem Nysret Musliu and Felix Winter Vienna University of Technology corresponding author Abstract Sudoku is not only a popular puzzle but also an interesting
More informationA Modular Multiphase Heuristic Solver for Post Enrolment Course Timetabling
A Modular Multiphase Heuristic Solver for Post Enrolment Course Timetabling Marco Chiarandini 1, Chris Fawcett 2, and Holger H. Hoos 2,3 1 University of Southern Denmark, Department of Mathematics and
More informationParallel Computing in Combinatorial Optimization
Parallel Computing in Combinatorial Optimization Bernard Gendron Université de Montréal gendron@iro.umontreal.ca Course Outline Objective: provide an overview of the current research on the design of parallel
More informationTesting the Impact of Parameter Tuning on a Variant of IPOP-CMA-ES with a Bounded Maximum Population Size on the Noiseless BBOB Testbed
Testing the Impact of Parameter Tuning on a Variant of IPOP-CMA-ES with a Bounded Maximum Population Size on the Noiseless BBOB Testbed ABSTRACT Tianjun Liao IRIDIA, CoDE, Université Libre de Bruxelles
More informationUsing an outward selective pressure for improving the search quality of the MOEA/D algorithm
Comput Optim Appl (25) 6:57 67 DOI.7/s589-5-9733-9 Using an outward selective pressure for improving the search quality of the MOEA/D algorithm Krzysztof Michalak Received: 2 January 24 / Published online:
More informationAnt Colony Optimization
DM841 DISCRETE OPTIMIZATION Part 2 Heuristics Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. earch 2. Context Inspiration from Nature 3. 4. 5.
More informationThe Influence of Run-Time Limits on Choosing Ant System Parameters
The Influence of Run-Time Limits on Choosing Ant System Parameters Krzysztof Socha IRIDIA, Université Libre de Bruxelles, CP 194/6, Av. Franklin D. Roosevelt 50, 1050 Bruxelles, Belgium ksocha@ulb.ac.be
More informationA NEW HEURISTIC METHOD FOR MINIMIZING THE MAKESPAN IN A NO-IDLE PERMUTATION FLOWSHOP
A NEW HEURISTIC METHOD FOR MINIMIZING THE MAKESPAN IN A NO-IDLE PERMUTATION FLOWSHOP Marcelo Seido Nagano EESC/USP Avenida Trabalhador São-Carlense, 400, São Carlos/SP drnagano@usp.br Fábio José Ceron
More informationData Science meets Optimization. ODS 2017 EURO Plenary Patrick De Causmaecker EWG/DSO EURO Working Group CODeS KU Leuven/ KULAK
Data Science meets Optimization ODS 2017 EURO Plenary Patrick De Causmaecker EWG/DSO EURO Working Group CODeS KU Leuven/ KULAK ODS 2017, Sorrento www.fourthparadigm.com Copyright 2009 Microsoft Corporation
More informationTabu Search vs. Simulated Annealing for Solving Large Quadratic Assignment Instances
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle Tabu Search vs. Simulated Annealing for Solving Large Quadratic Assignment Instances
More informationParamILS: An Automatic Algorithm Configuration Framework
Journal of Artificial Intelligence Research 36 (2009) 267-306 Submitted 06/09; published 10/09 ParamILS: An Automatic Algorithm Configuration Framework Frank Hutter Holger H. Hoos Kevin Leyton-Brown University
More informationHeuristic Optimization Introduction and Simple Heuristics
Heuristic Optimization Introduction and Simple Heuristics José M PEÑA (jmpena@fi.upm.es) (Universidad Politécnica de Madrid) 1 Outline 1. What are optimization problems? 2. Exhaustive vs. Heuristic approaches
More informationA Parallel Simulated Annealing Algorithm for Weapon-Target Assignment Problem
A Parallel Simulated Annealing Algorithm for Weapon-Target Assignment Problem Emrullah SONUC Department of Computer Engineering Karabuk University Karabuk, TURKEY Baha SEN Department of Computer Engineering
More informationJorge M. S. Valente Faculdade de Economia, Universidade do Porto Rua Dr. Roberto Frias, Porto Portugal
Jeffrey Schaller Eastern Connecticut State University Department of Business Administration 83 Windham St. Willimantic, CT 06226-2295 schallerj@easternct.edu (860) 465-5226 Jorge M. S. Valente Faculdade
More informationSolving the C sum Permutation Flowshop Scheduling Problem by Genetic Local Search
ICEC 98 (1998 IEEE International Conference on Evolutionary Computation) pp.230 234 Solving the C sum Permutation Flowshop Scheduling Problem by Genetic Local Search Takeshi Yamada, NTT Communication Science
More informationRich Vehicle Routing Problems Challenges and Prospects in Exploring the Power of Parallelism. Andreas Reinholz. 1 st COLLAB Workshop
Collaborative Research Center SFB559 Modeling of Large Logistic Networks Project M8 - Optimization Rich Vehicle Routing Problems Challenges and Prospects in Exploring the Power of Parallelism Andreas Reinholz
More informationA Similarity-Based Mating Scheme for Evolutionary Multiobjective Optimization
A Similarity-Based Mating Scheme for Evolutionary Multiobjective Optimization Hisao Ishibuchi and Youhei Shibata Department of Industrial Engineering, Osaka Prefecture University, - Gakuen-cho, Sakai,
More informationEffective probabilistic stopping rules for randomized metaheuristics: GRASP implementations
Effective probabilistic stopping rules for randomized metaheuristics: GRASP implementations Celso C. Ribeiro Isabel Rosseti Reinaldo C. Souza Universidade Federal Fluminense, Brazil July 2012 1/45 Contents
More information(Stochastic) Local Search Algorithms
DM841 DISCRETE OPTIMIZATION Part 2 Heuristics (Stochastic) Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. Components 2 Outline 1. 2. 3. Components
More informationIntroduction: Combinatorial Problems and Search
STOCHASTIC LOCAL SEARCH FOUNDATIONS AND APPLICATIONS Introduction: Combinatorial Problems and Search Holger H. Hoos & Thomas Stützle Outline 1. Combinatorial Problems 2. Two Prototypical Combinatorial
More informationLearning the Neighborhood with the Linkage Tree Genetic Algorithm
Learning the Neighborhood with the Linkage Tree Genetic Algorithm Dirk Thierens 12 and Peter A.N. Bosman 2 1 Institute of Information and Computing Sciences Universiteit Utrecht, The Netherlands 2 Centrum
More informationOn Local Optima in Multiobjective Combinatorial Optimization Problems
On Local Optima in Multiobjective Combinatorial Optimization Problems Luis Paquete 1, Tommaso Schiavinotto and Thomas Stützle 3 1 Universidade do Algarve, aculdade de Economia, Centro de Sistemas Inteligentes
More information