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  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 58  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
NLP, CCS 2021-06-11
11:25
Online Online The Electric Vehicle Routing Problems with Time Windows Using Optimized Charging Methods for Vehicle's Batteries
Jun Adachi, Takayuki Kimura (NIT)
 [more]
MSS, NLP
(Joint)
2020-03-10
13:55
Aichi  
(Cancelled but technical report was issued)
Performance Investigation of A Routing Method Using Network Path Length
Daiki Ebisawa, Akinori Yoshida, Takayuki Kimura (Nippon Institute of Tech) NLP2019-129
 [more] NLP2019-129
pp.95-98
MSS, NLP
(Joint)
2020-03-10
14:20
Aichi  
(Cancelled but technical report was issued)
Performance Investigation of A Routing Method in Realistic Network Topology
Shota Yukita, Yoshiya Uchino, Takayuki Kimura (Nippon Institute of Tech) NLP2019-130
 [more] NLP2019-130
pp.99-102
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
15:40
Okinawa Miyakojima Marine Terminal A Study of Congestion Avoidance Method Using Transmission History Information
Akinori Yoshida, Toshichika Aoki, Takayuki Kimura (Nippon Institute of Tech) NLP2019-85
To avoiding the packet congestion, the efficient routing method using transmission history information has already been ... [more] NLP2019-85
pp.7-12
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, 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
NLP 2019-09-23
12:55
Kochi Eikokuji Campus, University of Kochi Performance Investigation of A Routing Method Using Chaotic Neurodynamics for Various Probability Distributions
Yoshiya Uchino, Toshichika aoki, Takayuki Kimura (Nippon Institute of Tech) NLP2019-41
Recently, the number of flowing packets in the network increases, and this causes a packet congestion. For avoiding the ... [more] NLP2019-41
pp.31-36
CCS, NLP 2019-06-09
12:00
Niigata machinaka campus nagaoka Characteristic Measures in Optimized Power Grid Using Simulated Annealing
Toshichika Aoki (Nippon Institute of Tec.), Hideyuki Kato (Oita Univ.), Takayuki Kimura (Nippon Institute of Tec.) NLP2019-32 CCS2019-15
The electric power generated at power plants to surrounding consumers are the most important in- frastructure for a comf... [more] NLP2019-32 CCS2019-15
pp.69-74
NLP 2019-05-10
16:25
Oita J:COM HoltoHALL OITA A Shortest Path Heuristic Using Network Centralities
Misa Fujita (TUS), Takayuki Kimura (NIT), Tohru Ikeguchi (TUS) NLP2019-8
A distance network heuristic and a shortest path heuristic are one of the popular construction methods for solving the S... [more] NLP2019-8
pp.41-46
NLP 2019-05-11
10:00
Oita J:COM HoltoHALL OITA A study of spreading information in different network structures
Ryu Uto, Toshichika Aoki, Takayuki Kimura (Nippon Institute of Tech) NLP2019-11
In cases many people are in disaster,
they are difficult to figure out whether obtained information is real or not.
If... [more]
NLP2019-11
pp.59-64
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
13:50
Hokkaido The Centennial Hall, Hokkaido Univ. A Solving Method using The Chaos Search for The Vehicle Routing Problems with Soft Time Window Constraints
Daiki Watanabe, Takayuki Kimura (NIT) NLP2018-105
Because of rapid increase of delivery goods and truck driver shortage, efficient delivery routes that minimize vehicle u... [more] NLP2018-105
pp.51-56
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
CAS, NLP 2018-10-18
14:40
Miyagi Tohoku Univ. An application of a differential evolution SHADE to multi-objective optimization problems
Yuuichitou Ooto, Takayuki Kimura (NIT) CAS2018-44 NLP2018-79
An objective of the Multi-objective Optimization Problem is to nd the optimal Pareto solution under the situation that ... [more] CAS2018-44 NLP2018-79
pp.39-44
CAS, NLP 2018-10-18
15:30
Miyagi Tohoku Univ. Solvable Performance and Refractory Effects of Neural Networks for Solving the Steiner Tree Problem in Graphs
Misa Fujita (TUS), Takayuki Kimura (NIT), Tohru Ikeguchi (TUS) CAS2018-46 NLP2018-81
(To be available after the conference date) [more] CAS2018-46 NLP2018-81
pp.51-56
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 2017-11-05
16:35
Miyagi Research Institute of Electrical Communication Tohoku University A routing method using transmission history information and betweenness centrality
Yuuki Morita, Takayuki Kimura (NIT) NLP2017-72
The combinatorial optimization problem is classified into two types: a static combinatorial optimization problem and a d... [more] NLP2017-72
pp.41-46
NLP 2017-07-14
10:50
Okinawa Miyako Island Marine Terminal A packet routing method using Learning Ability for Load Balancing
Hiroki Sawade, Takayuki Kimura (Nippon Inst. of Tech.) NLP2017-41
The number of Internet users continues to increase and the packet congestion frequently occurs in the communication netw... [more] NLP2017-41
pp.73-78
NLP 2017-07-14
15:15
Okinawa Miyako Island Marine Terminal An Influence of Mutation Distribution for Evolutionary Algorithm
Yuuichirou Ooto, Yuuki Morita, Hiroki Sawade, Takayuki Kimura (NIT) NLP2017-48
When solving the benchmark problems in which objective functions sharply fluctuate near optimum values, the Strength Par... [more] NLP2017-48
pp.107-112
 Results 1 - 20 of 58  /  [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