Suchergebnisse - "multiobjective combinatorial optimization"

  1. 1

    Effective anytime algorithm for multiobjective combinatorial optimization problems von Domínguez-Ríos, Miguel Ángel, Chicano, Francisco, Alba, Enrique

    ISSN: 0020-0255, 1872-6291
    Veröffentlicht: Elsevier Inc 01.07.2021
    Veröffentlicht in Information sciences (01.07.2021)
    “… In multiobjective optimization, the result of an optimization algorithm is a set of efficient solutions from which the decision maker selects one. It is common …”
    Volltext
    Journal Article
  2. 2

    A Random Forest-Assisted Evolutionary Algorithm for Data-Driven Constrained Multiobjective Combinatorial Optimization of Trauma Systems von Wang, Handing, Jin, Yaochu

    ISSN: 2168-2267, 2168-2275, 2168-2275
    Veröffentlicht: United States IEEE 01.02.2020
    Veröffentlicht in IEEE transactions on cybernetics (01.02.2020)
    “… Many real-world optimization problems can be solved by using the data-driven approach only, simply because no analytic objective functions are available for …”
    Volltext
    Journal Article
  3. 3

    A greedy hypervolume polychotomic scheme for multiobjective combinatorial optimization von Lopes, Gonçalo, Klamroth, Kathrin, Paquete, Luís

    ISSN: 0305-0548
    Veröffentlicht: Elsevier Ltd 01.11.2025
    Veröffentlicht in Computers & operations research (01.11.2025)
    “… The usual goal in multiobjective combinatorial optimization is to find the complete set of nondominated points. However, in general, the nondominated set may …”
    Volltext
    Journal Article
  4. 4

    New techniques to improve neighborhood exploration in pareto local search von Kang, Yuhao, Shi, Jialong, Sun, Jianyong, Zhang, Qingfu, Fan, Ye

    ISSN: 0957-4174
    Veröffentlicht: Elsevier Ltd 15.11.2024
    Veröffentlicht in Expert systems with applications (15.11.2024)
    “… Pareto Local Search (PLS) is an extension of local search to multiobjective combinatorial optimization problems (MCOPs). It is widely used as a building block …”
    Volltext
    Journal Article
  5. 5

    PPLS/D: Parallel Pareto Local Search Based on Decomposition von Shi, Jialong, Zhang, Qingfu, Sun, Jianyong

    ISSN: 2168-2267, 2168-2275, 2168-2275
    Veröffentlicht: United States IEEE 01.03.2020
    Veröffentlicht in IEEE transactions on cybernetics (01.03.2020)
    “… Pareto local search (PLS) is a basic building block in many metaheuristics for a multiobjective combinatorial optimization problem. In this paper, an enhanced …”
    Volltext
    Journal Article
  6. 6

    An exact method for the biobjective shortest path problem for large-scale road networks von Duque, Daniel, Lozano, Leonardo, Medaglia, Andrés L.

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Amsterdam Elsevier B.V 01.05.2015
    Veröffentlicht in European journal of operational research (01.05.2015)
    “… •Recursive exact algorithm that implicitly enumerates all solutions.•Fast method that works well on graphs of up to 1.2 million nodes and 2.8 million …”
    Volltext
    Journal Article
  7. 7

    RM-MOCO: A Fast-Solving Model for Neural Multi-Objective Combinatorial Optimization Based on Retention von Wei, Huiqing, Han, Fei, Liu, Qing, Han, Henry

    ISSN: 2096-9929, 2097-3705
    Veröffentlicht: Tsinghua University Press 01.06.2025
    Veröffentlicht in Complex System Modeling and Simulation (01.06.2025)
    “… Multiobjective combinatorial optimization (MOCO) problems have a wide range of applications in the real world. Recently, learning-based methods have achieved …”
    Volltext
    Journal Article
  8. 8

    ccDNCA: A Dual-Neighborhood Search-Based Dual-Population Coevolutionary Algorithm for Multi-UAV Task Allocation Problems With Complex Constraints von Chen, Xi, Zhao, Zipeng, Wan, Yu, Qi, Jingtao, Ruan, Yirun, Lu, Xin, Tang, Jun

    ISSN: 2327-4662, 2327-4662
    Veröffentlicht: Piscataway IEEE 15.10.2025
    Veröffentlicht in IEEE internet of things journal (15.10.2025)
    “… Solving the multiple unmanned aerial vehicles task allocation problem with complex constraints (MTAPCc) by means of the constrained multiobjective evolutionary …”
    Volltext
    Journal Article
  9. 9

    A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming von Liefooghe, Arnaud, Verel, Sébastien, Hao, Jin-Kao

    ISSN: 1568-4946, 1872-9681
    Veröffentlicht: Elsevier B.V 01.03.2014
    Veröffentlicht in Applied soft computing (01.03.2014)
    “… •We extend conventional single-objective unconstrained binary quadratic programming (UBQP) to the multiobjective case.•We define a flexible model to generate …”
    Volltext
    Journal Article
  10. 10

    A Cooperative Hybrid Quantum-Inspired Salp Swarm and Differential Evolution for Solving CEC 2022 Benchmark and Controller Placement Problems in Software Defined Networks von Pathak, Sanjai, Mani, Ashish, Chatterjee, Amlan

    ISSN: 2169-3536, 2169-3536
    Veröffentlicht: Piscataway IEEE 2024
    Veröffentlicht in IEEE access (2024)
    “… This paper introduces a Cooperative Model of Salp Swarm Optimization (CMSSO), which combines four algorithms: Salp Swarm Algorithm (SSA), Elite Opposition …”
    Volltext
    Journal Article
  11. 11

    Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia von Caballero, Rafael, González, Mercedes, Guerrero, Flor M a, Molina, Julián, Paralera, Concepción

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Amsterdam Elsevier B.V 16.03.2007
    Veröffentlicht in European journal of operational research (16.03.2007)
    “… In this work we present a multiobjective location routing problem and solve it with a multiobjective metaheuristic procedure. In this type of problem, we have …”
    Volltext
    Journal Article
  12. 12

    Using multiobjective optimization for biclustering microarray data von Seridi, Khedidja, Jourdan, Laetitia, Talbi, El-Ghazali

    ISSN: 1568-4946, 1872-9681
    Veröffentlicht: Elsevier B.V 01.08.2015
    Veröffentlicht in Applied soft computing (01.08.2015)
    “… [Display omitted] •A new multiobjective modeling for the biclustering problem.•A new hybrid multiobjective algorithm gradually conceived for best …”
    Volltext
    Journal Article
  13. 13

    Pareto Ant Colony Optimization: A Metaheuristic Approach to Multiobjective Portfolio Selection von Doerner, Karl, Gutjahr, Walter J., Hartl, Richard F., Strauss, Christine, Stummer, Christian

    ISSN: 0254-5330, 1572-9338
    Veröffentlicht: New York Springer Nature B.V 01.10.2004
    Veröffentlicht in Annals of operations research (01.10.2004)
    “… Selecting the "best" project portfolio out of a given set of investment proposals is a common and often critical management issue. Decision-makers must …”
    Volltext
    Journal Article
  14. 14

    A greedy memetic algorithm for a multiobjective dynamic bin packing problem for storing cooling objects von Spencer, Kristina Yancey, Tsvetkov, Pavel V., Jarrell, Joshua J.

    ISSN: 1381-1231, 1572-9397
    Veröffentlicht: New York Springer US 01.02.2019
    Veröffentlicht in Journal of heuristics (01.02.2019)
    “… In this paper, a multiobjective dynamic bin packing problem for storing cooling objects is introduced along with a metaheuristic designed to work well in …”
    Volltext
    Journal Article
  15. 15

    On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem von Schulze, Britta, Stiglmayr, Michael, Paquete, Luís, Fonseca, Carlos M, Willems, David, Ruzika, Stefan

    ISSN: 1432-5217, 1432-2994, 1432-5217
    Veröffentlicht: Berlin, Heidelberg Springer 01.08.2020
    “… In this article, we introduce the rectangular knapsack problem as a special case of the quadratic knapsack problem consisting in the maximization of the …”
    Volltext
    Journal Article
  16. 16

    Weight-Specific-Decoder Attention Model to Solve Multiobjective Combinatorial Optimization Problems von Ye, Te, Zhang, Zizhen, Chen, Jinbiao, Wang, Jiahai

    ISSN: 2577-1655
    Veröffentlicht: IEEE 09.10.2022
    “… The multiobjective combinatorial optimization problems (MOCOPs) have a wide range of real-world applications. Designing an effective algorithm has an important …”
    Volltext
    Tagungsbericht
  17. 17

    Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection von Doerner, K.F., Gutjahr, W.J., Hartl, R.F., Strauss, C., Stummer, C.

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Amsterdam Elsevier B.V 16.06.2006
    Veröffentlicht in European journal of operational research (16.06.2006)
    “… One of the most important, common and critical management issues lies in determining the “best” project portfolio out of a given set of investment proposals …”
    Volltext
    Journal Article
  18. 18

    Cross entropy for multiobjective combinatorial optimization problems with linear relaxations von Caballero, Rafael, Hernández-Díaz, Alfredo G., Laguna, Manuel, Molina, Julián

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Amsterdam Elsevier B.V 01.06.2015
    Veröffentlicht in European journal of operational research (01.06.2015)
    “… •A multiobjective optimization cross entropy (MOCE) procedure for MOCO problems.•It benefits of the linear relaxation, that can be solved with modest …”
    Volltext
    Journal Article
  19. 19

    Working principles, behavior, and performance of MOEAs on MNK-landscapes von Aguirre, Hernán E., Tanaka, Kiyoshi

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Amsterdam Elsevier B.V 16.09.2007
    Veröffentlicht in European journal of operational research (16.09.2007)
    “… This work studies the working principles, behavior, and performance of multiobjective evolutionary algorithms (MOEAs) on multiobjective epistatic fitness …”
    Volltext
    Journal Article
  20. 20

    Speed-up techniques for solving large-scale biobjective TSP von Lust, T., Jaszkiewicz, A.

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Veröffentlicht: New York Elsevier Ltd 01.03.2010
    Veröffentlicht in Computers & operations research (01.03.2010)
    “… In this paper, we present the Two-Phase Pareto Local Search ( 2PPLS) method with speed-up techniques for the heuristic resolution of the biobjective traveling …”
    Volltext
    Journal Article