Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles: DFG German National Licenses
  • Opus Repository ZIB  (7)
  • 2020-2024  (5)
  • 2015-2019
  • 2010-2014  (2)
  • 1990-1994
  • 1965-1969
  • 1920-1924
  • 2020  (5)
  • 2013  (2)
  • Japanese  (7)
Source
  • Articles: DFG German National Licenses
  • Opus Repository ZIB  (7)
Years
  • 2020-2024  (5)
  • 2015-2019
  • 2010-2014  (2)
  • 1990-1994
  • 1965-1969
    • +
Year
Language
  • 1
    facet.materialart.
    Unknown
    MIPLIB と Hans Mittelmann’s benchmarks (2020)
    Details
    Publication Date: 2023-04-17
    Description: 混合整数計画法 (Mixed Integer Programming: MIP) は，MIP を解くソフトウェアである MIP ソルバが大規模な現実問題を解けるようになったこともあり，現実問題を解く有用な OR の手法として広く知られるようになった．しかしながら，MIP ソルバの開発に欠かせないベンチマーク・データセットおよび性能測定方法についてはそれほど広く知られているとは言い難い．ベンチマーク・データセットは注意を払って作成しないと，多くのバイアスがかかってしまう．それらのバイアスを可能な限りのぞき，真に有用なベンチマーク・テストの結果を得るためには複数の人数で多大な労力を割く必要がある．本稿では，そのような MIP ソルバ開発の背景として重要な役割を果たしてきた MIPLIB と Hans Mittelmann’s benchmarks について解説する．また，本稿において Hans Mittelmann’s benchmarks は，BENCHMARKS FOR OPTIMIZATION SOFTWAREのページ (http://plato.asu.edu/bench.html) に示されているベンチマークである．
    Language: Japanese
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 2
    facet.materialart.
    Unknown
    エネルギー供給システムの設計および運用の階層的関係を考慮した最適化 (k-メドイド法に基づく期間クラスタリングの適用) (2020)
    Details
    Publication Date: 2024-04-26
    Description: To attain the highest performance of energy supply systems, it is necessary to determine design specifications optimally in consideration of operational strategies corresponding to seasonal and hourly variations in energy demands. A hierarchical mixed-integer linear programming method has been proposed to solve such an optimal design problem efficiently. In this paper, a method of reducing model by clustering periods with the k-medoids method is applied to the relaxed optimal design problem at the upper level. Through a case study, it is clarified how the proposed method is effective to enhance the computation efficiency in a large scale optimal design problem.
    Language: Japanese
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 3
    facet.materialart.
    Unknown
    エネルギー供給システムの 設計および運用の階層的関係を考慮した最適化 (多目的最適設計へのモデル縮約の適用) (2020)
    Details
    Publication Date: 2024-04-26
    Description: To attain the highest performance of energy supply systems, it is necessary to determine design specifications optimally in consideration of operational strategies corresponding to seasonal and hourly variations in energy demands. Mixed-integer linear programming (MILP) methods have been applied widely to such optimal design problems. A hierarchical MILP method has been proposed to solve the problems very efficiently. In addition, by utilizing features of the hierarchical MILP method, a method of reducing model by clustering periods based on the optimal operational strategies of equipment has been proposed to search design solution candidates efficiently in the relaxed optimal design problem at the upper level. In this paper, these methods are applied to the multiobjective optimal design of a cogeneration system by considering the annual total cost and primary energy consumption as the objective functions to be minimized. Through a case study, it turns out that the model reduction by the operation-based time-period clustering is effective in terms of the computation efficiency when importance is given to the first objective function, while it is not when importance is given to the second objective function.
    Language: Japanese
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 4
    facet.materialart.
    Unknown
    階層的最適化手法を用いた エネルギー供給システムのロバスト性評価 (2020)
    Details
    Publication Date: 2024-04-26
    Description: A robust optimal design method of energy supply systems under uncertain energy demands has been proposed using a mixed-integer linear model for constituent equipment. However, this method takes a long computation time, and thus it can be applied only to small-scale problems. In this paper, a hierarchical optimization method is applied to two types of optimization problems for evaluating robustness to solve them efficiently. In a case study, the proposed method is applied to a cogeneration system with a complex configuration, and the validity and effectiveness of the method are ascertained.
    Language: Japanese
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 5
    facet.materialart.
    Unknown
    階層的最適化手法の援用による エネルギー供給システムのロバスト最適設計 (2020)
    Details
    Publication Date: 2024-04-26
    Description: A robust optimal design method of energy supply systems under uncertain energy demands has been proposed using a mixed- integer linear model for constituent equipment. A robust optimal design problem has been formulated as a three-level min-max- min optimization one by expressing uncertain energy demands by intervals, evaluating the robustness in a performance criterion based on the minimax regret criterion, and considering hierarchical relationships among design variables, uncertain energy demands, and operation variables. Since this problem must be solved by a special algorithm and is too difficult to solve even using a commercial solver, a hierarchical optimization approach has been applied to solve the problem but its application is limited only to small scale toy problems. In this paper, some strategies are introduced into the hierarchical optimization approach to enhance the computation efficiency for the purpose of applying the approach to large scale practical problems. In a case study, the proposed approach is applied to the robust optimal design of a cogeneration system with a complex configuration, and the validity and effectiveness of the method are ascertained.
    Language: Japanese
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 6
    facet.materialart.
    Unknown
    制約整数計画ソルバ SCIP の並列化 (2013)
    Details
    Publication Date: 2023-04-17
    Description: 制約整数計画(CIP: Constraint Integer Programming)は，制約プログラミング(CP: Constraint Programming)，混合整数計画(MIP: Mixed Integer Programming), 充足可能性問題(SAT: Satisfiability Problems)の研究分野におけるモデリング技術と解法を統合している．その結果，制約整数計画は，広いクラスの最適化問題を扱うことができる．SCIP (Solving Constraint Integer Programs)は，CIPを解くソルバとして実装され,Zuse Institute Berlin (ZIB)の研究者を中心として継続的に拡張が続けられている．本論文では，著者らによって開発されたSCIP に対する2種類の並列化拡張を紹介する． 一つは，複数計算ノード間で大規模に並列動作するParaSCIP である． もう一つは，複数コアと共有メモリを持つ１台の計算機上で(スレッド)並列で動作するFiberSCIP である． ParaSCIP は，HLRN IIスーパーコンピュータ上で， 一つのインスタンスを解くために最大7,168 コアを利用した動作実績がある．また，統計数理研究所のFujitsu PRIMERGY RX200S5上でも，最大512コアを利用した動作実績がある．統計数理研究所のFujitsu PRIMERGY RX200S5上 では，これまでに最適解が得られていなかったMIPLIB2010のインスタンスであるdg012142に最適解を与えた．
    Description: The paradigm of Constraint Integer Programming (CIP) combines modeling and solving techniques from the fields of Constraint Programming (CP), Mixed Integer Programming (MIP) and Satisfiability Problems (SAT). The paradigm allows us to address a wide range of optimization problems. SCIP is an implementation of the idea of CIP and is now continuously extended by a group of researchers centered at Zuse Institute Berlin (ZIB). This paper introduces two parallel extensions of SCIP. One is ParaSCIP, which is intended to run on a large scale distributed memory computing environment, and the other is FiberSCIP, intended to run on shared memory computing environments. ParaSCIP has successfully been run on the HLRN II supercomputer utilizing up to 7,168 cores to solve a single difficult MIP. It has also been tested on an ISM supercomputer (Fujitsu PRIMERGY RX200S5 using up to 512 cores). The previously unsolved instance dg012142 from MIPLIB2010 was solved by using the ISM supercomputer.
    Language: Japanese
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 7
    facet.materialart.
    Unknown
    制約整数計画ソルバ SCIP の並列化 (2013)
    Details
    Publication Date: 2023-05-04
    Description: 制約整数計画（CIP: Constraint Integer Programs）は，制約プログラミング（CP: Constraint Programming），混合整数計画（MIP: Mixed Integer Programming），充足可能性問題（SAT: Satisfability Problem）の研究分野におけるモデリング技術と解法を統合している．その結果，制約整数計画は，広いクラスの最適化問題を扱うことができる．SCIP（Solving Constraint Integer Programs）は，CIP を解くソルバとして実装され，Zuse Institute Berlin（ZIB）の研究者を中心として継続的に拡張が続けられている．本論文では，著者らによって開発された SCIP に対する2 種類の並列化拡張を紹介する．一つは，複数計算ノード間で大規模に並列動作する ParaSCIPである．もう一つは，複数コアと共有メモリを持つ 1 台の計算機上で（スレッド）並列で動作する FiberSCIP である．ParaSCIP は，HLRN II スーパーコンピュータ上で，一つのインスタンスを解くために最大 7,168 コアを利用した動作実績がある．また，統計数理研究所の Fujitsu PRIMERGY RX200S5 上でも，最大 512 コアを利用した動作実績がある．統計数理研究所のFujitsu PRIMERGY RX200S5 上では，これまでに最適解が得られていなかった MIPLIB2010のインスタンスである dg012142 に最適解を与えた．
    Description: The paradigm of constraint integer programming (CIP) combines modeling and solving techniques from the fields of constraint programming (CP), mixed-integer programming (MIP) and　satisfability problem (SAT). This paradigm allows us to address a wide　range of optimization problems. SCIP is an implementation of the idea of CIP and is now being continuously extended by a group of researchers centered at Zuse Institute Berlin (ZIB). This paper introduces two parallel extensions of SCIP. One is ParaSCIP, which is intended to run on a large scale distributed memory computing environment, and the other is FiberSCIP, intended to run on a shared memory computing environment. ParaSCIP has been run successfully on the HLRN II supercomputer utilizing up to 7,168 cores to solve a single difficult MIP. It has also been tested on an ISM supercomputer (Fujitsu PRIMERGY RX200S5 using up to 512 cores). The previously unsolved instance dg012142 from MIPLIB2010 was solved by using the ISM supercomputer.
    Language: Japanese
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...