Journal
DISCRETE OPTIMIZATION
Volume 33, Issue -, Pages 146-168Publisher
ELSEVIER
DOI: 10.1016/j.disopt.2019.05.001
Keywords
Dual ascent heuristic; Lagrangian relaxation; Subgradient method; Generalized set partitioning
Funding
- BPIfrance
Ask authors/readers for more resources
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. (C) 2019 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available