[PDF] Top 20 Solving the Traveling Salesman Problem Using Hydrological Cycle Algorithm

Solving the Traveling Salesman Problem Using Hydrological Cycle Algorithm

... The intelligent water drops (IWD) algorithm is a water-based algorithm pro- posed by Shah-Hosseini [1]. The IWD was inspired by the natural flow behavior of water in a river and by what happens in the ... See full document

34

Modified Ant Colony Optimization for Solving Traveling Salesman Problem

... for solving traveling salesman problem (TSP) by making modification on ACO depends on pheromone on edges between unvisited cities and maximum path between ...The salesman starts at some ... See full document

5

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

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

Solving a Traveling Salesman Problem with a Flower Structure

... the problem P = NP? The result is positive with the criteria that solve the Traveling Salesman Problem in polynomial cost of the input size and a proof is ...This problem gets a ... See full document

6

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

A reactive bone route algorithm for solving the traveling salesman problem

... the problem (diversification ...Constructed using improved solutions of previous step in which their routes are sorted by increasing costs of relative ...nodes using the nearest neighborhood ... See full document

13

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

Improved Memetic Algorithm and Its Application on Traveling Salesman Problem

... The traveling salesman problem is a classic NP-hard combinatorial optimization problem which is important in operations research and theoretical computer ...annealing algorithm to find ... See full document

5

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

Solving Asymmetric Travelling Salesman Problem using Memetic Algorithm

... The Traveling Salesman Problem is a problem that is not deterministic and hard and quite known in combinatorial optimization studied in theory based computer science and operation research ... See full document

6

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

An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem

... the problem size to be ...the problem might not contain any cycle; for example G can be a directed simple ...the problem size using ...approximation algorithm for ATSP to obtain ... See full document

13

Different Applications of the Genetic Mutation Operator for Symetric Travelling Salesman Problem

... The problem to find a minimal Hamiltonian cycle in a graph is an optimization ...Travelling Salesman Problem, and its variants and detailed description are presented in [30] and ... See full document

9

A Neighborhood Expansion Tabu Search Algorithm Based On Genetic Factors

... network algorithm [3] has a strong adaptive ability and fault tolerance, but it depends on me- chanism ...annealing algorithm [4] can achieve parallel operation, find out the global optimal solution for ... See full document

6

Characterization of the probabilistic traveling salesman problem

... abilistic Traveling Salesman Problem ...“traveling salesman” must decide on an a priori order in which to visit n cities (randomly distributed over a unit square) before learning that ... See full document

11

On the recoverable robust traveling salesman problem

... two-stage problem formulation, and – with slight differences between the concepts – is known as adjustable robustness (see [BTGGN03]), or recoverable robustness (see ...path problem [B¨ us12], and the ... See full document

14

Dynamic version of Traveling Salesman Problem

... an algorithm is being designed When all targets are moving towards the origin with the positive constant velocity in a straight line and a single salesman (moving with the constant velocity) has to ... See full document

10

A VARIATION OF NEAREST NEIGHBOUR ALGORITHM TO SOLVE SYMMETRIC TRAVELING SALESMAN PROBLEM

... picking problem in warehouses problem which arises in warehouses can be explained as follows: Suppose an order is received to supply some subset of items which are stored in ...This problem can be ... See full document

9

DETECTION ENVIRONMENT FORMATION METHOD FOR ANOMALY DETECTION SYSTEMS

... of Algorithm 3 is used to intersect two partial components together, and as long each component may have all the vertices of the digraph in the worst case, ...of Algorithm 3 which is ... See full document

14