Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
NLP |
2024-05-09 15:05 |
Kagawa |
Kagawa Prefecture Social Welfare Center |
A Gray Wolf Optimization Method with Adaptive Large Neighborhood Search for the Traveling Salesman Problems Rikuto Shibutani, Takayuki Kimura (NIT) NLP2024-5 |
In solving the Traveling Salesman Problem (TSP), the Gray Wolf Optimization method has shown better performance, but it ... [more] |
NLP2024-5 pp.19-24 |
CAS, CS |
2024-03-14 10:20 |
Okinawa |
|
Improved CSD-FIR Filter Design Performance by Reducing the Number of Penalized Individuals Hanqin Qi, Kenji Suyama (Tokyo Denki Univ.) CAS2023-113 CS2023-106 |
A design method for CSD-FIR filters using PfGA has been proposed, in which a parameter adjustment is not required in adv... [more] |
CAS2023-113 CS2023-106 pp.12-16 |
NLP, MSS |
2024-03-14 10:25 |
Misc. |
Kikai-Shinko-Kaikan Bldg. |
A Particle Swarm Optimizer Based on Chaotic Spiking Oscillators with Dynamic Thresholds for Velocity Vectors Ahmed Ali, Hidehiro Nakano (Tokyo City Univ.) MSS2023-87 NLP2023-139 |
Particle Swarm Optimization (PSO) is a metaheuristic algorithm known for solving complex optimization problems. Despite ... [more] |
MSS2023-87 NLP2023-139 pp.77-82 |
SS, MSS |
2024-01-17 16:50 |
Ishikawa |
(Primary: On-site, Secondary: Online) |
The Verification of the Introduction Effect of the Rolling-Horizon Approach in Inventory Routing Problems Hirotaka Ooe, Soichiro Yokoyama, Tomohisa Yamashita, Hidenori Kawamura (Hokudai), Mitsuo Tada (ZeroSpec) MSS2023-60 SS2023-39 |
This paper focuses on the Inventory Routing Problem (IRP), a combinatorial optimization problem where distributors with ... [more] |
MSS2023-60 SS2023-39 pp.44-51 |
AI |
2023-09-12 15:15 |
Hokkaido |
|
An Efficient Neighborhood Structure for the Kerosene Inventory Routing Problem Hirotaka Ooe, Soichiro Yokoyama, Tomohisa Yamashita, Hidenori Kawamura (Hokudai), Mitsuo Tada (ZeroSpec) AI2023-17 |
Kerosene delivery is a service where kerosene is periodically delivered to ensure that household tanks do not run out. R... [more] |
AI2023-17 pp.87-94 |
CCS |
2022-11-17 13:50 |
Mie |
(Primary: On-site, Secondary: Online) |
A chaotic search method with stochastic solution transitions for electric vehicle routing problem with time windows Jun Adachi, Takafumi Matsuura, Takayuki Kimura (NIT) CCS2022-45 |
Rapid increase of delivery goods and shortage of drivers causes the construction of efficient delivery routes that minim... [more] |
CCS2022-45 pp.9-13 |
IN, CCS (Joint) |
2022-08-05 11:10 |
Hokkaido |
Hokkaido University(Centennial Hall) (Primary: On-site, Secondary: Online) |
A chaotic search method for Electric Vehicle Routing Problems with Time Windows that allow Partial Recharging in recharge stations Jun Adachi, Takafumi Matsuura, Takayuki Kimura (NIT) CCS2022-38 |
The rapid increase of delivery goods and shortage of drivers causes the construction of efficient delivery routes that m... [more] |
CCS2022-38 pp.60-65 |
NLP, MICT, MBE, NC (Joint) [detail] |
2022-01-22 13:15 |
Online |
Online |
A study on performance of local search methods for Electric Vehicle Routing Problem with Time Windows Jun Adachi, Takafumi Matsuura, Takayuki Kimura (NIT) NLP2021-104 MICT2021-79 MBE2021-65 |
The rapid increase of delivery goods and shortage of drivers causes the construction of efficient delivery routes that m... [more] |
NLP2021-104 MICT2021-79 MBE2021-65 pp.143-148 |
R |
2021-07-17 14:25 |
Online |
Virtual |
Refined Ensemble Learning Algorithms for Software Bug Prediction
-- Metaheuristic Approach -- Keisuke Fukuda, Tadashi Dohi, Hiroyuki Okamura (Hiroshima Univ.) R2021-19 |
In this paper, we propose to apply three metaheuristic algorithms; latin hypercube sampling, ABC (artificial
bee colon... [more] |
R2021-19 pp.18-23 |
CAS, ICTSSL |
2021-01-28 14:25 |
Online |
Online |
Design of IIR Filter Using Novel Constraint-handling Method Yuta Harigae, Kenji Suyama (Tokyo Denki Univ.) CAS2020-47 ICTSSL2020-32 |
In previous work, the design methods of IIR filter using metaheuristics have been proposed.
The penalty function method... [more] |
CAS2020-47 ICTSSL2020-32 pp.46-51 |
R |
2020-11-30 13:00 |
Online |
Online |
Ant Colony Optimization Algorithm Based on Birnbaum Importance and Necessary Condition for Optimal Arrangement Problems in a Linear Consecutive-k-out-of-n: F System Issin Honma, Hisashi Yamamoto (Tokyo Metropolitan Univ.), Taishin Nakamura (Tokai Univ.) R2020-23 |
In this study, we propose an ant colony optimization algorithm based on Birnbaum importance and necessary conditions for... [more] |
R2020-23 pp.1-6 |
NLP |
2018-04-27 16:10 |
Kumamoto |
Kumaoto Univ. |
An ABC Algorithm with Improvement of Tracking Performance to Solutions in Dynamic Optimization Problems Masato Omika, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2018-26 |
We propose an ABC algorithm to dynamic optimization problems in this article. The proposed method makes the following tw... [more] |
NLP2018-26 pp.127-131 |
NLP |
2018-04-27 16:35 |
Kumamoto |
Kumaoto Univ. |
A Particle Swarm Optimizer Based on Periodically Swiched Particle Networks Santana Sato, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2018-27 |
In this paper, we propose a method to periodically switch the couplings between particles in Particle Swarm Optimization... [more] |
NLP2018-27 pp.133-137 |
NLP |
2017-11-05 14:00 |
Miyagi |
Research Institute of Electrical Communication Tohoku University |
Optimization for switching phase of PWM inverter Asuna Yamasaki, Kenya Jin'no (NIT) NLP2017-67 |
In this article, we optimize the switching phase of the PWM inverter by using a differential evolution algorithm to impr... [more] |
NLP2017-67 pp.13-18 |
NLP, CCS |
2015-06-11 09:50 |
Tokyo |
Waseda Univerisity |
Analysis and evaluation of Firefly Algorithm Jianze Xiao, Takuya Shindo, Takuya Kurihara, Kenya Jin'no (NIT) NLP2015-41 CCS2015-3 |
Firefly algorithm is one of Metaheuristic optimization algorithms, it is inspired by the flashing and attracting behavio... [more] |
NLP2015-41 CCS2015-3 pp.13-18 |
COMP |
2014-03-10 15:40 |
Tokyo |
|
Amoeba-inspired Algorithm and Its Realization Using Nanodevice Hiroyoshi Miwa (Kwansei Gakuin Univ.), Mashashi Aono (Tokyo Tech/JST), Makoto Naruse (NICT), Seiya Kasai (Hokkaido Univ.) COMP2013-71 |
Many metaheuristic algorithms have been studied so far to search for fairy good solutions to intractable computational ... [more] |
COMP2013-71 pp.77-82 |
SSS |
2013-12-19 13:40 |
Tokyo |
|
Application of Multi-objective Metaheuristics to Transmission Network Expansion Planning Hiroki Kakuta, Hiroyuki Mori, Shigeru Tamura, Yosikazu Fukuyama (Meiji Univ.) SSS2013-29 |
This paper proposes an efficient method for transmission network expansion planning in power systems. It makes use of mo... [more] |
SSS2013-29 pp.5-8 |
MBE |
2011-07-09 10:00 |
Tokushima |
The University of Tokushima |
An Automatic Scheduling Method of Clinical Exercises Hisashi Miyazaki, Isao Kayano, Osamu Hiramatsu (Kawasaki Univ), Sousuke Amasaki (Okayama Prefectural Univ) MBE2011-31 |
In this paper, we propose an automatic scheduling method of clinical exercises using tabu search that is one of the meta... [more] |
MBE2011-31 pp.59-63 |
COMP |
2010-09-29 10:00 |
Niigata |
Nagaoka Univ. of Tech. |
Run-time Analysis of Ant Colony Optimization over the Cheapest Path with a Context-dependent Cost Atsushi Murata, Yoshinori Takei (Nagaoka Univ. of Tech.) COMP2010-24 |
Since Ant Colony Optimization (ACO) was introduced by Dorigo and his colleagues in the early 1990s, it has been worked a... [more] |
COMP2010-24 pp.1-8 |
NC, NLP |
2009-07-14 10:00 |
Nara |
NAIST |
A competitive PSO based on evaluation with priority for finding plural solutions Yu Taguchi, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2009-29 NC2009-22 |
It is known that Particle Swarm Optimization (PSO) is a kind of evolutionary algorithm that can efficiently find the sol... [more] |
NLP2009-29 NC2009-22 pp.83-86 |