Journal of the Operations Research Society of Japan

[title in Japanese]

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

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

JOURNAL FREE ACCESS

Download PDF (19469K)
[title in Japanese]

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

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

JOURNAL FREE ACCESS

Download PDF (65K)
[title in Japanese]

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

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

JOURNAL FREE ACCESS

Download PDF (65K)
CONSTANT FACTOR APPROXIMATION ALGORITHMS FOR REPETITIVE ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS

Yoshiyuki Karuno, Hiroshi Nagamochi, Aleksandar Shurbevski

Article type: Article
2012 Volume 55 Issue 3 Pages 181-191
Published: 2012
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

In this paper, we consider a repetitive routing problem which we find on a printed circuit board assembly line. There are m different printed circuit boards to be processed. As an automated manipulator embeds electronic parts in a printed circuit board from above, n identical pins from underneath protect it against overbending. A dedicated pin configuration is designed for each printed circuit board so that pins do not obstruct its own circuit. A single grasp-and-delivery robot transfers the pins one by one to arrange them from a configuration to another one. Given an initial configuration of pins and a permutable set of m required configurations, our repetitive routing problem asks to find a configuration sequence, i.e., a processing order of m printed circuit boards, and a transfer route of the grasp-and-delivery robot so that the route length over all m transitions is minimized. We first design a polynomial time approximation algorithm with factor four to a restricted version of the repetitive routing problem with a non-permutable set of configurations, i.e., with a fixed processing order of m printed circuit boards. Applying the procedure, we then show that the repetitive routing problem with a permutable set of configurations admits a polynomial time approximation algorithm with factor six.

View full abstract

Download PDF (896K)
NECESSITY AND SUFFICIENCY FOR THE EXISTENCE OF A PURE-STRATEGY NASH EQUILIBRIUM

Jun-ichi Takeshita, Hidefumi Kawasaki

Article type: Article
2012 Volume 55 Issue 3 Pages 192-198
Published: 2012
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

In this paper, we consider a non-cooperative n-person game in the strategic form. As is well known, the game has a mixed-strategy Nash equilibrium. However, it does not always have a pure-strategy Nash equilibrium. Wherein, Topkis (1979), Iimura (2003), and Sato and Kawasaki (2009) provided a sufficient condition for the game to have a pure-strategy Nash equilibrium. However, they did not consider necessary conditions. This paper has two aims. The first is to extend the authors' sufficient condition, which is based on monotonicity of the best responses. The second is to show that the existence of a pure-strategy Nash equilibrium implies the monotonicity of the best responses or an isolation of the equilibrium.

View full abstract

Download PDF (473K)
A MATHEMATICAL PROGRAMMING APPROACH TO THE MULTI-ROUND TOPOLOGY CONSTRUCTION PROBLEM IN WIRELESS SENSOR NETWORKS

Mihiro Sasaki, Takehiro Furuta, Fumio Ishizaki, Atsuo Suzuki

Article type: Article
2012 Volume 55 Issue 3 Pages 199-208
Published: 2012
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

One of the important issues in wireless sensor networks is how to save power consumption and extend the network lifetime. For this purpose, various network topology construction algorithms have been studied. However, most of them are based on a method repeating single round optimization. In other words, by considering the energy dissipation of sensor nodes only in the next round, a network topology in the next round is constructed in a round-by-round manner. The set of the topology constructions based on such a round-by-round view may be far from the optimal solution to maximize the network lifetime. To address this issue, we take the energy dissipation of sensor nodes over multiple rounds into account, and we consider the problem as a multi-dimensional knapsack problem, which enables us to find optimal network topologies until at least one sensor node exhausts its battery power. We also propose a solution method to maximize the network lifetime. The computational experiments show that the proposed approach provides efficient topology construction in the wireless sensor network in terms of network lifetime compared to the cluster-based approach.

View full abstract

Download PDF (914K)
[title in Japanese]

Article type: Appendix
2012 Volume 55 Issue 3 Pages App10-
Published: 2012
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.55.App10

JOURNAL FREE ACCESS

Download PDF (90K)
[title in Japanese]

Article type: Appendix
2012 Volume 55 Issue 3 Pages App11-
Published: 2012
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.55.App11

JOURNAL FREE ACCESS

Download PDF (90K)
[title in Japanese]

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

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

JOURNAL FREE ACCESS

Download PDF (25K)
[title in Japanese]

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

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

JOURNAL FREE ACCESS

Download PDF (25K)

Register with J-STAGE for free!