IEICE SEARCH SYSTEM

Keyword : traveling salesman problem

Ant Colony Optimization with Memory and Its Application to Traveling Salesman Problem Rong-Long WANG Li-Qing ZHAO Xiao-Fan ZHOU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2012/03/01 Vol. E95-A No. 3 pp. 639-645 Type of Manuscript: PAPER Category: Numerical Analysis and Optimization Keyword: ant colony optimization, memory, combinatorial optimization problems, traveling salesman problem,
	Summary \| Full Text:PDF

Ant Colony Optimization with Genetic Operation and Its Application to Traveling Salesman Problem Rong-Long WANG Xiao-Fan ZHOU Kozo OKAZAKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2009/05/01 Vol. E92-A No. 5 pp. 1368-1372 Type of Manuscript: LETTER Category: Numerical Analysis and Optimization Keyword: ant colony optimization, combinatorial optimization problems, traveling salesman problem, genetic algorithm, genetic operation,
	Summary \| Full Text:PDF

Quantum Interference Crossover-Based Clonal Selection Algorithm and Its Application to Traveling Salesman Problem Hongwei DAI Yu YANG Cunhua LI Jun SHI Shangce GAO Zheng TANG
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2009/01/01 Vol. E92-D No. 1 pp. 78-85 Type of Manuscript: PAPER Category: Biocybernetics, Neurocomputing Keyword: clonal selection algorithm, quantum interference crossover, traveling salesman problem, hybrid model,
	Summary \| Full Text:PDF

An Expanded Lateral Interactive Clonal Selection Algorithm and Its Application Shangce GAO Hongwei DAI Jianchen ZHANG Zheng TANG
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2008/08/01 Vol. E91-A No. 8 pp. 2223-2231 Type of Manuscript: PAPER Category: Neural Networks and Bioengineering Keyword: clonal selection algorithm, somatic hypermutation, receptor editing, idiotype, traveling salesman problem,
	Summary \| Full Text:PDF

Improved Clonal Selection Algorithm Combined with Ant Colony Optimization Shangce GAO Wei WANG Hongwei DAI Fangjia LI Zheng TANG
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2008/06/01 Vol. E91-D No. 6 pp. 1813-1823 Type of Manuscript: PAPER Category: Biocybernetics, Neurocomputing Keyword: clonal selection algorithm, ant colony optimization, traveling salesman problem, hybridization,
	Summary \| Full Text:PDF

An Improved Clonal Selection Algorithm and Its Application to Traveling Salesman Problems Shangce GAO Zheng TANG Hongwei DAI Jianchen ZHANG
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2007/12/01 Vol. E90-A No. 12 pp. 2930-2938 Type of Manuscript: PAPER Category: Neural Networks and Bioengineering Keyword: clonal selection algorithm, distance-based somatic hypermutation, traveling salesman problem, chaotic, affinity,
	Summary \| Full Text:PDF

A New Three-Level Tree Data Structure for Representing TSP Tours in the Lin-Kernighan Heuristic Hung Dinh NGUYEN Ikuo YOSHIHARA Kunihito YAMAMORI Moritoshi YASUNAGA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2007/10/01 Vol. E90-A No. 10 pp. 2187-2193 Type of Manuscript: Special Section PAPER (Special Section on Nonlinear Theory and its Applications) Category: Optimization Keyword: traveling salesman problem, Lin-Kernighan heuristic, data structure, three-level trees,
	Summary \| Full Text:PDF

Approximating the Minmax Rooted-Subtree Cover Problem Hiroshi NAGAMOCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2005/05/01 Vol. E88-A No. 5 pp. 1335-1338 Type of Manuscript: PAPER Category: Graphs and Networks Keyword: approximation algorithm, graph algorithm, partition, subtree cover problem, traveling salesman problem,
	Summary \| Full Text:PDF

