Abstract
ABSTRACT In this paper, we propose a simple linear multiple objective programming to deal with the fuzzy shortest path problem. The proposed approach does not need to declare 0-1 variables to solve the fuzzy shortest path problem because it meets the requirements of the network linear programming constraints. Therefore, the linear programming relaxation can be used to arrive at an integer solution without using the Branch and Bound technique, and the complexity of our proposed method can be reduced. A compromising non-dominated integer optimal solution, the fuzzy shortest path, can be obtained easily without adding extra constraints. This approach not only can obtain a fuzzy shortest path but also can reduce the complexity of solving the basic fuzzy shortest path problem without using 0-1 variables. Three examples with trapezoidal and triangular fuzzy numbers in arc length are used to demonstrate the proposed method in more details.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of the Chinese Institute of Industrial Engineers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
