Name
Abstract | ||
|---|---|---|
Several relevant optimization problems can be formulated as generalizations of Capacitated Covering Problems, by considering a cost function that combines a linear term with a nonlinear one. In this paper we introduce the Staircase Capacitated Covering Problem, where the nonlinear term has a staircase shape, and we propose a framework based on a Metaheuristic algorithm for solving problems having this formulation. The performance of the Metaheuristic algorithm in solving the Staircase Capacitated Covering Problem is evaluated on a set of instances derived from an industrial application, and it is compared with a linearized formulation of the problem solved by CPLEX. In particular, the experiments show that the former produces better solutions in the same computing time. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s11590-015-0913-4 | Optimization Letters |
Keywords | Field | DocType |
Integer nonlinear programming, Capacitated Covering Problems, Metaheuristic algorithm | Mathematical optimization,Nonlinear system,Generalization,Nonlinear mixed integer programming,Optimization problem,Mathematics,Metaheuristic,Covering problems | Journal |
Volume | Issue | ISSN |
10 | 1 | 1862-4480 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Enrico Malaguti | 1 | 312 | 21.69 |
| Rosa Medina Durán | 2 | 7 | 0.83 |
| Paolo Toth | 3 | 326 | 20.42 |