DOI : https://doi.org/10.18517/ijaseit.13.5.18284

Adaptive Cone Algorithm

Purba Daru Kusuma (1), Meta Kallista (2)
(1) Computer Engineering, Telkom University, Buah Batu Street, Bandung, 40238, Indonesia
(2) Computer Engineering, Telkom University, Buah Batu Street, Bandung, 40238, Indonesia
Fulltext View | Download
How to cite (IJASEIT) :
[1]
P. D. Kusuma and M. Kallista, “Adaptive Cone Algorithm”, Int. J. Adv. Sci. Eng. Inf. Technol., vol. 13, no. 5, pp. 1605–1614, Oct. 2023.
Citation Format :
This study was conducted to promote a new adaptive cone algorithm (ACA) algorithm. ACA is a metaheuristic technique based on swarm intelligence. ACA contains three steps. Each agent moves closer to the global reference in the first step. Then, each agent searches for a better solution around the current solution in the second step. The global reference searches for better solutions around it in the third step. This algorithm is named cone because the local space size declines linearly during the iterative process. ACA introduces a new adaptability model to improve the exploration strategy when a better solution cannot be achieved. It is conducted by enlarging the local solution space. ACA is challenged to find the final solution for theoretical and practical problems. The 23 functions are chosen as theoretical optimization problems. The portfolio optimization problem is selected as the practical problem. ACA is compared with five algorithms: particle swarm optimization (PSO), grey wolf optimizer (GWO), marine predator optimization (MPA), average subtraction-based optimizer (ASBO), and pelican optimization algorithm (POA). The result shows that ACA is competitive in finding the optimal solution for 23 functions and outperforms all sparing algorithms in achieving the highest total capital gain in tackling the portfolio optimization problem. ACA is superior to PSO, GWO, MPA, ASBO, and POA in solving 20, 11, 13, 4, and 21 functions, respectively. In the future, ACA can be implemented in solving various practical optimization problems.

F. Luan, W. Zhang, and Y. Liu, “Robust international portfolio optimization with worst-case mean-LPM,” Math Probl Eng, vol. 2022, pp. 1-10, Feb. 2022, doi: 10.1155/2022/5072487.

M. Escobar-Anel, M. Wahl, and R. Zagst, “Portfolio optimization with wealth-dependent risk constraints,” Scand Actuar J, vol. 2022, no. 3, pp. 244-268, Mar. 2022, doi: 10.1080/03461238.2021.1962962.

H. Xuan, H. Zhang, and B. Li, “An improved discrete artificial bee colony algorithm for flexible flowshop scheduling with step deteriorating jobs and sequence-dependent setup times,” Math Probl Eng, vol. 2019, pp. 1-13, Dec. 2019, doi: 10.1155/2019/8520503.

K. Geng, C. Ye, L. Cao, and L. Liu, “Multi-objective reentrant hybrid flowshop scheduling with machines turning on and off control strategy using improved multi-verse optimizer algorithm,” Math Probl Eng, vol. 2019, pp. 1-18, Jun. 2019, doi: 10.1155/2019/2573873.

D. Kurniawan, A. C. Raja, S. Suprayogi, and A. H. Halim, “A flow shop batch scheduling and operator assignment model with time-changing effects of learning and forgetting to minimize total actual flow time,” Journal of Industrial Engineering and Management, vol. 13, no. 3, p. 546, Nov. 2020, doi: 10.3926/jiem.3153.

I. Ribas and R. Companys, “A computational evaluation of constructive heuristics for the parallel blocking flow shop problem with sequence-dependent setup times,” International Journal of Industrial Engineering Computations, vol. 12, no. 3, pp. 321-328, 2021, doi: 10.5267/j.ijiec.2021.1.004.

P. D. Kusuma and A. S. Albana, “University course timetabling model in joint courses program to minimize the number of unserved requests,” International Journal of Advanced Computer Science and Applications, vol. 12, no. 10, 2021, doi: 10.14569/IJACSA.2021.0121014.

M. Mokhtari, M. Vaziri Sarashk, M. Asadpour, N. Saeidi, and O. Boyer, “Developing a model for the university course timetabling problem: a case study,” Complexity, vol. 2021, pp. 1-12, Dec. 2021, doi: 10.1155/2021/9940866.

I. Balan, “A new genetic approach for course timetabling problem,” Journal of Applied Computer Science & Mathematics, vol. 15, no. 1, pp. 9-14, 2021, doi: 10.4316/JACSM.202101001.

H. Herní¡ndez-Pí©rez and J.-J. Salazar-Gonzí¡lez, “A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem,” Eur J Oper Res, vol. 297, no. 2, pp. 467-483, Mar. 2022, doi: 10.1016/j.ejor.2021.05.040.

D. Wolfinger and J.-J. Salazar-Gonzí¡lez, “The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach,” Eur J Oper Res, vol. 289, no. 2, pp. 470-484, Mar. 2021, doi: 10.1016/j.ejor.2020.07.032.

