Filters








771 Hits in 7.6 sec

A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover [chapter]

Darrell Whitley, Doug Hains, Adele Howe
2010 Parallel Problem Solving from Nature, PPSN XI  
We present a hybrid Genetic Algorithm that incorporates the Generalized Partition Crossover (GPX) operator to produce an algorithm that is competitive with the state of the art for the Traveling Salesman  ...  Our results show that the Hybrid Genetic Algorithm quickly finds optimal and near optimal solution on problems ranging from 500 to 1817 cities using a population size of 10.  ...  Introduction The state of the art for the Traveling Salesman Problem (TSP) is Chained Lin-Kernighan (Chained LK) [6] , a local search algorithm coupled with a carefully designed operator called the "double  ... 
doi:10.1007/978-3-642-15844-5_57 dblp:conf/ppsn/WhitleyHH10 fatcat:scvhvxnsrjfotcal56do3gl7dm

:{unav)

E.-G. Talbi
2012 Journal of Heuristics  
As an illustration of the usefulness of the taxonomy an annoted bibliography is given which classifies a large number of hybrid approaches according to the taxonomy.  ...  Hybrid metaheuristics have received considerable interest these recent years in the field of combinatorial optimization. A wide variety of hybrid approaches have been proposed in the literature.  ...  For instance, a tabu search is used as a mutation operator and a greedy heuristic as a crossover operator in a genetic algorithm.  ... 
doi:10.1023/a:1016540724870 fatcat:zrjhda6uqfgm3b23zfa7lcm2bu

Impact of Crossover Probability on Symmetric Travel Salesman Problem Efficiency

Wafa' Slaibi Alsharafat, Suhila Farhan Abu-owida
2015 International Journal of Interactive Mobile Technologies  
Genetic Algorithm (GA) considered as one of optimization methods used to solve Travel salesman Problem (TSP).  ...  Genetic algorithm (GA) is a powerful evolutionary searching technique that is used successfully to solve and optimize problems in different research areas.  ...  Whitley in [6] has adapted Hybrid Genetic Algorithm for solving TSP called Generalized Partition Crossover (GPX) .The GPX is a hybrid GAs with LK-search which derived from Partition Crossover (PX).  ... 
doi:10.3991/ijim.v9i1.4196 fatcat:e2mkwqkw5feb3ocotjfglkdnby

A Real Coded Genetic Algorithm for Data Partitioning and Scheduling in Networks with Arbitrary Processor Release Time [chapter]

S. Suresh, V. Mani, S. N. Omkar, H. J. Kim
2005 Lecture Notes in Computer Science  
This is a difficult combinatorial optimization problem and hence genetic algorithms approach is presented for its solution.  ...  a minimum.  ...  A detailed study on effect of hybrid crossovers for real coded genetic algorithm is presented in [21, 22] .  ... 
doi:10.1007/11572961_43 fatcat:gxdbqhsovvdh5ji5o4k2q6gfhq

A Taxonomyof Intelligent Algorithms used for Solving Traveling Salesman Problem (TSP) in the Year 2019

Haroon Altarawneh
2021 Zenodo  
Travel salesman problem (TSP) considered as one of the most important complex optimization problem.  ...  In our research we reviewed related published articles in the year 2019(Scopus database), to find the state-of-art in Solving Travel Salesman Problem (TSP) by different intelligent algorithms.  ...  "AMGA: An Adaptive and Modular Genetic Algorithm for the Traveling Salesman Problem."  ... 
doi:10.5281/zenodo.4785093 fatcat:s62cji4vvfdwdnrolrrbb75t5m

Page 8830 of Mathematical Reviews Vol. , Issue 2003k [page]

2003 Mathematical Reviews  
Summary: “This paper presents a genetic algorithm to solve the asymmetric traveling salesman problem.  ...  A comparative computational study using benchmark problems shows that the proposed genetic algorithm is a viable option for hard asymmetric traveling salesman problems.” 2003k:90054 90C27 05C45 90C35 Firla  ... 

A New Recombination Operator for the Genetic Algorithm Solution of the Quadratic Assignment Problem

Umut Tosun
2014 Procedia Computer Science  
The suggested approach runs quick sort partitioning algorithm to generate different chromosomes from partitions. The minimum cost partition produces offsprings with the other chromosome.  ...  It can be transformed into many problems such as the travelling salesman, weapon target assignment, and query optimization in distributed databases.  ...  The service allocation problem with the purpose of minimizing the container re-handling operations at a shipyard 9 , travelling salesman, bin-packing, maximum clique, linear ordering, and the graph-partitioning  ... 
doi:10.1016/j.procs.2014.05.394 fatcat:guprzxrcpngn3py3uyfzlofw4y

Approaches to the Travelling Salesman Problem Using Evolutionary Computing Algorithms [chapter]

Jyh-Da Wei
2008 Traveling Salesman Problem  
Acknowledgements This work was supported in part by the Taiwan National Science Council under the Grants NSC95-2221-E-001-016-MY3 and NSC-95-2752-E-002-005-PAE.  ...  to the Travelling Salesman Problem Using Evolutionary Computing Algorithms  ...  Using genetic algorithms to solve the travelling salesman problem (TSP) is one of the popular approaches (Larranaga et al., 1999) .  ... 
doi:10.5772/5584 fatcat:q76d2dilm5g6hmylrekjinj4x4

