๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient genetic algorithm for multi-objective solid travelling salesman problem under fuzziness

โœ Scribed by Changdar, Chiranjit; Mahapatra, G.S.; Kumar Pal, Rajat

Book ID
121446422
Publisher
Elsevier
Year
2014
Tongue
English
Weight
416 KB
Volume
15
Category
Article
ISSN
2210-6502

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The efficiency of hybrid mutation geneti
The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem
โœ K Katayama; H Sakamoto; H Narihisa ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 519 KB

In this paper, we present an efficient genetic algorithm (GA) for solving the travelling salesman problem (TSP) as a combinatorial optimization problem. In our computational model, we propose a complete subtour exchange crossover that does not break as some good subtours as possible, because the goo