RIEŠENIE PROBLÉMU VIACERÝCH OBCHODNÝCH CESTUJÚCICH POMOCOU GENETICKÉHO ALGORITMU
| dc.contributor.author | Macík, Martin | |
| dc.date.accessioned | 2020-06-01T06:58:37Z | |
| dc.date.available | 2020-06-01T06:58:37Z | |
| dc.date.issued | 2015 | |
| dc.description.abstract | Article deals with application of the multiple traveling salesman problem (MTSP) into environment of postal operator. MTSP involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. This combinatorial optimization method has a multiplicity of applications, mostly in the areas of routing and scheduling. Simulation of MTSP has been applied on regional postal network. Results show that used software proves to be sufficiently functional for field of postal transport networks. | en_US |
| dc.identifier.doi | https://doi.org/10.26552/pte.C.2015.1.3 | |
| dc.identifier.issn | 1336-8281 | |
| dc.identifier.uri | http://drepo.uniza.sk/handle/hdluniza/82 | |
| dc.language.iso | sk | en_US |
| dc.publisher | Žilinská univerzita v Žiline | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | |
| dc.subject | Postal network | en_US |
| dc.subject | graph theory | en_US |
| dc.subject | metaheuristic methods | en_US |
| dc.subject | genetic algorithm | en_US |
| dc.subject | traveling salesman | en_US |
| dc.title | RIEŠENIE PROBLÉMU VIACERÝCH OBCHODNÝCH CESTUJÚCICH POMOCOU GENETICKÉHO ALGORITMU | en_US |
| dc.type | Working Paper | en_US |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- pte.C.2015.1.3.pdf
- Size:
- 1.77 MB
- Format:
- Adobe Portable Document Format
- Description:
- RIEŠENIE PROBLÉMU VIACERÝCH OBCHODNÝCH CESTUJÚCICH POMOCOU GENETICKÉHO ALGORITMU
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: