Chaotic Binarization Schemes for Solving Combinatorial Optimization Problems Using Continuous Metaheuristics
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Hui Lu & Xiaoteng Wang & Zongming Fei & Meikang Qiu, 2014. "The Effects of Using Chaotic Map on Improving the Performance of Multiobjective Evolutionary Algorithms," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-16, February.
- Muter, İbrahim & Sezer, Zeynep, 2018. "Algorithms for the one-dimensional two-stage cutting stock problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 20-32.
- Y.C. Ho & D.L. Pepyne, 2002. "Simple Explanation of the No-Free-Lunch Theorem and Its Implications," Journal of Optimization Theory and Applications, Springer, vol. 115(3), pages 549-570, December.
- Naanaa, Anis, 2015. "Fast chaotic optimization algorithm based on spatiotemporal maps for global optimization," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 402-411.
- Le Wang & Yuelin Gao & Jiahang Li & Xiaofeng Wang & Rui Wang, 2021. "A Feature Selection Method by using Chaotic Cuckoo Search Optimization Algorithm with Elitist Preservation and Uniform Mutation for Data Classification," Discrete Dynamics in Nature and Society, Hindawi, vol. 2021, pages 1-19, June.
- Martello, Silvano & Pisinger, David & Toth, Paolo, 2000. "New trends in exact algorithms for the 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 325-332, June.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Genserik L. L. Reniers & Kenneth Sörensen, 2013. "An Approach for Optimal Allocation of Safety Resources: Using the Knapsack Problem to Take Aggregated Cost‐Efficient Preventive Measures," Risk Analysis, John Wiley & Sons, vol. 33(11), pages 2056-2067, November.
- Sbihi, Abdelkader, 2010.
"A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem,"
European Journal of Operational Research, Elsevier, vol. 202(2), pages 339-346, April.
- Abdelkader Sbihi, 2009. "A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem," Post-Print hal-00644088, HAL.
- Büther, Marcel & Briskorn, Dirk, 2007. "Reducing the 0-1 knapsack problem with a single continuous variable to the standard 0-1 knapsack problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 629, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
- Modiri-Delshad, Mostafa & Aghay Kaboli, S. Hr. & Taslimi-Renani, Ehsan & Rahim, Nasrudin Abd, 2016. "Backtracking search algorithm for solving economic dispatch problems with valve-point effects and multiple fuel options," Energy, Elsevier, vol. 116(P1), pages 637-649.
- Ben O’Neill, 2022. "Smallest covering regions and highest density regions for discrete distributions," Computational Statistics, Springer, vol. 37(3), pages 1229-1254, July.
- R. Pablo Arribillaga & G. Bergantiños, 2022.
"Cooperative and axiomatic approaches to the knapsack allocation problem,"
Annals of Operations Research, Springer, vol. 318(2), pages 805-830, November.
- Arribillaga, Pablo & Bergantiños, Gustavo, 2019. "Cooperative and axiomatic approaches to the knapsack allocation problem," MPRA Paper 91719, University Library of Munich, Germany.
- Stefan Hajkowicz & Andrew Higgins & Kristen Williams & Daniel P. Faith & Michael Burton, 2007.
"Optimisation and the selection of conservation contracts,"
Australian Journal of Agricultural and Resource Economics, Australian Agricultural and Resource Economics Society, vol. 51(1), pages 39-56, March.
- Hajkowicz, Stefan & Higgins, Andrew J. & Williams, Kristen & Faith, Daniel P. & Burton, Michael P., 2007. "Optimisation and the selection of conservation contracts," Australian Journal of Agricultural and Resource Economics, Australian Agricultural and Resource Economics Society, vol. 51(01), pages 1-18.
- Marcelo Becerra-Rozas & José Lemus-Romani & Felipe Cisternas-Caneo & Broderick Crawford & Ricardo Soto & Gino Astorga & Carlos Castro & José García, 2022. "Continuous Metaheuristics for Binary Optimization Problems: An Updated Systematic Literature Review," Mathematics, MDPI, vol. 11(1), pages 1-32, December.
- Joonyup Eun & Chang Sup Sung & Eun-Seok Kim, 2017. "Maximizing total job value on a single machine with job selection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 998-1005, September.
- Hegazy Rezk & Abdul Ghani Olabi & Rania M. Ghoniem & Mohammad Ali Abdelkareem, 2023. "Optimized Fractional Maximum Power Point Tracking Using Bald Eagle Search for Thermoelectric Generation System," Energies, MDPI, vol. 16(10), pages 1-15, May.
- Deb, Sanchari & Gao, Xiao-Zhi & Tammi, Kari & Kalita, Karuna & Mahanta, Pinakeswar, 2021. "A novel chicken swarm and teaching learning based algorithm for electric vehicle charging station placement problem," Energy, Elsevier, vol. 220(C).
- Wishon, Christopher & Villalobos, J. Rene, 2016. "Robust efficiency measures for linear knapsack problem variants," European Journal of Operational Research, Elsevier, vol. 254(2), pages 398-409.
- Hernán Peraza-Vázquez & Adrián Peña-Delgado & Prakash Ranjan & Chetan Barde & Arvind Choubey & Ana Beatriz Morales-Cepeda, 2021. "A Bio-Inspired Method for Mathematical Optimization Inspired by Arachnida Salticidade," Mathematics, MDPI, vol. 10(1), pages 1-32, December.
- Furini, Fabio & Ljubić, Ivana & Sinnl, Markus, 2017. "An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem," European Journal of Operational Research, Elsevier, vol. 262(2), pages 438-448.
- Zhenbo Wang & Wenxun Xing, 2009. "A successive approximation algorithm for the multiple knapsack problem," Journal of Combinatorial Optimization, Springer, vol. 17(4), pages 347-366, May.
- Syam Menon & Ali Amiri, 2004. "Scheduling Banner Advertisements on the Web," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 95-105, February.
- Shah, Ruchit & Reed, Patrick, 2011. "Comparative analysis of multiobjective evolutionary algorithms for random and correlated instances of multiobjective d-dimensional knapsack problems," European Journal of Operational Research, Elsevier, vol. 211(3), pages 466-479, June.
- Anis Naanaa, 2025. "Chaotic guided local search algorithm for solving global optimization and engineering problems," Journal of Combinatorial Optimization, Springer, vol. 49(4), pages 1-21, May.
- Kottath, Rahul & Singh, Priyanka, 2023. "Influencer buddy optimization: Algorithm and its application to electricity load and price forecasting problem," Energy, Elsevier, vol. 263(PC).
- Mokhtar Said & Ali M. El-Rifaie & Mohamed A. Tolba & Essam H. Houssein & Sanchari Deb, 2021. "An Efficient Chameleon Swarm Algorithm for Economic Load Dispatch Problem," Mathematics, MDPI, vol. 9(21), pages 1-14, November.
More about this item
Keywords
chaotic maps; binarization schemes; knapsack problem; Sine Cosine Algorithm; Grey Wolf Optimizer; Whale Optimization Algorithm;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:2:p:262-:d:1318439. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.