Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
NLP |
2024-05-09 15:05 |
Kagawa |
Kagawa Prefecture Social Welfare Center |
A Gray Wolf Optimization Method with Adaptive Large Neighborhood Search for the Traveling Salesman Problems Rikuto Shibutani, Takayuki Kimura (NIT) NLP2024-5 |
In solving the Traveling Salesman Problem (TSP), the Gray Wolf Optimization method has shown better performance, but it ... [more] |
NLP2024-5 pp.19-24 |
AI |
2024-03-01 13:40 |
Aichi |
Room0221, Bldg.2-C, Nagoya Institute of Technology |
Applying Graph Neural Networks and Reinforcement Learning to the Multiple Depot-Multiple Traveling Salesman Problem Dongyeop Kim, Toshihiro Matsui (NITech) AI2023-39 |
In this study, we introduce a method combining Graph Neural Networks (GNN) and reinforcement learning for the Multiple D... [more] |
AI2023-39 pp.13-18 |
NC, IBISML, IPSJ-BIO, IPSJ-MPS [detail] |
2023-07-01 10:20 |
Okinawa |
OIST Conference Center (Primary: On-site, Secondary: Online) |
Solving the Traveling Salesman Problem Using Oscillator Interaction Tomoaki Kinugasa (Tohoku Univ), Futo Ono, Kazuhiro Sakamoto (TMPU) NC2023-23 IBISML2023-23 |
In this study, a single Kuramoto oscillator is considered as a city, and the traveling salesman problem is tackled using... [more] |
NC2023-23 IBISML2023-23 pp.149-152 |
NLP |
2023-05-13 11:15 |
Fukushima |
Kenshin Koriyama Cultural Center (Koriyama, Fukushima) |
Parameter adjustment methods of ACO based on moving costs in time-dependent TSP Teppei Yamauchi, Hidehiro Nakano (Tokyo City Univ.) NLP2023-4 |
The Time Dependent Traveling Salesman Problem (TDTSP) is a combinatorial optimization problem with dynamically changing ... [more] |
NLP2023-4 pp.16-19 |
NLP, MSS |
2023-03-15 16:35 |
Nagasaki |
(Primary: On-site, Secondary: Online) |
An Trial to Replace Chaotic Neural Networks with Hidden Markov Models.
-- A Case of Method for Solving Asymmetric Traveling Salesman Problems -- Toshihiro Tachibana, Tomoya Matsuno (Shonan Inst. of Tech.), Masaharu Adachi (Tokyo Denki Univ.), Kaya Nagasawa (Shonan Inst. of Tech.) MSS2022-78 NLP2022-123 |
We have proposed a method for adaptive switching between multiple methods using chaotic neural networks. Our research ha... [more] |
MSS2022-78 NLP2022-123 pp.81-84 |
MSS, NLP |
2022-03-29 13:00 |
Online |
Online |
A Relation between Gap and City Layout for Asymmetric Traveling Salesman Problems Using Hidden Markov Models Toshihiro Tachibana, Tomoya Matsuno (Shonan Inst. of Tech.), Masaharu Adachi (Tokyo Denki Univ.) MSS2021-74 NLP2021-145 |
We have proposed several methods for solving asymmetric traveling salesman problems and multi-objective optimization pro... [more] |
MSS2021-74 NLP2021-145 pp.101-104 |
CAS, ICTSSL |
2021-01-29 10:10 |
Online |
Online |
Consideration of Switching by Chaotic Neurodynamics for Asymmetric TSPs by using Hidden Markov Model Tomoya Matsuno, Toshihiro Tachibana (Shonan Inst. of Tech.), Masaharu Adachi (Tokyo Denki Univ.) CAS2020-59 ICTSSL2020-44 |
Several methods for solving the asymmetric traveling salesman problem using chaotic neural networks is proposed by Tachi... [more] |
CAS2020-59 ICTSSL2020-44 pp.107-110 |
CAS, ICTSSL |
2021-01-29 10:30 |
Online |
Online |
A Method for Solving Traveling Salesman Problems Using Switching of Crossover by Chaotic Neurodynamics Masayuki Kashiwagi, Tomoki Ishizawa, Toshihiro Tashibana (Shonan Inst. of Tech.) CAS2020-60 ICTSSL2020-45 |
In this paper, we solve traveling salesman problems using genetic algorithm. The genetic algorithm is a heuristic method... [more] |
CAS2020-60 ICTSSL2020-45 pp.111-114 |
VLD, DC, CPSY, RECONF, ICD, IE, IPSJ-SLDM, IPSJ-EMB, IPSJ-ARC (Joint) [detail] |
2019-11-14 14:15 |
Ehime |
Ehime Prefecture Gender Equality Center |
Solving Traveling Salesman Problem Using Grid Partitioning via Ising-Model based Solver Akira Dan, Takeshi Nishikawa, Takashi Sato (Kyoto Univ.) VLD2019-40 DC2019-64 |
Ising-model based solver is gaining increasing attention
for its efficiency in finding approximate solutions for
com... [more] |
VLD2019-40 DC2019-64 pp.97-102 |
ICD, CPSY, CAS |
2018-12-21 16:00 |
Okinawa |
|
Accelerating the Held-Karp Algorithm for the symmetric traveling salesman problem Kazuro Kimura, Shinya Higa, Masao Okita, Fumihiko Ino (Osaka Univ.) CAS2018-84 ICD2018-68 CPSY2018-50 |
In this paper, we propose an acceleration method for the Held-Karp algorithm that solves the symmetric traveling salesma... [more] |
CAS2018-84 ICD2018-68 CPSY2018-50 pp.31-36 |
MSS, CAS, IPSJ-AL [detail] |
2018-11-12 14:25 |
Shizuoka |
|
A Study on Spin Update Method of Ising Model Yuki Naito, Kunihiro Fujiyoshi (TUAT) CAS2018-61 MSS2018-37 |
Ising model, which consists of spins and interactions of them, is a novel way to solve combinatorial optimization proble... [more] |
CAS2018-61 MSS2018-37 pp.19-24 |
MVE |
2018-10-26 15:00 |
Hokkaido |
|
Planning Movement of a Camera for Finding People in an Office Enviroment Koki Sakata, Koh Kakusho (Kwansei Gakuin Univ), Masaaki Iiyama (Kyoto Univ), Satoshi Nishiguchi (Osaka Institute of Technology Univ) MVE2018-37 |
This article discusses motion planning for a camera equipped on a mobile platform such as a drone to find a certain pers... [more] |
MVE2018-37 pp.105-110 |
NLP, CCS |
2018-06-10 09:30 |
Kyoto |
Kyoto Terrsa |
Performance Analysis of a Coherent Ising Machine with Hardware Constraints Hirotake Ito, Yukio Murata (TUS), Hiroki Takesue (NTT), Kazuyuki Aihara (TU), Mikio Hasegawa (TUS) NLP2018-39 CCS2018-12 |
A fast solution method of combinational optimization problem using a Coherent Ising Machine has been developed. A method... [more] |
NLP2018-39 CCS2018-12 pp.63-68 |
MSS, NLP (Joint) |
2018-03-14 15:20 |
Osaka |
|
Method for Solving Asymmetric Traveling Salesman Problems by Dynamically Changes the Number of Cities Consider as One City Toshihiro Tachibana (Shonan Inst. of Tech.), Masaharu Adachi (Tokyo Denki Univ.) NLP2017-113 |
In this paper, the authors extend a proposed method for asymmetric traveling salesman problems. Asymmetric traveling sal... [more] |
NLP2017-113 pp.61-66 |
CCS |
2017-03-10 10:30 |
Tokyo |
ELSI, TITECH |
Solving Asymmetric Traveling Salesman Problems by Coherent Ising Machine Yukio Murata (Tokyo Univ. of Science), Hiroyuki Yasuda (Univ. of Tokyo), Kaori Kuroda (Tokyo Univ. of Science), Kazuyuki Aihara (Univ. of Tokyo), Mikio Hasegawa (Tokyo Univ. of Science) CCS2016-46 |
The effectiveness of high-speed combinatorial optimization method using Coherent Ising Machine (CIM) has been shown. Hop... [more] |
CCS2016-46 pp.7-12 |
NS, IN (Joint) |
2016-03-03 11:00 |
Miyazaki |
Phoenix Seagaia Resort |
Method for Determining Traveling Route in Consideration of Number of Users for Message Ferry Using UAV Tomohiro Kondo, Takuji Tachibana (Univ. of Fukui) NS2015-185 |
In delay tolerant networks (DTN) where Unmanned Aerial Vehicle (UAV) is used as message ferry, users can transmit data t... [more] |
NS2015-185 pp.99-104 |
NLP |
2015-04-23 15:00 |
Kagawa |
Kagawa Social Welfare Center |
Bee Algorithm using Voronoi Diagram Masafumi Uemura, Haruna Matsushita (Kagawa Univ) NLP2015-9 |
We propose the Bee Algorithm using Voronoi Diagram(BAVD). The Bee Algorithm (BA) is a populationbased search algorithm a... [more] |
NLP2015-9 pp.39-42 |
IBISML |
2014-11-18 15:00 |
Aichi |
Nagoya Univ. |
[Poster Presentation]
Enumerating all the optimal solutions of multiple travelling salesman problem by using simpath algorithm Masashi Ogawa, Masato Inoue (Waseda Univ.) IBISML2014-78 |
In this manuscript, we propose an exact method which answers all the optimal solutions of "multiple traveling salesman p... [more] |
IBISML2014-78 pp.321-328 |
NC |
2012-10-04 17:45 |
Fukuoka |
Kyushu Institute of Technology (Wakamatsu Campus) |
An Application of the Virtual Magnetic Diminuendo Method to Combinatorial Optimization Problems
-- Towards Autonomous System for Effective Assignment -- Hiroshi Wakuya, Taichi Inoue, Hideaki Itoh, Hisao Fukumoto, Tatsuya Furukawa (Saga Univ.) NC2012-48 |
In general, there are quite a lot of constraints, when we try to solve actual combinatorial optimization problems. A fa... [more] |
NC2012-48 pp.67-72 |
NLP |
2012-04-20 11:35 |
Mie |
Ise City Plaza |
Bee Colony Optimization with Switching Role and Responsibility Yudai Shirasaki, Yoko Uwate, Yoshifumi Nishio (Tokushima Univ.) NLP2012-16 |
In previous study, we proposed Bee Colony Optimization with Role and Responsibility(BCORR) as new Bee Colony Optimizatio... [more] |
NLP2012-16 pp.83-87 |