Papers by Tristan Cazenave
Lecture Notes in Computer Science, 2012
breakthrough is a recent race-based board game usually played on a 8× 8 board. We describe a meth... more breakthrough is a recent race-based board game usually played on a 8× 8 board. We describe a method to solve 6× 5 boards based on (1) race patterns and (2) an extension of (JLPNS). Using race patterns is a new domain-specific technique that allows early endgame detection. The patterns we use enable us to prune positions safely and statically as far as 7 moves from the end. For the purpose of solving Breakthrough we also present an extension of the parallel algorithm (JLPNS), viz. when a PN search is used as the underlying job. In ...
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2011
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2011
Bookmarks Related papers MentionsView impact
Revue d'intelligence artificielle, 2009
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2012
Bookmarks Related papers MentionsView impact
2013 IEEE Symposium on Computational Intelligence in Scheduling (CISched), 2013
ABSTRACT The well-known traveling salesman problem (TSP) is concerned with determining the shorte... more ABSTRACT The well-known traveling salesman problem (TSP) is concerned with determining the shortest route for a vehicle while visiting a set of cities exactly once. We consider knowledge and algorithm engineering in combinatorial optimization for improved solving of complex TSPs with Time Windows (TSPTW). To speed-up the exploration of the applied Nested Monte-Carlo Search with Policy Adaption, we perform beam search for an improved compromise of search breadth and depth as well as automated knowledge elicitation to seed the distribution for the exploration. To evaluate our approach, we use established TSPTW benchmarks with promising results. Furthermore, we indicate improvements for real-world logistics by its use in a multiagent system. Thereby, each agent computes individual TSPTW solutions and starts negotiation processes on this basis.
Bookmarks Related papers MentionsView impact
Communications in Computer and Information Science, 2014
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Encyclopedia of the Sciences of Learning, 2012
Bookmarks Related papers MentionsView impact
Encyclopedia of the Sciences of Learning, 2012
Bookmarks Related papers MentionsView impact
Encyclopedia of the Sciences of Learning, 2012
Bookmarks Related papers MentionsView impact
Encyclopedia of the Sciences of Learning, 2012
Bookmarks Related papers MentionsView impact
Encyclopedia of the Sciences of Learning, 2012
Bookmarks Related papers MentionsView impact
Uploads
Papers by Tristan Cazenave