Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Lippi, Marcoa; * | Ernandes, Marcob | Felner, Arielc
Affiliations: [a] Dipartimento di Informatica – Scienza e Ingegneria, Università degli Studi di Bologna, Viale Risorgimento 2, 40136 Bologna, Italy. E-mail: marco.lippi3@unibo.it | [b] Quest-IT s.r.l., Strada Massetana Romana, 44, 53100 Siena, Italy. E-mail: ernandes@quest-it.com | [c] Department of Information System Engineering, Ben Gurion University, Be’er-Sheva, Israel. E-mail: felner@bgu.ac.il
Correspondence: [*] Corresponding author. E-mail: marco.lippi3@unibo.it.
Abstract: In this paper we consider several variants of the problem of sorting integer permutations with a minimum number of moves, a task with many potential applications ranging from computational biology to logistics. Each problem is formulated as a heuristic search problem, where different variants induce different sets of allowed moves within the search tree. Due to the intrinsic nature of this category of problems, which in many cases present a very large branching factor, classic unidirectional heuristic search algorithms such as A∗ and IDA∗ quickly become inefficient or even infeasible as the problem dimension grows. Therefore, more sophisticated algorithms are needed. To this aim, we propose to combine two recent paradigms which have been employed in difficult heuristic search problems showing good performance: enhanced partial expansion (EPE) and efficient single-frontier bidirectional search (eSBS). We propose a new class of algorithms combining the benefits of EPE and eSBS, named efficient Single-frontier Bidirectional Search with Enhanced Partial Expansion (eSBS-EPE). We then present an experimental evaluation that shows that eSBS-EPE is a very effective approach for this family of problems, often outperforming previous methods on large-size instances. With the new eSBS-EPE class of methods we were able to push the limit and solve the largest size instances of some of the problem domains (the pancake and the burnt pancake puzzles). This novel search paradigm hence provides a very promising framework also for other domains.
Keywords: Heuristic search, bidirectional search, permutation sorting
DOI: 10.3233/AIC-160704
Journal: AI Communications, vol. 29, no. 4, pp. 513-536, 2016
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl