Details of a Researcher - Tanaka Kenichi

Tanaka Kenichi

写真a

Affiliation: Faculty of Science and Technology, Department of Industrial and Systems Engineering （Yagami）

Position: Professor

Page Top ▲

Academic Background 【 Display / hide 】

1996.04

-

2000.03

Keio University, Faculty of Science and Technology, Department of Administration Engineering

University, Graduated
2000.04

-

2002.03

Keio University, Graduate School of Science and Technology, School of Science for Open and Environmental Systems

University, Completed, Master's course
2002.04

-

2005.03

Keio University, Graduate School of Science and Technology, School of Science for Open and Environmental Systems

University, Completed, Doctoral course

Page Top ▲

Papers 【 Display / hide 】

A continuous districting model focusing on intra- and inter-zonal squared distances and its Voronoi-based heuristic

Morimoto K., Tanaka K.

International Transactions in Operational Research （Wiley) 28 （ 3 ） 1109 - 1134 2021.05

ISSN 09696016

　View Summary

We consider the problem of dividing a given convex polygon into p convex polygons called zones, each of which receives a designated land area. The position and shape of each zone is determined so that intra- and inter-zonal trips for the resulting zones are conducted efficiently. To evaluate the compactness of the resulting zones, we derive the average squared distance between two points uniformly distributed in each zone, as well as the average squared distance between two points uniformly distributed in two zones. The weighted sum of these measures is used as the objective function, and a Voronoi-based heuristic algorithm is proposed that iteratively updates the positions of p generator points placed inside a convex polygon. The method is used to divide several regular polygons, and the results show that zones become (i) rounded when intra-zonal trips are prioritized and (ii) elongated with longer boundary lines when inter-zonal trips are prioritized.
- Access to Document (DOI)
Modelling the order of scoring in team sports

Hamada K., Tanaka K.

IMA Journal of Management Mathematics 32 283 - 301 2021

Joint Work
The Probabilistic Minisum Flow Interception Problem: Minimizing the Expected Travel Distance until Intercept under Probabilistic Interception

Tanaka K., Kurita O.

Geographical Analysis （Wiley) 52 （ 2 ） 211 - 230 2020.04

ISSN 00167363

　View Summary

We develop a variant of the flow interception problem (FIP) in which it is more desirable for travelers to be intercepted as early as possible in their trips. In addition, we consider flows being intercepted probabilistically instead of the deterministic view of coverage assumed in the FIP literature. We call the proposed model the probabilistic minisum FIP (PMFIP); it involves minimizing the sum of the expected distance that each flow travels until intercepted at a facility among placed facilities. This extension allows us to evaluate the effect of facility location under any given value of the interception probability and to apply the model to a variety of situations. We apply the proposed model to an example network by assuming a hypothetical situation in which people gather at a stadium from various nodes on the network, and receive some goods or services on the way to the stadium. We analyze optimal solutions obtained by varying the number of facilities and interception probability. It is shown that the expected travel distance until intercept is greatly reduced by means of a few optimally located facilities under a moderate interception probability.
- Access to Document (DOI)
City shapes that maximize the number of walking-only trips based on Manhattan distance

Misaki S., Tanaka K.

Journal of Advanced Mechanical Design, Systems and Manufacturing 14 （ 5 ） 2020

　View Summary

Various modes of transportation are available when people travel within cities, and trips can be classified into two types depending on whether some type of vehicle is used. Compared to vehicular travel, trips conducted only by walking have the advantages of lower environmental impact and less space required for road networks. By assuming that the proportion of walking-only trips decreases exponentially with the distance traveled, we explore the problem of finding a city shape with a fixed land area that maximizes the number of walking-only trips based on Manhattan distance. For many-to-one travel with the city center as the destination, we show that the optimal city shape is a diamond. For many-to-many travel, a method is presented that expresses the number of walking-only trips as a double integral, originally formulated as a four-dimensional integral. Using this, an optimization problem is formulated whose variables are the vertex coordinates of a polygon, and approximate solutions for the optimal city shape under several different settings are obtained numerically. For many-to-many travel, it is shown that a large number of walking-only trips occur when the city shape is close to being circular, although the exact shape varies with the distance deterrence coefficient.
- Access to Document (DOI)
複数回の広告接触を考慮したCMスケジューリング問題―視聴パターンに着目したフロー捕捉型配置モデル―