S. Fazi, J. C. Fransoo, T. van Woensel, and J.-X. Dong, “A variant of the split vehicle routing problem with simultaneous deliveries and pickups for inland container shipping in dry-port based systems,” Transp Res E Logist Transp Rev, vol. 142, p. 102057, Oct. 2020, doi: 10.1016/j.tre.2020.102057.

X. Yuan, Q. Zhang, and J. Zeng, “Modeling and solution of vehicle routing problem with grey time windows and multiobjective constraints,” J Adv Transp, vol. 2021, pp. 1-12, Mar. 2021, doi: 10.1155/2021/6665539.

Y. Wang, L. Ran, X. Guan, and Y. Zou, “Multi-depot pickup and delivery problem with resource sharing,” J Adv Transp, vol. 2021, pp. 1-22, Jun. 2021, doi: 10.1155/2021/5182989.

J. Swan et al., “Metaheuristics ‘in the large,’” Eur J Oper Res, vol. 297, no. 2, pp. 393-406, Mar. 2022, doi: 10.1016/j.ejor.2021.05.042.

J. Xu, “Improved genetic algorithm to solve the scheduling problem of college English courses,” Complexity, vol. 2021, pp. 1-11, Jun. 2021, doi: 10.1155/2021/7252719.

A. Slowik and H. Kwasnicka, “Evolutionary algorithms and their applications to engineering problems,” Neural Comput Appl, vol. 32, no. 16, pp. 12363-12379, Aug. 2020, doi: 10.1007/s00521-020-04832-8.

A. Ibrahim, F. Anayi, M. Packianather, and O. A. Alomari, “New hybrid invasive weed optimization and machine learning approach for fault detection,” Energies (Basel), vol. 15, no. 4, p. 1488, Feb. 2022, doi: 10.3390/en15041488.

D. Freitas, L. G. Lopes, and F. Morgado-Dias, “Particle swarm optimisation: a historical review up to the current developments,” Entropy, vol. 22, no. 3, p. 362, Mar. 2020, doi: 10.3390/e22030362.

Y. Celik, “An enhanced artificial bee colony algorithm based on fitness weighted search strategy,” Automatika, vol. 62, no. 3-4, pp. 300-310, Oct. 2021, doi: 10.1080/00051144.2021.1938477.

S. Liang, T. Jiao, W. Du, and S. Qu, “An improved ant colony optimization algorithm based on context for tourism route planning,” PLoS One, vol. 16, no. 9, p. e0257317, Sep. 2021, doi: 10.1371/journal.pone.0257317.

S. Mirjalili, S. M. Mirjalili, and A. Lewis, “Grey wolf optimizer,” Advances in Engineering Software, vol. 69, pp. 46-61, Mar. 2014, doi: 10.1016/j.advengsoft.2013.12.007.

N. Rana, M. S. A. Latiff, S. M. Abdulhamid, and H. Chiroma, “Whale optimization algorithm: a systematic review of contemporary applications, modifications and developments,” Neural Comput Appl, vol. 32, no. 20, pp. 16245-16277, Oct. 2020, doi: 10.1007/s00521-020-04849-z.

M. Braik, A. Sheta, and H. Al-Hiary, “A novel meta-heuristic search algorithm for solving optimization problems: capuchin search algorithm,” Neural Comput Appl, vol. 33, no. 7, pp. 2515-2547, Apr. 2021, doi: 10.1007/s00521-020-05145-6.

A. Faramarzi, M. Heidarinejad, S. Mirjalili, and A. H. Gandomi, “Marine predators algorithm: a nature-inspired metaheuristic,” Expert Syst Appl, vol. 152, p. 113377, Aug. 2020, doi: 10.1016/j.eswa.2020.113377.

A. M. Fathollahi-Fard, M. Hajiaghaei-Keshteli, and R. Tavakkoli-Moghaddam, “Red deer algorithm (RDA): a new nature-inspired meta-heuristic,” Soft comput, vol. 24, no. 19, pp. 14637-14665, Oct. 2020, doi: 10.1007/s00500-020-04812-z.

S. Suyanto, A. A. Ariyanto, and A. F. Ariyanto, “Komodo mlipir algorithm,” Appl Soft Comput, vol. 114, pp. 1-17, Jan. 2022, doi: 10.1016/j.asoc.2021.108043.

M. Dehghani, Z. Montazeri, H. Givi, J. Guerrero, and G. Dhiman, “Darts game optimizer: a new optimization technique based on darts game,” International Journal of Intelligent Engineering and Systems, vol. 13, no. 5, pp. 286-294, Oct. 2020, doi: 10.22266/ijies2020.1031.26.

M. Dehghani, M. Mardaneh, J. Guerrero, O. Malik, and V. Kumar, “Football game based optimization: an application to solve energy commitment problem,” International Journal of Intelligent Engineering and Systems, vol. 13, no. 5, pp. 514-523, Oct. 2020, doi: 10.22266/ijies2020.1031.45.

M. Dehghani et al., “HOGO: hide objects game optimization,” International Journal of Intelligent Engineering and Systems, vol. 13, no. 4, pp. 216-225, Aug. 2020, doi: 10.22266/ijies2020.0831.19.

