A Random Keys Based Genetic Algorithm for the Target Visitation Problem

DOI10.1007/978-3-540-74356-9_24zbMath1190.93094OpenAlexW174469096MaRDI QIDQ3564144

Ashwin Arulselvan, Clayton W. Commander, Panos M. Pardalos

Publication date: 2 June 2010

Published in: Advances in Cooperative Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74356-9_24

zbMATH Keywords

genetic algorithmrandom keystarget visitation problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete-time control/observation systems (93C55) Automated systems (robots, etc.) in control theory (93C85) Stochastic systems in control theory (general) (93E03)

Related Items

The target visitation arc routing problem, Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs, A semidefinite optimization approach to the target visitation problem, A branch-and-cut algorithm for the target visitation problem

Uses Software

• CPLEX