IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v158y2004i2p418-433.html
   My bibliography  Save this article

On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study

Author

Listed:
  • Jaszkiewicz, Andrzej

Abstract

No abstract is available for this item.

Suggested Citation

  • Jaszkiewicz, Andrzej, 2004. "On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study," European Journal of Operational Research, Elsevier, vol. 158(2), pages 418-433, October.
    • Handle: RePEc:eee:ejores:v:158:y:2004:i:2:p:418-433
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00494-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Zionts, Stanley, 1981. "A multiple criteria method for choosing among discrete alternatives," European Journal of Operational Research, Elsevier, vol. 7(2), pages 143-147, June.
    2. Jaszkiewicz, Andrzej & Slowinski, Roman, 1999. "The `Light Beam Search' approach - an overview of methodology and applications," European Journal of Operational Research, Elsevier, vol. 113(2), pages 300-314, March.
    3. Korhonen, Pekka & Laakso, Jukka, 1986. "Solving generalized goal programming problems using a visual interactive approach," European Journal of Operational Research, Elsevier, vol. 26(3), pages 355-363, September.
    4. Viana, Ana & Pinho de Sousa, Jorge, 2000. "Using metaheuristics in multiobjective resource constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 120(2), pages 359-374, January.
    5. Sun, Minghe & Steuer, Ralph E., 1996. "InterQuad: An interactive quad tree based procedure for solving the discrete alternative multiple criteria problem," European Journal of Operational Research, Elsevier, vol. 89(3), pages 462-472, March.
    6. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rooderkerk, Robert P. & van Heerde, Harald J., 2016. "Robust optimization of the 0–1 knapsack problem: Balancing risk and return in assortment optimization," European Journal of Operational Research, Elsevier, vol. 250(3), pages 842-854.
    2. Ishibuchi, Hisao & Narukawa, Kaname & Tsukamoto, Noritaka & Nojima, Yusuke, 2008. "An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 188(1), pages 57-75, July.
    3. Cerqueus, Audrey & Przybylski, Anthony & Gandibleux, Xavier, 2015. "Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems," European Journal of Operational Research, Elsevier, vol. 244(2), pages 417-433.
    4. Mavrotas, George & Florios, Kostas, 2013. "An improved version of the augmented epsilon-constraint method (AUGMECON2) for finding the exact Pareto set in Multi-Objective Integer Programming problems," MPRA Paper 105034, University Library of Munich, Germany.
    5. Bogdan Rębiasz, 2009. "A method for selecting an effective investment project portfolio," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 19(3), pages 95-117.
    6. Florios, Kostas & Mavrotas, George & Diakoulaki, Danae, 2010. "Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms," European Journal of Operational Research, Elsevier, vol. 203(1), pages 14-21, May.

    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.
    1. Nowak, Maciej, 2007. "Aspiration level approach in stochastic MCDM problems," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1626-1640, March.
    2. Sun, Minghe & Steuer, Ralph E., 1996. "InterQuad: An interactive quad tree based procedure for solving the discrete alternative multiple criteria problem," European Journal of Operational Research, Elsevier, vol. 89(3), pages 462-472, March.
    3. Krzysztof S. Targiel & Maciej Nowak & Tadeusz Trzaskalik, 2018. "Scheduling non-critical activities using multicriteria approach," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(3), pages 585-598, September.
    4. Schlereth, Christian & Stepanchuk, Tanja & Skiera, Bernd, 2010. "Optimization and analysis of the profitability of tariff structures with two-part tariffs," European Journal of Operational Research, Elsevier, vol. 206(3), pages 691-701, November.
    5. Melouk, Sharif & Damodaran, Purushothaman & Chang, Ping-Yu, 2004. "Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing," International Journal of Production Economics, Elsevier, vol. 87(2), pages 141-147, January.
    6. Ganesan, Viswanath Kumar & Sivakumar, Appa Iyer, 2006. "Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times," International Journal of Production Economics, Elsevier, vol. 103(2), pages 633-647, October.
    7. Tien-Fu Liang & Tien-Shou Huang & Ming-Feng Yang, 2012. "Application of fuzzy mathematical programming to imprecise project management decisions," Quality & Quantity: International Journal of Methodology, Springer, vol. 46(5), pages 1451-1470, August.
    8. Lindroth, Peter & Patriksson, Michael & Strömberg, Ann-Brith, 2010. "Approximating the Pareto optimal set using a reduced set of objective functions," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1519-1534, December.
    9. Van Woensel, T. & Kerbache, L. & Peremans, H. & Vandaele, N., 2008. "Vehicle routing with dynamic travel times: A queueing approach," European Journal of Operational Research, Elsevier, vol. 186(3), pages 990-1007, May.
    10. Piotr Wojewnik & Tomasz Szapiro, 2010. "Bireference Procedure fBIP for Interactive Multicriteria Optimization with Fuzzy Coefficients," Central European Journal of Economic Modelling and Econometrics, Central European Journal of Economic Modelling and Econometrics, vol. 2(3), pages 169-193, June.
    11. Scholz, Michael & Dorner, Verena & Schryen, Guido & Benlian, Alexander, 2017. "A configuration-based recommender system for supporting e-commerce decisions," European Journal of Operational Research, Elsevier, vol. 259(1), pages 205-215.
    12. Sun, Minghe, 2011. "A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization," European Journal of Operational Research, Elsevier, vol. 209(3), pages 228-240, March.
    13. G Özerol & E Karasakal, 2008. "Interactive outranking approaches for multicriteria decision-making problems with imprecise information," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1253-1268, September.
    14. Cantarella, G.E. & Pavone, G. & Vitetta, A., 2006. "Heuristics for urban road network design: Lane layout and signal settings," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1682-1695, December.
    15. Asim Roy & Patrick Mackin & Jyrki Wallenius & James Corner & Mark Keith & Gregory Schymik & Hina Arora, 2008. "An Interactive Search Method Based on User Preferences," Decision Analysis, INFORMS, vol. 5(4), pages 203-229, December.
    16. M Larbani & B Aouni, 2011. "A new approach for generating efficient solutions within the goal programming model," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 175-182, January.
    17. Alizadeh, Somayeh & Ghazanfari, Mehdi, 2009. "Learning FCM by chaotic simulated annealing," Chaos, Solitons & Fractals, Elsevier, vol. 41(3), pages 1182-1190.
    18. Miettinen, Kaisa & Molina, Julián & González, Mercedes & Hernández-Díaz, Alfredo & Caballero, Rafael, 2009. "Using box indices in supporting comparison in multiobjective optimization," European Journal of Operational Research, Elsevier, vol. 197(1), pages 17-24, August.
    19. B Suman & P Kumar, 2006. "A survey of simulated annealing as a tool for single and multiobjective optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(10), pages 1143-1160, October.
    20. Suxia Ma & Yuelin Gao & Bo Zhang & Wenlu Zuo, 2022. "A New Nonparametric Filled Function Method for Integer Programming Problems with Constraints," Mathematics, MDPI, vol. 10(5), pages 1-16, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:ejores:v:158:y:2004:i:2:p:418-433. 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.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.