A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Optimization Année : 2019

A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints

Résumé

In this paper we propose a dual ascent heuristic for solving the linear relaxation of the generalized set partitioning problem with convexity constraints, which often models the master problem of a column generation approach. The generalized set partitioning problem contains at the same time set covering, set packing and set partitioning constraints. The proposed dual ascent heuristic is based on a reformulation and it uses Lagrangian relaxation and subgradient method. It is inspired by the dual ascent procedure already proposed in literature, but it is able to deal with right hand side greater than one, together with under and over coverage. To prove its validity, it has been applied to the minimum sum coloring problem, the multi-activity tour scheduling problem, and some newly generated instances. The reported computational results show the effectiveness of the proposed method.

Dates et versions

hal-03554347 , version 1 (03-02-2022)

Licence

Copyright (Tous droits réservés)

Identifiants

Citer

Lucas Létocart, Stefania Pan, Roberto Wolfler Calvo, Mahuna Akplogan, Nora Touati. A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints. Discrete Optimization, 2019, 33, pp. 146-168. ⟨10.1016/j.disopt.2019.05.001⟩. ⟨hal-03554347⟩
16 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More