Journal of the Operations Research Society of Japan

[title in Japanese]

Article type: Cover
2013 Volume 56 Issue 3 Pages Cover7-
Published: 2013
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.56.Cover7

JOURNAL FREE ACCESS

Download PDF (19530K)
[title in Japanese]

Article type: Appendix
2013 Volume 56 Issue 3 Pages App7-
Published: 2013
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.56.App7

JOURNAL FREE ACCESS

Download PDF (69K)
PREFACE TO THE SPECIAL ISSUE OF ISOLDE XII(<Special Issue>ISOLDE XII)

Atsuo Suzuki

Article type: Article
2013 Volume 56 Issue 3 Pages 155-
Published: 2013
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.56.155

JOURNAL FREE ACCESS

Download PDF (114K)
SOLVING CONSTRAINED TWO-FACILITY LOCATION PROBLEMS(<Special Issue>ISOLDE XII)

Atsuo Suzuki, Zvi Drezner

Article type: Article
2013 Volume 56 Issue 3 Pages 157-165
Published: 2013
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.56.157

JOURNAL FREE ACCESS

Show abstractHide abstract

A general approach to optimally solve multiple facility location problems based on the "Big Triangle Small Triangle" approach to solving single facility problems is proposed. The proposed procedure is especially effective when the solution is constrained to a given polygon such as the convex hull of demand points. The procedure is tested on the two facilities Weber problem with attraction and repulsion (WAR) with excellent computational results.

View full abstract

Download PDF (760K)
DISTRIBUTION OF THE DIFFERENCE BETWEEN DISTANCES TO THE FIRST AND THE SECOND NEAREST FACILITIES(<Special Issue>ISOLDE XII)

Masashi Miyagawa

Article type: Article
2013 Volume 56 Issue 3 Pages 167-176
Published: 2013
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.56.167

JOURNAL FREE ACCESS

Show abstractHide abstract

This paper derives the distribution of the difference between the distances to the first and the second nearest facilities. Facilities are represented as points of regular and random patterns, and distance is measured as Euclidean and rectilinear distances on a continuous plane. Since the difference between the distances is regarded as the additional travel distance of customers when the nearest facility is closed, the distribution of the difference represents the reliability of facility location. The distribution of the difference between the road network distances is also calculated to evaluate the reliability of actual facility location.

View full abstract

Download PDF (1631K)
LOCATIONS AND SERVICE START TIME OF FLOW-COVERING FACILITIES WITH MULTIPLE COVERAGE LEVELS(<Special Issue>ISOLDE XII)

Ken-ichi Tanaka, Takehiro Furuta

Article type: Article
2013 Volume 56 Issue 3 Pages 177-197
Published: 2013
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.56.177

JOURNAL FREE ACCESS

Show abstractHide abstract

This paper develops an extended version of MFCLSTP (Maximum Flow-Covering Location and service Start Time Problem, Tanaka 2011) by introducing multiple coverage levels based on the arrival time to a destination. The original MFCLSTP determines the locations of facilities and the start time of services of fixed duration to maximize coverage for flows on the way back home from work. In MFCLSTP, each flow is either fully covered if commuters can be back home by a given time (after consuming service from start to end at a facility), or not covered at all otherwise. In many situations, a service which ensures that commuters can be back home early is more desirable. To describe this situation, we introduce different levels of coverage and allow the value of coverage to vary depending on the arrival time to a destination (home). The model is applied to the railway network of Chukyo area in Japan by using commuter flow data for railway users in this area. By employing a model with two coverage levels, we obtain the optimal set of stations to site facilities and their service start times. The results show that the optimal time to start a service tends to be earlier when more importance is placed on covering flows that can return home early.

View full abstract

Download PDF (3295K)
DESIGNING NETWORK TOPOLOGY USING DATA ENVELOPMENT ANALYSIS

Noriaki Kamiyama

Article type: Article
2013 Volume 56 Issue 3 Pages 199-220
Published: 2013
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.56.199

JOURNAL FREE ACCESS

Show abstractHide abstract

The topology of a network seriously affects its cost, reliability, throughput, and traffic pattern, etc, so we need to simultaneously consider these multiple criteria, which have different units, when evaluating network topologies. However, ordinary methods of network topology design considered only a single criterion. DEA (data envelopment analysis) enables us to simultaneously evaluate multiple criteria, and it has been widely used when evaluating the efficiency of a business or a project. DEA derives the optimality of each candidate by emphasizing strong criteria in its evaluation. In this paper, we apply DEA to network topology design, and we numerically show that it enables us to effectively focus on a small number of desirable topology candidates. We also compare the results of DEA with those obtained by the generic algorithm (GA).

View full abstract

Download PDF (1508K)
MINISUM AND MINIMAX LOCATION MODELS FOR HELICOPTER EMERGENCY MEDICAL SERVICE SYSTEMS

Takehiro Furuta, Ken-ichi Tanaka

Article type: Article
2013 Volume 56 Issue 3 Pages 221-242
Published: 2013
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.56.221

JOURNAL FREE ACCESS

Show abstractHide abstract

This paper presents minisum and minimax location problems for helicopter emergency medical service (HEMS) systems. Given demand points (origins) and hospitals (destinations), the locations of rendezvous points and helicopter stations are selected to minimize the total demand-weighted transport time (minisum objective) and the maximum transport time (minimax objective) to a hospital. Rendezvous points are required for a helicopter to meet with an ambulance. In minimizing these objectives, each demand is allocated to either an already-available ground ambulance or a newly-introduced helicopter. We provide 0-1 integer formulations of the minisum and minimax problems, and develop a variable reduction procedure that reduces the size of the problem. Some optimal solutions of the proposed models tested for an idealized square city are analyzed. We also apply the models to the case study of Japan using geographical and population data, and the locations of the actual emergency medical centers. The proposed variable reduction procedure is shown to be effective for both examples. Results show that the proposed problems tend to focus on low-accessibility locations and that accessibility to a hospital is greatly improved.

View full abstract

Download PDF (5726K)
[title in Japanese]

Article type: Appendix
2013 Volume 56 Issue 3 Pages App8-
Published: 2013
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.56.App8

JOURNAL FREE ACCESS

Download PDF (88K)
[title in Japanese]

Article type: Appendix
2013 Volume 56 Issue 3 Pages App9-
Published: 2013
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.56.App9

JOURNAL FREE ACCESS

Download PDF (88K)
[title in Japanese]

Article type: Cover
2013 Volume 56 Issue 3 Pages Cover8-
Published: 2013
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.56.Cover8

JOURNAL FREE ACCESS

Download PDF (27K)
[title in Japanese]

Article type: Cover
2013 Volume 56 Issue 3 Pages Cover9-
Published: 2013
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.56.Cover9

JOURNAL FREE ACCESS

Download PDF (27K)

Register with J-STAGE for free!