Exploration of a two sided rendezvous search problem using genetic algorithms

DOI10.1007/3-540-45110-2_144MaRDI QIDQ4451867zbMATH OpenFDO

Authors T. Q. S. Truong, Andrew James Stacey

Publication date 11 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2724/27242422.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99) Search theory (90B40)

Recommendations

• Using multiple searchers in constrained-path, moving-target search problems
• Rendezvous Search: A Personal Perspective
• Search-and-rescue rendezvous
• The Rendezvous Search Problem
• A genetic approach to the quadratic assignment problem

This page was built for publication: Exploration of a two sided rendezvous search problem using genetic algorithms

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