巻号一覧
38 巻 (1995)
- 4 号 p. 381-
- 3 号 p. 269-
- 2 号 p. 141-
- 1 号 p. 1-
38 巻, 1 号
選択された号の論文の14件中1～14を表示しています
- |<
- <
- 1
- >
- >|
-
原稿種別: 表紙
1995 年 38 巻 1 号 p. Cover1-
発行日: 1995年
公開日: 2017/06/27
ジャーナル フリーPDF形式でダウンロード (124K) -
原稿種別: 付録等
1995 年 38 巻 1 号 p. App1-
発行日: 1995年
公開日: 2017/06/27
ジャーナル フリーPDF形式でダウンロード (134K) -
Seyed Hessameddin Zegordi, Kenji Itoh, Takao Enkawa, Shih Li Chung原稿種別: Article
1995 年 38 巻 1 号 p. 1-20
発行日: 1995年
公開日: 2017/06/27
ジャーナル フリーSimulated annealing, an analogy between statistical mechanics and combinatorial optimization, has attracted considerable attention due to its potential in dealing with certain traditional optimization problems. However, it has been shown to be parameter sensitive and require more computational effort to produce high quality solutions than traditional heuristics. The present paper reports on a new approach to applying this method to a class of quadratic assignment problems, i.e., the facility layout problem. This approach combines the simulated annealing methodology with a specific layout design rule, which in the case of this study is a "Move Desirability Table" . Two annealing methods are proposed based on this approach which differ only in cooling schedule. The first method produces high quality solutions, while the second method is faster with a slight degradation in the quality of solutions and therefore suitable for larger problems. Performance of the two methods was numerically tested on standard problems as well as two larger problems (n = 50 and n = 100; n is the number of facilities) and was compared to that of Wilhelm & Ward, Connolly and other heuristics, e.g., QAPH4, CRAFT, biased sampling and the revised Hillier procedure. As the experimental results, it was found that except, in the case of n = 50, 100, the proposed methods are computationally faster than Wilhelm & Ward and that the solution qualities of t,he proposed methods in all the cases are superior to those of Wilhelm & Ward, Connolly and other heuristic procedures.抄録全体を表示PDF形式でダウンロード (1703K) -
Kazutomo Nishizawa原稿種別: Article
1995 年 38 巻 1 号 p. 21-33
発行日: 1995年
公開日: 2017/06/27
ジャーナル フリーIn this paper, a consistency improving of the comparison matrix in binary AHP (Analytic Hierarchy Process) is studied. As its byproducts, we propose a method to count the cycles of length 3 and to find the locations of the cycles in a complete directed graph. We apply our proposed consistency improving method to various examples including three actual sports games. Comparing our method with ordinary improving method, we can show the usefulness of our method.抄録全体を表示PDF形式でダウンロード (671K) -
Toshiyuki Sueyoshi原稿種別: Article
1995 年 38 巻 1 号 p. 34-54
発行日: 1995年
公開日: 2017/06/27
ジャーナル フリーThis article presents analytical and numerical approaches for statistically testing parameter estimates of a regression hyperplane, using Empirical Regression Quantile (ERQ) technique. The analytical approach uses its asymptotic property of ERQ to determine the standard error of parameter estimates. The asymptotical results are replaced and compared with a computer intensive technique referred to as "a bootstrap method." Furthermore, Leverage Treatment, Method (LTM) is proposed for dealing with a leverage point problem that may seriously affect ERQ results. It is not trivial to detect the leverage point in a multivariate date set. An important feature of the LTM is that, it fully utilizes dual variables derived from ERQ for identifying the leverage point. The proposed ERQ/LTM is applied to two illustrative examples in which the technique is compared with other conventional methods.抄録全体を表示PDF形式でダウンロード (1683K) -
Nobuko Sagara, Masao Fukushima原稿種別: Article
1995 年 38 巻 1 号 p. 55-69
発行日: 1995年
公開日: 2017/06/27
ジャーナル フリーThis paper presents a new method with trust region technique for solving the nonlinear least squares problem with linear inequality constraints. The method proposed in this paper stems from the one presented in a recent paper by the authors. The method successively constructs trust region constraints, which are ellipsoids centered at the iterative points, in such a way that they lie in the relative interior of the feasible region. Thus the method belongs to the class of interior point, methods, and hence we may expect that the generated sequence approaches a solution smoothly without the combinatorial complications inherent to traditional active set methods. We establish a convergence theorem for the proposed method and show its practical efficiency by numerical experiments.抄録全体を表示PDF形式でダウンロード (901K) -
Kensaku Kikuta原稿種別: Article
1995 年 38 巻 1 号 p. 70-88
発行日: 1995年
公開日: 2017/06/27
ジャーナル フリーThere is a rooted tree. A person selects a vertex except the root, hides in it and stays there. The searcher is at the root and then examines each vertex until he finds the hider, traveling along edges of the tree. Associated with the examination are a traveling cost dependent on the distance from the last vertex examined and a fixed examination cost. The searcher wishes to minimize the expected cost of finding the hider, whereas the hider wishes to maximize it. The problem is formulated as a two-person zero-sum game and it is solved.抄録全体を表示PDF形式でダウンロード (1169K) -
Seizo Ikuta原稿種別: Article
1995 年 38 巻 1 号 p. 89-106
発行日: 1995年
公開日: 2017/06/27
ジャーナル フリーThe present paper deals with an optimal stopping problem with several possible search areas in which travel costs are assumed among the areas. In terms of the future availability of an offer once obtained and passed up, the following two cases are considered: (1) it becomes instantly and forever unavailable and (2) it remains forever available, called a no recall model and a recall model, respectively. The main results obtained here are as follows: 1 . Both models have a reservation value property, and the reservation values are nondecreasing in the number of periods, t, remaining up to deadline and converge as t → ∞; 2. Their limits in both models do not always become the same, which coincide in conventional optimal stopping problems; 3. In the recall model, there may exist double critical points w_* and w*(w_* < w*) in terms of the present offer w in the sense that, if w < w_*, then the optimal next search area. is i, if w_* < w < w*, then j ≠ i, and if w* < w, then again i; and 4. Suppose the travel cost is independent, of the starting search area. Then, in the recall model, the reservation value is independent, of both the remaining periods and the current search area. Furthermore, in this case, the reservation values in both models converge to the same value as t → ∞.抄録全体を表示PDF形式でダウンロード (1148K) -
池上 敦子, 丹羽 明原稿種別: 本文
1995 年 38 巻 1 号 p. 107-123
発行日: 1995年
公開日: 2017/06/27
ジャーナル フリーこの論文では、中央デポをベースとするキャパシティ付きビークル(車輌)を、できるだけ少ない台数で、時間指定のある需要群に対応させようというルーティング問題を考える。まず、この時間拘束付きビークル・ルーティング問題の定式化をおこない、これを解くヒューリスティック・アルゴリズムについて考察する。この問題にキャパシティ拘束が無かったなら、輸送計画問題となり、シンプレックス法を利用して解くことができる。しかし、キャパシティ拘束がつけられた場合、ビークルは何度もデポに戻り複数のツアーを扱うことになる。つまり、問題には、ツアーの作成とビークルに対するツアー割付けの2つの要素が存在し、輸送計画問題を二重に含む構造となる。この構造を利用したヒューリスティック・アルゴリズムを提案し、数値実験においてセービング法等を応用した6つのアルゴリズムと比較する。その結果、提案したアルゴリズムが有効であることがわかった。また、デポの位置とビークルのキャパシティの大小が、このヒューリスティック・アルゴリズムの有効性に大きく影響することがわかった。抄録全体を表示PDF形式でダウンロード (1163K) -
Satoru Fujishige, Zhang Xiaodong原稿種別: Article
1995 年 38 巻 1 号 p. 124-136
発行日: 1995年
公開日: 2017/06/27
ジャーナル フリーAn efficient cost scaling algorithm is presented for the independent assignment problem of Iri and Tomizawa, which is equivalent to the weighted matroid intersection problem of Edmonds. Our algorithm in general can be viewed as a generalization of Orlin and Ahuja's scaling algorithm for the ordinary assignment problem. On a bipartite graph with n vertices and integer arc costs bounded by C, an optimal r-independent assignment can be found in O(√<rgt:n^2 log(rC)) time by our algorithm under an independence oracle for matorids.抄録全体を表示PDF形式でダウンロード (1002K) -
原稿種別: 付録等
1995 年 38 巻 1 号 p. 137-139
発行日: 1995年
公開日: 2017/06/27
ジャーナル フリーPDF形式でダウンロード (173K) -
原稿種別: 付録等
1995 年 38 巻 1 号 p. App2-
発行日: 1995年
公開日: 2017/06/27
ジャーナル フリーPDF形式でダウンロード (162K) -
原稿種別: 表紙
1995 年 38 巻 1 号 p. Cover2-
発行日: 1995年
公開日: 2017/06/27
ジャーナル フリーPDF形式でダウンロード (95K) -
原稿種別: 表紙
1995 年 38 巻 1 号 p. Cover3-
発行日: 1995年
公開日: 2017/06/27
ジャーナル フリーPDF形式でダウンロード (95K)
- |<
- <
- 1
- >
- >|