An adaptive evolutionary multi-objective approach based on simulated annealing

QR Code

An adaptive evolutionary multi-objective approach based on simulated annealing

A multi-objective optimization problem can be solved by decomposing it into one or more single objective subproblems in some multi-objective metaheuristic algorithms. Each subproblem corresponds to one weighted aggregation function. For example, MOEA/D is an evolutionary multi-objective optimization...

Full description

Bibliographic Details
Main Authors:	Li, Hui, Landa-Silva, Dario
Format:	Article
Published:	MIT Press 2011
Subjects:	multiobjective optimization simulated annealing local search combinatorial optimization
Online Access:	https://eprints.nottingham.ac.uk/32605/

Similar Items

Improved dynamic lexicographic ordering for multi-objective optimisation
by: Castro-Gutierrez, Juan, et al.
Published: (2010)

CODEA : an agent based multi-objective optimization framework
by: Castro-Gutierrez, Juan, et al.
Published: (2010)

Improved local search approaches to solve the post enrolment course timetabling problem
by: Goh, Say Leng, et al.
Published: (2017)

Evolutionary multi-objective optimization algorithms with probabilistic representation based on pheromone trails
by: Li, Hui, et al.
Published: (2010)

Analysis of objectives relationships in multiobjective problems using trade-off region maps
by: Pinheiro, Rodrigo L., et al.
Published: (2015)

A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems
by: Xu, Ying, et al.
Published: (2013)

Nature of real-world multi-objective vehicle routing with evolutionary algorithms
by: Castro-Gutierrez, Juan, et al.
Published: (2011)

A hybrid evolutionary approach to the nurse rostering problem
by: Bai, Ruibin, et al.
Published: (2010)

Evolutionary squeaky wheel optimization: a new framework for analysis
by: Li, Jingpeng, et al.
Published: (2011)

Move Acceptance in Local Search Metaheuristics for Cross-domain Heuristic Search
by: Jackson, Warren G
Published: (2021)

Tuning a Simulated Annealing metaheuristic for cross-domain search
by: Jackson, Warren G., et al.
Published: (2017)

Improved orthogonal array based simulated annealing for design optimization
by: Chan, Kit Yan, et al.
Published: (2009)

Move acceptance in local search metaheuristics for cross-domain search
by: Jackson, Warren G., et al.
Published: (2018)

A technique based on trade-off maps to visualise and analyse relationships between objectives in optimisation problems
by: Pinheiro, Rodrigo Lankaites, et al.
Published: (2017)

Application of Heuristic Methods To Portfolio Optimisation: An Object-Oriented Approach
by: Adedoyin, Olatunde
Published: (2008)

A modified ant colony optimization algorithm for network coding resource minimization
by: Wang, Zhaoyuan, et al.
Published: (2015)

Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems
by: Nazif, Habibeh
Published: (2010)

Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms
by: Koh, Johnny Siaw Paw
Published: (2008)

Fuzzy genetic algorithms for combinatorial optimisation problems
by: Varnamkhasti, Mohammad Jalali
Published: (2012)

Combinatorial Optimization of Topological Design in Computer Communication Network
by: Garba Mohammed, Salisu
Published: (2004)

A multi-agent based cooperative approach to scheduling and routing
by: Martin, Simon, et al.
Published: (2016)

Metaheuristic and Multiobjective Approaches for Space Allocation
by: Landa Silva, Jesus Dario
Published: (2003)

Evolutionary local search for solving the office space allocation problem
by: Ulker, Ozgur, et al.
Published: (2012)

Hyper-volume evolutionary algorithm
by: Le, Khoi Nguyen, et al.
Published: (2016)

A hybrid combinatorial approach to a two-stage stochastic portfolio optimization model with uncertain asset prices
by: Cui, Tianxiang, et al.
Published: (2020)

Enhanced simulated annealing for solving aggregate production planning
by: Abu Bakar, Mohd Rizam, et al.
Published: (2016)

Iterated local search using an add and delete hyper- heuristic for university course timetabling
by: Soria-Alcaraz, Jorge A., et al.
Published: (2016)

A software interface for supporting the application of data science to optimisation
by: Parkes, Andrew J., et al.
Published: (2015)

An investigation of Monte Carlo tree search and local search for course timetabling problems
by: Goh, Say Leng
Published: (2017)

An Estimation of Distribution Algorithm with Intelligent Local Search for Rule-based Nurse Rostering
by: Aickelin, Uwe, et al.
Published: (2007)

An Estimation of Distribution Algorithm with Intelligent Local Search for Rule-based Nurse Rostering
by: Aickelin, Uwe, et al.
Published: (2007)

A nondominated sorting genetic algorithm for bi-objective network coding based multicast routing problems
by: Xing, Huanlai, et al.
Published: (2013)

The cross-entropy method in multi-objective optimisation: An assessment
by: Bekker, J., et al.
Published: (2011)

A case study of controlling crossover in a selection hyper-heuristic framework using the multidimensional knapsack problem
by: Drake, John H., et al.
Published: (2015)

Simulation of a four-car elevator operation using MATLAB
by: King, Saw Soon, et al.
Published: (2008)

Evolutionary topology optimization using the extended finite element method and isolines
by: Abdi, Meisam, et al.
Published: (2014)

Office space allocation by using mathematical programming and meta-heuristics
by: Ulker, Ozgur
Published: (2013)

Evolutionary approaches for portfolio optimization
by: Lwin, Khin Thein
Published: (2015)

Artificial neural networks in wave predictions at the west coast of Portugal
by: Makarynskyy, Oleg, et al.
Published: (2005)

Lattice Boltzmann simulation of flow and heat transfer in random porous media constructed by simulated annealing algorithm
by: Liu, Minghua, et al.
Published: (2017)