By Topic

Simulated Annealing Approach for the Constrained Shortest Path with Fuzzy Arc and Node Weights

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jie Su ; Sch. of Manage. Sci. & Eng., Central Univ. of Finance & Econ., Beijing, China ; Aihua Li

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.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:4 )

Date of Conference:

March 31 2009-April 2 2009