• No results found

Solving the TSP using EM-like mechanism

An Improved Nearest Neighbor Algorithm for Solving TSP

An Improved Nearest Neighbor Algorithm for Solving TSP

... since TSP is NP-complete, finding an optimal solution becomes very hard when problem size ...Conceptually TSP is very easy to understand but solving TSP is quite difficult than anyone can ...

5

Solving TSP by Transiently Chaotic Neural Networks

Solving TSP by Transiently Chaotic Neural Networks

... The chapter aims at introducing recent progress in discrete-time neural network models, in particular, the transiently chaotic neural network (TCNN) and the advantage of adopting piecewise linear activation function. We ...

21

Survey of Methods of Solving TSP along with its Implementation using Dynamic Programming Approach

Survey of Methods of Solving TSP along with its Implementation using Dynamic Programming Approach

... expressed TSP as an integer linear program and developed the cutting plane method for its ...solution. Using these new methods they took up the computational challenge of TSP, solving a ...

8

An Interactive Simulation and Analysis Software for Solving TSP using Ant Colony Optimization Algorithms

An Interactive Simulation and Analysis Software for Solving TSP using Ant Colony Optimization Algorithms

... Department of Computer Engineering, University of Ege, 35100 Bornova-Izmir, Turkey, {[email protected], [email protected]} Traveling Salesman Problem (TSP) is one of the extensively studied combinatorial ...

21

Genetic Algorithm Performance with Different Selection Strategies in Solving TSP

Genetic Algorithm Performance with Different Selection Strategies in Solving TSP

... III. GENETIC ALGORITHM FOR TSP This section provides the general overview of the genetic algorithm component and operation for solving TSP. Genetic algorithm is an optimization method that uses a ...

6

A Performance Study of the Impact of Different Perturbation Methods on the Efficiency of GVNS for Solving TSP

A Performance Study of the Impact of Different Perturbation Methods on the Efficiency of GVNS for Solving TSP

... the TSP means finding the minimum cost route so that the salesman starts from a particular node and returns to that node after passing from all the other nodes ...obtained using the First Improvement search ...

25

New binary representation in Genetic Algorithms for solving TSP by mapping permutations to a list of ordered numbers

New binary representation in Genetic Algorithms for solving TSP by mapping permutations to a list of ordered numbers

... for solving a TSP problem, there is one problem: how individuals are encoded and represented? We can divide TSP representation into three categories: Binary Representation, Vector Representation and ...

5

Ant Colony Optimization (ACO) and a Variation of Bee Colony Optimization (BCO) in Solving TSP Problem: A Comparative Study

Ant Colony Optimization (ACO) and a Variation of Bee Colony Optimization (BCO) in Solving TSP Problem: A Comparative Study

... solving the TSP problem. ACO execution time is less than its ri- val means that it costs less time than BCO for small number of iterations, but as the number of iterations is increasing the execu- tion time ...

8

A Randomness Ant Colony Algorithm for Solving TSP

A Randomness Ant Colony Algorithm for Solving TSP

... Abstract. The Travelling Salesman Problem (TSP) has received much attention because of its practical applications in several problems. One of the commonly used algorithms to solve TSP is Ant Colony ...

5

TSP Solver using Constructive Method of Heuristic Approach

TSP Solver using Constructive Method of Heuristic Approach

... expressed TSP as an integer linear program and developed the cutting plane method for its ...solution. Using these new methods they took up the computational challenge of TSP, solving a ...

6

A Novel Approach To Solve Tsp Using Ant Colony Optimization

A Novel Approach To Solve Tsp Using Ant Colony Optimization

... Jyoti Garg 1 , Renu Singla 2 M.Tech Student, Dept. of CSE, SRCEM, Palwal, India 1 Assistant Prof., Dept. of CSE, SRCEM, Palwal, India 2 ABSTRACT: Travelling salesman problem (TSP) is a routing problem, which is a ...

6

Using the TSP Solution for Optimal Route Scheduling in Construction Management

Using the TSP Solution for Optimal Route Scheduling in Construction Management

... timal route scheduling, scheduling of supplies, order picking in a storehous- es, work sequencing, vehicle routing, supervision planning etc. The real-life TSPs that appear in construction man- agement are usually not ...

7

An Electromagnetism-Like Mechanism Method for Solving Dynamic Cell Formation Problems

An Electromagnetism-Like Mechanism Method for Solving Dynamic Cell Formation Problems

... 5. CONCLUSIONS AND DISCUSSIONS In order to maximize the group efficacy for each period, and to minimize the coefficient of variation overall, the group efficacy and coefficient of variation are combined into the proposed ...

14

(EM) mechanism, for global

(EM) mechanism, for global

... [31] C. S. Tsou and C. H. Kao, “Multi-objective Inventory Control Using Electromagnetism-like Meta-heuristic,” Int. Journal of Production Research, Vol. 1, pp. 1-16, 2007. [32] D. F. Wang, P. Han, N. Liu, ...

6

Stabilization of Expansive Clay Using RHA and TSP

Stabilization of Expansive Clay Using RHA and TSP

... minerals like kaolinite, illite, montmorillonite and hallosyte, montmorillonite has the highest swelling property which leads to unpredictable swelling and shrinkage in expansive ...

7

Modeling and Control of a Snake-Like Robot Using the Screw-Drive Mechanism

Modeling and Control of a Snake-Like Robot Using the Screw-Drive Mechanism

... 23. Developing a control method to handle modeling errors is one of the future issues. VI. C ONCLUSIONS In this paper, we have developed a new type of snake-like robot using screw-drive units connected by ...

14

Using a game like procedure as a new test of problem solving and concept formation in children

Using a game like procedure as a new test of problem solving and concept formation in children

... offering a practice to participants (e.g. Alderson-Day & McGonigle-Chalmers, 2011). When comparing this task to traditional 20-Questions tasks (e.g. Mosher & Hornsby, 1966), the obvious difference with the present task ...

133

Using TSP With a Multi-Disciplined Project Management System

Using TSP With a Multi-Disciplined Project Management System

... a mechanism for incorporating the plans of multiple teams, which do not all use ...use TSP, so traditional project planning and tracking methods must be used for the overall ...

6

Updating the TSP Quality Plan Using Monte Carlo Simulation

Updating the TSP Quality Plan Using Monte Carlo Simulation

... The consistent failure of large-scale devel- opment programs not only costs a lot of time and money, it delays the introduction of promising new technology and deprives our fighting forces of the tools they need to ...

32

Improved Inapproximability for TSP

Improved Inapproximability for TSP

... By using some edges twice the tour is paying some cost on top of what is accounted for in ...would like to show that this extra cost is larger than the number of clauses violated by the ...

20

Show all 10000 documents...

Related subjects