Optimization Of Postal Routes By Genetic Algorithm For Solving The Multiple Traveling Salesman Problem
Author
Abstract
Suggested Citation
DOI: 10.12955/cbup.v3.582
Download full text from publisher
More about this item
Keywords
Postal networkgraph theory; heuristic methods; genetic algorithm; traveling salesman;All these keywords.
JEL classification:
- L87 - Industrial Organization - - Industry Studies: Services - - - Postal and Delivery Services
- R53 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - Regional Government Analysis - - - Public Facility Location Analysis; Public Investment and Capital Stock
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:aad:iseicj:v:3:y:2015:i:0:p:043-049. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Petr Hájek (email available below). General contact details of provider: https://ojs.journals.cz/index.php/CBUIC .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.