Cart (Loading....) | Create Account
Close category search window
 

Approach to the Shortest Path with Fuzzy Constraints by Simulated Annealing Algorithm

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
$31 $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

In supply-chain management, the constrained shortest path problem in a network has wide applications. In this paper, the optimality and algorithm of the shortest path with fuzzy constraints (noted as SPFC) is studied. Introducing the fuzzy objective weight of a path into the objective function, an integer fuzzy optimization model is established for the SPFC problem. Then a simulated annealing algorithm is given to solve the problem. And the numerical simulation of example demonstrates the feasibility and effectiveness of the approach.

Published in:

Intelligent Systems, 2009. GCIS '09. WRI Global Congress on  (Volume:1 )

Date of Conference:

19-21 May 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.