Search Results 1-20 of 1277

  • Software Framework Design for Fast Enumeration of Optimal Solutions to Combinatorial Optimization Problems  [in Japanese]

    小池 英勝

    解法が確立していない問題を解くためのソフトウェア開発では,プログラムの仕様の変更が頻繁に起こることがある.本論文は,頻繁な仕様変更に対応しながら正しくて効率的なプログラムを開発するためのフレームワークを提案する.本研究の特徴は,プログラムの部品を書き換えルールで表現し,仕様から正しい書き換えルールを生成・集積してプログラムを構成することである.このことによってプログラムの効率と正しさの両立が可能に …

    札幌学院大学総合研究所紀要 = Proceedings of the Research institute of Sapporo Gakuin University (8), 67-78, 2021-03-20

    IR 

  • An Implementation of Branch Chaining for RX Microcontrollers  [in Japanese]

    千葉 雄司 , 永井 佑樹 , 中川 満

    コードサイズを削減する最適化の1つに,branch chainingがある.branch chainingは,分岐命令のサイズが分岐先までの距離の増加に応じて増えるアーキテクチャ向けの最適化であり,遠方への分岐命令の近傍に,同一箇所への分岐命令があるとき,一方の分岐先を他方の分岐命令にすることで,分岐の実現を,他方の分岐命令経由とすることと引き換えに,分岐先を近傍とし,命令のサイズを小さくする.L …

    情報処理学会論文誌プログラミング(PRO) 14(1), 1-14, 2021-01-27

    IPSJ 

  • Service Restoration Problem Based on Robust Optimization Framework  [in Japanese]

    森下 和樹 , 高野 浩貴 , 村田 純一 , 浅野 浩志

    電気学会研究会資料. PSE = The papers of Technical Meeting on "Power Systems Engineering", IEE Japan 2021(1-9・11・13-19), 75-80, 2021-01-19

  • Evaluation of Quantum Annealing for Vehicle Routing Problem  [in Japanese]

    齋藤 和広 , 大山 重樹 , 梅木 智光 , 黒川 茂莉 , 小野 智弘

    … 配送計画問題(VRP: Vehicle Routing Problem)は,複数配送車の配送順序を最適化する問題で,物流における配達順序やデマンド交通サービスにおける配車計画など,様々な現実問題に応用可能な問題である.VRPは代表的な組合せ最適問題の1つとしてNP-Hardと呼ばれる問題であり,従来のコンピュータでは多項式時間で厳密解を求めることが困難であることが知られている.量子アニーリングは,このような組合せ最適化問題を …

    情報処理学会論文誌データベース(TOD) 14(1), 8-17, 2021-01-15

    IPSJ 

  • Mapping Induced Subgraph Isomorphism Problems to Ising Models and Its Evaluations by an Ising Machine

    YOSHIMURA Natsuhito , TAWADA Masashi , TANAKA Shu , ARAI Junya , YAGI Satoshi , UCHIYAMA Hiroyuki , TOGAWA Nozomu

    … <p>Ising machines have attracted attention as they are expected to solve combinatorial optimization problems at high speed with Ising models corresponding to those problems. … An induced subgraph isomorphism problem is one of the decision problems, which determines whether a specific graph structure is included in a whole graph or not. …

    IEICE Transactions on Information and Systems E104.D(4), 481-489, 2021

    J-STAGE 

  • Optimization by Neural Networks in the Coherent Ising Machine and its Application to Wireless Communication Systems

    HASEGAWA Mikio , ITO Hirotake , TAKESUE Hiroki , AIHARA Kazuyuki

    … <p>Recently, new optimization machines based on non-silicon physical systems, such as quantum annealing machines, have been developed, and their commercialization has been started. … Such a property of minimization of the Ising Hamiltonian can be applied to various combinatorial optimization problems. … We explain how a target problem can be implemented on the CIM, based on the optimization scheme using the mutually connected neural networks. …

    IEICE Transactions on Communications E104.B(3), 210-216, 2021

    J-STAGE 

  • Solving Constrained Slot Placement Problems Using an Ising Machine and Its Evaluations

    KANAMARU Sho , KAWAMURA Kazushi , TANAKA Shu , TOMITA Yoshinori , TOGAWA Nozomu

    … <p>Ising machines have attracted attention, which is expected to obtain better solutions of various combinatorial optimization problems at high speed by mapping the problems to natural phenomena. …

    IEICE Transactions on Information and Systems E104.D(2), 226-236, 2021

    J-STAGE 

  • APPROXIMATION ALGORITHMS FOR A GENERALIZATION OF THE MAXIMUM BUDGET ALLOCATION

    Fukunaga Takuro

    … <p>The maximum budget allocation (MBA) problem is the problem of allocating items to agents so as to maximize the total payment from all agents, where the payment from an agent is the sum of prices of the items allocated to that agent, capped by the agent's budget. … In this study, we consider a generalization of the MBA problem in which each item has a capacity constraint, and present two approximation algorithms for it. …

    Journal of the Operations Research Society of Japan 64(1), 31-44, 2021

    J-STAGE 

  • Solving Malware-Infected Network Disconnection Optimization Problems Using Annealing Computation  [in Japanese]

    山口 純平 , 清水 俊也 , 古川 和快 , 鳥居 悟 , 森川 郁也 , 伊豆 哲也

    コンピュータセキュリティシンポジウム2020論文集, 559-566, 2020-10-19

    IPSJ 

  • A Consideration on Travelling Salesman Problem : Constitution of Constraint Solutions  [in Japanese]

    一色 浩

    日本船舶海洋工学会講演会論文集 Conference proceedings, the Japan Society of Naval Architects and Ocean Engineers (30), 161-164, 2020-05

  • A Control Method for Searching for A Feasible and An Infeasible Solution Space of A multiple-Vehicle Bike Sharing System Routing Problem  [in Japanese]

    對馬 帆南 , 木村 貴幸 , 松浦 隆文

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 119(381), 13-18, 2020-01-23

  • Shape construction problem by combining polygons based on adjacency information and its heuristic algorithm:Application to animal shape construction using administrative boundary data  [in Japanese]

    Ogai Koki , Tanaka Ken-ichi

    <p>隣接関係をもつ多角形の集合を所与とし,それに含まれる複数の隣接した多角形を組み合わせて入力形状(ターゲット)に類似した形状を構成する問題を考える.「隣接関係をもつ多角形の集合」の身近な例として,日本における都道府県が挙げられる.一つの都道府県を身近な対象に見立てたマスコットや,動物や乗り物などと関連付けて覚えるための教材などは数多く存在する.一方本稿のように,複数の都道府県を組み …

    Journal of the City Planning Institute of Japan 55(2), 182-190, 2020

    J-STAGE 

  • Amoeba-inspired combinatorial optimization machines:Computing systems exploiting concurrency and fluctuations  [in Japanese]

    AONO Masashi , OHKODA Kaori

    <p>本稿では,単細胞アメーバ生物・粘菌が環境に適応し最適な形状に変形する振る舞いに学び,「巡回セールスマン問題」や「充足可能性問題」といった組合せ最適化問題の解を,アナログ/ディジタル電子回路を用いて探索するユニークな計算システムを紹介する.「アメーバ型アルゴリズム」を実装するこれらの組合せ最適化マシンは,回路を流れる電流ダイナミクスの並行性や,デバイスの揺らぎからもたらされる確率的 …

    Oyo Buturi 89(10), 580-584, 2020

    J-STAGE 

  • A method to suppress local minima for symmetrical DOPO networks

    Amoh Seiya , Ito Daisuke , Ueta Tetsushi

    … <p>Coherent Ising machine (CIM) implemented by degenerate optical parametric oscillator (DOPO) networks can solve some combinatorial optimization problems. … In addition, a uniform pump rate for DOPOs in the conventional operation cannot overcome this problem. …

    Nonlinear Theory and Its Applications, IEICE 11(4), 580-589, 2020

    IR  J-STAGE 

  • Monte Carlo Tree Search Method for Solving the Knapsack Problem  [in Japanese]

    Iima Hitoshi , Hyono Takumi

    … It can be used for searching for the optimum of combinatorial optimization problems, and it is promising for finding the optimum or a near-optimum. … This paper proposes a Monte Carlo tree search method for the knapsack problem which is one of the typical combinatorial optimization problems. …

    IEEJ Transactions on Electronics, Information and Systems 140(10), 1141-1146, 2020

    J-STAGE 

  • Optimization of Deterministic Pilot Pattern Placement Based on Quantum Genetic Algorithm for Sparse Channel Estimation in OFDM Systems

    NIE Yang , YU Xinle

    … <p>This paper proposes a deterministic pilot pattern placement optimization scheme based on the quantum genetic algorithm (QGA) which aims to improve the performance of sparse channel estimation in orthogonal frequency division multiplexing (OFDM) systems. … By minimizing the mutual incoherence property (MIP) of the sensing matrix, the pilot pattern placement optimization is modeled as the solution of a combinatorial optimization problem. …

    IEICE Transactions on Communications E103.B(10), 1164-1171, 2020

    J-STAGE 

  • An improved performance of greedy heuristic solutions for a bi-criteria mixture packaging problem of two types of items with bounded weights

    KARUNO Yoshiyuki , NAKAHAMA Oki

    … <p>In this paper, we treat a lexicographic bi-criteria combinatorial optimization model of mixture packaging of two types of items, which arises in actual food packing systems, so-called multi-head weighers. …

    Journal of Advanced Mechanical Design, Systems, and Manufacturing 14(5), JAMDSM0066-JAMDSM0066, 2020

    J-STAGE 

  • Care Worker Scheduling in Long-term Care Facilities Using Repair Operators  [in Japanese]

    KASHIWAGI Kazuto , HAYASHI Yusaku , SAKAE Hayato , ONO Satoshi

    <p>介護業界では人材不足の問題が深刻化しており,介護職員の離職率の低減化は重要な課題である.特に,介護職員の離職理由として人間関係によるストレスが多く占めており,人間関係を考慮した勤務シフトを作成することは重要となっている.しかしながら,介護勤務スケジューリングは,ナース・スケジューリンング等と比較して,職員の資格の種類や雇用形態が多様であるために制約条件が多岐にわたり,これらの制約 …

    Proceedings of the Annual Conference of JSAI JSAI2020(0), 4Rin129-4Rin129, 2020

    J-STAGE 

  • Reinforcement learning for solving time-dependent traveling salesman problem  [in Japanese]

    NAKANISHI Kensuke , MIYAMURA Yuichi , HIROSE Shunsuke , KOZU Tomotake

    … 本稿の目的は、強化学習手法の実社会問題における応用可能性を深耕することであり、時間依存巡回セールスマン問題(Time-Dependent Traveling Salesman Problem: TDTSP)を題材として扱う。 …

    Proceedings of the Annual Conference of JSAI JSAI2020(0), 2H4GS1305-2H4GS1305, 2020

    J-STAGE 

  • IMPROVING APPROXIMATION RATIOS FOR THE CLUSTERED TRAVELING SALESMAN PROBLEM

    Kawasaki Masamune , Takazawa Kenjiro

    … <p>The clustered traveling salesman problem (CTSP) is a generalization of the traveling salesman problem (TSP) in which the set of cities is divided into clusters and the salesman must consecutively visit the cities of each cluster. … (2000) designed approximation algorithms for several variants of CTSP by decomposing it into subproblems including the traveling salesman path problem (TSPP). …

    Journal of the Operations Research Society of Japan 63(2), 60-70, 2020

    J-STAGE 

Page Top