154 Hits in 5.6 sec

Web-Based Implementation of Travelling Salesperson Problem Using Genetic Algorithm [article]

Aryo Pinandito, Novanto Yudistira, Fajar Pradana
2018 arXiv   pre-print
Based on the result, the use of Ruby in GA implementation is recommended.  ...  Travelling Salesperson Problem (TSP) as Non Polynomial-hard (NP-hard) problem is provided to be a problem domain to be solved by GA.  ...  Therefore, the usage of Ruby is recommended to gain performance in implementation of GA for TSP in a web environment over Python and PHP.  ... 
arXiv:1802.03155v1 fatcat:7jslr6obpzdizjo6bijybhavvm

Fruit Fly Optimization Algorithm for Travelling Salesperson Problem

Nitin S.Choubey
2014 International Journal of Computer Applications  
The paper proposes different variants of Vision function and Smell function of Fruit-Fly and evaluated them for solutions of Travelling Salesperson problem.  ...  The Fruit-Fly Optimization Algorithm (FFOA) is an algorithm with a potential to solve the complex optimization problems. It is based on the behavior of Fruit-Fly to search for its solution.  ...  Potvin [2] presents survey of Genetic Algorithm (GA) approaches for the general TSP. GA Suffers with the problem of premature convergence.  ... 
doi:10.5120/18851-0385 fatcat:6pc3vclutfhmjmoxtcbhg76o4m

Chips-n-Salsa: A Java Library of Customizable, Hybridizable, Iterative, Parallel, Stochastic, and Self-Adaptive Local Search Algorithms

Vincent Cicirello
2020 Journal of Open Source Software  
For example, a GitHub search finds countless solvers for problems like Boolean Satisfiability or the Traveling Salesperson.  ...  For example, the traveling salesperson, bin packing, and longest common subsequence problems are NP-Hard, as is resource constrained scheduling, and many single-machine scheduling problems (Garey & Johnson  ... 
doi:10.21105/joss.02448 fatcat:7zfw22t5vvdrbog6eu6ehcsa4y

Editorial for the special issue on metaheuristics for combinatorial optimization

Bin Hu, Francisco Chicano
2017 Journal of Heuristics  
The final selection contains 12 high quality papers addressing practical applications and theoretical analyses of metaheuristic algorithms in the context of combinatorial optimization problems.  ...  For larger instances it is reasonable to use heuristic or metaheuristic algorithms, which are designed to obtain good but not necessarily optimal solutions in acceptable time.  ...  The Traveling Thief Problem (TTP) is a problem combining the Knapsack Problem an the Traveling Salesperson Problem.  ... 
doi:10.1007/s10732-017-9352-y fatcat:uyd5cl3ydrfthozcuohcqwkhza

Genetic Algorithm Based Solution for TSP on a Sphere

Aybars Uğur, Serdar Korukoğlu, Ali Çalıskan, Muhammed Cinsdikici, Ali Alp
2009 Mathematical and Computational Applications  
In this paper, we proposed a genetic algorithm-based solution for TSP where all points are on the surface of a sphere.  ...  The Traveling Salesman Problem (TSP) is one of the extensively studied combinatorial optimization problems.  ...  using genetic algorithms and 2-opt.  ... 
doi:10.3390/mca14030219 fatcat:xipkhfmbbzddndm5o4y5aqi7wy

Development of a decision support model for optimization of tour time to visit tourist destination points in a city

Jagat Kumar Shrestha
2017 Geographical Journal of Nepal  
In this situation, the tourists want to optimize their travelling time and moments of leisure, taking the opportunity to visit the desired city attractions.  ...  There may be a number of tourist destinations in a city; however, a tourist may have limited time that can be spent for tourism.  ...  ., 2005) uses a tree based search. Genetic algorithm can also be used to find near optimal solutions (Moon et al., 2002) .  ... 
doi:10.3126/gjn.v10i0.17388 fatcat:4f6m3muwwbgk3kc526okqigxdi

An Efficient Mining Approach for Handling Web Access Sequences

Nandhini R, Evangelin Sonia S.V
2021 International Journal of Computer Communication and Informatics  
In this study, the modern technique is presented for mining web access utility-based tree construction under Modified Genetic Algorithm (MGA).  ...  Now a day the data-based approach is the widely used approach. It is used to extract the knowledge from web data in the form of hyper link, and web log data.  ...  Acknowledgements The authors declare that they have no conflict of interest. Conflict of interest The authors declare that they have no conflict of interest. About The License  ... 
doi:10.34256/ijcci2112 fatcat:lk52a3pqdnhofkfpgkib47yyd4

A Future Perspective Survey on Bio-inspired algorithms based self-organization techniques for GA

Santhoshini Banda, U. Sri Lakshmi, P. Victer Paul
2018 International Journal of Engineering & Technology  
To have a performance improvement over GA the concept of Hybrid genetic algorithms that were inspired by the biological behavior of different living beings was put to use to solve the NP-completeness problems  ...  Genetic algorithms (GAs) are the most important evolutionary computation technique that is used to solve various complex problems that involve a large search space.  ...  an algorithm that can solve the complex problems like the traveling salesperson problem.  ... 
doi:10.14419/ijet.v7i4.6.20222 fatcat:vu6jbu7g7rca7laierou2hwsju

