| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| 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 |
| IT | 2020-12-02 10:00 |
Online | Online | Policy Optimization Based on Bayesian Decision Theory in Learning Period on Markov Decision Process Naoki Ichijo, Yuta Nakahara, Yuto Motomura, Toshiyasu Matsushima (Waseda Univ.) IT2020-31 |
In Markov decision process(MDP) problems with an unknown transition probability, a learning agent has to learn the unkno... [more] | IT2020-31 pp.38-43 |
| COMP, IPSJ-AL | 2018-05-26 14:30 |
Aichi | Nagoya Institute of Technology | Worst-Case Scenario for Γ-Robust Optimization Jiabao Zhang (Nagoya Univ.), Wei Wu (Seikei Univ.), Mutsunori Yagiura (Nagoya Univ.) COMP2018-1 |
Robust optimization is motivated by practical applications and deals with optimization problems in which some input para... [more] | COMP2018-1 pp.17-24 |
| 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 |
| ITS, IPSJ-ITS, IEE-ITS | 2017-09-04 13:50 |
Toyama | Toyama Institute of Information Systems | A Fast Map-matching algorithm based on Global Optimization
-- Dynamic Programming and a fast link connectivity verification -- Tatsuya Hamaoka (Fujitsu Ten), Masato Mizu, Takayoshi Yokota (Tottori Univ.) ITS2017-8 |
The location data from positioning devices, such as GPS, provides vital information for the probe car systems aiming at... [more] | ITS2017-8 pp.17-22 |
| IN, NV (Joint) |
2015-07-17 11:15 |
Hokkaido | Hokkaido University | [Invited Talk]
Exploiting ZDDs on Constrained Dynamic Programming Problems Norihito Yasuda (Hokkaido Univ.) IN2015-34 |
Dynamic Programming is a fundamental tool for many optimization problems. However, in practical situations, in addition ... [more] | IN2015-34 pp.67-72 |
| SIS | 2015-06-08 15:55 |
Nagasaki | Arkas SASEBO | Weight Optimization for Image Integration and Restoration Ryo Matsuoka (Univ of Kitakyushu), Tomohiro Yamauchi (QBS), Tatsuya Baba, Masahiro Okuda (Univ of Kitakyushu) SIS2015-7 |
To restore an image degraded by sensor noise or quantization error, multiple image integration is an effective and power... [more] | SIS2015-7 pp.35-38 |
| NLP | 2014-12-04 11:20 |
Tokyo | Kyoto Univ. Tokyo Office | An artificial bee colony optimization algorithm for solving maximum power point tracking problems Masataka Kojima, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2014-110 |
In the photovoltaic power generation systems, it is required that an operating point to maximize the output power valu... [more] |
NLP2014-110 pp.63-68 |
| NLP | 2014-07-01 11:00 |
Miyagi | Tohoku Univ. | Solving dynamic optimization problems using an artificial bee colony with a memory scheme Masataka Kojima, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2014-29 |
Dynamic Optimization Problems (DOPs) are the problems of optimizing the function values of the time varying objective fu... [more] | NLP2014-29 pp.47-52 |
| COMP | 2013-12-21 16:30 |
Okinawa | Okinawa Industry Support Center | Label Size Maximization for Square Labels on Rotating Maps Yusuke Yokosuka, Keiko Imai (Chuo Univ.) COMP2013-59 |
Map labeling is a problem of placing labels at corresponding graphical features on a map. There are two optimization pro... [more] | COMP2013-59 pp.131-135 |
| NC, MBE (Joint) |
2013-07-20 11:50 |
Tokushima | The University of Tokushima | A method of intensity-modulated radiation therapy planning using nonlinear dynamical system Yoshihiro Tanaka, Ken'ichi Fujimoto, Tetsuya Yoshinaga (Univ. of Tokushima) MBE2013-35 |
The intensity-modulated radiation therapy (IMRT) plans include an optimization strategy for minimizing an objective func... [more] | MBE2013-35 pp.47-52 |
| NLP | 2013-05-28 09:50 |
Fukuoka | Event hall, Central Library, Fukuoka University | An Improved Artificial Bee Colony Optimizer for Dynamic Optimization Problems Masataka Kojima, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2013-20 |
Artificial Bee Colony (ABC) is a fast and robust algorithm to solve various optimization problems with complex nonlinear... [more] | NLP2013-20 pp.59-64 |
| COMP, IPSJ-AL | 2013-05-18 16:30 |
Hokkaido | Otaru University of Commerce | Label Size Maximization for Rotating Maps Yusuke Yokosuka, Keiko Imai (Chuo Univ.) COMP2013-18 |
Map labeling is a problem of placing labels at the corresponding graphical features in a map. There are two optimizati... [more] |
COMP2013-18 pp.157-162 |
| NLP | 2010-10-28 14:15 |
Osaka | Osaka University Machikaneyama Hall | A Potential Game Based Method for Solving Nonlinear Optimization Problems under Convex Constraints Naoki Hayashi, Toshimitsu Ushio, Takafumi Kanazawa (Osaka Univ.) NLP2010-87 |
We consider a nonlinear optimization problem which has both convex and non-constrained variables. We show that the nonli... [more] | NLP2010-87 pp.37-40 |
| NLP | 2008-03-28 13:30 |
Hyogo | A New Chaotic Algorithm for Solving Traveling Salesman Problems by Using 2-opt and Or-opt Algorithms Takafumi Matsuura, Tohru Ikeguchi (Saitama Univ.) NLP2007-173 |
To nd the near optimum solutions of TSPs, a method introducing chaotic neurodynamics for solving TSPs has already been ... [more] | NLP2007-173 pp.37-42 |
|
| NC, MBE (Joint) |
2008-03-13 15:00 |
Tokyo | Tamagawa Univ | Appling dynamic representation to solving QAP in ID model Takahiro Sota, Yoshihiro Hayakawa, Koji Nakajima (Tohoku Univ.) NC2007-171 |
We have solved combinatorial optimization problems by using the Inverse function Delayed model (ID model). When obtainin... [more] | NC2007-171 pp.349-354 |
| NLP | 2005-12-16 15:35 |
Ibaraki | Ibaraki Univ. | Discrete ID model based on asynchronous update Hirokazu Nagashima, Yoshihiro Hayakawa, Koji Nakajima (RIEC Tohoku Univ.) |
It is a problem not escaping from a local minimum when the combinatiorial optimization problems are solved by ordinary n... [more] | NLP2005-94 pp.51-56 |
| NLP | 2005-05-17 15:45 |
Yamagata | Yamagata Univ (Yonezawa) | Parameter dependence on performance of ID model for optimization problems Akari Sato, Yoshihiro Hayakawa, Koji Nakajima (R.I.E.C., Tohoku Univ.) |
Inverse Function Delayed model used in out reserch has high performance of seaeching answer of optimization problems. Th... [more] | NLP2005-7 pp.35-39 |
[Return to Top Page]