An Indirect Genetic Algorithm for Set Covering Problems

QR Code

An Indirect Genetic Algorithm for Set Covering Problems

This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. the actual solutions are found by an external decoder function. The genetic algorithm itself provides this decoder with p...

Full description

Bibliographic Details
Main Author:	Aickelin, Uwe
Format:	Article
Published:	Palgrave Macmillan 2002
Subjects:	Heuristics Optimisation Scheduling
Online Access:	https://eprints.nottingham.ac.uk/550/

Similar Items

'An Indirect Genetic Algorithm for Set Covering Problems'
by: Aickelin, Uwe
Published: (2002)

'Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem'
by: Aickelin, Uwe, et al.
Published: (2002)

Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem
by: Aickelin, Uwe, et al.
Published: (2002)

'Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem'
by: Aickelin, Uwe, et al.
Published: (2002)

An Indirect Genetic Algorithm for a Nurse Scheduling Problem
by: Aickelin, Uwe, et al.
Published: (2004)

'Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem'
by: Aickelin, Uwe, et al.
Published: (2000)

Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
by: Aickelin, Uwe, et al.
Published: (2000)

'Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem'
by: Aickelin, Uwe, et al.
Published: (2000)

Development and application of hyperheuristics to personnel scheduling
by: Soubeiga, Eric
Published: (2003)

A heuristic algorithm for nurse scheduling with balanced preference satisfaction
by: Constantino, Ademir A., et al.
Published: (2011)

Iterated heuristic algorithms for the classroom assignment problem
by: Constantino, Ademir Aparecido, et al.
Published: (2010)

A New Genetic Algorithm for Set Covering Problems
by: Aickelin, Uwe
Published: (2000)

A heuristic algorithm based on multiassignment procedures for nurse scheduling
by: Constantino, Ademir Aparecido, et al.
Published: (2014)

Hyper-heuristics: a survey of the state of the art
by: Burke, Edmund, et al.
Published: (2013)

Multi-stage hyper-heuristics for optimisation problems
by: Kheiri, Ahmed
Published: (2014)

An iterated multi-stage selection hyper-heuristic
by: Kheiri, Ahmed, et al.
Published: (2016)

'On the Application of Hierarchical Coevolutionary Genetic Algorithms: Recombination and Evaluation Partners'
by: Aickelin, Uwe, et al.
Published: (2003)

A self-adaptive multimeme memetic algorithm co-evolving utility scores to control genetic operators and their parameter settings
by: Özcan, Ender, et al.
Published: (2016)

Optimisation models and algorithms for workforce scheduling and routing
by: Castillo Salazar, José Arturo
Published: (2015)

Genetic algorithms for workforce scheduling and routing problem
by: Algethami, Haneen
Published: (2017)

A heuristic approach to optimal design of an underground mine stope layout
by: Sandanayake, D., et al.
Published: (2015)

A multiobjective single bus corridor scheduling using machine learning-based predictive models
by: Chen, Bing, et al.
Published: (2020)

A stochastic local search algorithm with adaptive acceptance for high-school timetabling
by: Kheiri, Ahmed, et al.
Published: (2014)

An Estimation of Distribution Algorithm for Nurse Scheduling
by: Aickelin, Uwe, et al.
Published: (2007)

An Estimation of Distribution Algorithm for Nurse Scheduling
by: Aickelin, Uwe, et al.
Published: (2007)

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

Ant algorithm hyperheuristic approaches for scheduling problems
by: O'Brien, Ross
Published: (2008)

Greedy heuristic for the workforce scheduling and routing problem
by: Russell, Samuel
Published: (2017)

Multiobjective selection hyper-heuristics using reinforcement learning
by: Li, Wenwen
Published: (2018)

A variable neighbourhood search for the workforce scheduling and routing problem
by: Pinheiro, Rodrigo Lankaites, et al.
Published: (2015)

An adaptive multi-population artificial bee colony algorithm for dynamic optimisation problems
by: Nseef, Shams K., et al.
Published: (2016)

Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm
by: Constantino, Ademir Aparecido, et al.
Published: (2017)

An analysis of the Taguchi method for tuning a memetic algorithm with reduced computational time budget
by: Gümüş, Düriye Betül, et al.
Published: (2016)

A greedy heuristic for workforce scheduling and routing with time-dependent activities constraints
by: Castillo-Salazar, J. Arturo, et al.
Published: (2015)

An adaptive multi meme memetic algorithm embedding choice function hyper-heuristic
by: Qarout, Rehab
Published: (2015)

Heuristic algorithms for routing problems.
by: Chong, Yen N.
Published: (2001)

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)

Solving single machine scheduling problem with maximum lateness using a genetic algorithm
by: Nazif, Habibeh, et al.
Published: (2010)

A multi-objective genetic algorithm for optimisation of energy consumption and shop floor production performance
by: Liu, Ying, et al.
Published: (2016)

Heuristic decomposition and mathematical programming for workforce scheduling and routing problems
by: Laesanklang, Wasakorn
Published: (2017)