Stock portfolio optimization using hill climbing and simple human learning optimization algorithms as a decision
Suyash S Satpute1, Amol C Adamuthe2, Pooja Bagane3
1Department of CSE, Kasegaon Education Society's Rajarambapu Institute of Technology, affiliated to Shivaji University, Sakharale, MS 415414, India.
Methodsx
|June 30, 2025
Summary
This study developed a stock portfolio optimization system using hybrid algorithms. Fundamentally undervalued portfolios significantly outperformed growth portfolios and US market indices.
Area of Science:
- Quantitative Finance
- Computational Finance
- Investment Management
Background:
- Stock portfolio optimization aims to maximize returns while minimizing risk.
- Traditional methods may not fully capture complex market dynamics.
- Integrating fundamental analysis offers a robust approach to stock selection.
Purpose of the Study:
- To develop a decision support system (DSS) for stock portfolio optimization.
- To hybridize nature-inspired algorithms (hill climbing and SHLO) with fundamental analysis modules.
- To evaluate the performance of optimized portfolios against various risk profiles and market indices.
Main Methods:
- Developed a DSS integrating intrinsic value and financial health analysis modules.
- Designed custom datasets using historical fundamental stock data.
- Employed a novel fitness function with hill climbing and SHLO algorithms for optimization.
Main Results:
- Optimized portfolios showed decreasing returns from 55% to 24% as risk tolerance increased.
- Increasing portfolio cardinality led to decreased returns.
- Fundamentally undervalued portfolios demonstrated superior performance compared to growth portfolios.
Conclusions:
- The developed DSS effectively optimizes stock portfolios based on fundamental analysis.
- Optimized portfolios consistently outperformed US market indices (>80% of the time).
- Hybridizing nature-inspired algorithms enhances portfolio selection accuracy and risk management.
Keywords:
Decision support system (DSS)Financial health analysisHill climbing algorithmIntrinsic stock valueSimple human learning optimization algorithmStock portfolio optimizationStock portfolio optimization using hill climbing and simple human learning optimization algorithms as a decision support systemMore Related Videos
Related Concept Videos
Decision Making: P-value Method
5.7K
The process of hypothesis testing based on the P-value method includes calculating the P- value using the sample data and interpreting it.
First, a specific claim about the population parameter is proposed. The claim is based on the research question and is stated in a simple form. Further, an opposing statement to the claim is also stated. These statements can act as null and alternative hypotheses: a null hypothesis would be a neutral statement while the alternative hypothesis can...
First, a specific claim about the population parameter is proposed. The claim is based on the research question and is stated in a simple form. Further, an opposing statement to the claim is also stated. These statements can act as null and alternative hypotheses: a null hypothesis would be a neutral statement while the alternative hypothesis can...
5.7K
Decision Making: Traditional Method
4.2K
The process of hypothesis testing based on the traditional method includes calculating the critical value, testing the value of the test statistic using the sample data, and interpreting these values.
First, a specific claim about the population parameter is decided based on the research question and is stated in a simple form. Further, an opposing statement to this claim is also stated. These statements can act as null and alternative hypotheses, out of which a null hypothesis would be a...
First, a specific claim about the population parameter is decided based on the research question and is stated in a simple form. Further, an opposing statement to this claim is also stated. These statements can act as null and alternative hypotheses, out of which a null hypothesis would be a...
4.2K
Decision Making
242
Decision-making is a fundamental cognitive process that involves evaluating alternatives and selecting among them. This process can range from simple choices, such as deciding what to wear, to complex decisions, like choosing a major in college or a career path. The complexity of the decision often dictates the approach we use, which can be broadly categorized into two types: automatic and controlled decision-making.
Automatic decision-making is fast, intuitive, and relies on gut feelings...
Automatic decision-making is fast, intuitive, and relies on gut feelings...
242
Heuristics
153
Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
153
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
103
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
103
Maxwell-Boltzmann Distribution: Problem Solving
1.8K
Individual molecules in a gas move in random directions, but a gas containing numerous molecules has a predictable distribution of molecular speeds, which is known as the Maxwell-Boltzmann distribution, f(v).
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
1.8K


