OPTIMIZATION OF POSTAL ROUTES BY GENETIC ALGORITHM FOR SOLVING THE MULTIPLE TRAVELING SALESMAN PROBLEM

Martin Macík () and Jozef Štefunko ()
Additional contact information
Martin Macík: Faculty of Operation and Economics of Transport and Communications, University of Žilina
Jozef Štefunko: Faculty of Operation and Economics of Transport and Communications, University of Žilina

CBU International Conference Proceedings, 2015, vol. 3, issue 0, 043-049

Abstract: High level of competition on postal market increases demands on reliability of postal services and lowering of transport costs. This can be achieved by optimizing the routing of postal vehicles. The article discusses the possibilities of such optimization by using graph theory. It describes basic methods of finding optimal routes using a graph. The approach, used in this article, assesses the possibility of applying meta-heuristic solution to the traveling salesman problem in the postal sector. Simulation of methods described has been applied on a regional postal network. Results showed that the software used proves to be sufficiently functional for the field of postal transport networks.

Keywords: Postal networkgraph theory; heuristic methods; genetic algorithm; traveling salesman (search for similar items in EconPapers)
JEL-codes: L87 R53 (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
https://ojs.journals.cz/index.php/CBUIC/article/view/582/536 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:aad:iseicj:v:3:y:2015:i:0:p:043-049

DOI: 10.12955/cbup.v3.582

Access Statistics for this article

More articles in CBU International Conference Proceedings from ISE Research Institute
Bibliographic data for series maintained by Petr Hájek ().