• No results found

real traveling salesman problem

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

... the concept of Smart City (Chourabi et al., 2012), where "smart" implies to incorporate a plethora of methods and disciplines in a holistic vision in order to mitigate problems generated by the population growth ...

10

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

Phrase Based Statistical Machine Translation as a Traveling Salesman Problem

Phrase Based Statistical Machine Translation as a Traveling Salesman Problem

... the real translation task, the size of the TSP graph is much larger than in the artificial re- ordering task (in our experiments the median size of the TSP graph was around 400 nodes, some- times growing up to ...

9

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 real world and specially modern world is extremely uncertain and dynamic, time interval can be used to create more realistic models of real world ...

30

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 ...the problem. The objective or goal of the problem is to invent the shortest route of the salesman ...

5

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 ...Many real-life problems and appli- cations can also be formulated as TSPs, and some ...

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 ...

17

Density-Based Clustering Heuristics for the Traveling Salesman Problem

Density-Based Clustering Heuristics for the Traveling Salesman Problem

... the problem was presented by Hassler Whitney and Merrill Flood at Princeton in 1934 ...the Traveling Salesman, authored by William Cook ...behind real world applications prior to the ...

98

A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem

A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem

... the traveling salesman problem (TSP) and its generalizations such as the multiple traveling salesmen problem (MTSP) and the vehicle routing problem (VRP) (Yousefikhoshbakht, ...

13

A reactive bone route algorithm for solving the traveling salesman problem

A reactive bone route algorithm for solving the traveling salesman problem

... Each problem exhibits a geometric symmetry which allows us to visually estimate a ...11 problem instances and these solutions have been published in the ...

13

Modified Ant Colony Optimization for Solving Traveling Salesman Problem

Modified Ant Colony Optimization for Solving Traveling Salesman Problem

... Fig. 1. Illustrating the behavior of real ant movements. In particular, several ant species are capable of selecting the shortest pathway, among a set of alternative pathways, from their nest to a food source. ...

5

Novel Approach to Fuzzy Shortest Path Problem

Novel Approach to Fuzzy Shortest Path Problem

... In order to make evolve the design of fuzzy systems, several met heuristic learning algorithms are projected. One major improvement class uses evolutionary algorithms (EAs) [18]. These algorithms are heuristic and ...

8

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 GSA is basically established to improve the results of algorithms like PSO, while keeping the same complexity. The high point of this algorithm, which this study has used, is that it avoids finding a local optimum as ...

22

A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM

A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM

... The TSP is an optimization problem, which is seen in almost every area of the real life. As being one of the most well-known and common graph problems, the TSP belongs to the class of hard problems. In this ...

9

Characterization of the probabilistic traveling salesman problem

Characterization of the probabilistic traveling salesman problem

... Many real systems present problems of stochastic opti- mization. These include communications networks, pro- tein design [1] and oil field models [2], in all of which uncertainty plays a central role. We will ...

11

Well-solvable special cases of the Traveling Salesman Problem : a survey

Well-solvable special cases of the Traveling Salesman Problem : a survey

... the problem of finding a shortest Hamilto- nian path in circulant (di)graphs; see, ...open problem. (In the case of the bottleneck objective, however, the problem is efficiently solvable; see Burkard ...

52

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 ...

14

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. ...

5

Improved Memetic Algorithm and Its Application on Traveling Salesman Problem

Improved Memetic Algorithm and Its Application on Traveling Salesman Problem

... Memetic algorithm is one of heuristic algorithms which includes global search and local search. It is more appropriate for traveling salesman problem than some classical mathematical methods. In this ...

5

Particle Swarm Optimization to Solve Multiple Traveling Salesman Problem

Particle Swarm Optimization to Solve Multiple Traveling Salesman Problem

... Bifan Li, Lipo Wang, and Wu Song (2008):- In this paper, new model of Ant Colony Optimization (ACO) probabilistic Mant to solve the traveling salesman problem (TSP) by introducing ants with memory ...

6

Show all 10000 documents...

Related subjects