poster

The optimal filtering set problem with application to surrogate evaluation in genetic programming

Authors:

Francisco J. Gil-Gala,

María R. Sierra,

Carlos Mencía,

Ramiro VarelaAuthors Info & Claims

GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference Companion

Pages 129 - 130

https://doi.org/10.1145/3449726.3459484

Published: 08 July 2021 Publication History

Get Access

Abstract

Surrogate evaluation is common in population-based evolutionary algorithms where exact fitness calculation may be extremely time consuming. We consider a Genetic Program (GP) that evolves scheduling rules, which have to be evaluated on a training set of instances of a scheduling problem, and propose exploiting a small set of low size instances, called filter, so that the evaluation of a rule in a filter estimates the actual evaluation of the rule on the training set. The calculation of filters is modelled as an optimal subset problem and solved by a genetic algorithm. As case study, we consider the problem of scheduling jobs in a machine with time-varying capacity and show that the combination of the surrogate model with the GP termed SM-GP, outperforms the original GP.

References

[1]

Maumita Bhattacharya. 2008. Reduced computation for evolutionary optimization in noisy environment. In GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008. 2117--2122.

Digital Library

Google Scholar

[2]

J. Branke and C. Schmidt. 2005. Faster Convergence by Means of Fitness Estimation. Soft Comput. 9, 1 (Jan. 2005), 13âĂŞ20.

Digital Library

Google Scholar

[3]

Francisco J. Gil-Gala, Carlos Mencía, María R. Sierra, and Ramiro Varela. 2019. Evolving priority rules for on-line scheduling of jobs on a single machine with variable capacity over time. Applied Soft Computing 85 (2019), 105782.

Digital Library

Google Scholar

[4]

Francisco J. Gil-Gala, María R. Sierra, Carlos Mencía, and Ramiro Varela. 2020. Combining hyper-heuristics to evolve ensembles of priority rules for on-line scheduling. Natural Computing (2020).

Google Scholar

[5]

Rayan Hussein and Kalyanmoy Deb. 2016. A Generative Kriging Surrogate Model for Constrained and Unconstrained Multi-Objective Optimization. In Proceedings of the Genetic and Evolutionary Computation Conference 2016 (Denver, Colorado, USA) (GECCO '16). Association for Computing Machinery, New York, NY, USA, 573âĂŞ580.

Digital Library

Google Scholar

[6]

Z. Zhou, Y. S. Ong, P. B. Nair, A. J. Keane, and K. Y. Lum. 2007. Combining Global and Local Surrogate Models to Accelerate Evolutionary Optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) 37, 1 (2007), 66--76.

Digital Library

Google Scholar

Cited By

View all

Gil Gala FDurasevic MDumic MCoric RJakobovic DSilva SPaquete L(2023)An analysis of training models to evolve heuristics for the travelling salesman problemProceedings of the Companion Conference on Genetic and Evolutionary Computation10.1145/3583133.3590559(575-578)Online publication date: 15-Jul-2023
https://dl.acm.org/doi/10.1145/3583133.3590559
Gil-Gala FAfsar SDurasevic MPalacios JAfsar MSilva SPaquete L(2023)Genetic programming for the vehicle routing problem with zone-based pricingProceedings of the Genetic and Evolutionary Computation Conference10.1145/3583131.3590366(1118-1126)Online publication date: 15-Jul-2023
https://dl.acm.org/doi/10.1145/3583131.3590366
Gil-Gala FSierra MMencía CVarela R(2023)Surrogate model for memetic genetic programming with application to the one machine scheduling problem with time-varying capacityExpert Systems with Applications: An International Journal10.1016/j.eswa.2023.120916233:COnline publication date: 15-Dec-2023
https://dl.acm.org/doi/10.1016/j.eswa.2023.120916

Index Terms

The optimal filtering set problem with application to surrogate evaluation in genetic programming

Recommendations

Surrogate model for memetic genetic programming with application to the one machine scheduling problem with time-varying capacity
Abstract
Surrogate evaluation is a useful, if not the unique, technique in population-based evolutionary algorithms where exact fitness calculation is too expensive. This situation arises, for example, in Genetic Programming (GP) applied to evolve ...
Highlights
- Formalization of the Optimal Filtering Set Problem (OFSP).
- Development of a Genetic Algorithm (GA) for solving the OFSP.
- Combination of surrogate evaluation and local search in Genetic Programming.
- Analysis and comparison of ...
An improved genetic algorithm with conditional genetic operators and its application to set-covering problem

The genetic algorithm (GA) is a popular, biologically inspired optimization method. However, in the GA there is no rule of thumb to design the GA operators and select GA parameters. Instead, trial-and-error has to be applied. In this paper we present an ...
A new dispatching rule based genetic algorithm for the multi-objective job shop problem

Hyper-heuristics or "methodologies to choose heuristics" are becoming increasingly popular given their suitability to solve hard real world combinatorial optimisation problems. Their distinguishing feature is that they operate in the space of heuristics ...

Comments

Information & Contributors

Information

Published In

GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference Companion

July 2021

2047 pages

ISBN:9781450383516

DOI:10.1145/3449726

Editor:
Francisco Chicano
University of Malaga
,
General Chair:
Krzysztof Krawiec
Poznan University of Technology

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 July 2021

Check for updates

Author Tags

Qualifiers

Poster

Funding Sources

Spanish National Plan for Scientific and Technical Research and Innovation

Conference

GECCO '21

Sponsor:

SIGEVO

GECCO '21: Genetic and Evolutionary Computation Conference

July 10 - 14, 2021

Lille, France

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
34
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gil Gala FDurasevic MDumic MCoric RJakobovic DSilva SPaquete L(2023)An analysis of training models to evolve heuristics for the travelling salesman problemProceedings of the Companion Conference on Genetic and Evolutionary Computation10.1145/3583133.3590559(575-578)Online publication date: 15-Jul-2023
https://dl.acm.org/doi/10.1145/3583133.3590559
Gil-Gala FAfsar SDurasevic MPalacios JAfsar MSilva SPaquete L(2023)Genetic programming for the vehicle routing problem with zone-based pricingProceedings of the Genetic and Evolutionary Computation Conference10.1145/3583131.3590366(1118-1126)Online publication date: 15-Jul-2023
https://dl.acm.org/doi/10.1145/3583131.3590366
Gil-Gala FSierra MMencía CVarela R(2023)Surrogate model for memetic genetic programming with application to the one machine scheduling problem with time-varying capacityExpert Systems with Applications: An International Journal10.1016/j.eswa.2023.120916233:COnline publication date: 15-Dec-2023
https://dl.acm.org/doi/10.1016/j.eswa.2023.120916

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Surrogate model for memetic genetic programming with application to the one machine scheduling problem with time-varying capacity

An improved genetic algorithm with conditional genetic operators and its application to set-covering problem

A new dispatching rule based genetic algorithm for the multi-objective job shop problem

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Funding Sources

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations