Design of a heuristic algorithm for the generalized multi-objective set covering problem

DOI10.1007/s10589-022-00379-7zbMath1494.90102OpenAlexW4293079547MaRDI QIDQ2149956

Aniekan A. Ebiefung, Anthony Skjellum, Lakmali Weerasena

Publication date: 27 June 2022

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-022-00379-7

zbMATH Keywords

algorithmapproximationmulti-objectiveSCPmulti-cover

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
• Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
• An algorithm for approximating the Pareto set of the multiobjective set covering problem
• A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
• An effective and simple heuristic for the set covering problem
• Logical analysis of data -- an overview: from combinatorial optimization to medical applications
• A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP
• A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
• The maximum reliability location problem and \(\alpha\)-reliable p-center problem: Derivatives of the probabilistic location set covering problem
• Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm
• A parallel multiple reference point approach for multi-objective optimization
• Design and analysis of stochastic local search for the multiobjective traveling salesman problem
• On the completeness and constructiveness of parametric characterizations to vector optimization problems
• Local branching
• Multicriteria optimization
• A tolerance function for the multiobjective set covering problem
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Airline crew rostering: problem types, modeling, and optimization
• An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
• A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
• Variable and large neighborhood search to solve the multiobjective set covering problem
• Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
• Use of substitute scalarizing functions to guide a local search based heuristic: the case of moTSP
• Optimal dispatching strategies for emergency vehicles to increase patient survivability
• An efficient heuristic for large set covering problems
• A Greedy Heuristic for the Set-Covering Problem
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• Error Detecting and Error Correcting Codes
• Multi‐objective combinatorial optimization problems: A survey
• Reducibility among Combinatorial Problems
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• Genetic local search for multi-objective combinatorial optimization

This page was built for publication: Design of a heuristic algorithm for the generalized multi-objective set covering problem