• No results found

large traveling salesman problem

Solution of a Large-Scale Traveling-Salesman Problem

Solution of a Large-Scale Traveling-Salesman Problem

... The RAND Corporation in the early 1950s contained “what may have been the most remarkable group of mathematicians working on optimization ever assem- bled” [6]: Arrow, Bellman, Dantzig, Flood, Ford, Fulkerson, Gale, ...

22

A reactive bone route algorithm for solving the traveling salesman problem

A reactive bone route algorithm for solving the traveling salesman problem

... 11 large-scale problems of the TSP are considered in which the number of customers ranges in size from 100 to ...Each problem exhibits a geometric symmetry which allows us to visually estimate a ...11 ...

13

THE TRAVELING SALESMAN PROBLEM AND ITS VARIATIONS

THE TRAVELING SALESMAN PROBLEM AND ITS VARIATIONS

... a large sample S of randomly chosen ...the problem by Glover and Punnen is well illustrated by the problem [34] to find a tournament on n vertices with the number of Hamiltonian cycles exceeding the ...

40

Bio inspired Computing Practice on Traveling Salesman Problem

Bio inspired Computing Practice on Traveling Salesman Problem

... On the appearances, CPP and TSP are two similar questions, as long as the carrier must send each location as a "City" on the line. Generally speaking, about successful postman each time want to 200-300 location, ...

5

Generating subtour elimination constraints for the Traveling Salesman Problem

Generating subtour elimination constraints for the Traveling Salesman Problem

... the traveling salesman Problem with large instances, using the three formulations (DFJ, MTZ and DL), and see which of the formulations is stronger by applying a strategy of constraint ...

5

Density-Based Clustering Heuristics for the Traveling Salesman Problem

Density-Based Clustering Heuristics for the Traveling Salesman Problem

... The experimental setup deployed in this research examines the effectiveness of the clustered greedy heuristic and the clustered nearest neighbor against their standard versions. To provide a thorough and effective ...

98

BLIND ordering of large scale transcriptomic developmental timecourses

BLIND ordering of large scale transcriptomic developmental timecourses

... general traveling salesman problem (Held and Karp, ...This problem has been shown to be a non- deterministic polynomial-time hard problem (NP-hard) and therefore the optimal solution ...

6

Optimization of a multi-objective-multi period traveling salesman problem with pickup and delivery using genetic algorithm

Optimization of a multi-objective-multi period traveling salesman problem with pickup and delivery using genetic algorithm

... The alteration from an industrial based economy to a service based economy has been proceeding in most of the developed countries over past years. As a good instance, service industry has been continuously growing and ...

30

A Rule Based Evolutionary Optimization Approach for the Traveling Salesman Problem

A Rule Based Evolutionary Optimization Approach for the Traveling Salesman Problem

... the problem arises from the fact that each city may be numbered as an integer selection and a non-integer selec- tion has no ...factorially large, so that the solution may not be generated practically via ...

18

Dynamic version of Traveling Salesman Problem

Dynamic version of Traveling Salesman Problem

... of Traveling salesman problem, the targets which have to be visited are stationary but in real life there are large numbers of instances where the targets are in ...single salesman ...

10

Modified Ant Colony Optimization for Solving Traveling Salesman Problem

Modified Ant Colony Optimization for Solving Traveling Salesman Problem

... 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 which is very hard ...

5

Improved Memetic Algorithm and Its Application on Traveling Salesman Problem

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 ...a large search ...TSP ...

5

Solving the Traveling Salesman Problem Using Hydrological Cycle Algorithm

Solving the Traveling Salesman Problem Using Hydrological Cycle Algorithm

... In general, small TSPs are most easily solved by trying all possibilities ( i.e. ex- haustive searching). This can be achieved by brute-force and branch-and-bound. These methods generate all possibilities and choose the ...

34

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 ...a problem is the classical “traveling ...

17

Volume 3, Issue 4, April 2014 Page 100

Volume 3, Issue 4, April 2014 Page 100

... The traveling salesman problem (TSP) first proposed by Irish mathematician ...A large number of techniques were developed to solve the ...the problem is to invent the shortest route of ...

5

Study and Application of TSP Based on Genetic Algorithm

Study and Application of TSP Based on Genetic Algorithm

... Abstract: Traveling salesman problem ( TSP ) has been proved a non-deterministic polynomial complete ...the problem, but can find out the optimal solution of the ...a large search ...

5

The Multi-path Traveling Salesman Problem with Stochastic Travel Costs: Building Realistic Instances for City Logistics Applications

The Multi-path Traveling Salesman Problem with Stochastic Travel Costs: Building Realistic Instances for City Logistics Applications

... a large increase of the gap when moving from 1 to 3 paths, while this increment becomes less evident when the paths becomes 5, showing a sort of asymptotic ...a large amount the computational ...

10

Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem

Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem

... Consider Fig. 1A: Ants arrive at a decision point in which they have to decide whether to turn left or right. Since they have no clue about which is the best choice, they choose randomly. It can be expected that, on ...

24

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

... The TSP is a representative of a large class of problems known as the combinatorial optimization problems. Among them, TSP is one of the most important, since it is very easy to describe, but very difficult to ...

22

Characterization of the probabilistic traveling salesman problem

Characterization of the probabilistic traveling salesman problem

... approach is difficult, since we need a large number of cities to produce reliable data for this regime. Extraction of this behaviour can however be achieved by comparing simulations for different values of n, but ...

11

Show all 10000 documents...

Related subjects