Combining Local Search with the Multilevel Paradigm for the Traveling Salesman Problem

Noureddine Bouhmala
2004 International Workshop on Hybrid Metaheuristics  
In this paper, we present a multilevel genetic algorithm and a multilevel construction algorithm for the traveling salesman problem.The resulting two multilevel algorithms start by coarsening the original  ...  original problem, using a solution from a previous level as a starting solution at the next level.  ...  the solutions generated by crossover operators.  ... 
dblp:conf/hm/Bouhmala04 fatcat:ss4c6fvpyfacbkjmgpfvvzfr3m

Survey of Metaheuristic Algorithms for Combinatorial Optimization

Malti Baghel, Shikha Agrawal, Sanjay Silakari
2012 International Journal of Computer Applications  
This paper aims to present a brief survey of different metaheuristic algorithms for solving the combinatorial optimization problems.  ...  Population based methods deal with a set of solutions. These include genetic algorithm, ant colony optimization and particle swarm optimization.  ...  Kusum and Hadush (2011) proposed a genetic algorithm for solving traveling salesman problem.  ... 
doi:10.5120/9391-3813 fatcat:7ur2f64xvvb6jc4ojsd5jujfeq

A Hybrid Optimization Algorithm for Traveling Salesman Problem Based on Geographical Information System for Logistics Distribution

Wei Gu, Yong Liu, Li-Rong Wei, Bing-Kun Dong
2015 International Journal of Grid and Distributed Computing  
This paper presents a hybrid algorithm for traveling salesman problem.  ...  The algorithm is a combination of the genetic algorithm and simulated annealing algorithm; in other words, it is a hybrid algorithm.  ...  for traveling salesman problem (TSP).  ... 
doi:10.14257/ijgdc.2015.8.3.33 fatcat:d3ymu5vxwrebrgzmg2lz6up4nq

Research on Traveling Salesman Problem Based on the Ant Colony Optimization Algorithm and Genetic Algorithm

Yu Chen, Yanmin Jia
2015 Open Automation and Control Systems Journal  
In this paper, we prompt a new multi-dimensional algoithm to solve the traveling salesman problem based on the ant colony optimization algorithm and genetic algorithm.  ...  The traveling salesman problem (TSP) is one of the most important combinatorial problems. ACO is taken as one of the high performance computing methods for TSP.  ...  ACKNOWLEDGEMENTS This work is supported by the Research project of science and technology of Inner Mongolia communication and transportation bureau.  ... 
doi:10.2174/1874444301507011329 fatcat:m77kzn4tcbg6rbye7y3owqhq5m

Hybridizing PSM and RSM Operator for Solving NP-Complete Problems: Application to Travelling Salesman Problem [article]

Otman Abdoun, Chakir Tajani, Jaafar Abouchabka
2012 arXiv   pre-print
In this paper, we present a new mutation operator, Hybrid Mutation (HPRM), for a genetic algorithm that generates high quality solutions to the Traveling Salesman Problem (TSP).  ...  The Hybrid Mutation operator constructs an offspring from a pair of parents by hybridizing two mutation operators, PSM and RSM.  ...  In Genetic Algorithm, a population of potential solutions termed as chromosomes and individuals are evolved over successive generations using a set of genetic operators called selection, crossover and  ... 
arXiv:1203.5028v1 fatcat:syzhkoegcra4ndu33wwdmpr5gy

An improved hybrid algorithm for capacitated fixed-charge transportation problem

C.-M. Pintea, P. C. Pop
2015 Logic Journal of the IGPL  
Fişa de verificare a ȋndeplinirii crieteriilor minimale corespunzătoare domeniului Informatică a) Etica cercetării Subsemnatul, Petrica Pop Sitar, am respectat toate normele de etica a cercetării şi prin  ...  urmare perspectiva a) o evaluez cu calificativul: îndeplinit.  ...  Reihaneh, An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem, Algorithmic Operations Research, Vol. 7, No. 1, pp. 22-29, 2012.  ... 
doi:10.1093/jigpal/jzv014 fatcat:6boxa6wgmzelpdg5ovbxrteebu

Aspects of the Study of Genetic Algorithms and Mechanisms for their Optimization for the Travelling Salesman Problem

Nataliya Boyko, Andriy Pytel
2021 International Scientific Journal of Computing  
One of the common problems in programming is the travelling salesman problem. Many methods can be used to solve it, but we are going consider genetic algorithms.  ...  This study aims at developing the most efficient application of genetic algorithms in the travelling salesman problem.  ...  Dizdarevic, “Genetic algorithms for the travelling salesman problem: [11] J. Majumdar, A. K.  ... 
doi:10.47839/ijc.20.4.2442 fatcat:6gljt4wx2vbsvnek474jzvgqqi
« Previous Showing results 1 — 15 out of 771 results