All issues
Volume 56 (2013)
- Issue 4 Pages 243-
- Issue 3 Pages 155-
- Issue 2 Pages 57-
- Issue 1 Pages 1-
Volume 56, Issue 1
Displaying 1-10 of 10 articles from this issue
- |<
- <
- 1
- >
- >|
-
Article type: Cover
2013 Volume 56 Issue 1 Pages Cover1-
Published: 2013
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (19822K) -
Article type: Appendix
2013 Volume 56 Issue 1 Pages App1-
Published: 2013
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (64K) -
Article type: Appendix
2013 Volume 56 Issue 1 Pages App2-
Published: 2013
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (64K) -
Toshio Nakagawa, Xufeng ZhaoArticle type: Article
2013 Volume 56 Issue 1 Pages 1-14
Published: 2013
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThis paper proposes random age, periodic and block replacement policies which are made at random variable times, and optimal policies that minimize their expected cost rates are discussed analytically and computed numerically. We compare such random replacements with their standard policies that are made at constant times. Comparison results show that when costs for random and constant replacements are the same, the standard policies are better than the random ones. Furthermore, it is computed numerically that if how much the random replacement cost is lower than that for the constant one, then the standard and random replacements have the same optimal cost rates. That is, the modified random replacement costs and their optimal times are discussed and computed when the random replacements would be better than the standard policies.View full abstractDownload PDF (810K) -
Naoyuki KamiyamaArticle type: Article
2013 Volume 56 Issue 1 Pages 15-25
Published: 2013
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSIn this paper, we consider the following variant of the matroid intersection problem. We are given two matroids M_1, M_2 on the same ground set E and a subset A of E. Our goal is to find a common independent set I of M_1, M_2 such that |I∩A| is maximum among all common independent sets of M_1, M_2 and such that (secondly) |I| is maximum among all common independent sets of M_1, M_2 satisfying the first condition. This problem is a matroid-generalization of the simplest case of the rank-maximal matching problem introduced by Irving, Kavitha, Mehlhorn, Michail and Paluch (2006). In this paper, we extend the "combinatorial" algorithm of Irving et at. for the rank-maximal matching problem to our problem by using a Dulmage-Mendelsohn type decomposition for the matroid intersection problem.View full abstractDownload PDF (839K) -
Rei Yamamoto, Hiroshi KonnoArticle type: Article
2013 Volume 56 Issue 1 Pages 26-37
Published: 2013
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThis 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. This problem can be solved by an integer programming software if the size of the universe is small. However, it is still beyond the reach of the state-of-the-art technology to solve a large scale rebalancing problem. We will show that we can now solve these problems almost exactly within a practical amount of time by using an elaborate heuristic approach.View full abstractDownload PDF (747K) -
Yuran Choi, Tsutomu SuzukiArticle type: Article
2013 Volume 56 Issue 1 Pages 38-55
Published: 2013
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSClosing facilities due to a lack of demand is an unavoidable trend in areas experiencing decreasing populations. Strategies to prevent critical facilities from closing may be based on the concepts of maximum benefit or minimum cost. With the purpose of determining efficient strategies, we focused on a median and a maximal covering problem that considers two interacting players: interdiction and fortification. This study aims to develop an interdiction covering problem with fortification and compare it with a median problem. We specified the facilities to be grocery stores because justifying their protection is difficult given that they are private businesses; however, such protection is crucial because they provide a critical public service. First, we simulated the formulation on a linear urban space to explain the general characteristics and performance of the models. Second, we employed the formulation on a practical dataset to consider the heterogeneity of urban spaces. The result shows that, for models in a uniform space, the peripheral area is prioritized for protection when a lower level of damage is expected, while the central area is prioritized when more damage is expected. Moreover, these general characteristics can be sensitive to the spatial distribution of facilities.View full abstractDownload PDF (1305K) -
Article type: Appendix
2013 Volume 56 Issue 1 Pages App3-
Published: 2013
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (88K) -
Article type: Cover
2013 Volume 56 Issue 1 Pages Cover2-
Published: 2013
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (22K) -
Article type: Cover
2013 Volume 56 Issue 1 Pages Cover3-
Published: 2013
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (22K)
- |<
- <
- 1
- >
- >|