Rough Genetic Algorithm for Constrained Solid TSP with Interval Valued Costs and Times
TLDR
A rough set based age-dependent selection technique and an age-oriented min-point crossover are used along with three types of probability, p-dependent random mutations to solve constrained solid travelling salesman problems with restricted conveyances having uncertain costs and times as interval values.About:
This article is published in Fuzzy Information and Engineering.The article was published on 2018-09-24 and is currently open access. It has received 2 citations till now. The article focuses on the topics: Travelling salesman problem & Genetic algorithm.read more
Citations
More filters
Journal ArticleDOI
A Quantum-inspired Ant Colony Optimization for solving a sustainable four-dimensional traveling salesman problem under type-2 fuzzy variable
TL;DR: In this article , a Quantum-Inspired Ant Colony Optimization (Qi-ACO) is proposed to solve a sustainable four-dimensional traveling salesman problem (4DTSP), in which various paths with a different number of conveyances are available to travel between any two cities.
References
More filters
Book
Genetic algorithms in search, optimization, and machine learning
TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
Proceedings ArticleDOI
Particle swarm optimization
TL;DR: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced, and the evolution of several paradigms is outlined, and an implementation of one of the paradigm is discussed.
Genetic algorithms in search, optimization and machine learning
TL;DR: This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
Journal ArticleDOI
A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms
TL;DR: The basics are discussed and a survey of a complete set of nonparametric procedures developed to perform both pairwise and multiple comparisons, for multi-problem analysis are given.
Book
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
TL;DR: In this paper, Johnson and Papadimitriou proposed a performance guarantee for heuristics, based on the notion of well-solved special cases (P. Gilmore, et al.).