Junichi Murata
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Junichi Murata has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Danilo Vasconcellos Vargas
Graduate School of Information Science and Electrical Engineering Kyushu University Fukuoka Japan
4 shared publications - Hirotaka Takano
Faculty of Information Science and Electrical Engineering Kyushu University 819-0395 Fukuoka Japan
4 shared publications - Alexandre Claudio Botazzo Delbem
Institute of Mathematics and Computer Science, University of São Paulo, Av. Trabalhador São-carlense, 400, São Carlos, 13566-590, SP, Brazil
1 shared publication - Danilo Vasconcellos Vargas
Kyushu University, Fukuoka, Japan
1 shared publication - Fengji Luo
The University of Sydney
1 shared publication - Gianluca Ranzi
School of Civil Engineering, The University of Sydney, Sydney, NSW, Australia
1 shared publication
Latest Publications
- Open Access
- 2 May 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (9) , 4169
Service Restoring Reconfiguration for Distribution Networks Considering Uncertainty in Available Information
The recent growth in the penetration of photovoltaic generation systems (PVs) has brought new difficulties in the operating and planning of electric power distribution networks. This is because operators of the distribution networks normally cannot monitor or control the output of the PVs, which introduces additional uncertainty into the available information that operations must rely on. This paper focuses on the service restoration of the distribution networks, and the authors propose a problem framework and its solution method that finds the optimal restoration configuration under extensive PV installation. The service restoration problems have been formulated as combinatorial optimization problems. They do, however, require accurate information on load sections, which is impractical in distribution networks with extensively installed PVs. A combined framework of robust optimization and two-stage stochastic programming adopted in the proposed problem formulation enables us to deal with the PV-originated uncertainty using readily available information only. In addition, this problem framework can be treated by a traditional solution method with slight extensions. The validity of the authors’ proposal is verified through numerical simulations on a real-scale distribution network model and a discussion of their results.
- 2 May 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (9) , 4169
Open AccessService Restoring Reconfiguration for Distribution Networks Considering Uncertainty in Available Information
The recent growth in the penetration of photovoltaic generation systems (PVs) has brought new difficulties in the operating and planning of electric power distribution networks. This is because operators of the distribution networks normally cannot monitor or control the output of the PVs, which introduces additional uncertainty into the available information that operations must rely on. This paper focuses on the service restoration of the distribution networks, and the authors propose a problem framework and its solution method that finds the optimal restoration configuration under extensive PV installation. The service restoration problems have been formulated as combinatorial optimization problems. They do, however, require accurate information on load sections, which is impractical in distribution networks with extensively installed PVs. A combined framework of robust optimization and two-stage stochastic programming adopted in the proposed problem formulation enables us to deal with the PV-originated uncertainty using readily available information only. In addition, this problem framework can be treated by a traditional solution method with slight extensions. The validity of the authors’ proposal is verified through numerical simulations on a real-scale distribution network model and a discussion of their results.
- Open Access
General Subpopulation Framework and Taming the Conflict Inside Populations
Structured evolutionary algorithms have been investigated for some time. However, they have been under-explored specially in the field of multi-objective optimization. Despite their good results, the use of complex dynamics and structures make their understanding and adoption rate low. Here, we propose the general subpopulation framework that has the capability of integrating optimization algorithms without restrictions as well as aid the design of structured algorithms. The proposed framework is capable of generalizing most of the structured evolutionary algorithms, such as cellular algorithms, island models, spatial predator-prey and restricted mating based algorithms under its formalization. Moreover, we propose two algorithms based on the general subpopulation framework, demonstrating that with the simple addition of a number of single-objective differential evolution algorithms for each objective the results improve greatly, even when the combined algorithms behave poorly when evaluated alone at the tests. Most importantly, the comparison between the subpopulation algorithms and their related panmictic algorithms suggests that the competition between different strategies inside one population can have deleterious consequences for an algorithm and reveal a strong benefit of using the subpopulation framework. The code for SAN, the proposed multi-objective algorithm which has the current best results in the hardest benchmark, is available at the following https://github.com/zweifel/zweifel
Open AccessGeneral Subpopulation Framework and Taming the Conflict Inside Populations
Structured evolutionary algorithms have been investigated for some time. However, they have been under-explored specially in the field of multi-objective optimization. Despite their good results, the use of complex dynamics and structures make their understanding and adoption rate low. Here, we propose the general subpopulation framework that has the capability of integrating optimization algorithms without restrictions as well as aid the design of structured algorithms. The proposed framework is capable of generalizing most of the structured evolutionary algorithms, such as cellular algorithms, island models, spatial predator-prey and restricted mating based algorithms under its formalization. Moreover, we propose two algorithms based on the general subpopulation framework, demonstrating that with the simple addition of a number of single-objective differential evolution algorithms for each objective the results improve greatly, even when the combined algorithms behave poorly when evaluated alone at the tests. Most importantly, the comparison between the subpopulation algorithms and their related panmictic algorithms suggests that the competition between different strategies inside one population can have deleterious consequences for an algorithm and reveal a strong benefit of using the subpopulation framework. The code for SAN, the proposed multi-objective algorithm which has the current best results in the hardest benchmark, is available at the following https://github.com/zweifel/zweifel
- Open Access
Self Organizing Classifiers and Niched Fitness
Learning classifier systems are adaptive learning systems which have been widely applied in a multitude of application domains. However, there are still some generalization problems unsolved. The hurdle is that fitness and niching pressures are difficult to balance. Here, a new algorithm called Self Organizing Classifiers is proposed which faces this problem from a different perspective. Instead of balancing the pressures, both pressures are separated and no balance is necessary. In fact, the proposed algorithm possesses a dynamical population structure that self-organizes itself to better project the input space into a map. The niched fitness concept is defined along with its dynamical population structure, both are indispensable for the understanding of the proposed method. Promising results are shown on two continuous multi-step problems. One of which is yet more challenging than previous problems of this class in the literature.
Open AccessSelf Organizing Classifiers and Niched Fitness
Learning classifier systems are adaptive learning systems which have been widely applied in a multitude of application domains. However, there are still some generalization problems unsolved. The hurdle is that fitness and niching pressures are difficult to balance. Here, a new algorithm called Self Organizing Classifiers is proposed which faces this problem from a different perspective. Instead of balancing the pressures, both pressures are separated and no balance is necessary. In fact, the proposed algorithm possesses a dynamical population structure that self-organizes itself to better project the input space into a map. The niched fitness concept is defined along with its dynamical population structure, both are indispensable for the understanding of the proposed method. Promising results are shown on two continuous multi-step problems. One of which is yet more challenging than previous problems of this class in the literature.
- Open Access
Self Organizing Classifiers: First Steps in Structured Evolutionary Machine Learning
Learning classifier systems (LCSs) are evolutionary machine learning algorithms, flexible enough to be applied to reinforcement, supervised and unsupervised learning problems with good performance. Recently, self organizing classifiers were proposed which are similar to LCSs but have the advantage that in its structured population no balance between niching and fitness pressure is necessary. However, more tests and analysis are required to verify its benefits. Here, a variation of the first algorithm is proposed which uses a parameterless self organizing map (SOM). This algorithm is applied in challenging problems such as big, noisy as well as dynamically changing continuous input-action mazes (growing and compressing mazes are included) with good performance. Moreover, a genetic operator is proposed which utilizes the topological information of the SOM's population structure, improving the results. Thus, the first steps in structured evolutionary machine learning are shown, nonetheless, the problems faced are more difficult than the state-of-art continuous input-action multi-step ones.
Open AccessSelf Organizing Classifiers: First Steps in Structured Evolutionary Machine Learning
Learning classifier systems (LCSs) are evolutionary machine learning algorithms, flexible enough to be applied to reinforcement, supervised and unsupervised learning problems with good performance. Recently, self organizing classifiers were proposed which are similar to LCSs but have the advantage that in its structured population no balance between niching and fitness pressure is necessary. However, more tests and analysis are required to verify its benefits. Here, a variation of the first algorithm is proposed which uses a parameterless self organizing map (SOM). This algorithm is applied in challenging problems such as big, noisy as well as dynamically changing continuous input-action mazes (growing and compressing mazes are included) with good performance. Moreover, a genetic operator is proposed which utilizes the topological information of the SOM's population structure, improving the results. Thus, the first steps in structured evolutionary machine learning are shown, nonetheless, the problems faced are more difficult than the state-of-art continuous input-action multi-step ones.
- Open Access
Contingency Training
When applied to high-dimensional datasets, feature selection algorithms might still leave dozens of irrelevant variables in the dataset. Therefore, even after feature selection has been applied, classifiers must be prepared to the presence of irrelevant variables. This paper investigates a new training method called Contingency Training which increases the accuracy as well as the robustness against irrelevant attributes. Contingency training is classifier independent. By subsampling and removing information from each sample, it creates a set of constraints. These constraints aid the method to automatically find proper importance weights of the dataset's features. Experiments are conducted with the contingency training applied to neural networks over traditional datasets as well as datasets with additional irrelevant variables. For all of the tests, contingency training surpassed the unmodified training on datasets with irrelevant variables and even outperformed slightly when only a few or no irrelevant variables were present.
Open AccessContingency Training
When applied to high-dimensional datasets, feature selection algorithms might still leave dozens of irrelevant variables in the dataset. Therefore, even after feature selection has been applied, classifiers must be prepared to the presence of irrelevant variables. This paper investigates a new training method called Contingency Training which increases the accuracy as well as the robustness against irrelevant attributes. Contingency training is classifier independent. By subsampling and removing information from each sample, it creates a set of constraints. These constraints aid the method to automatically find proper importance weights of the dataset's features. Experiments are conducted with the contingency training applied to neural networks over traditional datasets as well as datasets with additional irrelevant variables. For all of the tests, contingency training surpassed the unmodified training on datasets with irrelevant variables and even outperformed slightly when only a few or no irrelevant variables were present.
- Open Access
- 10 July 2017
- Published by IOP Publishing in IOP Conference Series: Earth and Environmental Science
- Vol. 73 (1) , 012005
Natural Aggregation Approach based Home Energy Manage System with User Satisfaction Modelling
With the prevalence of advanced sensing and two-way communication technologies, Home Energy Management System (HEMS) has attracted lots of attentions in recent years. This paper proposes a HEMS that optimally schedules the controllable Residential Energy Resources (RERs) in a Time-of-Use (TOU) pricing and high solar power penetrated environment. The HEMS aims to minimize the overall operational cost of the home, and the user's satisfactions and requirements on the operation of different household appliances are modelled and considered in the HEMS. Further, a new biological self-aggregation intelligence based optimization technique previously proposed by the authors, i.e., Natural Aggregation Algorithm (NAA), is applied to solve the proposed HEMS optimization model. Simulations are conducted to validate the proposed method.
- 10 July 2017
- Published by IOP Publishing in IOP Conference Series: Earth and Environmental Science
- Vol. 73 (1) , 012005
Open AccessNatural Aggregation Approach based Home Energy Manage System with User Satisfaction Modelling
With the prevalence of advanced sensing and two-way communication technologies, Home Energy Management System (HEMS) has attracted lots of attentions in recent years. This paper proposes a HEMS that optimally schedules the controllable Residential Energy Resources (RERs) in a Time-of-Use (TOU) pricing and high solar power penetrated environment. The HEMS aims to minimize the overall operational cost of the home, and the user's satisfactions and requirements on the operation of different household appliances are modelled and considered in the HEMS. Further, a new biological self-aggregation intelligence based optimization technique previously proposed by the authors, i.e., Natural Aggregation Algorithm (NAA), is applied to solve the proposed HEMS optimization model. Simulations are conducted to validate the proposed method.
- 26 October 2013
- Published by Springer Nature in Evolutionary Intelligence
- Vol. 6 (2) , 57-72
Self organizing classifiers: first steps in structured evolutionary machine learning
- 26 October 2013
- Published by Springer Nature in Evolutionary Intelligence
- Vol. 6 (2) , 57-72
Self organizing classifiers: first steps in structured evolutionary machine learning