• No results found

[PDF] Top 20 Solving a Traveling Salesman Problem with a Flower Structure

Has 10000 "Solving a Traveling Salesman Problem with a Flower Structure" found on our website. Below are the top 20 most common "Solving a Traveling Salesman Problem with a Flower Structure".

Solving a Traveling Salesman Problem with a Flower Structure

Solving a Traveling Salesman Problem with a Flower Structure

... The traveling salesman problem (TSP) has origin in 1832 in a hand book of ...NP-complete problem and NP-hard problem and till now only some special cases are found to be polynomially ... See full document

6

Modified Ant Colony Optimization for Solving Traveling Salesman Problem

Modified Ant Colony Optimization for Solving Traveling Salesman Problem

... for solving the Traveling Salesman Problem (NP- hard problem) using pheromone of ant colony depends on the pheromone and path between ...a problem in theoretical computer science ... See full document

5

A Learning Automata based Algorithm for Solving Traveling Salesman Problem improved by Frequency based Pruning

A Learning Automata based Algorithm for Solving Traveling Salesman Problem improved by Frequency based Pruning

... Traveling Salesman Problem (TSP) is about finding a Hamiltonian path (tour) with minimum cost. TSP is one of the discrete optimization problems which is classified as NP-hard [1]. It is common in ... See full document

7

Dynamic Simulated Annealing for solving the Traveling Salesman Problem with Cooling Enhancer and Modified Acceptance Probability

Dynamic Simulated Annealing for solving the Traveling Salesman Problem with Cooling Enhancer and Modified Acceptance Probability

... Abstract- In this paper, a dynamic (i.e. self-adaptive according to the number of nodes) Simulated Annealing Algorithm is presented to solve the well-known Traveling Salesman Problem (TSP). In the ... See full document

8

A reactive bone route algorithm for solving the traveling salesman problem

A reactive bone route algorithm for solving the traveling salesman problem

... The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical ... See full document

13

Solving the Traveling Salesman Problem using Google Services and Simulated Annealing Algorithm

Solving the Traveling Salesman Problem using Google Services and Simulated Annealing Algorithm

... Travelling Salesman Problem has been analyzed and Simulated Annealing has been implemented, in Java, as RESTful web service, successfully. REST involves the transfer of resources between clients and ... See full document

10

Applying the Method for Solving Traveling Salesman Problem Based on Backtracking Algorithm to Order Picking

Applying the Method for Solving Traveling Salesman Problem Based on Backtracking Algorithm to Order Picking

... Based on the way of the single picking and assumed warehouse model, in order to reduce the walking path of order picking, the order picking problem is transformed into the traveling sale[r] ... See full document

6

New Approach for Solving Dynamic Traveling Salesman Problem with Hybrid Genetic Algorithms and Ant Colony Optimization

New Approach for Solving Dynamic Traveling Salesman Problem with Hybrid Genetic Algorithms and Ant Colony Optimization

... DTSP is the most important hybrid optimizing problem. In the past two decades, new computational methods such as refrigeration algorithms [1], ACO [2], GAs [3, 4] and Artificial Neural Networks [5, 6] to solve the ... See full document

6

Solving the Traveling Salesman Problem Using Hydrological Cycle Algorithm

Solving the Traveling Salesman Problem Using Hydrological Cycle Algorithm

... chmarking problem for evaluating new algorithms and comparing their perfor- mances with those of established ...scheduling problem, the knapsack problem, DNA sequencing, integrated circuit ( ... See full document

34

Modified Local Search Heuristics for the Symmetric Traveling Salesman Problem

Modified Local Search Heuristics for the Symmetric Traveling Salesman Problem

... In this paper, we have proposed several modified local search heuristic algorithms for solving the well- known combinatorial optimization problem, the traveling salesman problem. In ... See full document

14

A Method of Solving Travelling Salesman Problem

A Method of Solving Travelling Salesman Problem

... Two location selects in the tour at random than their positions are quietly swapped. For example, if we apply swap mutation to the following list, [1,2,3,4,5] the designation might end up with, [1,2,5,4,3]. Here, ... See full document

7

A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm

A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm

... optimization problem that has been the center of the attention of many researchers for the past few ...the Traveling Salesman problem solving methods and an evaluation of the mentioned ... See full document

22

Particle Swarm Optimization to Solve Multiple Traveling Salesman Problem

Particle Swarm Optimization to Solve Multiple Traveling Salesman Problem

... For solving traveling salesman problem, the experimental results show the effectiveness and efficiency of the proposed ...the problem of each part’s (includes individual’s cooperation) ... See full document

6

Human performance and strategies while solving an aircraft routing and sequencing problem: an experimental approach

Human performance and strategies while solving an aircraft routing and sequencing problem: an experimental approach

... zation problem, a problem type found in many real-world domains where resource allocation is critical, including air traffic control (Stergianos et ...of solving combinations of choices, and the ... See full document

17

AMR to text generation as a Traveling Salesman Problem

AMR to text generation as a Traveling Salesman Problem

... by solving an asym- metric generalized traveling salesman prob- lem ...the traveling costs, and a TSP solver is used to find the optimized solu- ... See full document

6

Ant Colony Optimization (ACO) For The Traveling Salesman Problem (TSP) Using Partitioning

Ant Colony Optimization (ACO) For The Traveling Salesman Problem (TSP) Using Partitioning

... salesman problem is the problem in which a sales man have to visit all the cities exactly ones into a given number of city set and come back to the home city in such a way the total cost of visiting ... See full document

6

Implementation of Fuzzy Intuitionistic Algorithm for Traveling Salesman Problem

Implementation of Fuzzy Intuitionistic Algorithm for Traveling Salesman Problem

... for solving Traveling salesman problem, ...for solving mixed Intuitionistic Fuzzy travelling salesman problem, International Journal of Mathematical Archive, ... See full document

7

Bio inspired Computing Practice on Traveling Salesman Problem

Bio inspired Computing Practice on Traveling Salesman Problem

... problem's structure, and the result of problem usually not global optimal ...optimization problem from the simple imitation of process, the key to success is through synergies, ensure that the ... See full document

5

Information in the Traveling Salesman Problem

Information in the Traveling Salesman Problem

... We have introduced a new perspective from which to study the Traveling Salesman Problem. Besides using the total tour length as the cost function, we propose to also use the tour information content. ... See full document

5

An Application of Goal Programming: The Best Route to Discover a Wonderful West Sumatera

An Application of Goal Programming: The Best Route to Discover a Wonderful West Sumatera

... is traveling from home at least one night for holiday or visiting friends or relatives by driving their own or rented vehicle as the primary mode of transport ... See full document

5

Show all 10000 documents...