WEKO3
アイテム
An Efficient Local Search for Partial Latin Square Extension Problem
http://hdl.handle.net/10252/00005670
http://hdl.handle.net/10252/00005670218d89d7-e2e4-495b-a105-a0c660e08387
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
LNCS-2015-8496.pdf (198.2 kB)
|
|
| Item type | 学術雑誌論文 / Journal Article_default(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2017-06-19 | |||||
| タイトル | ||||||
| タイトル | An Efficient Local Search for Partial Latin Square Extension Problem | |||||
| 言語 | en | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| キーワード | ||||||
| 言語 | en | |||||
| 主題Scheme | Other | |||||
| 主題 | partial Latin square extension problem | |||||
| キーワード | ||||||
| 言語 | en | |||||
| 主題Scheme | Other | |||||
| 主題 | maximum independent set problem | |||||
| キーワード | ||||||
| 言語 | en | |||||
| 主題Scheme | Other | |||||
| 主題 | metaheuristics | |||||
| キーワード | ||||||
| 言語 | en | |||||
| 主題Scheme | Other | |||||
| 主題 | local search | |||||
| 資源タイプ | ||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
| 資源タイプ | journal article | |||||
| 著者 |
Haraguchi, Kazuya
× Haraguchi, Kazuya |
|||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | A partial Latin square (PLS) is a partial assignment of nsymbols to an n×n grid such that, in each row and in each column, eachsymbol appears at most once. The partial Latin square extension problemis an NP-hard problem that asks for a largest extension of a givenPLS. In this paper we propose an efficient local search for this problem.We focus on the local search such that the neighborhood is defined by(p, q)-swap, i.e., removing exactly p symbols and then assigning symbolsto at most qempty cells. For p ∈ {1, 2, 3}, our neighborhood search algorithmfinds an improved solution or concludes that no such solutionexists in O(np+1) time. We also propose a novel swap operation,Trellisswap,which is a generalization of (1, q)-swap and (2, q)-swap. Our Trellisneighborhoodsearch algorithm takes O(n3.5) time to do the same thing.Using these neighborhood search algorithms, we design a prototype iteratedlocal search algorithm and show its effectiveness in comparisonwith state-of-the-artoptimization solvers such as IBM ILOG CPLEX and LocalSolver. | |||||
| 書誌情報 |
en : Lecture Notes in Computer Science 巻 9075, p. 182-198, 発行日 2015-04-16 |
|||||
| 出版者 | ||||||
| 出版者 | Springer International Publishing | |||||
| ISSN | ||||||
| 収録物識別子タイプ | ISSN | |||||
| 収録物識別子 | 0302-9743 | |||||
| DOI | ||||||
| 関連タイプ | isVersionOf | |||||
| 識別子タイプ | DOI | |||||
| 関連識別子 | 10.1007/978-3-319-18008-3_13 | |||||
| 権利 | ||||||
| 権利情報 | The original publication is available at www.springerlink.com | |||||
| 関連サイト | ||||||
| 識別子タイプ | URI | |||||
| 関連識別子 | https://link.springer.com/chapter/10.1007/978-3-319-18008-3_13 | |||||
| 著者版フラグ | ||||||
| 出版タイプ | AM | |||||
| 出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||
| 日本十進分類法 | ||||||
| 主題Scheme | NDC | |||||
| 主題 | 007 | |||||
