All issues
Volume 34 (1991)
- Issue 4 Pages 365-
- Issue 3 Pages 233-
- Issue 2 Pages 109-
- Issue 1 Pages 1-
Volume 34, Issue 2
Displaying 1-13 of 13 articles from this issue
- |<
- <
- 1
- >
- >|
-
Article type: Cover
1991 Volume 34 Issue 2 Pages Cover4-
Published: 1991
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (154K) -
Article type: Appendix
1991 Volume 34 Issue 2 Pages App3-
Published: 1991
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (174K) -
Takao Tanaka, Phan Thien Thach, Shigemichi SuzukiArticle type: Article
1991 Volume 34 Issue 2 Pages 109-124
Published: 1991
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThis paper describes nonconvex minimization approaches for the' problem of determining an economic ordering policy for jointly replenished items. After reducing the object, function in the problem to a single-variable nonconvex function, two methods are proposed for solving the problem. One is the Successive Underestimation Method which utilizes effectively the properties of the function A/t + Bt. Another is a modification of the Relief Indicator Method. Different from other heuristic methods ever proposed for the problem, the methods developed in this paper can obtain a global approximate solution within any prescribed error bound as we like. Results of computational tests show that both of the proposed methods perform equally well for many test problems.View full abstractDownload PDF (964K) -
Mikio Kubo, Hiroshi KasugaiArticle type: Article
1991 Volume 34 Issue 2 Pages 125-136
Published: 1991
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSWe consider the concave cost capacitated facility location problem, and develop a composite algorithm of lower and upper bounding procedures. Computational results for several instances with up to 100 customers and 25 candidate facility locations are also presented. Our numerical experiments show that the proposed algorithm generates good solutions. The gaps between upper and lower bounds a,re within 1 percent for all test problems.View full abstractDownload PDF (716K) -
Masahiro Higaki, Naonori NishidaArticle type: Article
1991 Volume 34 Issue 2 Pages 137-151
Published: 1991
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThe facility location problem which is one of the typical combinatorial optimization problems has been well-studied, and relatively large size problems can now be solved. However, the ordinary model of the facility location problem often cannot be applied to the real-life problem because of the simplicity of the model. Demands for each customer are given deterministically in the traditional model. However, demands are not constant, but rather change with time. Therefore, the capacity of the facility as well as the suitable location has to be determined with consideration given to the demand. This paper investigates the facility location problem with consideration to the constructing period of the candidate facilities. The facility location problem is first formulated as a mixed integer programming problem. A branch and bound algorithm is presented for two periods model. An efficient procedure is proposed for obtaining the lower bound and the penalty. For calculating the lower bound, a network problem with the special structure is solved by an out-of-kilter method. Moreover, a procedure for obtaining another lower bound is proposed. The lower bound is obtained by solving the Lagrangean relaxation problem. Computational experiment is presented, and it shows the effectiveness of the algorithm proposed.View full abstractDownload PDF (926K) -
Mikio Kubo, Hiroshi KasugaiArticle type: Article
1991 Volume 34 Issue 2 Pages 152-172
Published: 1991
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSWe consider a generalization of the classical traveling salesman problem (TSP) called the precedence constrained traveling salesman problem (PCTSP), i.e. given a directed complete graph G(V, E), a distance D_<ij> on each arc (i,j) ∈ E, precedence constraints ≺ on V, we want to find a minimum distance tour that starts node 1 ∈ V, visits all the nodes in V - {1}, and returns node 1 again so that node i is visited before node j when i ≺ j. We present a branch and bound algorithm for the exact solutions to the PCTSP incorporating lower bounds computed from the Lagrangean relaxation. Our lower bounding procedure is a generalization of the restricted Lagrangean method that has been successfully adapted to the TSP by Balas and Christofides [2]. Our branch and bound algorithm also incorporates several heuristics and variable reduction tests. The computational results with up to 49 nodes b-how that our algorithm computes exact solutions to several classes of precedence constraints within acceptable computational requirements.View full abstractDownload PDF (1264K) -
Toshikazu KimuraArticle type: Article
1991 Volume 34 Issue 2 Pages 173-186
Published: 1991
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSWe provide some two-moment, approximation formulas for the mean waiting time and the delay probability in a GI/G/s queue. These formulas are certain combinations of the exact mean waiting times for the M/M/s, M/D/s and D/M/s queues and the first two moments of the interarrival times and service times. To see the quality of the approximations, they are numerically compared with exact solutions and other approximations for some particular cases.View full abstractDownload PDF (1014K) -
Tatsuo OyamaArticle type: Article
1991 Volume 34 Issue 2 Pages 187-221
Published: 1991
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSApportionment, problem has been focused upon for more than 200 years by many applied mathematicians and operations researchers. Balinski and Young have done quite extensive works for this problem. In this paper we propose a parametric divisor method for solving an apportionment problem. Our method is shown to "cover" most traditional apportionment methods. First we introduce the idea of stable regions for the allocation of seats to each political constituency, then show the explicit relation between apportionment methods and corresponding stable regions. Then we look at these apportionment methods from the viewpoints of constrained optimization problem, and we show the corresponding optimization problem for our parametric divisor method. Finally using Japan's House of Representative. data, we show the numerical results for the application of various apportionment methods. We conclude our paper by suggesting appropriate parameter values for our parametric apportionment method.View full abstractDownload PDF (1933K) -
Kazuya Kamiya, Dolf TalmanArticle type: Article
1991 Volume 34 Issue 2 Pages 222-228
Published: 1991
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSIn this paper we propose a simplicial algorithm to find a core element for balanced games without side payments. The algorithm subdivides an appropriate simplex into smaller simplices and generates from an arbitrarily chosen point a sequence of adjacent simplices of variable dimension. Within a finite number of iterations the algorithm finds a simplex yielding an approximating core element. If the accuracy of approximation is not satisfactory, the algorithm can be restarted with a smaller mesh size in order to improve the accuracy.View full abstractDownload PDF (520K) -
Article type: Appendix
1991 Volume 34 Issue 2 Pages 229-231
Published: 1991
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (181K) -
Article type: Appendix
1991 Volume 34 Issue 2 Pages App4-
Published: 1991
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (196K) -
Article type: Cover
1991 Volume 34 Issue 2 Pages Cover5-
Published: 1991
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (130K) -
Article type: Cover
1991 Volume 34 Issue 2 Pages Cover6-
Published: 1991
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (130K)
- |<
- <
- 1
- >
- >|