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.
Similar content being viewed by others
References
Allahverdi, A., Gupta, J.N.D., Aldowaisan, T.: A review of scheduling research involving setup considerations. Omega 27, 219–239 (1999)
Baldacci, R., Vigo, D., Toth, P.: Exact solution of the capacitated vehicle routing problem. In: Wiley encyclopedia of operations research and management science, vol. 3, pp 1795–18072011. John Wiley & Sons Inc, New York (2011)
Caprara, A., Kroon, L., Monaci, M., Peeters, M., Toth, P.: Passenger railway optimization. In: Barnhart, C., Laporte, G. (eds.) Transportation, volume 14 of Handbooks in Operations Research and Management Science, pp. 129–187. Elsevier, NewYork (2007)
Ernst, A.T., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: a review of applications, methods and models. Eur. J. Oper. Res. 153, 3–27 (2004)
Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Oper. Res. 9, 849–859 (1961)
Malaguti, E., Medina Durán, R., Toth, P.: Approaches to real world two-dimensional cutting problems. Omega 47, 99–115 (2014)
Malaguti, E., Monaci, M., Toth, P.: A metaheuristic approach for the vertex coloring problem. INFORMS J. Comp. 20(2), 302–316 (2008)
Malaguti, E., Monaci, M., Toth, P.: Models and heuristic algorithms for a weighted vertex coloring problem. J. Heuristics 15, 503–526 (2009)
Monaci, M., Toth, P.: A set-covering based heuristic approach for bin-packing problems. INFORMS J. Comp. 18, 71–85 (2006)
Acknowledgments
The authors are grateful to two anonymous referees for their careful reading and useful comments, which helped very much in improving the paper. Rosa Medina Duràn was partially supported by project FONDECYT 11140244 and Complex Engineering Systems Institute (ICM: P-05-004-F, CONICYT: FBO16)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Malaguti, E., Durán, R.M. & Toth, P. A metaheuristic framework for Nonlinear Capacitated Covering Problems. Optim Lett 10, 169–180 (2016). https://doi.org/10.1007/s11590-015-0913-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-015-0913-4