Presentation 2006-03-20
Solving vehicle routing problems with soft time windows using chaotic neurodynamics
Takashi HOSHINO, Takayuki KIMURA, Tohru IKEGUCHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We proposed a new algorithm for solving vehicle routing problems(VRP) with soft time windows using chaotic neurodynamics. First, we constructed a neural network which works in the same way as the tabu search strategy. Then, we extended its dynamics to chaotic dynamics. We evaluated the proposed method for several instances of vehicle routing problems by computer simulations. As a result, we show that the proposed method can solve VRPs with high performance, which means that chaotic neurodynamics is very effective for solving VRPs as well as for solving TSPs and QAPs.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) vehicle vouting problem / chaos / dynamics / chaotic neural network / tabu search
Paper # NLP2005-140
Date of Issue

Conference Information
Committee NLP
Conference Date 2006/3/13(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Nonlinear Problems (NLP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Solving vehicle routing problems with soft time windows using chaotic neurodynamics
Sub Title (in English)
Keyword(1) vehicle vouting problem
Keyword(2) chaos
Keyword(3) dynamics
Keyword(4) chaotic neural network
Keyword(5) tabu search
1st Author's Name Takashi HOSHINO
1st Author's Affiliation Faculty of Engineering, Saitama University()
2nd Author's Name Takayuki KIMURA
2nd Author's Affiliation Graduate School of Science and Engineering, Saitama University
3rd Author's Name Tohru IKEGUCHI
3rd Author's Affiliation Faculty of Engineering, Saitama University:Graduate School of Science and Engineering, Saitama University
Date 2006-03-20
Paper # NLP2005-140
Volume (vol) vol.105
Number (no) 675
Page pp.pp.-
#Pages 6
Date of Issue