{"id":"https://openalex.org/W2345807696","doi":"https://doi.org/10.3233/aic-160704","title":"Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search","display_name":"Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search","publication_year":2016,"publication_date":"2016-05-30","ids":{"openalex":"https://openalex.org/W2345807696","doi":"https://doi.org/10.3233/aic-160704","mag":"2345807696"},"language":"en","primary_location":{"id":"doi:10.3233/aic-160704","is_oa":false,"landing_page_url":"https://doi.org/10.3233/aic-160704","pdf_url":null,"source":{"id":"https://openalex.org/S176303223","display_name":"AI Communications","issn_l":"0921-7126","issn":["0921-7126","1875-8452"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"AI Communications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11380/1122706","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062424045","display_name":"Marco Lippi","orcid":"https://orcid.org/0000-0002-9663-1071"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Marco Lippi","raw_affiliation_strings":["Dipartimento di Informatica \u2013 Scienza e Ingegneria, Universit\u00e0 degli Studi di Bologna, Viale Risorgimento 2, 40136 Bologna, Italy. E-mail:\u00a0marco.lippi3@unibo.it"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica \u2013 Scienza e Ingegneria, Universit\u00e0 degli Studi di Bologna, Viale Risorgimento 2, 40136 Bologna, Italy. E-mail:\u00a0marco.lippi3@unibo.it","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079762986","display_name":"Marco Ernandes","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marco Ernandes","raw_affiliation_strings":["Quest-IT s.r.l., Strada Massetana Romana, 44, 53100 Siena, Italy. E-mail:\u00a0ernandes@quest-it.com"],"affiliations":[{"raw_affiliation_string":"Quest-IT s.r.l., Strada Massetana Romana, 44, 53100 Siena, Italy. E-mail:\u00a0ernandes@quest-it.com","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011195666","display_name":"Ariel Felner","orcid":"https://orcid.org/0000-0003-0065-2757"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ariel Felner","raw_affiliation_strings":["Department of Information System Engineering, Ben Gurion University, Be\u2019er-Sheva, Israel. E-mail:\u00a0felner@bgu.ac.il"],"affiliations":[{"raw_affiliation_string":"Department of Information System Engineering, Ben Gurion University, Be\u2019er-Sheva, Israel. E-mail:\u00a0felner@bgu.ac.il","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5062424045"],"corresponding_institution_ids":["https://openalex.org/I9360294"],"apc_list":null,"apc_paid":null,"fwci":0.5821,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.77219747,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"29","issue":"4","first_page":"513","last_page":"536"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7065642476081848},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.7055627703666687},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6875400543212891},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6469728946685791},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5175777673721313},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.507625937461853},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5013833045959473},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.47182497382164},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.44972726702690125},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.43112993240356445},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4268779754638672},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.42039787769317627},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4150046408176422},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.4008006751537323},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3475133180618286},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21626263856887817},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16548782587051392},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12930262088775635}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7065642476081848},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.7055627703666687},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6875400543212891},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6469728946685791},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5175777673721313},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.507625937461853},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5013833045959473},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.47182497382164},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.44972726702690125},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.43112993240356445},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4268779754638672},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.42039787769317627},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4150046408176422},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.4008006751537323},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3475133180618286},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21626263856887817},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16548782587051392},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12930262088775635},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3233/aic-160704","is_oa":false,"landing_page_url":"https://doi.org/10.3233/aic-160704","pdf_url":null,"source":{"id":"https://openalex.org/S176303223","display_name":"AI Communications","issn_l":"0921-7126","issn":["0921-7126","1875-8452"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"AI Communications","raw_type":"journal-article"},{"id":"pmh:oai:flore.unifi.it:2158/1356471","is_oa":false,"landing_page_url":"https://hdl.handle.net/2158/1356471","pdf_url":null,"source":{"id":"https://openalex.org/S4306402033","display_name":"Florence Research (University of Florence)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45084792","host_organization_name":"University of Florence","host_organization_lineage":["https://openalex.org/I45084792"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:iris.unimore.it:11380/1122706","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/1122706","pdf_url":null,"source":{"id":"https://openalex.org/S4306400718","display_name":"IRIS UNIMORE (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:iris.unimore.it:11380/1122706","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/1122706","pdf_url":null,"source":{"id":"https://openalex.org/S4306400718","display_name":"IRIS UNIMORE (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W10620669","https://openalex.org/W22552673","https://openalex.org/W177529804","https://openalex.org/W1539048696","https://openalex.org/W1571191476","https://openalex.org/W1587705505","https://openalex.org/W1592436817","https://openalex.org/W1603934459","https://openalex.org/W1881819129","https://openalex.org/W1912134269","https://openalex.org/W1931201952","https://openalex.org/W1969483458","https://openalex.org/W1973518576","https://openalex.org/W1988577833","https://openalex.org/W1989407213","https://openalex.org/W1989711785","https://openalex.org/W1989978323","https://openalex.org/W2004163905","https://openalex.org/W2023749136","https://openalex.org/W2038291323","https://openalex.org/W2054344911","https://openalex.org/W2054600183","https://openalex.org/W2068426944","https://openalex.org/W2070449673","https://openalex.org/W2101458278","https://openalex.org/W2102323131","https://openalex.org/W2102723805","https://openalex.org/W2103333868","https://openalex.org/W2113659505","https://openalex.org/W2129810020","https://openalex.org/W2143420603","https://openalex.org/W2149628296","https://openalex.org/W2155992093","https://openalex.org/W2157622572","https://openalex.org/W2277099502","https://openalex.org/W2293119400","https://openalex.org/W2400786871","https://openalex.org/W2566652907","https://openalex.org/W2570388581","https://openalex.org/W2747118187","https://openalex.org/W2763373928","https://openalex.org/W3104567486","https://openalex.org/W3106450156","https://openalex.org/W6604197512","https://openalex.org/W6640047495"],"related_works":["https://openalex.org/W2402589461","https://openalex.org/W2358427436","https://openalex.org/W2081821176","https://openalex.org/W2885402535","https://openalex.org/W2097038466","https://openalex.org/W58921990","https://openalex.org/W2224555876","https://openalex.org/W2747118187","https://openalex.org/W1881819129","https://openalex.org/W2794473043"],"abstract_inverted_index":{"In":[0],"this":[1,61,103,174],"paper":[2],"we":[3,105,192],"consider":[4],"several":[5],"variants":[6,43],"of":[7,10,18,48,60,63,139,144,176,190,205,207],"the":[8,52,57,92,142,186,197,201,208,214],"problem":[9,33,93,209],"sorting":[11],"integer":[12],"permutations":[13],"with":[14,22,153],"a":[15,20,37,70,136,169,224],"minimum":[16],"number":[17],"moves,":[19],"task":[21],"many":[23,67],"potential":[24],"applications":[25],"ranging":[26],"from":[27],"computational":[28],"biology":[29],"to":[30,56,107,195],"logistics.":[31],"Each":[32],"is":[34,168],"formulated":[35],"as":[36,81,91],"heuristic":[38,77,118],"search":[39,53,78,119,132,220],"problem,":[40],"where":[41],"different":[42,46],"induc":[44],"e":[45],"sets":[47],"allowed":[49],"moves":[50],"within":[51],"tree.":[54],"Due":[55],"intrinsic":[58],"nature":[59],"category":[62],"problems,":[64,177],"which":[65,112],"in":[66,116],"cases":[68],"present":[69,160],"very":[71,170,225],"large":[72],"branching":[73],"factor,":[74],"classic":[75],"unidirectional":[76],"algorithms":[79,99,140],"such":[80],"A\u2217":[82],"and":[83,128,146,199,213],"IDA\u2217":[84],"quickly":[85],"become":[86],"inefficient":[87],"or":[88],"even":[89],"infeasible":[90],"dimension":[94],"grows.":[95],"Therefore,":[96],"more":[97],"sophisticated":[98],"are":[100],"needed.":[101],"To":[102],"aim,":[104],"propose":[106,135],"combine":[108],"two":[109],"recent":[110],"paradigms":[111],"have":[113],"been":[114],"employed":[115],"difficult":[117],"problems":[120],"showing":[121],"good":[122],"performance:":[123],"enhanced":[124],"partial":[125],"expansion":[126],"(EPE)":[127],"efficient":[129,149],"single-frontier":[130],"bidirectional":[131],"(eSBS).":[133],"We":[134,158],"new":[137,187],"class":[138,189],"combining":[141],"benefits":[143],"EPE":[145],"eSBS,":[147],"named":[148],"Single-frontier":[150],"Bidirectional":[151],"Search":[152],"Enhanced":[154],"Partial":[155],"Expansion":[156],"(eSBS-EPE).":[157],"then":[159],"an":[161],"experimental":[162],"evaluation":[163],"that":[164,166],"shows":[165],"eSBS-EPE":[167,188],"effective":[171],"approach":[172],"for":[173,229],"family":[175],"often":[178],"outperforming":[179],"previous":[180],"methods":[181,191],"on":[182],"large-size":[183],"instances.":[184],"With":[185],"were":[193],"able":[194],"push":[196],"limit":[198],"solve":[200],"largest":[202],"size":[203],"instances":[204],"some":[206],"domains":[210],"(the":[211],"pancake":[212,216],"burnt":[215],"puzzles).":[217],"This":[218],"novel":[219],"paradigm":[221],"hence":[222],"provides":[223],"promising":[226],"framework":[227],"also":[228],"other":[230],"domains.":[231]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}