Filters








732 Hits in 4.8 sec

Self-adaptive partially mapped crossover

Oliver Kramer, Patrick Koch
2007 Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07  
We present a self-adaptive extension of the partially mapped crossover (PMX) operator that controls the crossover points.  ...  We can now report encouraging experimental results for the PMX on the traveling salesman problem (TSP) as an example for combinatorial problems.  ...  SELF-ADAPTIVE PMX Partially mapped crossover (PMX) was designed for TSP by Goldberg and Lingle [1] and enhanced by Whitley in 1995.  ... 
doi:10.1145/1276958.1277252 dblp:conf/gecco/KramerK07 fatcat:qcpmgr6rivcg7fxtwq4yxaizlm

A Comparative Study of Adaptive Crossover Operators for Genetic Algorithms to Resolve the Traveling Salesman Problem [article]

Otman Abdoun, Jaafar Abouchabaka
2012 arXiv   pre-print
In this paper, the basic conceptual features and specific characteristics of various crossover operators in the context of the Traveling Salesman Problem (TSP) are discussed.  ...  The results of experimental comparison of more than six different crossover operators for the TSP are presented.  ...  According to thecomparative study of the crossover operators mentioned, the development of innovative crossover operators for the traveling salesman problem may be the subject of the future research.  ... 
arXiv:1203.3097v1 fatcat:fc7zhuzo75fhtlkjecq3wx677u

Assessing Different Crossover Operators for Travelling Salesman Problem

Imtiaz Hussain Khan
2015 International Journal of Intelligent Systems and Applications  
In this study, eight different crossover operators specially designed for travelling salesman problem, namely, Two-Point Crossover, Partially Mapped Crossover, Cycle Crossover, Shuffle Crossover, Edge  ...  Four benchmark instances of travelling salesman problem, two symmetric (ST70 and TSP225) and two asymmetric (FTV100 and FTV170), were used to thoroughly assess the select crossover operators.  ...  DISCUSSION Assessing Different Crossover Operators for Travelling Salesman Problem Copyright © 2015 MECS I.J.  ... 
doi:10.5815/ijisa.2015.11.03 fatcat:a7m3voc5wjatjcp2rw7rz2gkjy

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.  ...  TSP 1 9 the angular-metric travelling salesman problem (AngleTSP) 1 10 Traveling Thief Problem (TTP) which is a variant of symmetric TSP. 1 11 Time Dependent Traveling Salesman Problem  ... 
doi:10.5281/zenodo.4785093 fatcat:s62cji4vvfdwdnrolrrbb75t5m

Applying Metaheuristic for Time-Dependent Traveling Salesman Problem in Postdisaster

Ha-Bang Ban
2021 International Journal of Computational Intelligence Systems  
In this paper, we introduce a new variant of the TDTSP, that is, the Time-Dependent Traveling Salesman Problem in Postdisaster (TDTSP-PD).  ...  Keywords TDTSP TDTSP-PD MA GA GRASP VNS A B S T R A C T The Time-Dependent Traveling Salesman Problem (TDTSP) is a generalization of the Traveling Salesman Problem (TSP) and Traveling Repairman Problem  ...  ACKNOWLEDGMENTS This research is funded by Hanoi University of Science and Technology (HUST) under grant number T2020-PC-008.  ... 
doi:10.2991/ijcis.d.210226.001 fatcat:bxrafmrwyvgfrcffiemccvzt6m

Minimization of the Total Traveling Distance and Maximum Distance by Using a Transformed-Based Encoding EDA to Solve the Multiple Traveling Salesmen Problem

S. H. Chen
2015 Mathematical Problems in Engineering  
A well-known in-group optimization problem is the multiple traveling salesmen problem (mTSP), which involves simultaneous assignment and sequencing procedures and are shown in different forms.  ...  Notably, the proposed algorithm did not cause a longer traveling distance when the number of salesmen was increased from 3 to 10.  ...  Acknowledgments The author would like to thank anonymous reviewers who enhance the quality of this paper and the Minister of Science and Technology with Grant nos.  ... 
doi:10.1155/2015/640231 fatcat:jhlv27warzg5loktdp5kc767s4

An Improved Genetic Algorithm with a Local Optimization Strategy and an Extra Mutation Level for Solving Traveling Salesman Problem

Keivan Borna, Vahid Haji Hashemi
2014 International Journal of Computer Science Engineering and Information Technology  
The Traveling salesman problem (TSP) is proved to be NP-complete in most cases. The genetic algorithm (GA) is one of the most useful algorithms for solving this problem.  ...  The improved or hybrid GA consist of conventional GA and two local optimization strategies.  ...  The aim of traveling salesman problem (TSP) is to find the shortest tour that passed each city once and exactly once in a known map with different distances between cities.  ... 
doi:10.5121/ijcseit.2014.4405 fatcat:hev3sbbgyzeqjnqwohw2nmjne4

Fitness Landscape Analysis and Edge Weighting-Based Optimization of Vehicle Routing Problems

László Kovács, Anita Agárdi, Tamás Bányai
2020 Processes  
Based on the results of fitness landscape analysis, we propose a novel traveling salesman problem genetic algorithm optimization variant where the edges are the elementary units having a fitness value.  ...  The efficiency of the following operators is investigated: 2-opt, order crossover, partially matched crossover, cycle crossover. The results show that the most efficient one is the 2-opt operator.  ...  Theoretical Preliminaries Traveling Salesman Problem The goal of the traveling salesman problem (TSP) family is to find the shortest Hamiltonian cycle in a weighted graph.  ... 
doi:10.3390/pr8111363 fatcat:77vrstdilzc2lgxtlfmvbh3t5q