Vehicle Routing and Scheduling for Regular Mobile Healthcare Services

Cosmin Pascaru, Paul Diac
2018 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)  
Our solution implements two probabilistic algorithms out of which we chose the one that performs the best.  ...  We developed our solution in two phases: modeling of the most relevant parameters and data available for our goal and then design and implement an algorithm that provides an optimized solution.  ...  Cosette Chichirau for helping with problem specification and obtaining data from INS 2 , Prof. Dr. Mihaela Breaban and Dr. Raluca Necula for help on genetic and heuristic algorithms and Dr.  ... 
doi:10.1109/ictai.2018.00080 dblp:conf/ictai/PascaruD18 fatcat:n36eppptm5dt5gcc4tq6rtn4nu

Distributed Simulated Annealing with MapReduce [chapter]

Atanas Radenski
2012 Lecture Notes in Computer Science  
Some of our patterns integrate simulated annealing with genetic algorithms.  ...  We (i) design six algorithmic patterns of distributed simulated annealing with MapReduce, (ii) instantiate the patterns into MR implementations to solve a sample TSP problem, and (iii) evaluate the solution  ...  We illustrate this instantiation process with the traveling salesperson problem.  ... 
doi:10.1007/978-3-642-29178-4_47 fatcat:zcthrghkmrellc3ny2hox223bi

An improved hybrid algorithm for capacitated fixed-charge transportation problem

C.-M. Pintea, P. C. Pop
2015 Logic Journal of the IGPL  
Nakayama, Consultant-guided search for Traveling Salesperson Problem, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol.  ...  Srivastava, Enhancing genetic algorithm-based genome-scale metabolic network curation efficiency, in Proc. of GECCO 2014 Conference on Genetic and Evolutionary Computation, pp. 257-264, 2014, ISBN:  ... 
doi:10.1093/jigpal/jzv014 fatcat:6boxa6wgmzelpdg5ovbxrteebu

Performance analysis and optimization of web proxy servers and mirror sites

N. Gautam
2002 European Journal of Operational Research  
Based on a comparison with a genetic algorithm, it can be concluded that the DEJAVU algorithm produces near-optimal to optimal results in a very short time.  ...  These performance measures are used in an optimization problem that is formulated to determine the optimal number and optimal location of proxy servers.  ...  Girish Srinivasan for the genetic algorithm used in this paper.  ... 
doi:10.1016/s0377-2217(02)00210-2 fatcat:axtifznjznggriodgscsufnozq

A Fixed Wing UAV Path Planning Algorithm Based On Genetic Algorithm and Dubins Curve Theory

Peng Yan, Zhuo Yan, Hongxing Zheng, Jifeng Guo, Dan Zhang
2018 MATEC Web of Conferences  
Path planning is an essential problem in the autonomy research of UAVs. This paper proposes a new path planning algorithm for fixed wing UAVs based on genetic algorithm (GA) and Dubins curve theory.  ...  Path planning is treated as a global optimization problem under certain constraints, including the velocity vectors of initial and goal points and the minimum turning radius of UAVs.  ...  In [17, 18] , Savla et al. proposed methods to solve the traveling salesperson problems (TSP) for Dubins' vehicle.  ... 
doi:10.1051/matecconf/201817903003 fatcat:tjcrtwgcv5fq7je7ese623ufcm

Metaheuristics "In the Large" [article]

Jerry Swan, Steven Adriaensen, Alexander E. I. Brownlee, Kevin Hammond, Colin G. Johnson, Ahmed Kheiri, Faustyna Krawiec, J. J. Merelo, Leandro L. Minku, Ender Özcan, Gisele L. Pappa, Pablo García-Sánchez (+4 others)
2021 arXiv   pre-print
Following decades of sustained improvement, metaheuristics are one of the great success stories of optimization research.  ...  of metaheuristics.  ...  Open-Closed Principle to automated algorithm configuration of the Traveling Salesperson Problem over a fixed algorithm framework.  ... 
arXiv:2011.09821v4 fatcat:7rmva4ri6fbx7gijsgkhlercry

Codon Context Optimization in Synthetic Gene Design [article]

Dimitris Papamichail, Hongmei Liu, Vitor Machado, Nathan Gould, J. Robert Coleman, Georgios Papamichail
2015 arXiv   pre-print
We also present a web-based tool for evaluating codon context bias in the appropriate context.  ...  We analyze the computational complexity of codon context optimization and design exact and efficient heuristic gene recoding algorithms under reasonable constraint models.  ...  ACKNOWLEDGMENT This work has been supported by NSF Grant CCF-1418874 and the MUSE program at The College of New Jersey. D.  ... 
arXiv:1508.03428v1 fatcat:mittgixlfbgdrppt25esc2m32e
« Previous Showing results 1 — 15 out of 154 results