Journal of the Operations Research Society of Japan
Online ISSN : 2188-8299
Print ISSN : 0453-4514
ISSN-L : 0453-4514
Volume 52, Issue 4
Displaying 1-17 of 17 articles from this issue
  • Article type: Cover
    2009 Volume 52 Issue 4 Pages Cover10-
    Published: 2009
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (2141K)
  • Article type: Appendix
    2009 Volume 52 Issue 4 Pages App7-
    Published: 2009
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (69K)
  • Kimitoshi Sato, Katsushige Sawaki
    Article type: Article
    2009 Volume 52 Issue 4 Pages 355-365
    Published: 2009
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    In this paper we consider an airline seat allocation model where multiple fare classes are available and replenishment can be allowed for the lower fare classes. Such a replenishment likely occurs whenever the higher fare classes do not have demands large enough compared with the number of the pre-allocated seats. Then, the lower fare classes should be reopened while the prices may be discounted during the periods left before the departure. If the demands for high fare classes are large enough, the airlines should not discount the prices and the replenishment may not be allowed from the point of view of revenue management. We also allow the customers to cancel their reservations. Our model formulation is much closer to the airlines practice. We show under some conditions that the expected revenue with replenishment is greater than the one without replenishment and that there exists a simple optimal booking policy. Some numerical examples are provided to confirm analytical properties of the revenue function as well as of the optimal policy.
    Download PDF (702K)
  • Takehiro Furuta, Mihiro Sasaki, Fumio Ishizaki, Atsuo Suzuki, Hajime M ...
    Article type: Article
    2009 Volume 52 Issue 4 Pages 366-376
    Published: 2009
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    In this paper, we study mathematical formulations for clustering problems which arise in wireless sensor networks as examined from the standpoint of facility location theory. Following facility location theory, LEACH-C, one of the principal studies on cluster-based network organizations, formulates the clustering problem as a p-median problem. In this paper, we examine some drawbacks to the formulation put forward in LEACH-C. We then formulate the problem as an uncapacitated facility location problem to overcome these drawbacks. Computational experiments show that compared to LEACH-C, the proposed algorithm based on our formulation can extend the total lifetime of sensor networks.
    Download PDF (871K)
  • Hiroyuki Masuyama, Bin Liu, Tetsuya Takine
    Article type: Article
    2009 Volume 52 Issue 4 Pages 377-401
    Published: 2009
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    This paper considers the stationary queue length and waiting time distributions in a FIFO BMAP/GI/1 queue with heavy-tailed service times and that with heavy-tailed batch sizes. In each case, we provide sufficient conditions under which the stationary queue length and waiting time distributions are subexponential. Furthermore, we obtain asymptotic relationships between the tail distributions of the stationary queue length and waiting time.
    Download PDF (1534K)
  • Shinichi Murata, Yasunari Yoshitomi, Hiroaki Ishii, Taro Asada
    Article type: Article
    2009 Volume 52 Issue 4 Pages 402-416
    Published: 2009
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Recent developments in computer technologies and networks have enabled the use of high-quality digital contents, such as electronic documents, images, and audio and video contents. A watermarking technique has recently been developed for the copyright protection of these digital contents. There are few watermarking techniques for three-dimensional (3D) geometric models, such as solid models or polygonal models. In the present paper, we propose an optimization problem for embedding watermarks on 3D polygon models. Then, using a genetic algorithm, we obtain the approximately optimum solutions for an original problem and a partial problem, which has an advantage with respect to security over the corresponding original problem. For embedding and extracting the watermark, we use a simplified method based on the previous study using the wavelet transform. The structure of the optimization problem examined in the present research is the same as that for the Traveling Salesman Problem, except for the objective function and the two additional constraints.
    Download PDF (1203K)
  • Hiroyuki Nagasawa, Masaki Kotani, Kazuko Morizawa
    Article type: Article
    2009 Volume 52 Issue 4 Pages 417-432
    Published: 2009
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    How to make a coordination policy between suppliers is one of key issues in Supply Chain Management. This paper deals with a case where multiple farmers harvest and deliver agricultural fresh products to multiple markets in proportion to each market size provided that the plants related to the fresh products get flowering periodically like tropical fruits such as papaya. A cooperative model is formulated in a mathematical form to obtain the optimal harvesting patterns for multiple farmers who harvest the fresh products cooperatively to maximize the consumption level of fresh products daily used in multiple markets. Although this model becomes a kind of mixed integer linear programming problem hard to solve in general, this paper reduces it into a simple LP problem easy to solve, exploiting some properties of optimal harvesting patterns analytically obtained in an individual un-cooperative model. Numerical analyses provide optimal harvesting patterns for cooperative multiple farmers, and make it clear that the cooperation effect depends on the delivery lead times from multiple farmers to multiple markets and the shift periods between flowering cycles among farmers. In a two-farm, two-market model, it is also shown that the increment of the consumption level of fresh products in the cooperative model compared with that in the individual un-cooperative model becomes largest when the shift period between flowering cycles among two farmers is just half a flowering cycle.
    Download PDF (1134K)
  • Shoji Takechi, Hideaki Miyata, Toshiaki Namba
    Article type: Article
    2009 Volume 52 Issue 4 Pages 433-452
    Published: 2009
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Customer interaction with a movie rental business can be modeled with a multi-agent simulation consisting of customer, rental shop, and rental transaction models. A customer model is an agent that has independent purchase behaviors. The customer model is described by several properties called customer indicators. A rental shop model is a virtual shop with video stocks and services. The rental shop model is described by several properties called business indicators. A rental transaction model is composed of a series of virtual transactions between customer agents and the rental shop model. The rental transactions are simulated using the day-by-day time-marching method for one year. The results of the simulations are the sales figures of the rental movie shop and the consumption ratios of leisure time and money spent watching rental movies for each customer. Example results demonstrate the dependence of sales results on indicator values, and the potential for these simulations to benefit business management.
    Download PDF (1569K)
  • Tohru Ueda, Hirofumi Amatatsu
    Article type: Article
    2009 Volume 52 Issue 4 Pages 453-467
    Published: 2009
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    In Data Envelopment Analysis (DEA) many optimal weights (multipliers) for inputs and outputs may become zeros. This means that corresponding inputs or outputs are neglected. To improve this shortcoming the assurance region methods which have bounds on the ratios of weights have been proposed. Deciding bounds depends on the data, and in some cases it requires judgments from experts. However, it is generally a difficult task to put their judgments into the quantitative bounds. We propose new methods by which the bounds are derived easily from limited information, i.e., partial ranking data. The methods are applied to the evaluation of baseball players and chemical companies.
    Download PDF (801K)
  • Masashi Miyagawa
    Article type: Article
    2009 Volume 52 Issue 4 Pages 468-476
    Published: 2009
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    This paper examines how providing closing information affects travel distances when facilities are closed. Two cases are considered to assess the effect of closing information. In the first case, customers have perfect information and travel directly to the nearest open facility. In the second case, customers have no information and search for an open facility. The average distances from customers to an open facility with and without information are derived for regular and random patterns of facilities. The effect of information is measured as the reduction in the average distances.
    Download PDF (584K)
  • Article type: Bibliography
    2009 Volume 52 Issue 4 Pages 477-
    Published: 2009
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (18K)
  • Article type: Appendix
    2009 Volume 52 Issue 4 Pages 478-479
    Published: 2009
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (85K)
  • Article type: Index
    2009 Volume 52 Issue 4 Pages 480-482
    Published: 2009
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (135K)
  • Article type: Index
    2009 Volume 52 Issue 4 Pages 483-486
    Published: 2009
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (206K)
  • Article type: Appendix
    2009 Volume 52 Issue 4 Pages App8-
    Published: 2009
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (99K)
  • Article type: Cover
    2009 Volume 52 Issue 4 Pages Cover11-
    Published: 2009
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (49K)
  • Article type: Cover
    2009 Volume 52 Issue 4 Pages Cover12-
    Published: 2009
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (49K)
feedback
Top