این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
Iranian Journal of Fuzzy Systems، جلد ۱۰، شماره ۱، صفحات ۱-۲۸
عنوان فارسی A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
چکیده فارسی مقاله A solid travelling salesman problem (STSP) is a travelling salesman
problem (TSP) where the salesman visits all the cities only once in his
tour using di
erent conveyances to travel from one city to another. Costs
and environmental e
ect factors for travelling between the cities using di
erent
conveyances are di
erent. Goal of the problem is to nd a complete tour
with minimum cost that damages the environment least. An ant colony optimization
(ACO) algorithm is developed to solve the problem. Performance
of the algorithm for the problem is compared with another soft computing
algorithm, Genetic Algorithm(GA). Problems are solved with crisp as well as
fuzzy costs. For fuzzy cost and environmental e
ect factors, cost function as
well as environment constraints become fuzzy. As optimization of a fuzzy objective
function is not well de ned, fuzzy possibility approach is used to get
optimal decision. To test the eciency of the algorithm, the problem is solved
considering only one conveyance facility ignoring the environmental e
ect constraint,
i.e., a classical two dimensional TSP (taking standard data sets from
TSPLIB for solving the problem). Di
erent numerical examples are used for
illustration.
کلیدواژه‌های فارسی مقاله Solid travelling salesman problem، Fuzzy possibility، Ant colony optimization، Genetic algorithm،
عنوان انگلیسی A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
چکیده انگلیسی مقاله A solid travelling salesman problem (STSP) is a travelling salesman
problem (TSP) where the salesman visits all the cities only once in his
tour using di
erent conveyances to travel from one city to another. Costs
and environmental e
ect factors for travelling between the cities using di
erent
conveyances are di
erent. Goal of the problem is to nd a complete tour
with minimum cost that damages the environment least. An ant colony optimization
(ACO) algorithm is developed to solve the problem. Performance
of the algorithm for the problem is compared with another soft computing
algorithm, Genetic Algorithm(GA). Problems are solved with crisp as well as
fuzzy costs. For fuzzy cost and environmental e
ect factors, cost function as
well as environment constraints become fuzzy. As optimization of a fuzzy objective
function is not well de ned, fuzzy possibility approach is used to get
optimal decision. To test the eciency of the algorithm, the problem is solved
considering only one conveyance facility ignoring the environmental e
ect constraint,
i.e., a classical two dimensional TSP (taking standard data sets from
TSPLIB for solving the problem). Di
erent numerical examples are used for
illustration.
کلیدواژه‌های انگلیسی مقاله Solid travelling salesman problem, Fuzzy possibility, Ant colony optimization, Genetic algorithm
نویسندگان مقاله Chiranjit Changdar |
Department of Computer Science, Raja N.L. Khan Women's College, Midnapore, Paschim- Medinipur, West Bengal, India-721102

Manas Kumar Maiti |
Department of Mathematics, Mahishadal Raj College, Mahishadal, Purba- Medinipur, West Bengal, India-721628

Manoranjan Maiti |
Department of Mathematics, Vidyasagar University, Midnapore, Paschim- Medinipur, West Bengal, India-721102

نشانی اینترنتی http://ijfs.usb.ac.ir/article_153_100415578c754927aaf8d608b87dfdd1.pdf
فایل مقاله فایلی برای مقاله ذخیره نشده است
کد مقاله (doi)
زبان مقاله منتشر شده en
موضوعات مقاله منتشر شده
نوع مقاله منتشر شده
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات