Malaria is one of the major causes of a high death rate due to infectious diseases every year. Despite attempts to eradicate the disease, results have not been very successful. New vaccines and other treatments are being constantly developed to seek optimal ways to prevent malaria outbreaks. In this article, we formulate and analyze an optimal control model of malaria incorporating the new pre-erythrocytic vaccine and transmission-blocking treatment. Sufficient conditions to guarantee local stability of the malaria-free equilibrium were derived based on the controlled reproduction number condition. Using the non-linear least square fitting method, we fitted the incidence data from the province of Papua and West Papua in Indonesia to estimate the model parameter values. The optimal control characterization and optimality conditions were derived by applying the Pontryagin Maximum Principle, and numerical simulations were also presented. Simulation results show that both the pre-erythrocytic vaccine and transmission-blocking treatment significantly reduce the spread of malaria. Accordingly, a high doses of pre-erythrocytic vaccine is needed if the number of infected individuals is relatively small, while transmission blocking is required if the number of infected individuals is relatively large. These results suggest that a large-scale implementation of both strategies is vital as the world continues with the effort to eradicate malaria, especially in endemic regions across the globe.
The Multiple Traveling Salesman Problem (MTSP) is the extension of the Traveling Salesman Problem (TSP) in which the shortest routes of m salesmen all of which start and finish in a single city (depot) will be determined. If there is more than one depot and salesmen start from and return to the same depot, then the problem is called Fixed Destination Multi-depot Multiple Traveling Salesman Problem (MMTSP). In this paper, MMTSP will be solved using the Ant Colony Optimization (ACO) algorithm. ACO is a metaheuristic optimization algorithm which is derived from the behavior of ants in finding the shortest route(s) from the anthill to a form of nourishment. In solving the MMTSP, the algorithm is observed with respect to different chosen cities as depots and non-randomly three parameters of MMTSP: m, K, L, those represents the number of salesmen, the fewest cities that must be visited by a salesman, and the most number of cities that can be visited by a salesman, respectively. The implementation is observed with four dataset from TSPLIB. The results show that the different chosen cities as depots and the three parameters of MMTSP, in which m is the most important parameter, affect the solution.
1 January 2020 in Journal of Physics: Conference Series
Stock portfolio is a kind of investment which consists of several stocks. The aim of a stock portfolio is to minimize the risk of an investment and maximize the return on investment. To construct the optimum portfolio of stocks, one needs a strategy of stock selection and must determine the percentage of investment in each stock selected. In this paper, both the priority index method and genetic algorithm are applied to optimize the stock portfolios in terms of the return. Priority index is used in stock selection based on some parameters: price/earnings (P/E), earnings/share (EPS), wealth creation, undervaluation, and price per earnings/growth (PEG). Stock selection in each sector is determined by choosing the stocks which have a priority index score at least equal to the minimum priority index score of the selected stocks. The minimum priority index score of the selected stock is determined by using a certain scale parameter. The percentage of investment in each selected stock is then determined by using a genetic algorithm. The results showed that increasing the value of scale parameters does not always increase the average return. Moreover, the stock selection with a wealth creation parameter has a higher average return than without a wealth creation parameter. Stock selection using daily data has a higher average return than annual data. The results also showed that the method has an optimum period of up to five months to make an investment decision.
TB disease now is still one of the major world’s health problems. Loss-sight and undetected cases in TB contribute to the spread of TB. A deterministic model of TB including loss-sight and undetected cases with quarantine intervention is discussed in this paper. We analyzed a sensitivity analysis on the basic reproduction number (R0)and identified to some parameters that should be considered. Numerical simulations are performed under various scenarios based on the sensitivity analysis results. The simulations show how significant the impact of loss-sight and undetected cases in the spreading of TB. The more people infected with TB disease with loss-sight and undetected cases, the faster process of dissemination of TB disease. Consequently, If this condition persists, then the effort to reduce spreading of disease will take more time and cost to be spent for the treatment of TB disease will be greater.
1 January 2021 in Journal of Physics: Conference Series
This paper examines the price of European put options with underlying asset zero-coupon bond and the interest rate that satisfied the Vasicek model with jump. The study was conducted by reconstructing the European put option pricing equation. The jump size is defined following a mixed-exponential distribution. By utilizing infinitesimal generator and martingale concepts, Laplace transform is constructed for the distribution of the Vasicek model with jump. Then, using the results of the Laplace transform for the distribution of the Vasicek model with jump and the concept of equivalent martingale measure, the European put option pricing equation with underlying asset zero-coupon bond is constructed.
21 March 2018 in Journal of Physics: Conference Series
The traveling salesman problem (TSP) is a famous problem in finding the shortest tour to visit every vertex exactly once, except the first vertex, given a set of vertices. This paper discusses three modification methods to solve TSP by combining Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO) and 3-Opt Algorithm. The ACO is used to find the solution of TSP, in which the PSO is implemented to find the best value of parameters α and β that are used in ACO.In order to reduce the total of tour length from the feasible solution obtained by ACO, then the 3-Opt will be used. In the first modification, the 3-Opt is used to reduce the total tour length from the feasible solutions obtained at each iteration, meanwhile, as the second modification, 3-Opt is used to reduce the total tour length from the entire solution obtained at every iteration. In the third modification, 3-Opt is used to reduce the total tour length from different solutions obtained at each iteration. Results are tested using 6 benchmark problems taken from TSPLIB by calculating the relative error to the best known solution as well as the running time. Among those modifications, only the second and third modification give satisfactory results except the second one needs more execution time compare to the third modifications.