Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Trust Tawanda"'
Publikováno v:
International Journal of Mathematical, Engineering and Management Sciences, Vol 8, Iss 5, Pp 991-1005 (2023)
Shortest path problem (SPP) has various applications in areas such as telecommunications, transportation and emergency services, and postal services among others. As a result, several algorithms have been developed to solve the SPP and related proble
Externí odkaz:
https://doaj.org/article/d9d15cdf76a44d7ead25f6d68f934047
Publikováno v:
Forecasting, Vol 5, Iss 2, Pp 443-452 (2023)
We present a technique to solve the linear integer model with variable bounding. By using the continuous optimal solution of the linear integer model, the variable bounds for the basic variables are approximated and then used to calculate the optimal
Externí odkaz:
https://doaj.org/article/36a91a034b454a8e8a4ebddf47e5b866
Publikováno v:
Applied Sciences, Vol 13, Iss 11, p 6417 (2023)
The travelling salesman problem (TSP) is a problem whereby a finite number of nodes are supposed to be visited exactly once, one after the other, in such a way that the total weight of connecting arcs used to visit these nodes is minimized. We propos
Externí odkaz:
https://doaj.org/article/062f974a6f3549fbbeab7b1e2f7e09bf
Publikováno v:
International Journal of Applied Metaheuristic Computing. 14:1-16
In this article, the authors propose a maximum flow algorithm based on flow matrix. The algorithm only requires the effort to reduce the capacity of the underutilized arcs to that of the respective flow. The optimality of the algorithm is proved by t
Publikováno v:
International Journal of System Assurance Engineering and Management.
Publikováno v:
Intelligent Computing & Optimization ISBN: 9783031199578
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4247eeb7225f05f346b79de644ce82c4
https://doi.org/10.1007/978-3-031-19958-5_88
https://doi.org/10.1007/978-3-031-19958-5_88
Publikováno v:
Intelligent Computing & Optimization ISBN: 9783031199578
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30737dd828b32e3f35aa7a290cdd6b95
https://doi.org/10.1007/978-3-031-19958-5_79
https://doi.org/10.1007/978-3-031-19958-5_79
Autor:
Trust Tawanda
Publikováno v:
International Journal of System Assurance Engineering and Management. 8:370-378
In this paper, a new approach for solving transhipment model as a transportation model is developed and illustrated. The objective is to expose the transhipment problem to algorithms and methods that are transportation problem (TP) based. The princip
Autor:
Trust Tawanda
Publikováno v:
International Journal of Operational Research. 32:313
The critical path method (CPM) is a project modelling algorithm developed in the 1950s for scheduling project activities, it is used to determine the critical path through the calculation of three parameters thus, slack, earliest event, latest event
Publikováno v:
International Journal of Logistics Economics and Globalisation. 6:56
The use of non-iterative shortest route algorithm for finding shortest route between points in a network is illustrated. The non-iterative approach can be applied to various network problems that can be solved using shortest route algorithm and provi