A genetic algorithm for the set covering problem
From MaRDI portal
Publication:1278326
DOI10.1016/0377-2217(95)00159-XzbMath0953.90565MaRDI QIDQ1278326
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (86)
A model for locating park-and-ride facilities on urban networks based on maximizing flow capture: a case study of Isfahan, Iran ⋮ Minimizing fleet operating costs for a container transportation company ⋮ Meta-heuristic approaches to solve shortest lattice vector problem ⋮ A population heuristic for constrained two-dimensional non-guillotine cutting ⋮ Hierarchical differential evolution for minimal cut sets identification: application to nuclear safety systems ⋮ An efficient local search heuristic with row weighting for the unicost set covering problem ⋮ An effective and simple heuristic for the set covering problem ⋮ Developing effective meta-heuristics for a probabilistic location model via experimental design ⋮ A genetic algorithm for the generalised assignment problem ⋮ A distance-limited continuous location-allocation problem for spatial planning of decentralized systems ⋮ Metaheuristics for the single machine weighted quadratic tardiness scheduling problem ⋮ Algorithms for railway crew management ⋮ A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil ⋮ Solving large set covering problems for crew scheduling ⋮ The bi-objective covering tour problem ⋮ Application of a hybrid genetic algorithm to airline crew scheduling ⋮ Solving a bicriteria problem of optimal service centers location ⋮ The robust set covering problem with interval data ⋮ Edge covering problem under hybrid uncertain environments ⋮ A hybrid heuristic for the set covering problem ⋮ A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand ⋮ A GRASP algorithm to solve the unicost set covering problem ⋮ Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective ⋮ Location and design decisions of facilities in a distribution system with elastic customer demand ⋮ Covering models and optimization techniques for emergency response facility location and planning: a review ⋮ Wartime logistics model for multi‐support unit location–allocation problem with frontline changes ⋮ Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities ⋮ Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities ⋮ The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic ⋮ Hybrid heuristic algorithms for set covering. ⋮ Exact and heuristic algorithms for the interval data robust assignment problem ⋮ An evolutionary approach for the nurse rerostering problem ⋮ Humanitarian logistics planning for natural disaster response with Bayesian information updates ⋮ Evaluation of reliability bounds by set covering models. ⋮ Approximate algorithms for constrained circular cutting problems ⋮ An indirect genetic algorithm for a nurse-scheduling problem ⋮ A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem ⋮ A multiperiod set covering location model for dynamic redeployment of ambulances ⋮ A note on a symmetrical set covering problem: the lottery problem ⋮ An improved configuration checking-based algorithm for the unicost set covering problem ⋮ From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods ⋮ A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem ⋮ Solving the wire-harness design problem at a European car manufacturer ⋮ A hybrid hypercube - genetic algorithm approach for deploying many emergency response mobile units in an urban network ⋮ Distance preserving recombination operator for Earth observation satellites operations scheduling ⋮ A mixed integer linear program and tabu search approach for the complementary edge covering problem ⋮ Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems ⋮ A 3-flip neighborhood local search for the set covering problem ⋮ Optimal RSUs placement with delay bounded message dissemination in vehicular networks ⋮ A hybrid heuristic for the maximum clique problem ⋮ A hybrid scatter search heuristic for personalized crew rostering in the airline industry ⋮ An electromagnetism metaheuristic for the unicost set covering problem ⋮ An efficient mean field approach to the set covering problem ⋮ A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes ⋮ Constructing nurse schedules at large hospitals ⋮ A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study ⋮ Flight graph based genetic algorithm for crew scheduling in airlines ⋮ Benchmark data set with service programs to approximately solve the set covering problem ⋮ Set covering approach for reconstruction of sibling relationships ⋮ A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation ⋮ A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem ⋮ On the use of genetic algorithms to solve location problems ⋮ Spherical classification of data, a new rule-based learning method ⋮ The set covering problem revisited: an empirical study of the value of dual information ⋮ A fast approximation algorithm for solving the complete set packing problem ⋮ Comparing evolutionary algorithms to the (\(1+1\))-EA ⋮ Model-based view planning ⋮ GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS ⋮ Heuristics for the variable sized bin-packing problem ⋮ A new approach for solving set covering problem using jumping particle swarm optimization method ⋮ Computational experience with approximation algorithms for the set covering problem ⋮ Fuzzy minimum weight edge covering problem ⋮ Unnamed Item ⋮ Hitting times of local and global optima in genetic algorithms with very high selection pressure ⋮ An adaptive heuristic algorithm for VLSI test vectors selection ⋮ Fuzzy dispatching model and genetic algorithms for railyards operations ⋮ Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem ⋮ Exploring further advantages in an alternative formulation for the set covering problem ⋮ A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles ⋮ Heuristics for cardinality constrained portfolio optimization ⋮ A framework for the description of evolutionary algorithms ⋮ Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study ⋮ Application of heuristic methods for conformance test selection ⋮ An orthogonal array based genetic algorithm for developing neural network based process models of fluid dispensing ⋮ A set covering approach for multi-depot train driver scheduling ⋮ Metaheuristic applications on discrete facility location problems: a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enhancing an algorithm for set covering problems
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
- An algorithm for set covering problem
- An efficient heuristic for large set covering problems
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
This page was built for publication: A genetic algorithm for the set covering problem