M. Almarashi, W. Deabes, H. H. Amin, and A.-R. Hedar, “Simulated annealing with exploratory sensing for global optimization,” Algorithms, vol. 13, no. 9, p. 230, Sep. 2020, doi: 10.3390/a13090230.

F. H. Awad, A. Al-kubaisi, and M. Mahmood, “Large-scale timetabling problems with adaptive tabu search,” Journal of Intelligent Systems, vol. 31, no. 1, pp. 168-176, Jan. 2022, doi: 10.1515/jisys-2022-0003.

M. Dubey, V. Kumar, M. Kaur, and T.-P. Dao, “A systematic review on harmony search algorithm: theory, literature, and applications,” Math Probl Eng, vol. 2021, pp. 1-22, Apr. 2021, doi: 10.1155/2021/5594267.

X. Mi, Z. Liao, S. Li, and Q. Gu, “Adaptive teaching-learning-based optimization with experience learning to identify photovoltaic cell parameters,” Energy Reports, vol. 7, pp. 4114-4125, Nov. 2021, doi: 10.1016/j.egyr.2021.06.097.

M. Dehghani and P. Trojovskí½, “Hybrid leader based optimization: a new stochastic optimization algorithm for solving optimization applications,” Sci Rep, vol. 12, no. 1, pp. 1-16, Dec. 2022, doi: 10.1038/s41598-022-09514-0.

P. Trojovskí½ and M. Dehghani, “Pelican optimization algorithm: a novel nature-inspired algorithm for engineering applications,” Sensors, vol. 22, no. 3, pp. 1-34, Jan. 2022, doi: 10.3390/s22030855.

M. Dehghani, Z. Montazeri, E. Trojovskí¡, and P. Trojovskí½, “Coati optimization algorithm: a new bio-inspired metaheuristic algorithm for solving optimization problems,” Knowl Based Syst, vol. 259, p. 110011, Jan. 2023, doi: 10.1016/j.knosys.2022.110011.

M. S. Braik, “Chameleon swarm algorithm: a bio-inspired optimizer for solving engineering design problems,” Expert Syst Appl, vol. 174, p. 114685, Jul. 2021, doi: 10.1016/j.eswa.2021.114685.

S. A. Yasear and H. Ghanimi, “A modified honey badger algorithm for solving optimal power flow optimization problem,” International Journal of Intelligent Engineering and Systems, vol. 15, no. 4, pp. 142-155, Aug. 2022, doi: 10.22266/ijies2022.0831.14.

M. I. A. Latiffi, M. R. Yaakub, and I. S. Ahmad, “Flower pollination algorithm for feature selection in tweets sentiment analysis,” International Journal of Advanced Computer Science and Applications, vol. 13, no. 5, pp. 429-436, 2022, doi: 10.14569/IJACSA.2022.0130551.

A. Kaveh, S. Talatahari, and N. Khodadadi, “Stochastic paint optimizer: theory and application in civil engineering,” Eng Comput, vol. 38, no. 3, pp. 1921-1952, Jun. 2022, doi: 10.1007/s00366-020-01179-5.

M. A. Akbari, M. Zare, R. Azizipanah-abarghooee, S. Mirjalili, and M. Deriche, “The cheetah optimizer: a nature-inspired metaheuristic algorithm for large-scale optimization problems,” Sci Rep, vol. 12, no. 1, p. 10953, Jun. 2022, doi: 10.1038/s41598-022-14338-z.

M. Dehghani, Å . Hubí¡lovskí½, and P. Trojovskí½, “A new optimization algorithm based on average and subtraction of the best and worst members of the population for solving various optimization problems,” PeerJ Comput Sci, vol. 8, pp. 1-40, Mar. 2022, doi: 10.7717/peerj-cs.910.

K. Hussain, M. N. Mohd Salleh, S. Cheng, and R. Naseem, “Common benchmark functions for metaheuristic evaluation: a review,” JOIV: International Journal on Informatics Visualization, vol. 1, no. 4-2, p. 218, Nov. 2017, doi: 10.30630/joiv.1.4-2.65.

L. Chin, E. Chendra, and A. Sukmana, “Analysis of portfolio optimization with lot of stocks amount constraint: case study index LQ45,” IOP Conf Ser Mater Sci Eng, vol. 300, p. 012004, Jan. 2018, doi: 10.1088/1757-899X/300/1/012004.

N. Prakash and Yogesh L, “Market reaction to dividend announcements during pandemic: an event study,” Vision: The Journal of Business Perspective, p. 097226292110662, Dec. 2021, doi: 10.1177/09722629211066288.

Silvia and N. Toni, “The effect of profitability and capital structure against company value with dividend policy as moderator variable in consumption companies registered on the 2014-2018 IDX,” Research, Society and Development, vol. 9, no. 11, p. e019119260, Oct. 2020, doi: 10.33448/rsd-v9i11.9260.

D. H. Wolpert and W. G. Macready, “No free lunch theorems for optimization,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 67-82, Apr. 1997, doi: 10.1109/4235.585893.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
    2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
    3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).