Relaxation heuristics for the set multicover problem with generalized upper bound constraints

05/14/2017
by   Shunji Umetani, et al.
0

We consider an extension of the set covering problem (SCP) introducing (i) multicover and (ii) generalized upper bound (GUB) constraints. For the conventional SCP, the pricing method has been introduced to reduce the size of instances, and several efficient heuristic algorithms based on such reduction techniques have been developed to solve large-scale instances. However, GUB constraints often make the pricing method less effective, because they often prevent solutions from containing highly evaluated variables together. To overcome this, we develop heuristic algorithms to reduce the size of instances, in which new evaluation schemes of variables are introduced taking account of GUB constraints. We also develop an efficient implementation of a 2-flip neighborhood local search algorithm that reduces the number of candidates in the neighborhood without sacrificing the solution quality. According to computational comparison on benchmark instances with the recent solvers, the proposed algorithm performs quite effectively for instances having large gaps between lower and upper bounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/05/2020

A revisited branch-and-cut algorithm for large-scale orienteering problems

The orienteering problem is a route optimization problem which consists ...
research
05/24/2013

Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs

The bipartite boolean quadratic programming problem (BBQP) is a generali...
research
06/22/2022

The Bounded Beam Search algorithm for the Block Relocation Problem

In this paper we deal with the restricted Block Relocation Problem. We p...
research
12/31/2015

An (MI)LP-based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design

We investigate the 3-architecture Connected Facility Location Problem ar...
research
02/15/2022

Heuristic computation of exact treewidth

We are interested in computing the treewidth (G) of a given graph G. Our...
research
03/12/2016

Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm

We consider a multi-neighborhood local search algorithm with a large num...
research
05/11/2022

Numerical method for approximately optimal solutions of two-stage distributionally robust optimization with marginal constraints

We consider a general class of two-stage distributionally robust optimiz...

Please sign up or login with your details

Forgot password? Click here to reset