Modeling and solving of knapsack problem with setup based on evolutionary algorithm
Author
Abstract
Suggested Citation
DOI: 10.1016/j.matcom.2023.12.033
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Yassine Adouani & Bassem Jarboui & Malek Masmoudi, 2020. "Efficient matheuristic for the generalised multiple knapsack problem with setup," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 14(5), pages 715-741.
- Ragab, Mahmoud & Roesler, Uwe, 2014. "The Quicksort process," Stochastic Processes and their Applications, Elsevier, vol. 124(2), pages 1036-1054.
- Yanchun Yang & Robert L. Bulfin, 2009. "An exact algorithm for the Knapsack Problem with Setup," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 5(3), pages 280-291.
- 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.
- 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.
- 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.
- 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.
- 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.
- Novak, Antonin & Sucha, Premysl & Hanzalek, Zdenek, 2019. "Scheduling with uncertain processing times in mixed-criticality systems," European Journal of Operational Research, Elsevier, vol. 279(3), pages 687-703.
- Ewa M. Bednarczuk & Janusz Miroforidis & Przemysław Pyzel, 2018. "A multi-criteria approach to approximate solution of multiple-choice knapsack problem," Computational Optimization and Applications, Springer, vol. 70(3), pages 889-910, July.
- Mavrotas, George & Florios, Kostas & Figueira, José Rui, 2015. "An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: A computational study and comparison with meta-heuristics," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 25-43.
- Reilly, Charles H. & Sapkota, Nabin, 2015. "A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances," European Journal of Operational Research, Elsevier, vol. 241(3), pages 642-652.
- Barbati, Maria & Corrente, Salvatore & Greco, Salvatore, 2020. "A general space-time model for combinatorial optimization problems (and not only)," Omega, Elsevier, vol. 96(C).
- Charles H. Reilly, 2009. "Synthetic Optimization Problem Generation: Show Us the Correlations!," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 458-467, August.
- Di Francesco, Massimo & Gaudioso, Manlio & Gorgone, Enrico & Murthy, Ishwar, 2021. "A new extended formulation with valid inequalities for the Capacitated Concentrator Location Problem," European Journal of Operational Research, Elsevier, vol. 289(3), pages 975-986.
- Eskigun, Erdem & Uzsoy, Reha & Preckel, Paul V. & Beaujon, George & Krishnan, Subramanian & Tew, Jeffrey D., 2005. "Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers," European Journal of Operational Research, Elsevier, vol. 165(1), pages 182-206, August.
More about this item
Keywords
Evolutionary algorithm; Knapsack problem with setup; Group theory-based optimization algorithm; Infeasible solution; Greedy repair and optimization;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:eee:matcom:v:219:y:2024:i:c:p:378-403. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.