Search Results 1-20 of 49

  • 1 / 3
  • Efficient Method for Solving Integrated Planning Problem of Sequence and Part Delivery in Mixed-Model Production Systems  [in Japanese]

    MORINAGA Eiji , NAKAMURA Takumi , WAKAMATSU Hidefumi

    … For this reason, integration of sequencing and part delivery planning has been discussed.This paper provides an efficient method for solving the integrated planning problem in which the problem is formulated as a 0-1mixed integer programming and solved using both genetic algorithm and linear programming. …

    Journal of Smart Processing 9(5), 237-244, 2020


  • Relaxed computation of non-bifurcation progressive disaster recovery problem

    Kamamura Shohei , Uematsu Yoshihiko , Genda Kouichi

    … <p>We propose relaxed computation for the non-bifurcation progressive disaster recovery problem. … Though there are studies on disaster recovery problem to maximize the amount of recovered traffic considering this assumption, they are based on the maximum flow approach, where traffic bifurcation on an arbitrary node is allowed. …

    IEICE Communications Express 5(10), 359-364, 2016


  • Mathematical programming models for road repair scheduling—On aging bridges in Japan—

    KOICHI Shungo

    … This paper proposes two mathematical programming models to deal with a scheduling problem on the renovation of several roads that need to be repaired by a certain date. … A typical example of the scheduling problem is the one for aging and deteriorating bridges in Japan. …

    Journal of Advanced Mechanical Design, Systems, and Manufacturing 10(3), JAMDSM0046-JAMDSM0046, 2016


  • Optimal Scheduling of a Thorough Physical Medical Checkup:- Systematic Construction of SSSMC -  [in Japanese]

    ITO Mari , SUZUKI Atsuo , KAWAHARA Yoshiaki

    … 人間ドックの検査間の待ち時間を短くするために,対話型のスケジューリング支援システムを試作した.本論文では,システムの設計の考え方,人間ドック・スケジューリングの0-1整数計画問題としての定式化,実際例への適用結果を報告する.さらに,受診者の検診の開始順序を決定する問題をジョブショップ・スケジューリング問題の変種として捉えることで,受診者の順序にSPT規則を適用し, …

    Journal of Japan Industrial Management Association 66(1), 49-58, 2015


  • Dynamic programming algorithms for producing food mixture packages by automatic combination weighers

    IMAHORI Shinji , KARUNO Yoshiyuki , TATEISHI Kenju

    … The lexicographic bi-criteria combinatorial optimization problem to be discussed in this paper is a mathematical model of the food mixture packing performed by so-called automatic combination weighers, and it is described as follows. … = <i>I</i><sub>1</sub> … = 1,2,...,<i>m</i>, <i>I<sub>i</sub></i> … = 1,2,...,<i>n</i>} denotes a set of <i>n</i> …

    Journal of Advanced Mechanical Design, Systems, and Manufacturing 8(5), JAMDSM0065-JAMDSM0065, 2014


  • Delivery Date Optimization as a Resource Allocation Problem and its Heuristics based on Dynamic Programming

    Shimizu Takeshi , Sakakibara Kazutoshi , Nishikawa Ikuko

    … We propose a novel optimization problem for a vehicle delivery planning and its effective heuristics based on dynamic programming (DP). … Novelty of the problem is that each delivery item has a designated delivery date with a certain relaxation window. … Then, the minimum delivery cost can be decreased compared with the rigorous delivery date problem. …

    Transactions of the Institute of Systems, Control and Information Engineers 26(10), 365-373, 2013



    Yamamoto Rei , Konno Hiroshi

    … This paper is concerned with an optimization problem associated with a rebalancing schedule of a large scale fund subject to nonconvex transaction cost. … We will formulate this problem as a 0-1 mixed integer programming problem under linear constraints using absolute deviation as the measure of risk. …

    Journal of the Operations Research Society of Japan 56(1), 26-37, 2013

    J-STAGE  References (20)

  • Design of FIR Filters with Discrete Coefficients using Ant Colony Optimization  [in Japanese]

    TSUTSUMI Shuntaro , SUYAMA Kenji

    … In this paper, we propose a new design method for linear phase FIR (Finite Impulse Response) filters with discrete coefficients. … The design problem of digital filters with discrete coefficients is formulated as the integer programming problem. … Then, an enormous amount of computational time is required to solve the problem in a strict solver. …

    IEEJ Transactions on Electronics, Information and Systems 132(7), 1066-1071, 2012-07-01

    J-STAGE  References (15)

  • The Optimal Subcarrier and Bit Allocation for Multiuser OFDM System : A Dual-Decomposition Approach

    PARK Taehyung , IM Sungbin

    … In this paper, we propose a 0-1 integer programming model formulating the optimal subcarrier and bit allocation problem of the multiuser OFDM. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 94(9), 1826-1832, 2011-09-01

    J-STAGE  References (16)

  • Floating Operation Precision Setting Instruction Selection and Insertion Using 0-1 Integer Linear Programming by a Compiler for SH4A  [in Japanese]

    坂本 諒 , 千葉 雄司 , 久保田 光一 [他] , 土居 範久

    … 手段として,0-1 整数計画法を利用する手法を提案し,その実用性を評価した結果を示す.SH4A は浮動小数点演算命令の実行時にどの精度で演算を行うか指定するための命令を 2 種類提供するが,それぞれ挿入可能な箇所と実行コストが異なる.このため SH4A 向けコンパイラでは,どこでどの命令を使って精度の指定を行うべきか判断する必要があるが,提案技法ではこの判断に 0- …

    情報処理学会論文誌プログラミング(PRO) 4(2), 48-66, 2011-03-25


  • Energy-Aware Instruction Scheduling for Fine-Grained Power-Gated VLIW Processors with Multi-Cycle Instructions  [in Japanese]

    UCHIDA Mitsuya , TANIGUCHI Ittestu , TOMIYAMA Hiroyuki , FUKUI Masahiro

    … グが有効な手段として知られている.そこで,本研究では細粒度電源管理に対応したVLIW型プロセッサ向け消費電力最小命令スケジューリング手法を提案する.提案する命令スケジューリング手法はマルチサイクル演算に対応し,0-1線形整数計画として定式化されている.評価実験より,性能優先命令スケジューリングが必ずしも消費電力最小命令スケジューリングが得られるとは限らないことが確認された. …

    IEICE technical report 110(432), 7-12, 2011-02-23

    References (5)

  • Energy Aware Instruction Scheduling for Fine Grained Power Gated VLIW Processors  [in Japanese]

    TANIGUCHI Ittetsu , UCHIDA Mitsuya , TOMIYAMA Hiroyuki , FUKUI Masahiro

    … ングにより電源管理を行うためには,一定の空き時間をスケジューリング時に挿入する必要がある.そこで,本研究では,個々のFUごとのパワーゲーテイングによる電源管理に対応したVLIW型プロセッサを対象とした,消費電力最小スケジューリング手法を提案する.提案するスケジューリング手法では,与えられた性能制約を満たす消費電力最小スケジューリング問題を0-1線形整数計画問題として定式化する. …

    IEICE technical report 110(316), 61-66, 2010-11-22

    References (4) Cited by (1)

  • Energy Aware Instruction Scheduling for Fine Grained Power Gated VLIW Processors  [in Japanese]

    TANIGUCHI Ittetsu , UCHIDA Mitsuya , TOMIYAMA Hiroyuki , FUKUI Masahiro

    … かし,パワーゲーティングにより電源管理を行うためには,一定の空き時間をスケジューリング時に挿入する必要がある.そこで,本研究では,個々のFUごとのパワーゲーティングによる電源管理に対応したVLIW型プロセッサを対象とした,消費電力最小スケジューリング手法を提案する.提案するスケジューリング手法では,与えられた性能制約を満たす消費電力最小スケジューリング問題をO-1線形整数計画問題として定式化する. …

    IEICE technical report 110(317), 61-66, 2010-11-22

    References (4)

  • Optimal Design of CSD Coefficient FIR Filters Subject to Number of Nonzero Digits  [in Japanese]

    OZAKI Yuichi , SUYAMA Kenji

    … In general, a design problem of FIR filters with CSD(Canonic Signed Digit) representation, which is efficient one for the reduction of numbers of multiplier units, is often considered as one of the 0-1 combinational problems. … In such the problem, some difficult constraints make us prevent to linearize the problem. …

    IEEJ Transactions on Electronics, Information and Systems 129(1), 59-64, 2009-01-01

    J-STAGE  References (10) Cited by (9)

  • Routing problem under the shared storage policy for unit-load automated storage and retrieval systems with separate input and output points

    Tanaka Shunji , Araki Mituhiko

    … In this study the routing problem for unit-load automated storage and retrieval systems (AS/RSs) with separate input and output points is considered under the shared storage policy. … The problem is to find an optimal travel route of a S/R (storage and retrieval) machine to process given storage and retrieval requests so that the total travel time is minimised, where the input and output points are possibly separate and the shared storage policy is assumed. …

    International Journal of Production Research 47(9), 2391-2408, 2009-01



    WATADA Ryo , OHSAKI Makoto

    … A linear Mixed Integer Programming (MIP) approach is presented for topology optimization of trusses with discrete variables under stress constraints. … It is shown in the numerical examples that an optimal combination of the traditional layouts of trusses can be successfully found by solving a linear 0-1 MIP problem. …

    Journal of Structural and Construction Engineering (Transactions of AIJ) 74(639), 841-847, 2009


  • Optimal Common Sub-Expression Elimination Algorithm of Multiple Constant Multiplications with a Logic Depth Constraint

    HO Yuen-Hong Alvin , LEI Chi-Un , KWAN Hing-Kit , WONG Ngai

    … In the context of multiple constant multiplication (MCM) design, we propose a novel common sub-expression elimination (CSE) algorithm that models the optimal synthesis of coefficients into a 0-1 mixed-integer linear programming (MILP) problem with a user-defined generic logic depth constraint. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 91(12), 3568-3575, 2008-12-01

    J-STAGE  References (16)

  • Design Method FIR Filters Discrete Coefficients for Reduction of Nonzero Digits  [in Japanese]

    OZAKI Yuichi , SUYAMA Kenji

    FIRフィルタの回路規模はフィルタ係数の非零桁数に比例する.そのため,少ない非零桁数での実現が望まれている.従来,組み合わせ最適化による設計法や,CSD表現を利用する方法などが提案されてきた.これらの手法の多くは,個々のフィルタ係数の非零桁数に制限を加えている.しかしながら,フィルタ計数値の分布は大きな幅があり,必ずしも全ての係数に同数の桁数を割り当てることが有利とは言い難い.そこで本研究では,設 …

    IEICE technical report 107(475), 25-30, 2008-01-31

    References (9) Cited by (3)

  • Lens System Adjustment in Semiconductor Lithography Equipment : Optimization for Lens Groups Rotation  [in Japanese]

    SHINANO Yuji , FUKAGAWA Youzou , TAKANO Yoshimi , YOSHIHARA Toshiyuki

    … In this paper, we address the problem of lens abberation adjustment for lenses of semiconductor lithography equipment. … Nowadays, owing to significant progress in mathematical programming research, IP solvers can reach an optimal solution quite fast. …

    Transactions of the Japan Society of Mechanical Engineers C 73(735), 2982-2987, 2007-11-25

    References (6) Cited by (1)

  • On the Maximum Number of Strings in Go  [in Japanese]


    … This paper concerns the maximum string problem described as follows: to find a position that maximizes the number of live strings on the n × n Go board. … Previous researches proposed a 0-1 integer programming formulation of the maximum string problem, and solved the instances up to n = 16. …

    IPSJ journal 48(11), 3463-3469, 2007-11-15

    IPSJ  References (6) Cited by (1)

  • 1 / 3
Page Top