Corpus ID: 11025633

# The Travelling Salesman Problem and its Application in Logistic Practice

```@inproceedings{Filip2011TheTS,
title={The Travelling Salesman Problem and its Application in Logistic Practice},
author={Exnar Filip},
year={2011}
}```
The article describes The Travelling Salesman Problem as a logistic transport task. The first part defines the TSP as a mathematical model and briefly describes main established methods of solving the problem. The second part brings experience with practical task solutions in a distribution company within specific conditions and other requirements of the transport management in the company.
28 Citations

#### Figures, Tables, and Topics from this paper

A Review of Traveling Salesman Problem with Time Window Constraint
• 2015
The Traveling Salesman Problem (TSP) is a famous combinatorial problem which is intensively studied in the area of optimization. TSP solution has wide variety of applications but generally is used inExpand
A Mathematical Model to Optimize Transport Cost and Inventory Level in a Single Level Logistic Network
• Computer Science
• 2015
A mixed integer programming formula that can be solved using Lingo 14.0 is proposed that minimizes transportation costs and optimizes distribution organization in a single level logistic network. Expand
ADAPTATION OF THE HARMONY SEARCH ALGORITHM TO SOLVE THE TRAVELLING SALESMAN PROBLEM
• 2014
The travelling salesman problem (TSP) is a discrete combinatorial optimization problem; it allows us to solve a set of problems in the real world in var ious fields. This article presents a newExpand
A New Method to Improve Computing Time for TSP Little Algorithm
• Computer Science
• 2019
The proposed method reduces the solving time of a TSP problem and so decreases the overall costs and diminish the environmental impact of transport. Expand
A new mathematical programming formulation for the Single-Picker Routing Problem
• Computer Science
• Eur. J. Oper. Res.
• 2016
By means of extensive numerical experiments it is shown that the proposed formulation is superior to standard TSP formulations, and for the first time a mathematical programming formulation is proposed which takes into account this specific property. Expand
DISCRETE PENGUINS SEARCH OPTIMIZATION ALGORITHM TO SOLVE THE TRAVELING SALESMAN PROBLEM
The traveling salesman problem (TSP) is an NP-hard combinatorial optimization problem that can be solved by finding optimal solutions. In this work we present an adaptation of the metaheuristicExpand
HUNTING SEARCH ALGORITHM TO SOLVE THE TRAVELING SALESMAN PROBLEM
Traveling salesman problem is a classic combinatorial optimization problem NP-hard. It is often used to evaluate the performance of new optimization methods. We propose in the present article toExpand
QUANTITATIVE METHODS FOR SUPPORT OF MANAGERIAL DECISION-MAKING IN LOGISTICS
• 2012
The present entrepreneurial environment can be characterized by the speed of changes, rapidly developing ICT, and application of differentiated CRM, particularly in the area of logistics services.Expand
An Application of Metric Method of Solving Travelling Salesman Routing Problem to Table Water Company
• Mathematics
• 2016
Background:This research work deals with the travelling salesman problem, the aim of this research is to obtain the cheapest possible route to be taken during the distribution of product (water) inExpand
Discrete cuttlefish optimization algorithm to solve the travelling salesman problem
• Mathematics
• 2015 Third World Conference on Complex Systems (WCCS)
• 2015
The cuttlefish optimization algorithm is a new combinatorial optimization algorithm in the family of metaheuristics, applied in the continuous domain, and which provides mechanisms for local andExpand

#### References

SHOWING 1-10 OF 29 REFERENCES
The location - routing problem: an innovative approach
• Engineering
• 2007
The logistics system of a firm deals with purchased materials carrying, controls work in process in each production phase and the flow of the products delivered to the customer, defines theExpand
An ant-based technique for the dynamic generalized traveling salesman problem
• Computer Science
• 2007
An effective metaheuristic algorithm based on ant colony system in the case of the dynamic generalized traveling salesman problem is presented and can be used for other dynamic large scale NP- hard problems encountered in telecommunications, transportation, network design, etc. Expand
A Genetic Algorithm for Solving Travelling Salesman Problem
• Computer Science
• 2011
Genetic Algorithm which is a very good local search algorithm is employed to solve the TSP by generating a preset number of random tours and then improving the population until a stop condition is satisfied and the best chromosome which are a tour is returned as the solution. Expand
Parallel Implementation of Ant Colony Optimization for Travelling Salesman Problem
A parallel ant colony algorithm for the Travelling Salesman Problem (TSP) is presented. Some experiments using a MPI based framework are made and analyzed. The achieved results prove that the TSPExpand
Using River Formation Dynamics to Design Heuristic Algorithms
• Mathematics, Computer Science
• UC
• 2007
This paper proposes a new type of heuristic algorithms based on river formation dynamics that provides some advantages over other heuristic methods, like ant colony optimization methods, and illustrates its usefulness applying to a concrete example: The Traveling Salesman Problem. Expand
A Memetic Algorithm with a large neighborhood crossover operator for the Generalized Traveling Salesman Problem
• Computer Science, Mathematics
• Comput. Oper. Res.
• 2010
This paper addresses the solution of the Generalized Traveling Salesman Problem using a Memetic Algorithm, and demonstrates the efficiency of the algorithm in both solution quality and computation time. Expand
Role of demand planning in business process management