Journal of the Operations Research Society of Japan
Online ISSN : 2188-8299
Print ISSN : 0453-4514
ISSN-L : 0453-4514
Volume 44, Issue 4
Displaying 1-15 of 15 articles from this issue
  • Article type: Cover
    2001 Volume 44 Issue 4 Pages Cover9-
    Published: 2001
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (19K)
  • Article type: Appendix
    2001 Volume 44 Issue 4 Pages App7-
    Published: 2001
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (64K)
  • Chung-Chu Chuang
    Article type: Article
    2001 Volume 44 Issue 4 Pages 301-312
    Published: 2001
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Since order quantity has only been decided at a spot selling time in the classical newsboy problem, both the purchase timing and the time-variant variance of the forecasted demand are neglected. When the buyer purchases seasonal commodity by changing his pre-planned schedule for more purchase discount, it is necessary for the buyer to forecast the demand of spot selling time, which may increase the variance of the demand. This paper deals simultaneously with optimal purchase timing and order quantity under a specified shortage-level limit in a distribution free newsboy problem. Besides, a numerical example is used to illustrate the largest amount called Expected Value of Additional Information, which decision-maker will be willing to pay for the knowledge of the normal distribution. Furthermore, the effects of parameters and economical meanings are also included. The resultant outcomes could apply to some cases in futures commodity contracts.
    Download PDF (766K)
  • Peng-Sheng You
    Article type: Article
    2001 Volume 44 Issue 4 Pages 313-325
    Published: 2001
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    It is a current airline industry practice to upgrade passengers from the economy cabin to the business cabin at no additional cost to the passengers. Incorporating this practice, this paper deals with a single-flight-leg multi-fare class seat inventory control problem. A discrete-time dynamic programming model for finding the optimal booking policy is developed. It is found that the booking policy can be reduced to some set of critical values.
    Download PDF (917K)
  • Azuma Taguchi, Takeshi Koshizuka
    Article type: Article
    2001 Volume 44 Issue 4 Pages 326-343
    Published: 2001
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    In this aper, we propose a traffic model for a large-scale building giving careful consideration to traffic area. Our model consists of residential area, transportation area, and the rest. We focussed our attention on the trips generated between each pair of residents. There are three available transportation means in a building. The first one is a corridor to walk horizontally, the other two means, an escalator and an elevator, are used for vertical transportation. Each of the transportation means has its own capacity and speed, therefore the travel time and the necessary traffic area can be defined for each trip using it. We determine the distribution of residents as well as the transportation area which minimize the total travel time of trips under such constraints that, the used area on each floor must be less than floor area S, and the population must be equal to a specified population P. Solving the problem, we can evaluate how the ease of mobility in a building changes as its size and proportion changes, from the viewpoints of travel time and required traffic area. We show two numerical examples in order to examine whether our model can properly describe the transportation capacity of an actual skyscraper. The first example is to approximate a district consisting of 10 skyscrapers in Shinjuku area. We calculate the travle time distribution of trips in the district using our model through carefully choosing model parameters. We compared it with the observed travel time distribution of 523 example trips, and find that our model approximates the actual district very well. The second example is to represent the elevator system in World Trade Center building in New York which uses express elevators and local elevators. An express elevator stops at the first floor, two predetermined floors halfway(skylobbies), and the top of the building. We derive a model for WTC building and try to find how this elevator system increases transportation capacity of a skyscraper. It is derived that it makes travel time from the entrance on the first floor to the whole building shorter and almost equivalent to those of the buildings lower by 30〜40 stories. But it is not the case for a trip between points within a building. We also calculate the optimal location of skylobbies, which proved to be almost equal to the skylobbies in actual WTC building.
    Download PDF (1812K)
  • Hiroyuki Takada
    Article type: Article
    2001 Volume 44 Issue 4 Pages 344-365
    Published: 2001
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    In the conventional Markov modulated fluid queue, the buffer content process has a continuous sample path. This paper concerns a Markov modulated fluid queue whose buffer content process may have jumps. This model extends not only the conventional fluid queue but also the M AP/G/1 model. We give a procedure to get a Laplace-Stieltjes transform of the stationary joint distribution of the buffer content and background state. Some numerical examples are presented as well.
    Download PDF (1135K)
  • Yi-Kuei Lin, John Yuan
    Article type: Article
    2001 Volume 44 Issue 4 Pages 366-377
    Published: 2001
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    This paper is mainly to extent the MMCF(multi-commodity minimum cost flow)problem from deterministic flow networks to stochastic cases. Under the transportation budget constraint, this paper proposes an approach to calculate the probability that the required amount of multi-commodity can be transmitted successfully through a stochastic flow network. Such a probability is called transportation reliability. An algorithm is proposed first to find out all lower boundary points for the requirement in terms of minimal paths. The transportation reliability can then be calculated in terms of such lower boundary points. A numerical example, in which two types of commodities are shipped in container under two container-loading policies, is presented to illustrate the application of such a reliability model.
    Download PDF (762K)
  • Yuichiro Miyamoto, Mikio Kubo
    Article type: Article
    2001 Volume 44 Issue 4 Pages 378-389
    Published: 2001
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    In this paper, we present an integrated vender managed inventory system currently being developed for large soft drink firms in Japan. The heart of our system is a heuristic algorithm for the inventory routing problem that is concerned with the supply of a set of products from a single depot to a set of customers over a given planning horizon. The objective is to minimize the sum of distribution, inventory, and shortage costs during the planning periods. Our two-phase algorithm determines the set of costomers to be supplied each day and finds routes for vehicles to serve those customers. The first phase of the algorithm constructs an initial feasible solution using an insertion method, and the second improves the initial solution using a local search based on Cross-opt neighborhood. Due to the size and complexity of our real application, we adopt sophisticated data structures and speed-up techniques. Typical problems involve a depot and about 700 vending machines. For the problems, the system has been saving about 40% of total working hours and the number of roots.
    Download PDF (1180K)
  • Mihiro Sasaki, Masao Fukushima
    Article type: Article
    2001 Volume 44 Issue 4 Pages 390-402
    Published: 2001
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    In this paper, we consider a new competitive hub location model called Stackelberg hub location problem where a big firm competes with several medium firms to maximize its own profit. We assume that the medium firms' service sets are mutually disjoint and there is no competition among them. The big firm first locates a new hub on a plane as a leader on the condition that the other firms locate their new hubs after that. We formulate the leader's problem as a bilevel programming problem with followers' problem as lower level problems, and solve it using SQP method. Computational results show the significance of the proposed competitive hub location model.
    Download PDF (1021K)
  • Article type: Appendix
    2001 Volume 44 Issue 4 Pages 403-404
    Published: 2001
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (118K)
  • Article type: Appendix
    2001 Volume 44 Issue 4 Pages 405-
    Published: 2001
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (60K)
  • Article type: Index
    2001 Volume 44 Issue 4 Pages 406-407
    Published: 2001
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (96K)
  • Article type: Appendix
    2001 Volume 44 Issue 4 Pages App8-
    Published: 2001
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (218K)
  • Article type: Cover
    2001 Volume 44 Issue 4 Pages Cover10-
    Published: 2001
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (38K)
  • Article type: Cover
    2001 Volume 44 Issue 4 Pages Cover11-
    Published: 2001
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (38K)
feedback
Top