Implementation of Continuous-Time Dynamics on Stochastic Neurochip Shunsuke AKIMOTO Akiyoshi MOMOI Shigeo SATO Koji NAKAJIMA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2004/09/01 Vol. E87-A No. 9 pp. 2227-2232 Type of Manuscript: Special Section PAPER (Special Section on Nonlinear Theory and its Applications) Category: Keyword: stochastic logic, nonmonotonic neuron, continuous-time dynamics, asynchronous updating, associative memories, traveling salesman problem, large scale integration (LSI) implementation,
	Summary \| Full Text:PDF

A Gradient Ascent Learning Algorithm for Elastic Nets Zheng TANG Jia Hai WANG Qi Ping CAO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2003/04/01 Vol. E86-A No. 4 pp. 940-945 Type of Manuscript: PAPER Category: Neural Networks and Bioengineering Keyword: elastic net, traveling salesman problem, gradient ascent learning, optimization problems,
	Summary \| Full Text:PDF

An "Optimal" Hopfield Network for Combinatorial Optimization and Its Approximate Realization Satoshi MATSUDA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2000/06/20 Vol. E83-A No. 6 pp. 1211-1221 Type of Manuscript: PAPER Category: Graphs and Networks Keyword: Hopfield network, optimal Hopfield network, combinatorial optimization, traveling salesman problem,
	Summary \| Full Text:PDF

Cooperative Search Based on Pheromone Communication for Vehicle Routing Problems Hidenori KAWAMURA Masahito YAMAMOTO Tamotsu MITAMURA Keiji SUZUKI Azuma OHUCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1998/06/20 Vol. E81-A No. 6 pp. 1089-1096 Type of Manuscript: Special Section PAPER (Special Section of Papers Selected from ITC-CSCC'97) Category: Artificial Intelligence and Knowledge Keyword: multi-agent system, vehicle routing problem, traveling salesman problem, combinatorial optimization problem, local search algorithm,
	Summary \| Full Text:PDF

Performance Analysis of a New Genetic Crossover for the Traveling Salesman Problem Kengo KATAYAMA Hisayuki HIRABAYASHI Hiroyuki NARIHISA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1998/05/20 Vol. E81-A No. 5 pp. 738-750 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: genetic algorithm, traveling salesman problem, complete subtour exchange crossover, common subtour,
	Summary \| Full Text:PDF

Improving the Hopfield Model for TSP Feasible Solutions by Synapse Dynamical Systems Yoshikane TAKAHASHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1996/05/20 Vol. E79-A No. 5 pp. 694-708 Type of Manuscript: PAPER Category: Neural Networks Keyword: Hopfield model, traveling salesman problem, feasible solutions, synapse dynamical systems, continuous optimization problems,
	Summary \| Full Text:PDF

Parallel Genetic Algorithms Based on a Multiprocessor System FIN and Its Application Myung-Mook HAN Shoji TATSUMI Yasuhiko KITAMURA Takaaki OKUMOTO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1995/11/20 Vol. E78-A No. 11 pp. 1595-1605 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: parallel processing, genetic algorithm, multiprocessor, traveling salesman problem,
	Summary \| Full Text:PDF

The Scheduling of the Parameters in Hopfield Neural Networks with Fuzzy Control Tomoyuki UEDA Kiyoshi TAKAHASHI Chun-Ying HO Shinsaku MORI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1994/08/20 Vol. E77-D No. 8 pp. 895-903 Type of Manuscript: PAPER Category: Artificial Intelligence and Cognitive Science Keyword: Hopfield neural network, scheduling, fuzzy control, traveling salesman problem,
	Summary \| Full Text:PDF

A Neural Network with a Function of lnhibiting Subtours on TSP Akira YAMAMOTO Masaya OHTA Hiroshi UEDA Akio OGIHARA Kunio FUKUNAGA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1993/12/20 Vol. E76-A No. 12 pp. 2068-2071 Type of Manuscript: Special Section LETTER (Special Section of Letters Selected from the 1993 IEICE Fall Conference) Category: Keyword: neural network, traveling salesman problem, elimination of subtours,
	Summary \| Full Text:PDF