Filters








207 Hits in 6.3 sec

Strategies for the Parallel Implementation of Metaheuristics [chapter]

Van-Dat Cung, Simone L. Martins, Celso C. Ribeiro, Catherine Roucairol
2002 Operations Research/Computer Science Interfaces Series  
Basically, a cluster is a collection of PCs or workstations connected via a network and using off-the-shelf components. The sig-  ...  Parallel implementations of tabu search, GRASP, genetic algorithms, simulated annealing, and ant colonies are reviewed and discussed to illustrate the main strategies used in the parallelization of different  ...  In the case of vehicle routing problems, parallel implementations of heuristics based on domain decomposition, such as that proposed by Fiechter [83] for the traveling salesman problem, start by partitioning  ... 
doi:10.1007/978-1-4615-1507-4_13 fatcat:syvr7spvynhntdp6ya44ntlimq

:{unav)

E.-G. Talbi
2012 Journal of Heuristics  
The taxonomy, while presented in terms of metaheuristics, is also applicable to most types of heuristics and exact optimization algorithms.  ...  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.  ...  Experiments evaluating a simulated annealing algorithm to solve the traveling salesman problem achieved a speedup of about 37 times over an IBM RS6000 workstation.  ... 
doi:10.1023/a:1016540724870 fatcat:zrjhda6uqfgm3b23zfa7lcm2bu

Parallel Simulated Annealing Algorithms

D.Janaki Ram, T.H. Sreenivas, K.Ganapathy Subramaniam
1996 Journal of Parallel and Distributed Computing  
Section V gives implementations of both the algorithms on a network of Sun workstations. Section VI deals with the application and performance studies of the algorithms to the cases of JSS and TSP.  ...  The two algorithms have been applied to the job shop scheduling problem (JSS) and the traveling salesman problem (TSP).  ...  CASE STUDIES The algorithms have been applied to the job shop scheduling problem and the traveling salesman problem. A.1.  ... 
doi:10.1006/jpdc.1996.0121 fatcat:bv7tabzhtnfxjghtvlmibel5ra

A New Method of Exploring a Range of Genetic Parameters During the Execution of a Genetic Algorithm

