Nicodemus K. Mwonga, A. Gitau, J. Mutua, S. T. Mwangi
This study aimed at optimizing tillage depth and hitching length for optimal draft requirement in sandy clay loam soils for animal drawn subsoiler. Field experiments were conducted to collect draft datasets using the MSI 7300 digital dynamometer communicating remotely with MSI-8000 RF data logger connected to a laptop through the serial port. To determine the numeric values of soil parameters pertinent to subsoiling, field experiments, laboratory tests and numerical analysis techniques were employed. For a specified speed, a combination of three hitch lengths of 2.5 m, 3.0 m and 3.5 m and three depths from 0 cm to 30 cm with a range of 10 cm interval was used. Soil bulk density was found to vary between 1.52 to 1.37 g/cm3 and 1.44 to 1.67 g/cm3 for Machakos and Kitui experimental plots respectively. Soil moisture content increased with an increase in depth ranging from 3.53% to 9.94% for Machakos site and from 4.15% to 9.61% for Kitui site. Soil shear strength parameters ranged between 21.71 and 29.6 kPa between depths of 0 - 20 cm and decreased to 28.07 kPa for depths beyond 20 cm at Machakos experimental plot; while for Kitui experimental plot, it ranged between 30.02 and 39.29 kPa between depths of 0 - 30 cm. A second-order quadratic expression of the form y = ax2 + bx + c was obtained for the relationship between specific draft and depth at given hitching length as well as specific draft against hitching length at a given depth. The optimal hitching length and tillage depth for Machakos experimental plot were obtained as 2.9 m (~3 m) and 16.5 cm respectively. In Kitui experimental site, the optimal hitching length was obtained as 2.9 m (~3 m) and the optimal tillage depth was 15.4 cm.
{"title":"Optimization of Specific Draft Requirement and Hitch Length for an Animal Drawn Sub-Soiler: A Case of Sandy Clay Loam Soils","authors":"Nicodemus K. Mwonga, A. Gitau, J. Mutua, S. T. Mwangi","doi":"10.4236/ojop.2019.83008","DOIUrl":"https://doi.org/10.4236/ojop.2019.83008","url":null,"abstract":"This study aimed at optimizing tillage depth and hitching length for optimal draft requirement in sandy clay loam soils for animal drawn subsoiler. Field experiments were conducted to collect draft datasets using the MSI 7300 digital dynamometer communicating remotely with MSI-8000 RF data logger connected to a laptop through the serial port. To determine the numeric values of soil parameters pertinent to subsoiling, field experiments, laboratory tests and numerical analysis techniques were employed. For a specified speed, a combination of three hitch lengths of 2.5 m, 3.0 m and 3.5 m and three depths from 0 cm to 30 cm with a range of 10 cm interval was used. Soil bulk density was found to vary between 1.52 to 1.37 g/cm3 and 1.44 to 1.67 g/cm3 for Machakos and Kitui experimental plots respectively. Soil moisture content increased with an increase in depth ranging from 3.53% to 9.94% for Machakos site and from 4.15% to 9.61% for Kitui site. Soil shear strength parameters ranged between 21.71 and 29.6 kPa between depths of 0 - 20 cm and decreased to 28.07 kPa for depths beyond 20 cm at Machakos experimental plot; while for Kitui experimental plot, it ranged between 30.02 and 39.29 kPa between depths of 0 - 30 cm. A second-order quadratic expression of the form y = ax2 + bx + c was obtained for the relationship between specific draft and depth at given hitching length as well as specific draft against hitching length at a given depth. The optimal hitching length and tillage depth for Machakos experimental plot were obtained as 2.9 m (~3 m) and 16.5 cm respectively. In Kitui experimental site, the optimal hitching length was obtained as 2.9 m (~3 m) and the optimal tillage depth was 15.4 cm.","PeriodicalId":66387,"journal":{"name":"最优化(英文)","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46516001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this work we propose a solution method based on Lagrange relaxation for discrete-continuous bi-level problems, with binary variables in the leading problem, considering the optimistic approach in bi-level programming. For the application of the method, the two-level problem is reformulated using the Karush-Kuhn-Tucker conditions. The resulting model is linearized taking advantage of the structure of the leading problem. Using a Lagrange relaxation algorithm, it is possible to find a global solution efficiently. The algorithm was tested to show how it performs.
{"title":"A Lagrange Relaxation Based Approach to Solve a Discrete-Continous Bi-Level Model","authors":"Zaida E. Alarcón-Bernal, R. Aceves-García","doi":"10.4236/ojop.2019.83009","DOIUrl":"https://doi.org/10.4236/ojop.2019.83009","url":null,"abstract":"In this work we propose a solution method based on Lagrange relaxation for discrete-continuous bi-level problems, with binary variables in the leading problem, considering the optimistic approach in bi-level programming. For the application of the method, the two-level problem is reformulated using the Karush-Kuhn-Tucker conditions. The resulting model is linearized taking advantage of the structure of the leading problem. Using a Lagrange relaxation algorithm, it is possible to find a global solution efficiently. The algorithm was tested to show how it performs.","PeriodicalId":66387,"journal":{"name":"最优化(英文)","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43377864","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The current structure of Landmark University (LU) was induced by raising a generation of solution providers through a qualitative and life-applicable training system that focuses on values and creative knowledge by making it more responsive and relevant to the modern-day demands of demonstration, industrialization and development. The challenge facing Landmark University is the question of which of its numerous projects they should invest to give maximum output with minimum input. In this paper, we maximize the Net Present Value (NPV) and maintain the net discount cash overflow of each project per period as contained and extracted as the secondary data of cash inflows of the Landmark University (LU) monthly financial statement and annual reports from 2012 to 2017 of which the documents have been regrouped as small and large scale projects as many enterprises make more use of the trial-and-error method and as such firms have been finding it difficult in allocating scarce resources in a manner that will ensure profit maximization and/or cost minimization with a simple and accurate decision making by the company through an optimization principle in selecting LU project under multi-period capital rationing using linear programming (LP) and integer programming (IP). The annual net cash flow which is the difference between the cash inflows and cash outflows during each period for the project was estimated and recorded. The discount factors were estimated at cost of capital of 10% for each cash flow per period with the corresponding NPV at 10% which revealed that the optimal decision achieves maximum returns of $110 × 102 and this assisted the project manager to select a large number of the variable projects that can maximize the profit which is far better than relying on an ad-hoc judgmental approach to project investment that could have cost 160 × 102 for the same project. Sensitivity analysis on the project parameters are also carried out to test the extent to which project selection is sensitive to changes in the parameters of the system revealed that a little reduction and or addition of reduced cost by certain amount or percentages to its corresponding coefficient in the objective function effect no changes in the shadow prices with solution values for variables (x1), (x4), (x5) and the optimal objective function.
{"title":"Application of Optimization Principle in Landmark University Project Selection under Multi-Period Capital Rationing Using Linear and Integer Programming","authors":"N. Oladejo","doi":"10.4236/ojop.2019.83007","DOIUrl":"https://doi.org/10.4236/ojop.2019.83007","url":null,"abstract":"The current structure of Landmark University (LU) was induced by raising a generation of solution providers through a qualitative and life-applicable training system that focuses on values and creative knowledge by making it more responsive and relevant to the modern-day demands of demonstration, industrialization and development. The challenge facing Landmark University is the question of which of its numerous projects they should invest to give maximum output with minimum input. In this paper, we maximize the Net Present Value (NPV) and maintain the net discount cash overflow of each project per period as contained and extracted as the secondary data of cash inflows of the Landmark University (LU) monthly financial statement and annual reports from 2012 to 2017 of which the documents have been regrouped as small and large scale projects as many enterprises make more use of the trial-and-error method and as such firms have been finding it difficult in allocating scarce resources in a manner that will ensure profit maximization and/or cost minimization with a simple and accurate decision making by the company through an optimization principle in selecting LU project under multi-period capital rationing using linear programming (LP) and integer programming (IP). The annual net cash flow which is the difference between the cash inflows and cash outflows during each period for the project was estimated and recorded. The discount factors were estimated at cost of capital of 10% for each cash flow per period with the corresponding NPV at 10% which revealed that the optimal decision achieves maximum returns of $110 × 102 and this assisted the project manager to select a large number of the variable projects that can maximize the profit which is far better than relying on an ad-hoc judgmental approach to project investment that could have cost 160 × 102 for the same project. Sensitivity analysis on the project parameters are also carried out to test the extent to which project selection is sensitive to changes in the parameters of the system revealed that a little reduction and or addition of reduced cost by certain amount or percentages to its corresponding coefficient in the objective function effect no changes in the shadow prices with solution values for variables (x1), (x4), (x5) and the optimal objective function.","PeriodicalId":66387,"journal":{"name":"最优化(英文)","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48855689","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper considers a variation on the Dubins path problem and proposes an improved waypoint navigation (WN) algorithm called Dubins waypoint navigation (DWN). Based on the Dubins path problem, an algorithm is developed that is updated in real-time with a horizon of three waypoints. The purpose of DWN is to overcome a problem that we find in existing WN for small-class fixed-wing unmanned aerial vehicles (UAV) of not accurately reaching waypoints. This problem results at times in high overshoot and, in the presence of wind disturbances, it can cause a vehicle to miss the waypoint and swirl around it. To prevent this, the DWN creates “new waypoints” that are in the background, called turning points. Examples illustrate the improvement of the performance of WN achieved using the DWN algorithm in terms of the targeting of waypoints while reducing fuel and time.
{"title":"Dubins Waypoint Navigation of Small-Class Unmanned Aerial Vehicles","authors":"L. Silverberg, D. Xu","doi":"10.4236/OJOP.2019.82006","DOIUrl":"https://doi.org/10.4236/OJOP.2019.82006","url":null,"abstract":"This paper considers a variation on the Dubins path problem and proposes an improved waypoint navigation (WN) algorithm called Dubins waypoint navigation (DWN). Based on the Dubins path problem, an algorithm is developed that is updated in real-time with a horizon of three waypoints. The purpose of DWN is to overcome a problem that we find in existing WN for small-class fixed-wing unmanned aerial vehicles (UAV) of not accurately reaching waypoints. This problem results at times in high overshoot and, in the presence of wind disturbances, it can cause a vehicle to miss the waypoint and swirl around it. To prevent this, the DWN creates “new waypoints” that are in the background, called turning points. Examples illustrate the improvement of the performance of WN achieved using the DWN algorithm in terms of the targeting of waypoints while reducing fuel and time.","PeriodicalId":66387,"journal":{"name":"最优化(英文)","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48586846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Generating electricity from wave is predicted to be a new source of renewable energy conversion gaining more attention and is considered in various countries as promising renewable resource. Being surrounded by sea, Malaysia has the advantage of tapping energy from the nearest sea wave. However, Malaysia has low wave climate compared to other regions. On top of that, the technologies available for extracting this energy are still in infancy stage. This study explored the potential of generating electricity from low height wave energy. The recorded average electricity can be generated from the lab scale device which is 0.224 V, 0.175 A and 0.039 W. The data collected from Mukah Beach show that the maximum voltage recorded is 1.021 V, maximum current of 0.86 A and highest power of 0.878 W. By comparing results from both locations, the difference is almost 10-fold which validates the wave maker built in laboratory with 1:10 ratio. The standard deviation of all the outputs is small which indicates that the output generation from low height wave would be consistent. Although the output is small, it could be paired together to make a larger system to generate higher output. This study concludes that the developed lab scale model is useful for harnessing electrical energy from sea wave. The future direction of research would be to optimize the current method to maximize energy capture from sea wave. Another direction for future study is to make a system comprised of a large number of such devices to generate higher output.
{"title":"Energy Extraction from Low Height Sea Wave in Sarawak near Shore Region","authors":"M. Lee, Heng Jong Ngu, Dennis Ting Yuk Shin","doi":"10.4236/OJOP.2019.81005","DOIUrl":"https://doi.org/10.4236/OJOP.2019.81005","url":null,"abstract":"Generating electricity from wave is predicted to be a new source of renewable energy conversion gaining more attention and is considered in various countries as promising renewable resource. Being surrounded by sea, Malaysia has the advantage of tapping energy from the nearest sea wave. However, Malaysia has low wave climate compared to other regions. On top of that, the technologies available for extracting this energy are still in infancy stage. This study explored the potential of generating electricity from low height wave energy. The recorded average electricity can be generated from the lab scale device which is 0.224 V, 0.175 A and 0.039 W. The data collected from Mukah Beach show that the maximum voltage recorded is 1.021 V, maximum current of 0.86 A and highest power of 0.878 W. By comparing results from both locations, the difference is almost 10-fold which validates the wave maker built in laboratory with 1:10 ratio. The standard deviation of all the outputs is small which indicates that the output generation from low height wave would be consistent. Although the output is small, it could be paired together to make a larger system to generate higher output. This study concludes that the developed lab scale model is useful for harnessing electrical energy from sea wave. The future direction of research would be to optimize the current method to maximize energy capture from sea wave. Another direction for future study is to make a system comprised of a large number of such devices to generate higher output.","PeriodicalId":66387,"journal":{"name":"最优化(英文)","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42588908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The bleaching of crude palm oil using activated plantain peel ash (APPA) was studied in this work. Historical data design (HDD) in response surface methodology (RSM) experimental design was employed to optimize and correlate the process operating parameters (temperature, time and adsorbent dosage) to the percentage bleaching efficiency. The analysis of the results showed that the quadratic effects of the operating parameters were significant. The optimum condition for the maximum adsorption efficiency of 70.04% was obtained at 160°C temperature, 60 minutes reaction time, and 4 g adsorbent dosage. The predicted bleaching efficiency of 74% was in good agreement with the optimum experimental yield. This study has revealed that APPA is a good source of adsorbent for palm oil bleaching.
{"title":"Optimization of Bleaching Process of Crude Palm Oil by Activated Plantain (Musa paradisiaca) Peel Ash Using Response Surface Methodology","authors":"W. Raji, R. Azike, F. W. Ngubi","doi":"10.4236/OJOP.2019.81004","DOIUrl":"https://doi.org/10.4236/OJOP.2019.81004","url":null,"abstract":"The bleaching of crude palm oil using activated plantain peel ash (APPA) was studied in this work. Historical data design (HDD) in response surface methodology (RSM) experimental design was employed to optimize and correlate the process operating parameters (temperature, time and adsorbent dosage) to the percentage bleaching efficiency. The analysis of the results showed that the quadratic effects of the operating parameters were significant. The optimum condition for the maximum adsorption efficiency of 70.04% was obtained at 160°C temperature, 60 minutes reaction time, and 4 g adsorbent dosage. The predicted bleaching efficiency of 74% was in good agreement with the optimum experimental yield. This study has revealed that APPA is a good source of adsorbent for palm oil bleaching.","PeriodicalId":66387,"journal":{"name":"最优化(英文)","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47529820","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fraud is a major challenge facing telecommunication industry. A huge amount of revenues are lost to these fraudsters who have developed different techniques and strategies to defraud the service providers. For any service provider to remain in the industry, the expected loss from the activities of these fraudsters should be highly minimized if not eliminated completely. But due to the nature of huge data and millions of subscribers involved, it becomes very difficult to detect this group of people. For this purpose, there is a need for optimal classifier and predictive probability model that can capture both the present and past history of the subscribers and classify them accordingly. In this paper, we have developed some predictive models and an optimal classifier. We simulated a sample of eighty (80) subscribers: their number of calls and the duration of the calls and categorized it into four sub-samples with sample size of twenty (20) each. We obtained the prior and posterior probabilities of the groups. We group these posterior probability distributions into two sample multivariate data with two variates each. We develop linear classifier that discriminates between the genuine subscribers and fraudulent subscribers. The optimal classifier (βA+B) has a posterior probability of 0.7368, and we classify the subscribers based on this optimal point. This paper focused on domestic subscribers and the parameters of interest were the number of calls per hour and the duration of the calls.
{"title":"Optimal Classifier for Fraud Detection in Telecommunication Industry","authors":"H. Amuji, Etus Chukwuemeka, Emeka Maxwel Ogbuagu","doi":"10.4236/ojop.2019.81002","DOIUrl":"https://doi.org/10.4236/ojop.2019.81002","url":null,"abstract":"Fraud is a major challenge facing telecommunication industry. A huge amount of revenues are lost to these fraudsters who have developed different techniques and strategies to defraud the service providers. For any service provider to remain in the industry, the expected loss from the activities of these fraudsters should be highly minimized if not eliminated completely. But due to the nature of huge data and millions of subscribers involved, it becomes very difficult to detect this group of people. For this purpose, there is a need for optimal classifier and predictive probability model that can capture both the present and past history of the subscribers and classify them accordingly. In this paper, we have developed some predictive models and an optimal classifier. We simulated a sample of eighty (80) subscribers: their number of calls and the duration of the calls and categorized it into four sub-samples with sample size of twenty (20) each. We obtained the prior and posterior probabilities of the groups. We group these posterior probability distributions into two sample multivariate data with two variates each. We develop linear classifier that discriminates between the genuine subscribers and fraudulent subscribers. The optimal classifier (βA+B) has a posterior probability of 0.7368, and we classify the subscribers based on this optimal point. This paper focused on domestic subscribers and the parameters of interest were the number of calls per hour and the duration of the calls.","PeriodicalId":66387,"journal":{"name":"最优化(英文)","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48573999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we approach the problem of obtaining approximate solution of second-order initial value problems by converting it to an optimization problem. It is assumed that the solution can be approximated by a polynomial. The coefficients of the polynomial are then optimized using simulated annealing technique. Numerical examples with good results show the accuracy of the proposed approach compared with some existing methods.
{"title":"Solution of Second-Order Ordinary Differential Equations via Simulated Annealing","authors":"A. Bilesanmi, A. Wusu, A. Olutimo","doi":"10.4236/OJOP.2019.81003","DOIUrl":"https://doi.org/10.4236/OJOP.2019.81003","url":null,"abstract":"In this paper, we approach the problem of obtaining approximate solution of second-order initial value problems by converting it to an optimization problem. It is assumed that the solution can be approximated by a polynomial. The coefficients of the polynomial are then optimized using simulated annealing technique. Numerical examples with good results show the accuracy of the proposed approach compared with some existing methods.","PeriodicalId":66387,"journal":{"name":"最优化(英文)","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42908361","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：