IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 21  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
CCS, NLP 2020-06-05
13:00
Online Online Dynamically changing penalties method for Large-Scale multiple-Vehicle Bike Sharing System Routing Problem
Honami Tsushima (TUS), Takafumi Matsuura (NIT), Tohru Ikeguchi (TUS) NLP2020-14 CCS2020-4
In a bike sharing system (BSS) , we proposed a multiple-Vehicle Bike Sharing System Routing Problem (mBSSRP) to determin... [more] NLP2020-14 CCS2020-4
pp.19-22
NLC, IPSJ-ICS 2019-06-21
13:10
Hiroshima Hiroshima University of Economics (Tatemachi Campus) Flowchart creation from call center pseudo-interactive data using tabulation technology
Masaki Murata, Yutaro Mori (Tottori Univ.), Kazuhito Koyama (DATT JAPAN Inc.) NLC2019-1
In this research, we proposed a method of creating a flowchart that is useful for application to chat bots by using info... [more] NLC2019-1
pp.1-6
NLP 2019-05-11
10:25
Oita J:COM HoltoHALL OITA Study of A Solving Method for a Multiple Vehicle Bike Sharing System Routing Problem with Soft Constraints
Honami Tsushima, Takayuki Kimura, Takafumi Matsuura (NIT) NLP2019-12
To restore the number of bicycle in each port of the bike sharing system, we have formulated a multi- ple-Vehicle Bike S... [more] NLP2019-12
pp.65-70
NLP, NC
(Joint)
2019-01-23
14:10
Hokkaido The Centennial Hall, Hokkaido Univ. Chaos Search Method for Multiple-Vehicle Bike Sharing System Routing Problem
Honami Tsushima, Takafumi Matsuura, Takayuki Kimura (NIT) NLP2018-106
A multiple-Vehicle Bike Sharing System Routing Problem (mBSSRP) is proposed as a combinatorial optimization problem to r... [more] NLP2018-106
pp.57-62
NLP 2017-11-05
14:25
Miyagi Research Institute of Electrical Communication Tohoku University Solving latency location routing problem using exponential tabu search
Masaya Kaneko, Yuuki Morita, Hiroki Sawade, Takayuki Kimura (NIT) NLP2017-68
In this report, we propose a new solving method using an exponential tabu search
for a latency location routing prob... [more]
NLP2017-68
pp.19-24
NLP 2014-07-21
14:30
Hokkaido Hakodate City Central Library Digital Circuit Implementation of a Cost Calculation for Partial-update Exponential Chaotic Tabu Search Hardware Systems
Takeshi Miura, Masato Ozawa, Takemori Orima, Yoshihiko Horio (Tokyo Denki Univ.) NLP2014-34
The exponential chaotic tabu search is an efficient meta-heuristic algorithm for combinatorial optimization problems. Ba... [more] NLP2014-34
pp.17-22
NLP 2014-07-21
14:55
Hokkaido Hakodate City Central Library Solving Ability of Lin-Kernighan Method Driven by Chaotic Dynamics for Traveling Salesman Problems
Takahiro Mitsuoka, Mikio Hasegawa (Tokyo Univ. of Science) NLP2014-35
Effectiveness of chaos for optimization has been shown by many previous researches. In this paper, a chaotic search base... [more] NLP2014-35
pp.23-26
HCGSYMPO
(2nd)
2012-12-10
- 2012-12-12
Kumamoto Kumamoto-Shintoshin-plaza An Improvement of Creation for User's Fragrance with Interactive Tabu Search -- Investigation for the Efficient Search of Blending Aroma Sources --
Makoto Fukumoto, Keiji Kawai (Fukuoka Inst. Tech.), Makoto Inoue (Akita National College of Tech.), Jun-ichi Imai (Chiba Inst. Tech.)
Creation of media contents is one of the important targets in the area of engineering. We have already proposed a method... [more]
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
CS, SIP, CAS 2011-03-04
14:10
Okinawa Ohhamanobumoto memorial hall (Ishigaki)( [Poster Presentation] A Study on Initial Solution for Designing CSD Coefficient FIR Filters using Branch and Bound Method
Nobuo Takahashi, Kenji Suyama (Tokyo Denki Univ.) CAS2010-165 SIP2010-181 CS2010-135
In this paper, we study a selecting way of an initial solution for a fast design of FIR filters with CSD coefficients. T... [more] CAS2010-165 SIP2010-181 CS2010-135
pp.369-374
NLP 2010-03-09
11:10
Tokyo   Soft Tabu Search for Solving Traveling Salesman Problem
Takafumi Matsuura, Tohru Ikeguchi (Saitama Univ.) NLP2009-163
To avoid local minima of combinatorial optimization problems, the tabu search have been proposed. Although the tabu sear... [more] NLP2009-163
pp.31-36
NLP 2009-11-11
15:10
Kagoshima   Evaluation of Neuron Selection Techniques for Synchronous Exponential Chaotic Tabu Search for Quadratic Assignment Problems
Tetsuo Kawamura, Yoshihiko Horio (Tokyo Denki Univ.) NLP2009-94
The tabu search was implemented on a neural network with chaotic neuro-dynamics. This chaotic tabu search shows great pe... [more] NLP2009-94
pp.67-71
NLP 2009-05-15
17:35
Shiga Ritsumeikan University Solving Asymmetric TSP by Combination of Chaotic Neurodynamics and Block Shift operations
Toshihiro Tachibana, Masaharu Adachi (Tokyo Denki Univ.) NLP2009-13
In this paper, a method for solving Asymmetric Traveling Salesman Problems is proposed. Where the asymmetric TSP means t... [more] NLP2009-13
pp.63-66
RECONF, CPSY, VLD, IPSJ-SLDM 2008-01-16
16:35
Kanagawa Hiyoshi Campus, Keio University Solving the Quadratic Assignment Problem by Hardware Based on a Systolic Algorithm
Yoshihiro Kimura, Shin'ichi Wakabayashi, Shinobu Nagayama (Hiroshima City Univ.) VLD2007-114 CPSY2007-57 RECONF2007-60
For the quadratic assignment problem (QAP), a heuristic algorithm based on tabu search, which is implemented as hardware... [more] VLD2007-114 CPSY2007-57 RECONF2007-60
pp.55-60
MSS 2007-06-28
13:00
Okinawa   Cooperation and Its Effect in Parallel Tabu Search
Hidekazu Naka, Masashi Murayama, Morikazu Nakamura (Univ. of the Ryukyus) CST2007-1
This paper presents a new cooperation method in parallel tabu search.
In our parallel tabu search, multiple tabu proce... [more]
CST2007-1
pp.1-6
VLD, CPSY, RECONF, IPSJ-SLDM 2007-01-17
16:00
Tokyo Keio Univ. Hiyoshi Campus A Parallel Algorithm Based on Genetic Algorithm and Tabu Search for LSI Floorplanning and Its Implementation on a PC Cluster
Takayoshi Shimazu, Shin'ichi Wakabayashi, Shinobu Nagayama (Hiroshima City Univ.)
This paper proposes a parallel floorplanning algorithm for VLSI floorplanning, which was based on genetic algorithm (GA)... [more] VLD2006-90 CPSY2006-61 RECONF2006-61
pp.31-36
VLD, CPSY, RECONF, IPSJ-SLDM 2007-01-17
16:25
Tokyo Keio Univ. Hiyoshi Campus A Hardware Algorithm for the Quadratic Assignment Problem Based on Tabu Search Using FPGAs
Yoshihiro Kimura, Shin'ichi Wakabayashi, Shinobu Nagayama (Hiroshima City Univ.)
In this paper, a hardware algorithm for the quadratic assignment problem (QAP) based on tabu search was proposed. The p... [more] VLD2006-91 CPSY2006-62 RECONF2006-62
pp.37-42
MSS 2006-07-26
13:00
Kyoto Kyoto Institute of Technology Cooperation based on Searching History in Parallel Tabu Search
Hidekazu Naka, Morikazu Nakamura (Univ. of the Ryukyus)
Tabu Search (TS) is one of the most powerful methods in the
technique of calculating approximate solutions of
combinat... [more]
CST2006-14
pp.25-30
PN, IN
(Joint)
2005-10-13
14:00
Kanagawa Keio Univ. (Yagami) A Tabu Search Method of Logical Topology Design in IP over WDM Networks
Galy Lee (Waseda Univ.), Sugang Xu (NICT), Yoshiaki Tanaka (Waseda Univ.)
Given a static traffic condition, the motivation of logical topology design in IP over WDM networks is to optimize the n... [more] IN2005-88
pp.1-6
MSS 2005-06-30
15:20
Okinawa Jichi Kaikan(Naha) A parallel tabu search based on relinking of searched space
Hidekazu Naka, Morikazu Nakamura (Univ. of the Ryukyus)
Tabu search(TS) is one of the most powerful methods in the technique of calculating the approximate solution of combinat... [more] CST2005-5
pp.23-28
 Results 1 - 20 of 21  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan