Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems

DOI10.1287/ijoc.1090.0376zbMath1243.90257OpenAlexW2162675932MaRDI QIDQ2899091

Ịbrahim Muter, Ş. İlker Birbil, Güvenç Şahin

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1090.0376

zbMATH Keywords

heuristicscombinatorial optimizationtabu searchvehicle routinglocal search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (13)

A matheuristic approach for the pollution-routing problem ⋮ Hybrid column generation and large neighborhood search for the dial-a-ride problem ⋮ Managing hospital inpatient beds under clustered overflow configuration ⋮ MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems ⋮ A set partitioning heuristic for the home health care routing and scheduling problem ⋮ Heuristics for vehicle routing problems: sequence or set optimization? ⋮ An exact cooperative method for the uncapacitated facility location problem ⋮ A time-based pheromone approach for the ant system ⋮ A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints ⋮ Scheduling of maintenance work of a large-scale tramway network ⋮ The set covering problem revisited: an empirical study of the value of dual information ⋮ Industrial and tramp ship routing problems: closing the gap for real-scale instances ⋮ Pricing, relaxing and fixing under lot sizing and scheduling

This page was built for publication: Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems