On the public citation graph
A comparison of dominance mechanisms and simple mutation on non-stationary problems
0 signed · 134 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-58484-6_248openalex-snapshot
A diploid genetic algorithm for preserving population diversity — Pseudo-Meiosis GA
inferredcites →https://doi.org/10.1109/icec.1996.542705openalex-snapshot
Useful diversity via multiploidy
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ecj.10097openalex-snapshot
A new genetic algorithm with diploid chromosomes using probability decoding for adaptation to various environments
inferred← citeshttps://doi.org/10.1007/11539117_144openalex-snapshot
An Orthogonal Dynamic Evolutionary Algorithm with Niches
inferred← citeshttps://doi.org/10.1007/11732242_76openalex-snapshot
Associative Memory Scheme for Genetic Algorithms in Dynamic Environments
inferred← citeshttps://doi.org/10.1007/11759683_12openalex-snapshot
Preserving Variability in Sexual Multi-agent Systems with Diploidy and Dominance
inferred← citeshttps://doi.org/10.1007/11893295_92openalex-snapshot
An Improved Primal-Dual Genetic Algorithm for Optimization in Dynamic Environments
inferred← citeshttps://doi.org/10.1007/3-211-27389-1_53openalex-snapshot
Using Genetic Algorithms with Real-coded Binary Representation for Solving Non-stationary Problems
inferred← citeshttps://doi.org/10.1007/3-540-36077-8_32openalex-snapshot
Preserving Diversity through Diploidy and Meiosis for Improved Genetic Algorithm Performance in Dynamic Environments
inferred← citeshttps://doi.org/10.1007/3-540-45105-6_40openalex-snapshot
Finite Population Models of Co-evolution and Their Application to Haploidy versus Diploidy
inferred← citeshttps://doi.org/10.1007/3-540-45105-6_85openalex-snapshot
Chromosome Reuse in Genetic Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45110-2_7openalex-snapshot
Non-stationary Function Optimization Using Polygenic Inheritance
inferred← citeshttps://doi.org/10.1007/3-540-45356-3_16openalex-snapshot
An Analysis of Dynamic Severity and Population Size
inferred← citeshttps://doi.org/10.1007/3-540-45517-5_42openalex-snapshot
Dynamic Trait Expression for Multiploid Individuals of Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45712-7_7openalex-snapshot
Performance Measures for Dynamic Environments
inferred← citeshttps://doi.org/10.1007/978-0-387-71921-4_13openalex-snapshot
A Study of Canonical GAs for NSOPs
inferred← citeshttps://doi.org/10.1007/978-3-540-24854-5_133openalex-snapshot
Dynamic and Scalable Evolutionary Data Mining: An Approach Based on a Self-Adaptive Multiple Expression Mechanism
inferred← citeshttps://doi.org/10.1007/978-3-540-28646-2_7openalex-snapshot
An External Memory Implementation in Ant Colony Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-31996-2_1openalex-snapshot
An External Partial Permutations Memory for Ant Colony Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-32003-6_59openalex-snapshot
The Memory Indexing Evolutionary Algorithm for Dynamic Environments
inferred← citeshttps://doi.org/10.1007/978-3-540-32003-6_65openalex-snapshot
Assortative Mating in Genetic Algorithms for Dynamic Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-44511-1_10openalex-snapshot
Performance-Based Computation of Chromosome Lifetimes in Genetic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-45240-9_11openalex-snapshot
Comparison of Domination Approaches for Diploid Binary Genetic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-49774-5openalex-snapshot
Evolutionary Computation in Dynamic and Uncertain Environments
inferred← citeshttps://doi.org/10.1007/978-3-540-49774-5_1openalex-snapshot
Explicit Memory Schemes for Evolutionary Algorithms in Dynamic Environments
inferred← citeshttps://doi.org/10.1007/978-3-540-49774-5_4openalex-snapshot
Orthogonal Dynamic Hill Climbing Algorithm: ODHC
inferred← citeshttps://doi.org/10.1007/978-3-540-72964-8_4openalex-snapshot
Tackling Dynamic Problems with Multiobjective Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-73922-7_2openalex-snapshot
Multimodal Dynamic Optimization: From Evolutionary Algorithms to Artificial Immune Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-78761-7_65openalex-snapshot
Memory Based on Abstraction for Dynamic Fitness Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-89694-4_40openalex-snapshot
A Generalized Approach to Construct Benchmark Problems for Dynamic Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-18965-4_9openalex-snapshot
Designing Evolutionary Algorithms for Dynamic Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-20525-5_32openalex-snapshot
An Investigation of Selection Hyper-heuristics in Dynamic Environments
inferred← citeshttps://doi.org/10.1007/978-3-642-24082-9_33openalex-snapshot
Optimizing for Change through Shades
inferred← citeshttps://doi.org/10.1007/978-3-642-30504-7_1openalex-snapshot
Dynamic Optimization Using Analytic and Evolutionary Approaches: A Comparative Review
inferred← citeshttps://doi.org/10.1007/978-3-642-38416-5_1openalex-snapshot
Evolutionary Dynamic Optimization: Test and Evaluation Environments
inferred← citeshttps://doi.org/10.1007/978-3-642-38416-5_14openalex-snapshot
Genetic Algorithms for Dynamic Routing Problems in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-38416-5_2openalex-snapshot
Evolutionary Dynamic Optimization: Methodologies
inferred← citeshttps://doi.org/10.1007/978-3-642-38416-5_7openalex-snapshot
BIPOP: A New Algorithm with Explicit Exploration/Exploitation Control for Dynamic Optimization Problems
inferred← citeshttps://doi.org/10.1007/s00146-015-0591-xopenalex-snapshot
On the applicability of diploid genetic algorithms
inferred← citeshttps://doi.org/10.1007/s00500-004-0421-4openalex-snapshot
A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environments
inferred← citeshttps://doi.org/10.1007/s00500-004-0422-3openalex-snapshot
Experimental study on population-based incremental learning algorithms for dynamic optimization problems
inferred← citeshttps://doi.org/10.1007/s00500-008-0345-5openalex-snapshot
A permutation-based dual genetic algorithm for dynamic optimization problems
inferred← citeshttps://doi.org/10.1007/s00500-009-0420-6openalex-snapshot
Learning behavior in abstract memory schemes for dynamic optimization problems
inferred← citeshttps://doi.org/10.1007/s00500-013-1094-7openalex-snapshot
A hybrid multi-population framework for dynamic environments combining online and offline learning
inferred← citeshttps://doi.org/10.1007/s00500-013-1175-7openalex-snapshot
A novel cooperative coevolutionary dynamic multi-objective optimization algorithm using a new predictive model
inferred← citeshttps://doi.org/10.1007/s10489-011-0317-9openalex-snapshot
Performance evaluation of evolutionary heuristics in dynamic environments
inferred← citeshttps://doi.org/10.1007/s10489-018-1197-zopenalex-snapshot
Explicit memory based ABC with a clustering strategy for updating and retrieval of memory in dynamic environments
inferred← citeshttps://doi.org/10.1007/s10614-013-9411-xopenalex-snapshot
Volatility Forecasting Using Support Vector Regression and a Hybrid Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/s10614-023-10502-3openalex-snapshot
High-Frequency Trading in Bond Returns: A Comparison Across Alternative Methods and Fixed-Income Markets
inferred← citeshttps://doi.org/10.1007/s10710-014-9236-yopenalex-snapshot
Evolutionary model building under streaming data for classification tasks: opportunities and challenges
inferred← citeshttps://doi.org/10.1007/s11047-015-9497-2openalex-snapshot
Global memory schemes for dynamic optimization
inferred← citeshttps://doi.org/10.1007/s12065-025-01121-yopenalex-snapshot
Intensity-driven evolutionary optimization with dual prediction and adaptive stepwise response for dynamic multi-objective problems
inferred← citeshttps://doi.org/10.1007/s12293-012-0090-2openalex-snapshot
A framework for finding robust optimal solutions over time
inferred← citeshttps://doi.org/10.1016/b978-155860734-7/50100-1openalex-snapshot
Burden and Benefits of Redundancy
inferred← citeshttps://doi.org/10.1016/j.asoc.2019.105876openalex-snapshot
Dual-archive-based particle swarm optimization for dynamic optimization
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.02.042openalex-snapshot
Modified Differential Evolution with Locality induced Genetic Operators for dynamic optimization
inferred← citeshttps://doi.org/10.1016/j.eswa.2012.08.050openalex-snapshot
Dynamic genetic algorithms for the dynamic load balanced clustering problem in mobile ad hoc networks
inferred← citeshttps://doi.org/10.1016/j.ins.2011.05.022openalex-snapshot
A comparative study on the performance of dissortative mating and immigrants-based strategies for evolutionary dynamic optimization
inferred← citeshttps://doi.org/10.1016/j.knosys.2016.07.001openalex-snapshot
A dynamic optimization approach to the design of cooperative co-evolutionary algorithms
inferred← citeshttps://doi.org/10.1016/j.swevo.2012.05.001openalex-snapshot
Evolutionary dynamic optimization: A survey of the state of the art
inferred← citeshttps://doi.org/10.1016/j.swevo.2016.12.005openalex-snapshot
A survey of swarm intelligence for dynamic optimization: Algorithms and applications
inferred← citeshttps://doi.org/10.1093/imaman/dps021openalex-snapshot
Metaheuristics for dynamic combinatorial optimization problems
inferred← citeshttps://doi.org/10.1108/ijicc-07-2015-0026openalex-snapshot
Diploidy in evolutionary algorithms for dynamic optimization problems
inferred← citeshttps://doi.org/10.1109/access.2018.2881538openalex-snapshot
Neural Network for Change Direction Prediction in Dynamic Optimization
inferred← citeshttps://doi.org/10.1109/ccdc.2008.4597285openalex-snapshot
A new dual scheme for genetic algorithm in dynamic environments
inferred← citeshttps://doi.org/10.1109/ccdc.2008.4598123openalex-snapshot
Multi-agent based evolutionary algorithm for dynamic knapsack problem
inferred← citeshttps://doi.org/10.1109/cec.1999.785502openalex-snapshot
Memory enhanced evolutionary algorithms for changing optimization problems
inferred← citeshttps://doi.org/10.1109/cec.2002.1006224openalex-snapshot
Dynamic memory model for non-stationary optimization
inferred← citeshttps://doi.org/10.1109/cec.2003.1299951openalex-snapshot
Non-stationary problem optimization using the primal-dual genetic algorithm
inferred← citeshttps://doi.org/10.1109/cec.2004.1331042openalex-snapshot
Constructing dynamic test environments for genetic algorithms based on problem difficulty
inferred← citeshttps://doi.org/10.1109/cec.2004.1331046openalex-snapshot
On the performance of evolutionary algorithms with life-time adaptation in dynamic fitness landscapes
inferred← citeshttps://doi.org/10.1109/cec.2004.1331179openalex-snapshot
An event-driven test framework for evolutionary algorithms in dynamic environments
inferred← citeshttps://doi.org/10.1109/cec.2005.1554758openalex-snapshot
Complementary Selection and Variation for an Efficient Multiobjective Optimization of Complex Systems
inferred← citeshttps://doi.org/10.1109/cec.2005.1554783openalex-snapshot
The performance of polyploid evolutionary algorithms is improved both by having many chromosomes and by having many copies of each chromosome on symbolic regression problems
inferred← citeshttps://doi.org/10.1109/cec.2005.1554825openalex-snapshot
A Novel Evolutionary Algorithm Based on an Orthogonal Design for Dynamic Optimization Problems (ODEA)
inferred← citeshttps://doi.org/10.1109/cec.2005.1554916openalex-snapshot
Enhanced Particle Swarm Optimization Through External Memory Support
inferred← citeshttps://doi.org/10.1109/cec.2005.1555015openalex-snapshot
Memory-Enhanced Univariate Marginal Distribution Algorithms for Dynamic Optimization Problems
inferred← citeshttps://doi.org/10.1109/cec.2006.1688463openalex-snapshot
Orthogonal Dynamic Hill-Climbing Algorithm for Dynamic Optimization Problems
inferred← citeshttps://doi.org/10.1109/cec.2006.1688467openalex-snapshot
On the Design of Diploid Genetic Algorithms for Problem Optimization in Dynamic Environments
inferred← citeshttps://doi.org/10.1109/cec.2007.4424477openalex-snapshot
Continuous dynamic problem generators for evolutionary algorithms
inferred← citeshttps://doi.org/10.1109/cec.2007.4424684openalex-snapshot
Dynamic evolutionary algorithm with variable relocation vectors
inferred← citeshttps://doi.org/10.1109/cec.2007.4424729openalex-snapshot
A shared-memory ACO+GA hybrid for combinatorial optimization
inferred← citeshttps://doi.org/10.1109/cec.2007.4424928openalex-snapshot
A dual population genetic algorithm with evolving diversity
inferred← citeshttps://doi.org/10.1109/cec.2008.4631229openalex-snapshot
Hyper-Selection in Dynamic Environments
inferred← citeshttps://doi.org/10.1109/cec.2009.4983011openalex-snapshot
Hyper-learning for population-based incremental learning in dynamic environments
inferred← citeshttps://doi.org/10.1109/cec.2009.4983181openalex-snapshot
A memory-based colonization scheme for particle swarm optimization
inferred← citeshttps://doi.org/10.1109/cec.2014.6900232openalex-snapshot
A benchmark generator for dynamic capacitated arc routing problems
inferred← citeshttps://doi.org/10.1109/cec.2017.7969476openalex-snapshot
Elitism and aggregation methods in partial redundant evolutionary swarms solving a multi-objective tasks
inferred← citeshttps://doi.org/10.1109/gcis.2010.268openalex-snapshot
Adaptive Adjustment of Weight Parameters for Diploid Genetic Algorithm with a Network Structure
inferred← citeshttps://doi.org/10.1109/icamechs.2013.6681709openalex-snapshot
Multiobjective optimization for planning of mineral processing under varied equipment capability
inferred← citeshttps://doi.org/10.1109/iccse.2011.6028589openalex-snapshot
Multi-objective optimization in dynamic environment: A review
inferred← citeshttps://doi.org/10.1109/iceie.2010.5559679openalex-snapshot
Diploid genetic algorithm to solve optimal scheduling problem for hydropower in liberalised electricity market
inferred← citeshttps://doi.org/10.1109/icicip67436.2026.11417585openalex-snapshot
Bridge Connecting Multitask and Dynamic: A New Approach for Multitask Optimization via Dynamic Optimization
inferred← citeshttps://doi.org/10.1109/icnc.2008.110openalex-snapshot
Learning in Abstract Memory Schemes for Dynamic Optimization
inferred← citeshttps://doi.org/10.1109/icsmc.2007.4413963openalex-snapshot
A new genetic algorithm with diploid chromosomes by using probability decoding for non-stationary function optimization
inferred← citeshttps://doi.org/10.1109/iecon.2000.972466openalex-snapshot
Genetic algorithms for adaptation to dynamic environments - a survey
inferred← citeshttps://doi.org/10.1109/iraniancis.2014.6802582openalex-snapshot
A new real-valued diploid genetic algorithm for optimization in dynamic environments
inferred← citeshttps://doi.org/10.1109/iwaci.2010.5585215openalex-snapshot
A novel updating strategy for associative memory scheme in cyclic dynamic environments
inferred← citeshttps://doi.org/10.1109/micai-2016.2016.00022openalex-snapshot
A Modified-ABC: An Explicit-Memory Based Approach with a New Memory Updating and Retrieval in Dynamic Environments
inferred← citeshttps://doi.org/10.1109/tcyb.2020.3017017openalex-snapshot
Solving Dynamic Multiobjective Problem via Autoencoding Evolutionary Search
inferred← citeshttps://doi.org/10.1109/tevc.2005.846356openalex-snapshot
Evolutionary Optimization in Uncertain Environments—A Survey
inferred← citeshttps://doi.org/10.1109/tevc.2007.913070openalex-snapshot
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
inferred← citeshttps://doi.org/10.1109/tevc.2008.2009031openalex-snapshot
Dynamic Evolutionary Algorithm With Variable Relocation
inferred← citeshttps://doi.org/10.1109/tevc.2010.2043362openalex-snapshot
A Dual-Population Genetic Algorithm for Adaptive Diversity Control
inferred← citeshttps://doi.org/10.1109/tevc.2014.2377125openalex-snapshot
Robust Optimization Over Time: Problem Difficulties and Benchmark Problems
inferred← citeshttps://doi.org/10.1109/tevc.2019.2925358openalex-snapshot
A Multimodel Prediction Method for Dynamic Multiobjective Evolutionary Optimization
inferred← citeshttps://doi.org/10.1109/tnnls.2019.2920887openalex-snapshot
Neural Network-Based Information Transfer for Dynamic Optimization
inferred← citeshttps://doi.org/10.1109/tsmcb.2009.2015281openalex-snapshot
Adaptive Primal–Dual Genetic Algorithms in Dynamic Environments
inferred← citeshttps://doi.org/10.1109/tsmcb.2012.2217491openalex-snapshot
A Cluster-Based Differential Evolution Algorithm With External Archive for Optimization in Dynamic Environments
inferred← citeshttps://doi.org/10.1109/tsmcc.2009.2023676openalex-snapshot
Genetic Algorithms With Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1142/s1469026810002756openalex-snapshot
THE SHAKY LADDER HYPERPLANE-DEFINED FUNCTIONS AND CLASSIC DYNAMIC PROBLEMS
inferred← citeshttps://doi.org/10.1145/1068009.1068128openalex-snapshot
Population-based incremental learning with memory scheme for changing environments
inferred← citeshttps://doi.org/10.1145/1068009.1068196openalex-snapshot
Memory-based immigrants for genetic algorithms in dynamic environments
inferred← citeshttps://doi.org/10.1145/1068009.1068300openalex-snapshot
Multi-chromosomal genetic programming
inferred← citeshttps://doi.org/10.1145/1102256.1102261openalex-snapshot
Evolutionary algorithms for dynamic optimization problems
inferred← citeshttps://doi.org/10.1145/1102256.1102262openalex-snapshot
Generalized benchmark generation for dynamic combinatorial problems
inferred← citeshttps://doi.org/10.1145/1143997.1144232openalex-snapshot
Dominance learning in diploid genetic algorithms for dynamic optimization problems
inferred← citeshttps://doi.org/10.1145/2464576.2480805openalex-snapshot
Evolutionary computation for dynamic optimization problems
inferred← citeshttps://doi.org/10.1145/3205651.3208226openalex-snapshot
Diploidy for evolving neural networks
inferred← citeshttps://doi.org/10.1155/2014/389742openalex-snapshot
Dynamic Multiobjective Optimization Algorithm Based on Average Distance Linear Prediction Model
inferred← citeshttps://doi.org/10.1155/2014/420101openalex-snapshot
Multiobjective Resource-Constrained Project Scheduling with a Time-Varying Number of Tasks
inferred← citeshttps://doi.org/10.1155/2014/437625openalex-snapshot
Elitist Genetic Algorithm Based Energy Balanced Routing Strategy to Prolong Lifetime of Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1155/2018/9267054openalex-snapshot
Enhancing Cooperative Coevolution with Selective Multiple Populations for Large‐Scale Global Optimization
inferred← citeshttps://doi.org/10.1162/evco.2008.16.3.385openalex-snapshot
Genetic Algorithms with Memory- and Elitism-Based Immigrants in Dynamic Environments
inferred← citeshttps://doi.org/10.1541/ieejeiss.128.381openalex-snapshot
A New Genetic Algorithm with Diploid Chromosomes by Using Probability Decoding for Adaptation to Various Environments
inferred← citeshttps://doi.org/10.18576/msl/070110openalex-snapshot
The Improvement of Routing Operation Based on Learning Automata Using Local and National Smart Factors with the Help of the Ant Colony Algorithm
inferred← citeshttps://doi.org/10.20965/jaciii.2012.p0851openalex-snapshot
An Explicit Memory Scheme of Genetic Network Programming
inferred← citeshttps://doi.org/10.3934/qfe.2024007openalex-snapshot
Managing extreme cryptocurrency volatility in algorithmic trading: EGARCH via genetic algorithms and neural networks
inferred← citeshttps://doi.org/10.48550/arxiv.0904.3063openalex-snapshot
Using Dissortative Mating Genetic Algorithms to Track the Extrema of Dynamic Deceptive Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1610.02732openalex-snapshot
Investigating the effects Diversity Mechanisms have on Evolutionary Algorithms in Dynamic Environments
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0512003openalex-snapshot
Societal Implicit Memory and his Speed on Tracking Extrema over Dynamic Environments using Self-Regulatory Swarms
inferred← citeshttps://doi.org/10.5121/ijassn.2012.2202openalex-snapshot
Elitist Genetic Algorithm Based Energy Efficient Routing Scheme For Wireless Sensor Networks
inferred← citeshttps://doi.org/10.5772/6129openalex-snapshot
Adapting Genetic Algorithms for Combinatorial Optimization Problems in Dynamic Environments
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.