Name
Title | ||
|---|---|---|
Constrained Solid Travelling Salesman Problem Solving by Rough GA Under Bi-Fuzzy Coefficients. |
Abstract | ||
|---|---|---|
In this paper, a Rough Genetic Algorithm (RGA) is proposed to solve constrained solid travelling salesman problems (CSTSPs) in crisp and bi-fuzzy coefficients. In the proposed RGA, we developed a 'rough set based selection' (7-point scale) technique and 'comparison crossover' with new generation dependent mutation. A solid travelling salesman problem (STSP) is a tavelling salesman problem (TSP) in which, at each station, there are a number of conveyances available to travel to another station. The costs and risk/discomforts factors are in the form of crisp, bi-fuzzy in nature. In this paper, CSTSPs are illustrated numerically by some standard test data from TSPLIB using RGA. In each environment, some statistical significance studies due to different risk/discomfort factors and other system parameters are presented. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-81-322-2695-6_36 | PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON FRONTIERS IN INTELLIGENT COMPUTING: THEORY AND APPLICATIONS (FICTA) 2015 |
Keywords | DocType | Volume |
Rough selection,RGA,Generation dependent mutation,STSP,CSTSP | Conference | 404 |
ISSN | Citations | PageRank |
2194-5357 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Samir Maity | 1 | 13 | 2.27 |
| Arindam Roy | 2 | 0 | 0.34 |
| Manoranjan Maiti | 3 | 514 | 47.77 |