IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v289y2021i1p75-92.html
   My bibliography  Save this article

Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem

Author

Listed:
  • Melo, Rafael A.
  • Queiroz, Michell F.
  • Ribeiro, Celso C.

Abstract

Given a weighted graph G=(V,E), the minimum weighted feedback vertex set problem consists in obtaining a minimum weight subset F⊆V of the vertex set whose removal makes the graph acyclic. Differently from other approaches in the literature, in this work we tackle this problem via the maximum weighted induced forest problem. First, we propose two new compact mixed integer programming (MIP) formulations, using a polynomial number of variables and constraints. Next, we develop a matheuristic that hybridizes a multi-start iterated local search heuristic with a MIP-based local search procedure. Extensive computational experiments carried out on a set of benchmark instances show that the newly proposed MILS+-mtz matheuristic is extremely effective and outperforms or at least match the best heuristics available in the literature in terms of solution quality for 79 out of 99 (79.80%) large instance groups, with 55 (55.56%) of them being strictly better than the previously best known. Furthermore, the compact formulations were able to optimally solve 474 out of 810 test instances in less than 3600 seconds of running time.

Suggested Citation

  • Melo, Rafael A. & Queiroz, Michell F. & Ribeiro, Celso C., 2021. "Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem," European Journal of Operational Research, Elsevier, vol. 289(1), pages 75-92.
    • Handle: RePEc:eee:ejores:v:289:y:2021:i:1:p:75-92
    DOI: 10.1016/j.ejor.2020.07.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221720306172
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2020.07.006?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Perumal, Shyam S.G. & Larsen, Jesper & Lusby, Richard M. & Riis, Morten & Sørensen, Kasper S., 2019. "A matheuristic for the driver scheduling problem with staff cars," European Journal of Operational Research, Elsevier, vol. 275(1), pages 280-294.
    2. Ruiz, Ruben & Stutzle, Thomas, 2007. "A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2033-2049, March.
    3. López-Ibáñez, Manuel & Dubois-Lacoste, Jérémie & Pérez Cáceres, Leslie & Birattari, Mauro & Stützle, Thomas, 2016. "The irace package: Iterated racing for automatic algorithm configuration," Operations Research Perspectives, Elsevier, vol. 3(C), pages 43-58.
    4. Alan Diêgo Aurélio Carneiro & Fábio Protti & Uéverton S. Souza, 2019. "Deadlock resolution in wait-for graphs by vertex/arc deletion," Journal of Combinatorial Optimization, Springer, vol. 37(2), pages 546-562, February.
    5. Gendron, Bernard & Hanafi, Saïd & Todosijević, Raca, 2018. "Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design," European Journal of Operational Research, Elsevier, vol. 268(1), pages 70-81.
    6. Francesco Carrabs & Raffaele Cerulli & Manlio Gaudioso & Monica Gentili, 2013. "Lower and upper bounds for the spanning tree with minimum branch vertices," Computational Optimization and Applications, Springer, vol. 56(2), pages 405-438, October.
    7. Lersteau, Charly & Rossi, André & Sevaux, Marc, 2018. "Minimum energy target tracking with coverage guarantee in wireless sensor networks," European Journal of Operational Research, Elsevier, vol. 265(3), pages 882-894.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chen, Claire Y.T. & Sun, Edward W. & Miao, Wanyu & Lin, Yi-Bing, 2024. "Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing," European Journal of Operational Research, Elsevier, vol. 312(3), pages 1086-1107.
    2. Wang, Yiyuan & Pan, Shiwei & Al-Shihabi, Sameh & Zhou, Junping & Yang, Nan & Yin, Minghao, 2021. "An improved configuration checking-based algorithm for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 294(2), pages 476-491.
    3. Melo, Rafael A. & Queiroz, Michell F. & Santos, Marcio C., 2021. "A matheuristic approach for the b-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic," European Journal of Operational Research, Elsevier, vol. 295(1), pages 66-81.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Pagnozzi, Federico & Stützle, Thomas, 2019. "Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems," European Journal of Operational Research, Elsevier, vol. 276(2), pages 409-421.
    2. Alfaro-Fernández, Pedro & Ruiz, Rubén & Pagnozzi, Federico & Stützle, Thomas, 2020. "Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems," European Journal of Operational Research, Elsevier, vol. 282(3), pages 835-845.
    3. Pinacho Davidson, Pedro & Blum, Christian & Lozano, Jose A., 2018. "The weighted independent domination problem: Integer linear programming models and metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 265(3), pages 860-871.
    4. Lobo, Fernando G. & Bazargani, Mosab & Burke, Edmund K., 2020. "A cutoff time strategy based on the coupon collector’s problem," European Journal of Operational Research, Elsevier, vol. 286(1), pages 101-114.
    5. Pessoa, Luciana S. & Andrade, Carlos E., 2018. "Heuristics for a flowshop scheduling problem with stepwise job objective function," European Journal of Operational Research, Elsevier, vol. 266(3), pages 950-962.
    6. Pagnozzi, Federico & Stützle, Thomas, 2021. "Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems with additional constraints," Operations Research Perspectives, Elsevier, vol. 8(C).
    7. Asghari, Mohammad & Jaber, Mohamad Y. & Mirzapour Al-e-hashem, S.M.J., 2023. "Coordinating vessel recovery actions: Analysis of disruption management in a liner shipping service," European Journal of Operational Research, Elsevier, vol. 307(2), pages 627-644.
    8. Alex Gliesch & Marcus Ritt, 2022. "A new heuristic for finding verifiable k-vertex-critical subgraphs," Journal of Heuristics, Springer, vol. 28(1), pages 61-91, February.
    9. Dung-Ying Lin & Tzu-Yun Huang, 2021. "A Hybrid Metaheuristic for the Unrelated Parallel Machine Scheduling Problem," Mathematics, MDPI, vol. 9(7), pages 1-20, April.
    10. Carlos V. G. C. Lima & Dieter Rautenbach & Uéverton S. Souza & Jayme L. Szwarcfiter, 2022. "On the computational complexity of the bipartizing matching problem," Annals of Operations Research, Springer, vol. 316(2), pages 1235-1256, September.
    11. Agarwal, Y.K. & Aneja, Y.P. & Jayaswal, Sachin, 2022. "Directed fixed charge multicommodity network design: A cutting plane approach using polar duality," European Journal of Operational Research, Elsevier, vol. 299(1), pages 118-136.
    12. Kuo-Ching Ying & Yi-Ju Tsai, 2017. "Minimising total cost for training and assigning multiskilled workers in production systems," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2978-2989, May.
    13. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    14. Véronique François & Yasemin Arda & Yves Crama, 2019. "Adaptive Large Neighborhood Search for Multitrip Vehicle Routing with Time Windows," Transportation Science, INFORMS, vol. 53(6), pages 1706-1730, November.
    15. Perumal, Shyam S.G. & Lusby, Richard M. & Larsen, Jesper, 2022. "Electric bus planning & scheduling: A review of related problems and methodologies," European Journal of Operational Research, Elsevier, vol. 301(2), pages 395-413.
    16. Pan, Quan-Ke & Gao, Liang & Li, Xin-Yu & Gao, Kai-Zhou, 2017. "Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 89-112.
    17. Perez-Gonzalez, Paz & Framinan, Jose M., 2024. "A review and classification on distributed permutation flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 312(1), pages 1-21.
    18. Molenbruch, Yves & Braekers, Kris & Caris, An, 2017. "Benefits of horizontal cooperation in dial-a-ride services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 97-119.
    19. Alexandre D. Jesus & Luís Paquete & Arnaud Liefooghe, 2021. "A model of anytime algorithm performance for bi-objective optimization," Journal of Global Optimization, Springer, vol. 79(2), pages 329-350, February.
    20. Weiner, Jake & Ernst, Andreas T. & Li, Xiaodong & Sun, Yuan & Deb, Kalyanmoy, 2021. "Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid," European Journal of Operational Research, Elsevier, vol. 293(3), pages 847-862.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:289:y:2021:i:1:p:75-92. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.