Hideki Katagiri
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Hideki Katagiri has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Kosuke Kato
Department of Obstetrics and Gynecology The University of Tokyo Tokyo Japan
3 shared publications - Takashi Tanizaki
Kindai University
2 shared publications - Takeshi Uno
Department of Neurosurgery, Teikyo University, Tokyo, Japan
2 shared publications - Antonio Oliveira Nzinga Rene
Toyama Prefectural University,Department of Data Science,Toyama,Japan
1 shared publication - Hiroe Tsubaki
The Institute of Statistical Mathematics, Tokyo, Japan
1 shared publication Hiroshi Tsuda
Faculty of Science and Engineering, Doshisya University, Tatara Miyakodani 1-3, Kyotanabe City, 610-0394 Japan
1 shared publication
Latest Publications
- Open Access
- 5 January 2023
- Published by Fuji Technology Press Ltd. in International Journal of Automation Technology
- Vol. 17 (1) , 71-80
Scheduling Algorithm Using Path Relinking for Production Process with Crane Interference
In manufacturing industries, customers demand a wide variety of products, with high quality and fast delivery. Production scheduling systems have become critical for efficient operation. However, scheduling problems in manufacturing are generally large and complex with many constraints. It is difficult to create an optimal production schedule that satisfies all constraints within a reasonable timeframe. This study targets a factory with multiple working machines and two overhead cranes. Our research aims to obtain a solution algorithm to avoid interference of overhead cranes and machine competition and a production plan that minimizes the total makespan for each job. As the problem must be solved within a reasonable timeframe, we have developed the solution algorithm using metaheuristics and scheduling simulation. In general, metaheuristic algorithms must strike a balance between an intensive search for good solutions and a search for diverse solutions. Accordingly, we propose a new algorithm using path relinking in a scatter search. This method was demonstrated to be effective in obtaining good solutions with little variation in numerical experiments. In this paper, we describe previous research, our target process, and new solution algorithm and discuss algorithm design methods based on computer experiments.
- 5 January 2023
- Published by Fuji Technology Press Ltd. in International Journal of Automation Technology
- Vol. 17 (1) , 71-80
Open AccessScheduling Algorithm Using Path Relinking for Production Process with Crane Interference
In manufacturing industries, customers demand a wide variety of products, with high quality and fast delivery. Production scheduling systems have become critical for efficient operation. However, scheduling problems in manufacturing are generally large and complex with many constraints. It is difficult to create an optimal production schedule that satisfies all constraints within a reasonable timeframe. This study targets a factory with multiple working machines and two overhead cranes. Our research aims to obtain a solution algorithm to avoid interference of overhead cranes and machine competition and a production plan that minimizes the total makespan for each job. As the problem must be solved within a reasonable timeframe, we have developed the solution algorithm using metaheuristics and scheduling simulation. In general, metaheuristic algorithms must strike a balance between an intensive search for good solutions and a search for diverse solutions. Accordingly, we propose a new algorithm using path relinking in a scatter search. This method was demonstrated to be effective in obtaining good solutions with little variation in numerical experiments. In this paper, we describe previous research, our target process, and new solution algorithm and discuss algorithm design methods based on computer experiments.
- 5 January 2021
- Published by Springer Nature
- p. 17-31
Machine Learning Methods for Detecting Wiring Defects of Glass Substrates Through Non-contact Line Scanning Data
- 5 January 2021
- Published by Springer Nature
- p. 17-31
Machine Learning Methods for Detecting Wiring Defects of Glass Substrates Through Non-contact Line Scanning Data
- Open Access
- 1 May 2018
- Published by Fuji Technology Press Ltd. in International Journal of Automation Technology
- Vol. 12 (3) , 297-307
Scheduling Algorithms Using Metaheuristics for Production Processes with Crane Interference
This paper proposes scheduling algorithms using metaheuristics for production processes in which cranes can interfere with each other. There are many production processes that involve cranes in manufacturing industry, such as in the steel industry, so a general purpose algorithm for this problem can be of practical use. The scheduling problem for this process is very complicated and difficult to solve because the cranes must avoid interfering with each other plus each machine has its own operational constraints. Although several algorithms have been proposed for a specific problem or small-scale problem, general purpose algorithms that can be solved in real time (about 30 minutes or less) in the company’s production planning work have not been developed for large-scale problems. This paper develops some metaheuristic algorithms to obtain suboptimal solutions in a short time, and it confirms their effectiveness through computer experiments.
- 1 May 2018
- Published by Fuji Technology Press Ltd. in International Journal of Automation Technology
- Vol. 12 (3) , 297-307
Open AccessScheduling Algorithms Using Metaheuristics for Production Processes with Crane Interference
This paper proposes scheduling algorithms using metaheuristics for production processes in which cranes can interfere with each other. There are many production processes that involve cranes in manufacturing industry, such as in the steel industry, so a general purpose algorithm for this problem can be of practical use. The scheduling problem for this process is very complicated and difficult to solve because the cranes must avoid interfering with each other plus each machine has its own operational constraints. Although several algorithms have been proposed for a specific problem or small-scale problem, general purpose algorithms that can be solved in real time (about 30 minutes or less) in the company’s production planning work have not been developed for large-scale problems. This paper develops some metaheuristic algorithms to obtain suboptimal solutions in a short time, and it confirms their effectiveness through computer experiments.
- 1 October 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1062922X,p. 727-732
Interactive multiobjective random fuzzy programming: Necessity-based value at risk model
This article considers multiobjective linear programming problems (MOLPP) where random fuzzy variables are contained in objective functions and constraints. The purpose of the proposed decision making model is to optimize values at risk under the constraints using a necessity measure. An interacitve algorithm is constructed in order to obtain a satisficing solution for the decision maker from among a set of Pareto optimal solutions.
- 1 October 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1062922X,p. 727-732
Interactive multiobjective random fuzzy programming: Necessity-based value at risk model
This article considers multiobjective linear programming problems (MOLPP) where random fuzzy variables are contained in objective functions and constraints. The purpose of the proposed decision making model is to optimize values at risk under the constraints using a necessity measure. An interacitve algorithm is constructed in order to obtain a satisficing solution for the decision maker from among a set of Pareto optimal solutions.
- 23 December 2011
- Published by SAGE Publications in Intelligent Decision Technologies
- Vol. 6 (1) , 69-75
A Stackelberg solution for fuzzy random competitive location problems with demand site uncertainty
This paper focuses on a Stackelberg location problem on a tree network with demands whose sites are given uncertainly and vaguely. By representing their sites as fuzzy random variables on it, the distances from demands to facilities can be defined as
- 23 December 2011
- Published by SAGE Publications in Intelligent Decision Technologies
- Vol. 6 (1) , 69-75
A Stackelberg solution for fuzzy random competitive location problems with demand site uncertainty
This paper focuses on a Stackelberg location problem on a tree network with demands whose sites are given uncertainly and vaguely. By representing their sites as fuzzy random variables on it, the distances from demands to facilities can be defined as
- 1 April 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21629048,p. 1-8
Risk Management for Fuzzy Random MST Problem Based on Conditional Value-at-Risk
This paper deals with a minimum spanning tree problem where each edge weight is a fuzzy random variable. In terms of risk management in order to avoid adverse impacts derived from uncertainty, conditional Value-at-Risk including a necessity measure for fuzziness is introduced as a risk measure. Furthermore, by performing the deterministic equivalent transformation, the proposed problem is transformed into an existing minimum spanning tree problem to apply polynomial-time algorithms, and a solution algorithm is developed to solve the proposed problem.
- 1 April 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21629048,p. 1-8
Risk Management for Fuzzy Random MST Problem Based on Conditional Value-at-Risk
This paper deals with a minimum spanning tree problem where each edge weight is a fuzzy random variable. In terms of risk management in order to avoid adverse impacts derived from uncertainty, conditional Value-at-Risk including a necessity measure for fuzziness is introduced as a risk measure. Furthermore, by performing the deterministic equivalent transformation, the proposed problem is transformed into an existing minimum spanning tree problem to apply polynomial-time algorithms, and a solution algorithm is developed to solve the proposed problem.
- 10 December 2009
- Published by SAGE Publications in International Journal of Knowledge-based and Intelligent Engineering Systems
- Vol. 13 (3-4) , 111-118
Interactive fuzzy programming for two-level stochastic linear programming problems through expectation and variance models
In this paper, we focus on two-level linear programming problems involving random variable coefficients in objective functions and constraints. According to the concept of chance constrained programming, the two-level stochastic linear programming pr
- 10 December 2009
- Published by SAGE Publications in International Journal of Knowledge-based and Intelligent Engineering Systems
- Vol. 13 (3-4) , 111-118
Interactive fuzzy programming for two-level stochastic linear programming problems through expectation and variance models
In this paper, we focus on two-level linear programming problems involving random variable coefficients in objective functions and constraints. According to the concept of chance constrained programming, the two-level stochastic linear programming pr
- 12 March 2009
- Published by Springer Nature in Computational Economics
- Vol. 34 (1) , 37-65
Simulation Analysis Using Multi-Agent Systems for Social Norms
- 12 March 2009
- Published by Springer Nature in Computational Economics
- Vol. 34 (1) , 37-65
Simulation Analysis Using Multi-Agent Systems for Social Norms