Variable and large neighborhood search to solve the multiobjective set covering problem

DOI10.1007/s10732-013-9236-8zbMath1365.90278OpenAlexW1978520433MaRDI QIDQ2359157

Thibaut Lust, Daniel Tuyttens

Publication date: 27 June 2017

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-013-9236-8

zbMATH Keywords

combinatorial optimizationmetaheuristicsmultiobjective optimizationset covering problemvariable neighborhood searchlarge neighborhood search

Mathematics Subject Classification ID

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

Related Items

Design of a heuristic algorithm for the generalized multi-objective set covering problem ⋮ Many-objective Pareto local search ⋮ ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design ⋮ Proper balance between search towards and along Pareto front: biobjective TSP case study ⋮ A tolerance function for the multiobjective set covering problem ⋮ An algorithm for approximating the Pareto set of the multiobjective set covering problem ⋮ Exploring further advantages in an alternative formulation for the set covering problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of very large-scale neighborhood search techniques
• An effective and simple heuristic for the set covering problem
• Two-phase Pareto local search for the biobjective traveling salesman problem
• Nonlinear multiobjective optimization
• Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem
• Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
• Two phase algorithms for the bi-objective assignment problem
• The multiobjective multidimensional knapsack problem: a survey and a new approach
• Pareto Local Search Algorithms for Anytime Bi-objective Optimization
• The Multiobjective Traveling Salesman Problem: A Survey and a New Approach
• Bicriteria Transportation Problem
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives
• Multi‐objective combinatorial optimization problems: A survey
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Handbook of metaheuristics
• Variable neighborhood search: Principles and applications