Adam Byerly, Alexander Uskov
2016 International Journal of Computer Science and Applications  
Further, in this paper, we present the experimental results obtained from applying this method to solving the Traveling Salesman Problem across fourteen fully connected, symmetric maps of sizes ranging  ...  This paper presents the application of an innovative parameter adaptation strategy for Genetic Algorithms.  ...  Introduction The Travelling Salesperson Problem and Genetic Algorithms The Travelling Salesman Problem (TSP) is one of the most studied problems in the class of NP-hard problems [Lawler et al. (1985  ... 
dblp:journals/ijcsa/ByerlyU16 fatcat:sppxhpklkvgvzdm7gxu3xmtzce

A network parallel genetic algorithm for the one machine sequencing problem

M.K. Mayer
1999 Computers and Mathematics with Applications  
The network parallel genetic algorithm is executed on a cluster of IBM RS/6000 workstations using a master-slave approach. Performance to a serial genetic algorithm is reported. (~)  ...  This paper presents a network parallel genetic algorithm for the one machine sequencing problem.  ...  In the case of the network genetic algorithm model, this is not the case.  ... 
doi:10.1016/s0898-1221(99)00047-4 fatcat:l75mfl6arzfubcrbuau7fqprta

OPTIMIZING MULTIPLE TRAVELLING SALESMAN PROBLEM CONSIDERING THE ROAD CAPACITY

Ponraj
2014 Journal of Computer Science  
The objective of the study is to optimize the vehicle utilization and minimize the time of travel by salesman based on the road capacity.  ...  The Multiple Travelling Salesman Problems (MTSP) can be used in a wide range of discrete optimization problems.  ...  Genetic algorithm is proven efficient in solving travelling salesman problem as stated by Albayrak and Allahverdi (2011) .  ... 
doi:10.3844/jcssp.2014.680.688 fatcat:vpkuiqkvubhuzdylnuzkqqw3nm

Artificial Intelligence for Improving the Optimization of NP-Hard Problems: A Review

2020 International Journal of Advanced Trends in Computer Science and Engineering  
Among these AI techniques used for a better optimization of this type of problems, we discuss the genetic algorithms (GA), hybrid GA, parallel GA, GA with Big Data and improved AI techniques with special  ...  This study presents a systematic analysis of previously publications on the use of AI techniques to optimize the NP-hard problems in the area of human resource assignment to multi-constrained activities  ...  to solve the traveling salesman problem [60] .  ... 
doi:10.30534/ijatcse/2020/73952020 fatcat:biyvvjequfac7jbkgo7gyawfn4

Parallel Ant Colony Optimization for the Traveling Salesman Problem [chapter]

Max Manfrin, Mauro Birattari, Thomas Stützle, Marco Dorigo
2006 Lecture Notes in Computer Science  
In this article, we study the impact of communication when we parallelize a high-performing ant colony optimization (ACO) algorithm for the traveling salesman problem using message passing libraries.  ...  We find that the simplest way of parallelizing the ACO algorithms, based on parallel independent runs, is surprisingly effective; we give some reasons as to why this is the case.  ...  The European Community and the French Community are not responsible for any use that might be made of data appearing in this publication. The authors wish to thank A. L.  ... 
doi:10.1007/11839088_20 fatcat:nnocszdkgzhbnhanfqmtsotw7a

Efficient Parallelization of a Genetic Algorithm Solution on the Traveling Salesman Problem with Multi-core and Many-core Systems

2020 International Journal of Engineering  
[17] , which combines the mechanism of Threading Building Blocks (TBB) and Message Passing Interface (MPI) platforms to parallelize a GA-based solution of the Traveling Salesman Problem (TSP).  ...  Motivated by the above mentioned problem, this paper proposes an efficient method for parallelizing the key operators of the genetic algorithm.  ... 
doi:10.5829/ije.2020.33.07a.12 fatcat:2nhqh6wp4rgobfbxfe7tmbegqm

A Parallel Hybrid Heuristic for the TSP [chapter]

Ranieri Baraglia, José Ignacio Hidalgo, Raffaele Perego
2001 Lecture Notes in Computer Science  
In this paper we investigate the design of a coarse-grained parallel implementation of Cga-LK, a hybrid heuristic for the Traveling Salesman Problem (TSP).  ...  The results of several experiments conducted on a cluster of workstations with different TSP instances show the efficacy of the parallelism exploitation.  ...  This work was supported by the Italian National Research Council and the Spanish Government, Grant TYC 1999-0474.  ... 
doi:10.1007/3-540-45365-2_20 fatcat:7r2v4tq22veffbr3zlpxloqnua

An efficient parallel genetic algorithm solution for vehicle routing problem in cloud implementation of the intelligent transportation systems

Mahdi Abbasi, Milad Rafiee, Mohammad R. Khosravi, Alireza Jolfaei, Varun G. Menon, Javad Mokhtari Koushyar
2020 Journal of Cloud Computing: Advances, Systems and Applications  
A novel parallelization method of genetic algorithm (GA) solution of the Traveling Salesman Problem (TSP) is presented.  ...  The results confirm the efficiency of the proposed method for parallelizing GAs on many-core as well as on multi-core systems.  ...  Authors' contributions MA, MK, AJ and VM have participated in design of the proposed method and practical implementation. MR and JM has coded the method.  ... 
doi:10.1186/s13677-020-0157-4 fatcat:7hnkhn3s35danhw66iyqlfaway

Parallel Hybrid Metaheuristics [chapter]

Carlos Cotta, El-Ghazali Talbi, Enrique Alba
2005 Parallel Metaheuristics  
The days in which researchers struggled to slightly tighten worst-case bounds that were anyway far from practical, or in which finding a PTAS (let alone a FPTAS) for a certain problem was considered a  ...  On one hand, a new corpus of theory is being built around the notion of fixed-parameter tractability that emanates from the field of parameterized complexity [40] [41] .  ...  Part of the initial motivation was to find a way out of the limitations of both techniques on a well-studied combinatorial optimization problem the Min Euclidean Traveling Salesman (ETSP) problem.  ... 
doi:10.1002/0471739383.ch15 fatcat:frvcocssmbalbgx6lwnjbj3npu

Accelerating supply chains with Ant Colony Optimization across a range of hardware solutions

Ivars Dzalbs, Tatiana Kalganova
2020 Computers & industrial engineering  
Ant Colony algorithm has been applied to various optimisation problems, however, most of the previous work on scaling and parallelism focuses on Travelling Salesman Problems (TSPs).  ...  Results showed that PA was able to reach a higher solution quality in fewer iterations as the number of parallel instances increased.  ...  Acknowledgement Authors would like to thank Intel Corporation for donating the Xeon Phi hardware and for partially sponsoring this research.  ... 
doi:10.1016/j.cie.2020.106610 pmid:32834426 pmcid:PMC7323691 fatcat:ttxkllduovdy7lbzx3il4m6xka

New parallel randomized algorithms for the traveling salesman problem

Leyuan Shi, Sigurdur Ólafsson, Ning Sun
1999 Computers & Operations Research  
The Traveling Salesman Problem involves nding the shortest route between a number of cities. This route must visit each of the cities exactly once and end in the same city as it started.  ...  We present a new method, the Nested Partitions method, for solving the traveling salesman problem.  ...  In Section 4, we provide a detailed procedure for the implementation of the NP method for the traveling salesman problem.  ... 
doi:10.1016/s0305-0548(98)00068-9 fatcat:4ayso4xo5jdynpweqjidbexbym

Combining simulated annealing with local search heuristics

Olivier C. Martin, Steve W. Otto
1996 Annals of Operations Research  
For the traveling salesman problem with randomly distributed cities in a square, the procedure improves on 3-opt by 1.6%, and on Lin-Kernighan local search by 1.3%.  ...  We have tested this meta-heuristic for the traveling salesman and graph partitioning problems. Tests on instances from public libraries and random ensembles quantify the power of the method.  ...  Finally, we acknowledge signi cant help from the PVM group at OGI for the implementation of the parallelization.  ... 
doi:10.1007/bf02601639 fatcat:mtlpomzmfrehppka5ghzwho5hm
« Previous Showing results 1 — 15 out of 207 results