A random keys based genetic algorithm for the target visitation problem

DOI10.1007/978-3-540-74356-9_24MaRDI QIDQ3564144zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Genetic algorithm for combinatorial path planning: the subtour problem
• Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms
• The target visitation problem
• An interactive algorithm for multi-objective route planning
• The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach

Cited in

(7)

• The target visitation arc routing problem
• A branch-and-cut algorithm for the target visitation problem
• Genetic algorithm for combinatorial path planning: the subtour problem
• The target visitation problem
• Lifted formulations for the target visitation 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

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: A random keys based genetic algorithm for the target visitation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564144)