| 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 # | |
| R | 2023-05-27 15:25 |
Aichi | Aichi University (Primary: On-site, Secondary: Online) |
Iterated local search for the component assignment problem of connected-(1,2)-or-(2,1)-out-of-(m,n):F lattice systems Taishin Nakamura (Tokai Univ.)  R2023-5 |
In this study, we propose an Iterated Local Search (ILS) method for solving the component assignment problem of the conn... [more] | R2023-5 pp.21-26 |
| NLP, CAS | 2019-10-22 08:50 |
Gifu | Gifu Univ. | A Study of Grouping Procedure Using Local Search Method for Carpooling Optimization Problems Kosei Takahashi, Toshichika Aoki, Takayuki Kimura (Nippon Institute of Tech) CAS2019-23 NLP2019-63 |
Sharing a car while commuting with others is called carpool. Recently, many carpool applications such as Uber and Lyft h... [more] | CAS2019-23 NLP2019-63 pp.1-6 |
| CQ | 2014-01-24 13:35 |
Tokyo | Tokyo City University | [Poster Presentation]
A Study of Local Search Method Using The 2-opt and The Or-opt Method for Capacitated Vehicle Routing Problems Ikuma Funayama, Takayuki Kimura, Takefumi Hiraguri, Kenya Jin'no (Nippon Inst. of Tech.) CQ2013-79 |
The vehicle routing problem is the combinatorial optimization problems which aims to determine the delivery routes of th... [more] | CQ2013-79 pp.67-72 |
| MSS, SS | 2013-03-07 16:10 |
Fukuoka | Shikanoshima | Local Search Approach for Dispatch and Conflict-free Routing Problem of Capacitated AGV Systems Kensuke Inoue, Toshiyuki Miyamoto (Osaka Univ.) MSS2012-85 SS2012-85 |
In the case of routing problems of real AGV systems, some additional matters should be considered such as collision avoi... [more] | MSS2012-85 SS2012-85 pp.149-154 |
| MSS | 2013-01-23 16:10 |
Osaka | Osaka Int. Convention Center | Enhancing Local Search Algorithms for Organizing Conference Programs
-- Generating Initial Solutions and Neighborhood Swapping -- Masahiko Okumoto, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) MSS2012-58 |
Conference programs are required to satisfy wide variety of constraints and, therefore, organizing conference programs ... [more] | MSS2012-58 pp.71-76 |
| CPSY | 2011-10-21 17:00 |
Hyogo | Picking System Based on Real Time Batching Zulfazli Bin Hussin, Ryo Ohtera, Fujiichi Yoshimoto (KIC) CPSY2011-39 |
In warehouse operation, the cost of order-picking is considered about 70 percent of total operating costs. Improving th... [more] | CPSY2011-39 pp.79-84 |
|
| MSS | 2011-01-20 11:10 |
Yamaguchi | Kaikyo-Messe-Shimonoseki | Algorithm of a Controller for Multi-Car Elevators with High Transpotation Flexibility Takeshi Fujimura, Shohei Ueno, Hiroshi Tsuji, Hiroyoshi Miwa (Kwansei Gakuin Univ.) |
Recently multi-car elevator (MCE) consisting of several elevator cars in a single elevator shaft received great interest... [more] | CST2010-63 pp.25-26 |
| NS, RCS (Joint) |
2010-12-17 13:00 |
Okayama | Okayama Univ. | Ant Colony Optimization for the Node Placement Problem Keiichi Ohkura, Kengo Katayama (Okayama Univ. of Sci.), Nobuo Funabiki (Okayama Univ.), Hideo Minamihara, Noritaka Nishihara (Okayama Univ. of Sci.) NS2010-134 |
We address a problem of finding an optimal node placement that minimizes the amount of traffics reducing the weighted ho... [more] | NS2010-134 pp.173-178 |
| COMP | 2010-03-12 13:20 |
Tokyo | National Institute of Informatics | On the standard local search for the independent set problem on d-claw free graphs Kazuyuki Kitayama, Toshihiro Fujito (Toyohashi Univ. of Tech.) COMP2009-54 |
The independent set problem in graphs is such an NP-hard problem that is known to be hard even to approximate effectiv... [more] |
COMP2009-54 pp.33-38 |
| COMP | 2006-05-24 15:35 |
Fukuoka | Kyushu Institute of Technology | DNA Sequence Design by Dynamic Neighborhood Searches Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
In recent years, DNA sequence sets are used in various fields such as nanotechnology and nanocomputing. Since there are ... [more] | COMP2006-16 pp.47-54 |
| COMP | 2005-05-20 15:30 |
Fukuoka | Kyushu Univ. | Improving a local search approximation algorithm for the stable marriage problem Naoya Yamauchi, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) |
We consider the problem of finding a stable matching of maximum size when both ties and unacceptable partners are allowe... [more] | COMP2005-15 pp.45-51 |
| COMP | 2004-10-15 15:25 |
Miyagi | Tohoku University | A Local Search Algorithm for Barrier Heights Estimation in DNA computing Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
DNA computing is a new computing paradigm utilizing the transitions of DNA molecules as computation. In the context, th... [more] |
COMP2004-49 pp.41-46 |
[Return to Top Page]