Application of Lexisearch Algorithm to Vehicle Routing Problem with Time Windows
Publication Date: 23/04/2024
DOI: 10.52589/AJMSS-IBKASWQH
Author(s):
Achaku D. T., Sani B..
Volume/Issue:
Volume 7
,
Issue 2
(2024)
Abstract:
Vehicle Routing Problem with Time Windows (VRPTW) is an NP hard combinatorial scheduling optimization problem in which a minimum number of routes have to be determined so as to serve each of the destinations within their specified time windows. In this paper, the mail delivery of the Nigerian Postal Services (NIPOST) is modelled as a VRPTW in order to address the problem of delay in mail delivery occurring regularly in NIPOST. The Abuja Post Office is used as a case study and the Model of a related literature is applied with modifications to solve the problem. The problem is solved by applying Lexisearch algorithm using data that was obtained from Abuja Post Office and computational results on Solomon’s 100 instances were used to validate the algorithm.
Keywords:
Vehicle routing problem, Branch and bound algorithm, Time windows, Optimal and mail clearance.
No. of Downloads:
0
View: 18
Formulation of Game Model as a Linear Programming Problem using Various Models
Publication Date: 12/04/2024
DOI: 10.52589/AJMSS-XHFXSZP7
Author(s):
George Obed Samuel, P. O. Ekoko (Prof.).
Volume/Issue:
Volume 7
,
Issue 2
(2024)
Abstract:
Game theory is the examination of strategic interactions between two or more individuals known as players who act based on their individual self-interest within a framework known as the game. Every player possesses a set of possible actions referred to as strategies, from which they make selections. In a two-person zero sum game, each of the two players has at least two strategies. In such a game problem where both players have no inferior strategies, we can determine the optimal mixed strategies of the game problem by converting it to a linear programming problem and solving it using the simplex method or variations of it. In this paper, consideration of some existing models along with our proposed model on the conversion of game problem to LPP was made. We compared the results across the various models considered. The results obtained revealed that our proposed model on the conversion of game problem to LPP produced a higher value of the game compared to the others considered; and thus, produced better performance.
Keywords:
Game Theory, Linear Programming Formulation, linear programming problem, simplex method.
No. of Downloads:
0
View: 26
