.png){kind=icon}
返回
An imprecise Multi-Objective Genetic Algorithm for uncertain Constrained Multi-Objective Solid Travelling Salesman Problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2015.10.019.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, an imprecise Multi-Objective Genetic Algorithm (iMOGA) is developed to solve Constrained Multi-Objective Solid Travelling Salesman Problems (CMOSTSPs) in crisp, random, random-fuzzy, fuzzy-random and bi-random environments. In the proposed iMOGA, '3- and 5-level linguistic based age oriented selection', 'probabilistic selection' and an 'adaptive crossover' are used along with a new generation dependent mutation. In each environment, some sensitivity studies due to different risk/discomfort factors and other system parameters are presented. To test the efficiency, combining same size single objective problems from standard TSPLIB, the results of such multi-objective problems are obtained by the proposed algorithm, simple MOGA (Roulette wheel selection, cyclic crossover and random mutation), NSGA-II, MOEA-D/ACO and compared. Moreover, a statistical analysis (Analysis of Variance) is carried out to show the supremacy of the proposed algorithm. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
CMOSTSP
Fuzzy set based selection
Adaptive crossover
Generation dependent mutation
iMOGA
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
Novel dual labelled nanoprobes for nanosafety studies: Quantification and imaging experiment of CuO nanoparticles in C. elegans.png)
Chemosphere
ChemosphereIF0
PREAI
分享收藏Ethnobotanical profiles of wild edible plants recorded from Mongolia by Yunatov during 1940–1951
OAAI
OAAI分享收藏分享收藏
分享收藏Design and analysis of stochastic local search for the multiobjective traveling salesman problemOAAI
OAAI分享收藏An efficient genetic algorithm for the traveling salesman problem with precedence constraints具有优先约束的旅行商问题的有效遗传算法
PREAI
分享收藏
查看更多内容