Using genetic algorithm to solve multiple traveling salesman problem and considering Carbon emissions

Chris Jojo Obi, School of Management, Jiangsu University, 301, Xuefu Road, Zhenjiang, 212013, China
2020 Indian Journal of Science and Technology  
Objectives: The Multiple Travelling Salesman problem is a complex combinatorial optimization problem which is a variance of the Traveling Salesman Problem,where a lot of salesmen are utilized in the solution  ...  Methods: A genetic algorithm is then proposed to solve for the Multiple Travelling Salesman Problem with time windows while transport cost, carbon emission cost and refrigeration cost is minimized.  ...  Disclosure Statement: There is no potential conflict of interest reported by the authors.  ... 
doi:10.17485/ijst/v13i36.1316 fatcat:x2xdqhzphjew5ikkyb4o7olyae

Adaptive Sequential Constructive Crossover Operator in a Genetic Algorithm for Solving the Traveling Salesman Problem

Zakir Hussain Ahmed
2020 International Journal of Advanced Computer Science and Applications  
In this paper, we propose a new crossover operator, named adaptive sequential constructive crossover, to solve the benchmark travelling salesman problem.  ...  We then compare the efficiency of the proposed crossover operator with some existing crossover operators like greedy crossover, sequential constructive crossover, partially mapped crossover operators,  ...  ACKNOWLEDGMENT The author thanks the honourable anonymous reviewers for their constructive comments and suggestions which helped the author to improve this paper.  ... 
doi:10.14569/ijacsa.2020.0110275 fatcat:5j5nkiyczvbt3ggkofcyqtld34

Chaos Driven Evolutionary Algorithm for the Traveling Salesman Problem [chapter]

Ivan Zelinka, Roman Senkerik, Magdalena Bialic-Davendra, Donald Davendr
2010 Traveling Salesman Problem, Theory and Applications  
The two common systems of Lozi map and Delayed Logistic (DL) were selected as mutation generators for the DE heuristic. 12 Traveling Salesman Problem, Theory and Applications Lozi map The Lozi map  ...  One of the major drawbacks 58 Traveling Salesman Problem, Theory and Applications www.intechopen.com Chaos Driven Evolutionary Algorithm for the Traveling Salesman Problem 5 Control Variables  ... 
doi:10.5772/13107 fatcat:7tlidyo52fa7lajdtvxabkgczi

A genetic algorithm based task scheduling system for logistics service robots

Sariffuddin Harun, Mohd Faisal Ibrahim
2019 Bulletin of Electrical Engineering and Informatics  
Two variants of GA crossover are adopted to enhance the performance of the proposed algorithm.  ...  The performance of the scheduling is compared and analysed between the proposed GA algorithms and a conventional greedy algorithm in a virtual map and a real map environments that turns out the proposed  ...  ACKNOWLEDGEMENTS This research was supported by Universiti Kebangsaan Malaysia under the grant GGPM-2016-003.  ... 
doi:10.11591/eei.v8i1.1437 fatcat:37tcz5lirvhl3exzr3xrbawtei

Multi-parent extension of partially mapped crossover for combinatorial optimization problems

Chuan-Kang Ting, Chien-Hao Su, Chung-Nan Lee
2010 Expert systems with applications  
This paper proposes the multi-parent partially mapped crossover (MPPMX), which generalizes the partially mapped crossover (PMX) to a multi-parent crossover.  ...  Experimental results on five traveling salesman problems show that MPPMX significantly improves PMX by up to 13.95% in mean tour length.  ...  The traveling salesman problem (TSP) is an important representative of combinatorial optimization problems.  ... 
doi:10.1016/j.eswa.2009.07.082 fatcat:i4qqsxk2bvfbphafl6dfkkm6aa

Optimization of Multiple Vehicle Routing Problems using Approximation Algorithms [article]

R. Nallusamy, K. Duraiswamy, R. Dhanalaksmi, P. Parthiban
2010 arXiv   pre-print
This paper deals with generating of an optimized route for multiple Vehicle routing Problems (mVRP).  ...  We used a methodology of clustering the given cities depending upon the number of vehicles and each cluster is allotted to a vehicle. k- Means clustering algorithm has been used for easy clustering of  ...  Schabauer, Schikuta, and Weishaupl [3] have worked on to solve traveling salesman problem heuristically by the parallelization of self-organizing maps on cluster architectures.  ... 
arXiv:1001.4197v1 fatcat:w75jtmrzy5eh3fkjvhk2m6xexa

Evaluating the α-Dominance Operator in Multiobjective Optimization for the Probabilistic Traveling Salesman Problem with Profits [chapter]

Bingchun Zhu, Junichi Suzuki, Pruet Boonm
2011 Evolutionary Algorithms  
Optimization Process in the Proposed EMOA Crossover The proposed EMOA adopts partially-mapped crossover (PMX) as its crossover operator.  ...  . pTSPP is a combination of existing two variants of the traveling salesman problem (TSP): the probabilistic TSP (pTSP) (Jaillet, 1985) and the TSP with profits (TSPP) (Feillet et al., 2005) .  ...  Evaluating the α-Dominance Operator in Multiobjective Optimization for the Probabilistic Traveling Salesman Problem with Profits, Evolutionary Algorithms, Prof.  ... 
doi:10.5772/16199 fatcat:wruywnaovzf6ldhi2np3eu64uu
« Previous Showing results 1 — 15 out of 732 results