Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/68006
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVukmirovic, Slavomir-
dc.contributor.authorCapko, Zvonko-
dc.contributor.authorBabic, Ana-
dc.date.accessioned2021-01-28T06:35:30Z-
dc.date.available2021-01-28T06:35:30Z-
dc.date.issued2019-
dc.identifier.citationVukmirovic, S., Capko, Z., & Babic, A. (2019). Model of using the exhaustive search algorithm in solving of traveling salesman problem (TSP) on the example of the transport network optimization of Primorje-Gorski Kotar County (PGC). Journal of Corporate Governance, Insurance and Risk Management, 6(2), 1-12.en_GB
dc.identifier.issn2757-0983-
dc.identifier.urihttps://www.um.edu.mt/library/oar/handle/123456789/68006-
dc.description.abstractThis paper considers and presents a model of the use of an exhaustive search algorithm in solving problems of a salesman on the example of the transportation network optimization of Primorsko Goranska County. By identifying the suboptimal solutions of transportation network, that enable insight into more transportation routes and can be significantly influenced by the reduction of transportation costs and creating increased opportunities for the carrier in the context of flexible designing the structure of the commodity flows, greater utilization of transport capacity, and thus achieve greater profit. In the analyzed example, transportation network of Primorje-Gorski Kotar County (PGC) is divided into two sets (segment): 1) a set of cities (nodes) that are located (placed) on the same traffic direction (transportation route) that represents the optimal transportation route, and 2) a set of cities (nodes) that connect through a variety of transport relationships and that are included in the calculation by using the exhaustive search algorithm. In the example are also defined nodes that are common to both the two sets and that are connecting by the virtual transportation route in the spreadsheet optimization model.en_GB
dc.language.isoenen_GB
dc.publisherGovernance Research and Development Centre, Croatia & University of Malta, Faculty of Economics, Management and Accountancy, Department of Insuranceen_GB
dc.rightsinfo:eu-repo/semantics/openAccessen_GB
dc.subjectTransportation -- Croatiaen_GB
dc.subjectAlgorithmsen_GB
dc.subjectMathematical optimizationen_GB
dc.titleModel of using the exhaustive search algorithm in solving of traveling salesman problem (TSP) on the example of the transport network optimization of Primorje-Gorski Kotar County (PGC)en_GB
dc.typearticleen_GB
dc.rights.holderThe copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holder.en_GB
dc.description.reviewedpeer-revieweden_GB
dc.identifier.doi10.51410/JCGIRM2019-2-1-
dc.publication.titleJournal of Corporate Governance, Insurance and Risk Managementen_GB
Appears in Collections:JCGIRM, Volume 6, Issue 2, 2019

Files in This Item:
File Description SizeFormat 
JCGIRM6(2)A1.pdf980.64 kBAdobe PDFView/Open


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.