Stochastic Pareto local search: Pareto neighbourhood exploration and perturbation strategies

This publication has 34 references indexed in Scilit:

• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
  Computers & Operations Research, 2011
• HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization
  Evolutionary Computation, 2011
• On the Complexity of Computing the Hypervolume Indicator
  IEEE Transactions on Evolutionary Computation, 2009
• SMS-EMOA: Multiobjective selection based on dominated hypervolume
  European Journal of Operational Research, 2007
• Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem
  4OR, 2006
• First vs. best improvement: An empirical study
  Discrete Applied Mathematics, 2006
• Evaluating the ε-Domination Based Multi-Objective Evolutionary Algorithm for a Quick Computation of Pareto-Optimal Solutions
  Evolutionary Computation, 2005
• Random Bit Climbers on Multiobjective MNK-Landscapes: Effiects of Memory and Population Climbing
  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2005
• PISA — A Platform and Programming Language Independent Interface for Search Algorithms
  2003
• On spanning tree problems with multiple objectives
  Annals of Operations Research, 1994