Pages that link to "Item:Q5899566"

The following pages link to Introduction to evolutionary computing (Q5899566):

Displaying 36 items.

• Genetic algorithm modification for production scheduling (Q902742) (← links)
• A new algorithm to solve the generalized Nash equilibrium problem (Q2004210) (← links)
• Putting continuous metaheuristics to work in binary search spaces (Q2012877) (← links)
• A genetic algorithm for the maximum 2-packing set problem (Q2019714) (← links)
• A multi-objective approach for solving a replacement policy problem for equipment subject to imperfect repairs (Q2049737) (← links)
• Boltzmann distributed replicator dynamics: population games in a microgrid context (Q2052487) (← links)
• A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets (Q2057127) (← links)
• The trap of Sisyphean work in differential evolution and how to avoid it (Q2086554) (← links)
• Circle-based group recommendation in social networks (Q2100472) (← links)
• A model-based evolutionary algorithm for home health care scheduling (Q2108183) (← links)
• Evolutionary operators for the Hamiltonian completion problem (Q2156924) (← links)
• A new fitness function for evolutionary music composition (Q2165158) (← links)
• Profit driven decision trees for churn prediction (Q2178124) (← links)
• Memetic algorithms outperform evolutionary algorithms in multimodal optimisation (Q2211864) (← links)
• An evolutionary algorithm for automated machine learning focusing on classifier ensembles: an improved algorithm and extended results (Q2285646) (← links)
• A self-adaptive evolutionary algorithm for the berth scheduling problem: towards efficient parameter control (Q2287487) (← links)
• Open-minded imitation can achieve near-optimal vaccination coverage (Q2330622) (← links)
• Towards a runtime comparison of natural and artificial evolution (Q2362364) (← links)
• A comparative study of solution representations for the unrelated machines environment (Q2664345) (← links)
• Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints (Q2672647) (← links)
• Hierarchical clustering with discrete latent variable models and the integrated classification likelihood (Q2673349) (← links)
• A decentralised multi-agent system for rail freight traffic management (Q2678613) (← links)
• Power system oscillation damping controller design: a novel approach of integrated HHO-PSO algorithm (Q5097062) (← links)
• Comments on: ``Tabu search tutorial. A graph drawing application'' (Q5970666) (← links)
• Topological biclustering ARTMAP for identifying within bicluster relationships (Q6053426) (← links)
• An adaptive polyploid memetic algorithm for scheduling trucks at a cross-docking terminal (Q6064501) (← links)
• A matheuristic algorithm for the pollution and energy minimization traveling salesman problems (Q6079856) (← links)
• Adaptive evolutionary algorithms for portfolio selection problems (Q6088765) (← links)
• The knapsack problem with forfeit sets (Q6109304) (← links)
• A neural network approach to performance analysis of tandem lines: the value of analytical knowledge (Q6109337) (← links)
• A new taxonomy of global optimization algorithms (Q6137180) (← links)
• A generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework (Q6151605) (← links)
• Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling (Q6173707) (← links)
• Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter (Q6182679) (← links)
• Runtime analysis for permutation-based evolutionary algorithms (Q6185938) (← links)
• Observer-based secure consensus tracking of positive multi-agent systems under periodic denial-of-service attacks (Q6495050) (← links)