On the public citation graph

Parallel genetic algorithm for search and constrained multi-objective optimization

0 signed · 16 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-45105-6_95openalex-snapshot
Constrained Multi-objective Optimization Using Steady State Genetic Algorithms
inferredcites →https://doi.org/10.1007/3-540-45356-3_82openalex-snapshot
The Pareto Envelope-Based Selection Algorithm for Multiobjective Optimization
inferredcites →https://doi.org/10.1007/3-540-45356-3_83openalex-snapshot
A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II
inferredcites →https://doi.org/10.1142/1111openalex-snapshot
Genetic Algorithms and Robotics
inferredcites →https://doi.org/10.5860/choice.27-0936openalex-snapshot
Genetic algorithms in search, optimization, and machine learning
inferredcites →https://doi.org/10.7551/mitpress/1090.001.0001openalex-snapshot
Adaptation in Natural and Artificial Systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s40430-013-0063-5openalex-snapshot
Optimal point-to-point motion planning of non-holonomic mobile robots in the presence of multiple obstacles
inferred← citeshttps://doi.org/10.1016/j.ress.2005.11.018openalex-snapshot
Multi-objective optimization using genetic algorithms: A tutorial
inferred← citeshttps://doi.org/10.11113/elektrika.v19n3.225openalex-snapshot
Path planning Methods for Mobile Robots: A systematic and Bibliometric Review
inferred← citeshttps://doi.org/10.1142/s012905410500298xopenalex-snapshot
CROSS-POLLINATING PARALLEL GENETIC ALGORITHMS FOR MULTI-OBJECTIVE SEARCH AND OPTIMIZATION
inferred← citeshttps://doi.org/10.11575/prism/5368openalex-snapshot
A Unified Hybrid Evolutionary Multi-Objective Optimization Algorithm for Decision Making
inferred← citeshttps://doi.org/10.1631/jzus.c0910525openalex-snapshot
Multi-objective robot motion planning using a particle swarm optimization model
inferred← citeshttps://doi.org/10.17148/ijarcce.2016.51204openalex-snapshot
Application of Multi Objective Genetic Algorithm with Pareto Optimal Solution Space for Design in IoT
inferred← citeshttps://doi.org/10.48550/arxiv.1310.6372openalex-snapshot
A multiobjective optimization approach to statistical mechanics
inferred← citeshttps://doi.org/10.5281/zenodo.1074971openalex-snapshot
Classic And Heuristic Approaches In Robot Motion Planning A Chronological Review
inferred← citeshttps://doi.org/10.5772/54460openalex-snapshot
Meta-Heuristic Optimization Techniques and Its Applications in Robotics
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.