• Nenhum resultado encontrado

Traveling Salesman

The family traveling salesman problem

The family traveling salesman problem

... family traveling salesman problem (FTSP) é determinar o circuito elementar de custo mínimo que começa e acaba no depósito e visita um número predeterminado de cidades em cada ...(generalized ...

313

Improving the Solution of Traveling Salesman Problem Using Genetic, Memetic Algorithm and Edge assembly Crossover

Improving the Solution of Traveling Salesman Problem Using Genetic, Memetic Algorithm and Edge assembly Crossover

... The Traveling salesman problem (TSP) is to find a tour of a given number of cities (visiting each city exactly once) where the length of this tour is ...the traveling salesman problem, one of ...

4

Genetic algorithms for the traveling salesman problem

Genetic algorithms for the traveling salesman problem

... Gucht, The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem, in: Proc. Johnson, Local[r] ...

34

Optimal configuration problem identification of electrical power cable in tidal turbine farm via traveling salesman problem modeling approach

Optimal configuration problem identification of electrical power cable in tidal turbine farm via traveling salesman problem modeling approach

... multiple traveling salesman problem (mTSP) and the multiple depot mTSP of operational research for the single and multiple cable collector variants, ...

8

The Multi-commodity One-to-one Pickup-and-delivery Traveling Salesman Problem with Path Duration Limits

The Multi-commodity One-to-one Pickup-and-delivery Traveling Salesman Problem with Path Duration Limits

... pickup-and-delivery traveling salesman problem (m-PDTSP) in considered in Hernández- Pérez and Salazar-González [11], the problem is formulated and solution methods based on bender’s decomposition are ...

4

SOLUTION OF TRAVELING SALESMAN PROBLEM ON SCX BASED SELECTION WITH PERFORMANCE ANALYSIS USING GENETIC ALGORITHM

SOLUTION OF TRAVELING SALESMAN PROBLEM ON SCX BASED SELECTION WITH PERFORMANCE ANALYSIS USING GENETIC ALGORITHM

... Genetic Algorithm is relatively new optimization techniques which can be applied to various problems of different domain including those are NP-hard.TSP is one such combinatorial optimization and NP-hard problem. So GA ...

8

Alternative Method for Solving Traveling Salesman Problem by Evolutionary Algorithm

Alternative Method for Solving Traveling Salesman Problem by Evolutionary Algorithm

... This article describes the application of Self Organizing Migrating Algorithm (SOMA) to the well-known optimization problem - Traveling Salesman Problem (TSP). SOMA is a relatively new optimization method ...

6

A Computational Analysis of the Traveling Salesman and Cutting Stock Problems

A Computational Analysis of the Traveling Salesman and Cutting Stock Problems

... The aim of this article is to perform a computational study to analyze the impact of formulations, and the solution strategy on the algorithmic performance of two clas- sical optimization problems: the traveling ...

12

An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic

An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic

... This report describes an implementation of the Lin-Kernighan heuris- tic, one of the most successful methods for generating optimal or near- optimal solutions for the symmetric traveling salesman problem. ...

71

Parallelization Of Traveling Salesman Problem Using Rocks Cluster

Parallelization Of Traveling Salesman Problem Using Rocks Cluster

... Abstract—The Traveling Salesman Problem (TSP) is a well known Nondeterministic Polynomial (NP) problem. A number of sequential algorithms have been well defined to solve TSP. However in this paper the ...

4

ON THE USE OF LYTLE’S ALGORITHM FOR SOLVING TRAVELING SALESMAN PROBLEM AT DEVELOPING SUBURBAN ROUTE

ON THE USE OF LYTLE’S ALGORITHM FOR SOLVING TRAVELING SALESMAN PROBLEM AT DEVELOPING SUBURBAN ROUTE

... Abstract. Lytle’s algorithm is described as proposed for an accurate solution of the salesman Prob- lem. Statistical characteristics of solution duration with lytle’s algorithm of some problems and of their ...

7

New models for the Mirrored Traveling Tournament Problem

New models for the Mirrored Traveling Tournament Problem

... Easton, Nemhauser, and Trick (2003) again address the TTP, this time through a parallelized implementation of the branch- and-price method, where the master problem is solved by column generation and the subproblems are ...

7

On the Solutions to the Travelling Salesman Problem using Nature Inspired Computing Techniques

On the Solutions to the Travelling Salesman Problem using Nature Inspired Computing Techniques

... an important role in enhancing the searching ability of the algorithm. The modified algorithm gives better results in precision or computational cost. In another work Tasgetiren, Suganthan, & Pan applied a discrete ...

9

Double-ended nearest and loneliest neighbour : a nearest neighbour heuristic variation for the travelling salesman problem

Double-ended nearest and loneliest neighbour : a nearest neighbour heuristic variation for the travelling salesman problem

... travelling salesman problem that introduces the concept of loneliness of a city computed from the average distance of that city to all others and combines it with ideas from other nearest neighbour ...

14

ASYMMETRIC WETTED SECTOR ANGLE IN WATER DISTRIBUTION OF TRAVELING GUN IRRIGATION SYSTEMS

ASYMMETRIC WETTED SECTOR ANGLE IN WATER DISTRIBUTION OF TRAVELING GUN IRRIGATION SYSTEMS

... https://doi.org/10.1016/j.compag.2018.05.036 Shull H, Dylla AS (1976) Traveling gun application uniformity in high winds. Transactions of the ASAE 19(2):254-258. DOI: http://dx.doi.org/10.13031/2013.36007 Silva S, ...

10

Branch-and-bound with decomposition-based lower bounds for the Traveling Umpire Problem

Branch-and-bound with decomposition-based lower bounds for the Traveling Umpire Problem

... The Traveling Umpire Problem (TUP) is an optimization problem in which umpires have to be assigned to games in a double round robin tournament. The objective is to obtain a solution with minimum total travel ...

8

A HIGH PERFORMANCE ALGORITHM FOR SOLVING LARGE SCALE TRAVELLING SALESMAN PROBLEM USING DISTRIBUTED MEMORY ARCHITECTURES

A HIGH PERFORMANCE ALGORITHM FOR SOLVING LARGE SCALE TRAVELLING SALESMAN PROBLEM USING DISTRIBUTED MEMORY ARCHITECTURES

... Travelling Salesman Problem is a problem in computational mathematics aimed at finding the shortest path visiting every city in a given set of cities, along with known distances for each pair of cities, and return ...

6

Exploring 3D GPU-accelerated graph visualization with time-traveling virtual camera

Exploring 3D GPU-accelerated graph visualization with time-traveling virtual camera

... differences of our work. The study presented here is an extension of our previous work pre- sented in [1]. Therefore, in Sections 3 and 4 we briefly repeat parts of the previous ma- terial. Section 3 presents our ...

15

Worldwide COVID-19 spreading explained: traveling numbers as a primary driver for the pandemic

Worldwide COVID-19 spreading explained: traveling numbers as a primary driver for the pandemic

... In conclusion, we found that one of the likely most straightforward explanations for country vulnerability is how well connected it is internationally in the early stages of a pandemic, and prior a severe local community ...

10

SPRAYING SYSTEMS AND TRAVELING SPEED IN THE DEPOSIT AND SPECTRUM OF DROPLETS IN COTTON PLANT

SPRAYING SYSTEMS AND TRAVELING SPEED IN THE DEPOSIT AND SPECTRUM OF DROPLETS IN COTTON PLANT

... A self-propelled Jacto sprayer (Pompeia/SP) was used, Uniport model, serial number 504496, tank capacity of 2000 L and a 24 m long bar. The spraying was carried out towards the sowing ranks of the cotton plants, ...

11

Show all 58 documents...

temas relacionados