小貝洸希,八尾優作,丹野一輝,濱田賢吾,田中健一,栗田　治

オペレーションズ・リサーチ 65 （ 2 ） 93 - 103 2020

Joint Work, Accepted

display all >>

Page Top ▲

Papers, etc., Registered in KOARA 【 Display / hide 】

Mathematical models for shelter site selection in the event of volcanic eruption and their applications

Tanaka, Ken'ichi

科学研究費補助金研究成果報告書 2018
モデリングの魅力

Tanaka, Kenichi

新版窮理図解（慶應義塾大学理工学部) （ 22 ） 2016.08
The appeal of modeling

Tanaka, Kenichi

New Kyurizukai （Faculty of Science and Technology, Keio University) （ 22 ） 2016.08
Flow-based facility location and scheduling problems and their applications

Tanaka, Kenichi

科学研究費補助金研究成果報告書 2016

Page Top ▲

Presentations 【 Display / hide 】

格子状網をもつ凸多角形領域における総歩行者数の導出

御前汐莉，田中健一

日本オペレーションズ・リサーチ学会2018年春季研究発表会,

2018.03
,
Oral presentation (general)
サッカーの試合における得点過程に着目した確率モデル

濱田賢吾，田中健一

日本オペレーションズ・リサーチ学会2018年春季研究発表会,

2018.03
,
Oral presentation (general)
噴石シェルターの適正な配置計画に関する数理モデル

田中健一，鳥海重喜

日本オペレーションズ・リサーチ学会2018年春季研究発表会,

2018.03
,
Oral presentation (general)
Flow capturing location problem with probabilistic demand coverage

K. Tanaka, O. Kurita

Urban Operations Research Workshop 2017,

2017.12
,
Oral presentation (general)
投票定理を用いたサッカーにおける圧勝確率の計算

濱田賢吾，田中健一

「都市のOR」ワークショップ2017,

2017.12
,
Oral presentation (general)

display all >>

Page Top ▲

Research Projects of Competitive Funds, etc. 【 Display / hide 】

人の流れに着目した都市インフラの適正配置と運用に関する数理モデルの開発とその応用

2018.04

-

2022.03

MEXT,JSPS, Grant-in-Aid for Scientific Research, Grant-in-Aid for Scientific Research (B), Principal investigator
火山噴火時における避難施設の適正な配置計画に関する数理モデルの開発とその応用

2016.04

-

2019.03

MEXT,JSPS, Grant-in-Aid for Scientific Research, Grant-in-Aid for Challenging Exploratory Research, Principal investigator
Flow-based facility location and scheduling problems and their applications

2013.04

-

2017.03

MEXT,JSPS, Grant-in-Aid for Scientific Research, Grant-in-Aid for Scientific Research (B), Principal investigator

　View Summary

We proposed dynamic facility location models that seek locations and opening hours of multiple facilities so as to maximize the volumes of commuter flows that can be accessible to facility services, and applied the models to Tokyo metropolitan railway network using commuter flow data. Concretely, we constructed the following models: (1) a model where multiple coverage levels are considered depending on the arrival time to a destination, (2) a model in which there is a minimum required time for commuters to enjoy the service, and (3) a model where opening hours of facilities are decision variables rather than a fixed constant. In addition, we focused various situations where the temporal dimension is a critical factor, and constructed mathematical models to evaluate the effects of shuttle bus system on visitors' traffic flow to the Tokyo Bay zone during the 2020 Tokyo Olympics, and problems for designing network infrastructures by considering the time horizon.