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) |
(To be available after the conference date) [more] |
|
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-13 15:25 |
Misc. |
Kikai-Shinko-Kaikan Bldg. |
Machine learning-based solubility prediction and meta-heuristic search for multiple mutation patterns Kaisei Kojima, Kazutoshi Sakakibara, Masaki Nakamura (Toyama Prefectural Univ.), Daisuke Matsui (Ritsumeikan Univ.) MSS2023-80 NLP2023-132 |
In order to solubilize insoluble proteins that cannot be used for industrial purposes, experiments have been performed t... [more] |
MSS2023-80 NLP2023-132 pp.48-53 |
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 |
NLP |
2023-05-13 11:15 |
Fukushima |
Kenshin Koriyama Cultural Center (Koriyama, Fukushima) |
Parameter adjustment methods of ACO based on moving costs in time-dependent TSP Teppei Yamauchi, Hidehiro Nakano (Tokyo City Univ.) NLP2023-4 |
The Time Dependent Traveling Salesman Problem (TDTSP) is a combinatorial optimization problem with dynamically changing ... [more] |
NLP2023-4 pp.16-19 |
RECONF, VLD, CPSY, IPSJ-ARC, IPSJ-SLDM [detail] |
2022-01-24 11:50 |
Online |
Online |
Multi-spin-flip method for Ising machines and its application Tatsuhiko Shirai, Nozomu Tagawa (Waseda Univ.) VLD2021-54 CPSY2021-23 RECONF2021-62 |
(To be available after the conference date) [more] |
VLD2021-54 CPSY2021-23 RECONF2021-62 pp.31-36 |
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 |
MSS, NLP (Joint) |
2020-03-10 14:55 |
Aichi |
(Cancelled but technical report was issued) |
NA Masashi Tawada, Nozomu Togawa (Waseda Univ.) MSS2019-65 |
N/A [more] |
MSS2019-65 pp.43-48 |
AI |
2018-07-02 10:25 |
Hokkaido |
|
Solving Constraint Satisfaction Problems Using Ant Colony Optimization with Multi-Pheromones Takuya Masukane, Kazunori Mizuno (Takushoku Univ.) AI2018-2 |
Ant colony optimization, ACO, is one of the meta-heuristics. ACO has been effective to solve constraint satisfaction pro... [more] |
AI2018-2 pp.7-10 |
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 |
NLP |
2015-05-19 11:50 |
Aomori |
Yu-sa Asamushi |
Basic Performances of Deterministic PSO Networks Tomoyuki Sasaki, Hidehiro Nakano, Arata Miyauchi, Akira Taguchi (Tokyo City Univ.) NLP2015-38 |
PSO network is the method of dividing population of PSO into multiple sub-swarm groups, and each sub-swarm group is conn... [more] |
NLP2015-38 pp.61-66 |
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 |
NLP |
2012-01-23 17:05 |
Fukushima |
Aizu-keiko-do Hall |
An heuristic algorithm for TSP by region segmentation correspond to instance characteristics
-- The solution by the operation using P type Fourier descriptor -- Tomihiro Kimura, Masaharu Adachi (Tokyo Denki Univ.) NLP2011-133 |
A Fourier descriptor is often used for approximation to curves.
An improvement of the performance of a solution is aim... [more] |
NLP2011-133 pp.51-55 |