The shortest path problem is an important classical network optimization problem arising from many applications. In many cases, however, some aspects of a network-theoretic problem may be uncertain. For example, the vehicle travel time or vehicle capacity on a road network may not be known exactly. In such cases, it is natural to deal with the uncertainty using fuzzy set theory. Here, we consider solving the All-Pairs Shortest Paths Problem (APSPP) in a network with fuzzy arc lengths. Making use of a suitable ranking method, we propose a new approach to solve the fuzzy APSPP using a genetic algorithm. Illustrative examples are worked out to demonstrate our proposed method.
کلید واژگان :Network, All-pairs shortest path problem, Genetic algorithm, Fuzzy sets
ارزش ریالی : 500000 ریال
با پرداخت الکترونیک
جزئیات مقاله
- کد شناسه : 6146830861644441
- سال انتشار : 2011
- نوع مقاله : مقاله کامل پذیرفته شده در کنفرانس ها
- زبان : انگلیسی
- محل پذیرش : International Conference on Industrial and Operations Management
- برگزار کنندگان : Kuala Lampur, Malaysia, January 22-24, 2011
- تاریخ ثبت : 1395/04/22 12:00:16
- ثبت کننده : رضا حسن زاده
- تعداد بازدید : 275
- تعداد فروش : 0