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 26  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
NLP, MSS 2023-03-16
11:00
Nagasaki
(Primary: On-site, Secondary: Online)
A Method of Solving Posting Poster Problem for Public Office Election Using Min-max Type Objective Function
Fengkai Guo, Honami Tsushima (Tokyo univ. of science), Jun Adachi, Takafumi Matsuura, Takayuki Kimura (Nippon Institute of Technology), Tohru Ikeguchi (Tokyo univ. of science) MSS2022-83 NLP2022-128
To realize effective posting process of posters in public office elections, we have already proposed the Posting Poster ... [more] MSS2022-83 NLP2022-128
pp.104-109
NC, NLP 2023-01-28
09:50
Hokkaido Future University Hakodate
(Primary: On-site, Secondary: Online)
Performance evaluation of success-history based parameter adaptation for differential evolution for multi-objective optimization problems
Yusuke Matsuzaki, Jun Adachi, Takafumi Matsuura, Takayuki Kimura (NIT) NLP2022-81 NC2022-65
A Multi-objective Optimization Problems (MOPs) is a problem for simultaneously optimizing objective functions with diffe... [more] NLP2022-81 NC2022-65
pp.1-6
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
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
NLP, NC
(Joint)
2020-01-23
15:20
Okinawa Miyakojima Marine Terminal Simulation of A Taxi Ridesharing Problem Considering with Refusal of Carpool of Users
Hisashi Abiko, Takayuki Kimura, Takafumi Matsuura (NIT) NLP2019-84
 [more] NLP2019-84
pp.1-6
NLP, NC
(Joint)
2020-01-23
16:00
Okinawa Miyakojima Marine Terminal A Control Method for Searching for A Feasible and An Infeasible Solution Space of A multiple-Vehicle Bike Sharing System Routing Problem
Honami Tsushima, Takayuki Kimura, Takafumi Matsuura (NIT) NLP2019-86
To adjust the number of bicycles at each ports in the Bike Sharing System, we have already defined a multiple-Vehicle Bi... [more] NLP2019-86
pp.13-18
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 2015-05-18
15:20
Aomori Yu-sa Asamushi A Method for Deciding Feasible Solution of Quadratic Assignment Problem from Mutually Connected Chaotic Neural Network
Takafumi Matsuura (Nippon Inst. of Tech.), Tohru Ikeguchi (Tokyo Univ. Sci.) NLP2015-31
For finding good near-optimal solutions of quadratic assignment problems (QAPs), a heuristic method which uses a mutuall... [more] NLP2015-31
pp.23-28
NLP 2013-12-07
11:15
Overseas City University of Hong Kong Chaotic Motif Sampler by Using Chaotic Nerodynamics for Solving Motif Extraction Problem
Takafumi Matsuura (Tokyo Univ. of Science), Tohru Ikeguchi (Saitama Univ.) NLP2013-127
 [more] NLP2013-127
pp.75-80
NLP 2013-10-28
15:30
Kagawa Sanport Hall Takamatsu Solution Decision Method of Quadratic Assignment Problem from Mutually Connected Chaotic Neural Network
Takafumi Matsuura (Tokyo Univ. of Science), Tohru Ikeguchi (Saitama Univ.) NLP2013-83
 [more] NLP2013-83
pp.73-78
NLP 2013-07-09
10:25
Okinawa Miyako Island Marine Terminal Heuristic Method Using Soft Tabu Search for Quadratic Assignment Problems
Takafumi Matsuura (Tokyo University of Science), Tohru Ikeguchi (Saitama Univ.), Kazumiti Numata (Tokyo University of Science) NLP2013-39
 [more] NLP2013-39
pp.69-74
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
14:50
Kagoshima   Solving Traveling Salesman Problem Using 2-opt and Or-opt Algorithms Driven by Chaotic Neurons
Takafumi Matsuura, Tohru Ikeguchi (Saitama Univ.) NLP2009-93
To find near optimum solutions of TSPs, a method with chaotic neurodynamics for solving TSPs has already been proposed. ... [more] NLP2009-93
pp.61-66
NLP 2009-05-15
16:10
Shiga Ritsumeikan University Parameter Adjusting of the Chaotic Search Method to Multiple Sequence Alignment
Takafumi Matsuura, Tohru Ikeguchi (Saitama Univ.) NLP2009-10
An algorithm for solving combinatorial optimization problems by chaotic neurodynamics has already been proposed and exhi... [more] NLP2009-10
pp.45-50
NLP 2009-05-15
16:45
Shiga Ritsumeikan University Solving Quadratic Assignment Problems by Chaotic Neural Network with Dynamical Noise
Takayuki Suzuki, Shun Motohashi, Takafumi Matsuura, Tohru Ikeguchi (Saitama Univ.) NLP2009-11
The quadratic assignment problem (QAP) is one of the most difficult
NP-hard combinatorial optimization problems.
T... [more]
NLP2009-11
pp.51-56
NLP 2009-05-15
17:10
Shiga Ritsumeikan University A Solution-Space Reduction Method for Traveling Salesman Problem Using Geographical Threshold Graph with Neighbor Information
Yusuke Kawamura, Takafumi Matsuura, Tohru Ikeguchi (Saitama Univ.) NLP2009-12
Traveling Salesman Problem (TSP) is
one of the most typical combinatorial optimization problems
which belong to a clas... [more]
NLP2009-12
pp.57-62
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
 Results 1 - 20 of 26  /  [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