.png){kind=icon}
返回
A Modified Genetic Algorithm for solving uncertain Constrained Solid Travelling Salesman Problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2015.02.023.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a Modified Genetic Algorithm (MGA) is developed to solve Constrained Solid Travelling Salesman Problems (CSTSPs) in crisp, fuzzy, random, random-fuzzy, fuzzy-random and bi-random environments. In the proposed MGA, for the first time, a new 'probabilistic selection' technique and a 'comparison crossover' are used along with conventional random mutation. A Solid Travelling Salesman Problem (STSP) is a Travelling Salesman Problem (TSP) in which, at each station, there are a number of conveyances available to travel to another station. Thus STSP is a generalization of classical TSP and CSTSP is a STSP with constraints. In CSTSP, along each route, there may be some risk/discomfort in reaching the destination and the salesman desires to have the total risk/discomfort for the entire tour less than a desired value. Here we-model the CSTSP with traveling costs and route risk/discomfort factors as crisp, fuzzy, random, random-fuzzy, fuzzy-random and bi-random in nature. A number of benchmark problems from standard data set, TSPLIB are tested against the existing Genetic Algorithm (with Roulette Wheel Selection (RWS), cyclic crossover and random mutation) and the proposed algorithm and hence the efficiency of the new algorithm is established. In this paper, CSTSPs are illustrated numerically by some empirical data using this algorithm. In each environment, some sensitivity studies due to different risk/discomfort factors and other system parameters are presented. (c) 2015 Elsevier Ltd. All rights reserved.
Keyword:
STSP
CSTSP
Probabilistic selection
Comparison crossover
Modified Genetic Algorithm (MGA)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
Novel dual labelled nanoprobes for nanosafety studies: Quantification and imaging experiment of CuO nanoparticles in C. elegans.png)
Chemosphere
ChemosphereIF0
PREAI
分享收藏Simulated annealing metaheuristics for the vehicle routing problem with time windows带时间窗车辆路径问题的模拟退火元启发式算法
PREAI
分享收藏An efficient genetic algorithm for the traveling salesman problem with precedence constraints具有优先约束的旅行商问题的有效遗传算法
PREAI
分享收藏分享收藏
GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem掌握对称欧几里得聚类旅行商问题的路径重链接
OAAI
OAAI分享收藏
查看更多内容