This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Simulated Annealing Approach for the Constrained Shortest Path with Fuzzy Arc and Node Weights
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
The constrained shortest path problem in a network with fuzzy arc and node weights, abbreviated as the CSP problem, has important applications in modern logistics and supply-chain management, which is known to be NP-hard. In this paper, a fuzzy integer optimization model is established for the CSP problem with the improved decision variables, which will reduce the space complexity. Then the fuzzy objective weight of a directed path is introduced in the objective function, and the penalty function method is adopted to deal with the constraints. Hence, an unconstrained programming is proposed for the CSP problem, which is solved by a simulated annealing algorithm. Finally, the computational results demonstrate the efficiency and feasibility of the algorithm.
Citation:
Jie Su, Aihua Li, "Simulated Annealing Approach for the Constrained Shortest Path with Fuzzy Arc and Node Weights," csie, vol. 4, pp.754-758, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.