Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Results found: 3

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  traveling salesman problem
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1

Traveling salesman problem: approach to optimality

100%
Jadczak R.
Przedsiębiorczość i Zarządzanie
|
2014
|
vol. 15
|
issue 2
157-169
EN
Traveling Salesman Problem (TSP) is a basic and one of the most important transportation problems in operational logistics. It is also known in the literature as a Chinese postman problem or single vehicle routing problem. TSP can be shortly described as follows. Vehicle starting from the selected city must visit a set of another cities exactly once and return to the starting city in such a way that the total distance of the route is minimized. In this paper first mathematical formulation of decision problem is presented. Then solution strategies of TSP are shown with selected algorithms as examples. In the last part of article, a computational results of selected methods are presented.
2

Optimization of deployment of goods supply in a high storage warehouse by means of the greedy algorithm

100%
Sabo A.
Mathematical Economics
|
2012
|
issue 8 (15)
111-121
EN
A warehouse is one of the key areas in logistics. A large group of logistic problems is associated with the storage process. The optimization of logistic processes undoubtedly brings many benefits for businesses, both financial and organizational. This paper presents one of the most common problems which occurs in a specific type of warehouse – high storage warehouse. The problem is the location of the supply of goods in a high storage warehouse. Due to the large computational complexity of the problem, the paper proposes to use heuristic algorithms to solve the problem. The high storage warehouse is also a system that allows the comprehensive management of logistics operations in the warehouse by using information from a database and the corresponding data processing algorithms. The presented approach assumes the implementation of heuristic algorithms in the logistic warehouse management system and uses them in the high storage warehouse. This will allow the material management in the warehouse to become easier, faster and the decision-making to become more accurate.
3
Content available remote

A MEASURE OF EMERGENCE OF A LOGISTIC GROUP INTERACTION

51%
Novikov V., Korsuk Y., Shipulina L.
LogForum
|
2012
|
vol. 8
|
issue 2
109-122
EN
Background: The nature of the relations between group members is a very important part of the integrity of the logistics process. The identification of rating among the participants is certainly the most necessary condition for the quality of the logistics process. It can distinguished four types of emergence rating: direct participation rating, direct impact rating, participation rating and impact rating. The aim of this paper was to create the method to determine the mutual relationships among various elements of logistic group. Methods: The technique is based on the processing of the matrix of pairwise interactions obtained on the basis of a questionnaire survey of all members of the group and expressed as a score on the selected scale of assessments. The computation algorithm is based in particular on the traveling salesman problem using an original method of optimization and is implemented in Visual Studio C #. Results: 16 types of leaderships were distinguished and described by the use of statistical methods. Conclusions: The developed method of calculating the measure of emergence can be used not only for a group of students, but also for the definition of the rate of emergence in any collective system.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.