IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v66y2016i4d10.1007_s10898-016-0446-0.html
   My bibliography  Save this article

Scatter search for the bandpass problem

Author

Listed:
  • Jesús Sánchez-Oro

    (Universidad Rey Juan Carlos)

  • Manuel Laguna

    (University of Colorado at Boulder)

  • Rafael Martí

    (Universidad de Valencia)

  • Abraham Duarte

    (Universidad Rey Juan Carlos)

Abstract

We tackle a combinatorial problem that consists of finding the optimal configuration of a binary matrix. The configuration is determined by the ordering of the rows in the matrix and the objective function value is associated with a value B, the so-called bandpass number. In the basic version of the problem, the objective is to maximize the number of non-overlapping blocks containing B consecutive cells with a value of one in each column of the matrix. We explore variants of this basic problem and use them to test heuristic strategies within the scatter search framework. An existing library of problem instances is used to perform scientific testing of the proposed search procedures to gain insights that may be valuable in other combinational optimization settings. We also conduct competitive testing to compare outcomes with methods published in the literature and to improve upon previous results.

Suggested Citation

  • Jesús Sánchez-Oro & Manuel Laguna & Rafael Martí & Abraham Duarte, 2016. "Scatter search for the bandpass problem," Journal of Global Optimization, Springer, vol. 66(4), pages 769-790, December.
    • Handle: RePEc:spr:jglopt:v:66:y:2016:i:4:d:10.1007_s10898-016-0446-0
    DOI: 10.1007/s10898-016-0446-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-016-0446-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-016-0446-0?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. Duarte, Abraham & Marti, Rafael, 2007. "Tabu search and GRASP for the maximum diversity problem," European Journal of Operational Research, Elsevier, vol. 178(1), pages 71-84, April.
    2. Micael Gallego & Abraham Duarte & Manuel Laguna & Rafael Martí, 2009. "Hybrid heuristics for the maximum diversity problem," Computational Optimization and Applications, Springer, vol. 44(3), pages 411-426, December.
    3. Rafael Martí & Abraham Duarte & Manuel Laguna, 2009. "Advanced Scatter Search for the Max-Cut Problem," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 26-38, February.
    4. Vicente Campos & Rafael Martí & Jesús Sánchez-Oro & Abraham Duarte, 2014. "GRASP with path relinking for the orienteering problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(12), pages 1800-1813, December.
    5. M Gallego & M Laguna & R Martí & A Duarte, 2013. "Tabu search with strategic oscillation for the maximally diverse grouping problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(5), pages 724-734, May.
    6. Guohui Lin, 2011. "On the Bandpass problem," Journal of Combinatorial Optimization, Springer, vol. 22(1), pages 71-77, July.
    7. Djangir A. Babayev & George I. Bell & Urfat G. Nuriyev, 2009. "The bandpass problem: combinatorial optimization and library of problems," Journal of Combinatorial Optimization, Springer, vol. 18(2), pages 151-172, August.
    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. Casado, A. & Bermudo, S. & López-Sánchez, A.D. & Sánchez-Oro, J., 2023. "An iterated greedy algorithm for finding the minimum dominating set in graphs," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 207(C), pages 41-58.

    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. Parreño, Francisco & Álvarez-Valdés, Ramón & Martí, Rafael, 2021. "Measuring diversity. A review and an empirical analysis," European Journal of Operational Research, Elsevier, vol. 289(2), pages 515-532.
    2. Martí, Rafael & Gallego, Micael & Duarte, Abraham, 2010. "A branch and bound algorithm for the maximum diversity problem," European Journal of Operational Research, Elsevier, vol. 200(1), pages 36-44, January.
    3. Fred Glover & Gary Kochenberger & Weihong Xie & Jianbin Luo, 2019. "Diversification methods for zero-one optimization," Journal of Heuristics, Springer, vol. 25(4), pages 643-671, October.
    4. Martí, Rafael & Martínez-Gavara, Anna & Pérez-Peló, Sergio & Sánchez-Oro, Jesús, 2022. "A review on discrete diversity and dispersion maximization from an OR perspective," European Journal of Operational Research, Elsevier, vol. 299(3), pages 795-813.
    5. Anna Martínez-Gavara & Vicente Campos & Micael Gallego & Manuel Laguna & Rafael Martí, 2015. "Tabu search and GRASP for the capacitated clustering problem," Computational Optimization and Applications, Springer, vol. 62(2), pages 589-607, November.
    6. Lozano, M. & Molina, D. & GarcI´a-MartI´nez, C., 2011. "Iterated greedy for the maximum diversity problem," European Journal of Operational Research, Elsevier, vol. 214(1), pages 31-38, October.
    7. Wu, Qinghua & Hao, Jin-Kao, 2013. "A hybrid metaheuristic method for the Maximum Diversity Problem," European Journal of Operational Research, Elsevier, vol. 231(2), pages 452-464.
    8. Daniel Porumbel & Jin-Kao Hao & Fred Glover, 2011. "A simple and effective algorithm for the MaxMin diversity problem," Annals of Operations Research, Springer, vol. 186(1), pages 275-293, June.
    9. Zhou, Qing & Benlic, Una & Wu, Qinghua & Hao, Jin-Kao, 2019. "Heuristic search to the capacitated clustering problem," European Journal of Operational Research, Elsevier, vol. 273(2), pages 464-487.
    10. Liqin Huang & Weitian Tong & Randy Goebel & Tian Liu & Guohui Lin, 2015. "A 0.5358-approximation for Bandpass-2," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 612-626, October.
    11. Aringhieri, Roberto & Cordone, Roberto & Grosso, Andrea, 2015. "Construction and improvement algorithms for dispersion problems," European Journal of Operational Research, Elsevier, vol. 242(1), pages 21-33.
    12. Felix Prause & Kai Hoppmann-Baum & Boris Defourny & Thorsten Koch, 2021. "The maximum diversity assortment selection problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(3), pages 521-554, June.
    13. R Aringhieri & R Cordone, 2011. "Comparing local search metaheuristics for the maximum diversity problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 266-280, February.
    14. Anna Martínez-Gavara & Vicente Campos & Manuel Laguna & Rafael Martí, 2017. "Heuristic solution approaches for the maximum minsum dispersion problem," Journal of Global Optimization, Springer, vol. 67(3), pages 671-686, March.
    15. Hakan Kutucu & Arif Gursoy & Mehmet Kurt & Urfat Nuriyev, 2020. "The band collocation problem," Journal of Combinatorial Optimization, Springer, vol. 40(2), pages 454-481, August.
    16. Lai, Xiangjing & Hao, Jin-Kao, 2016. "Iterated maxima search for the maximally diverse grouping problem," European Journal of Operational Research, Elsevier, vol. 254(3), pages 780-800.
    17. Hakan Kutucu & Arif Gursoy & Mehmet Kurt & Urfat Nuriyev, 0. "The band collocation problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-28.
    18. Rafael Martí & Abraham Duarte & Manuel Laguna, 2009. "Advanced Scatter Search for the Max-Cut Problem," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 26-38, February.
    19. Mancini, Simona & Triki, Chefi & Piya, Sujan, 2022. "Optimal selection of touristic packages based on user preferences during sports mega-events," European Journal of Operational Research, Elsevier, vol. 302(3), pages 819-830.
    20. Bahram Alidaee & Haibo Wang, 2017. "A note on heuristic approach based on UBQP formulation of the maximum diversity problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(1), pages 102-110, January.

    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:spr:jglopt:v:66:y:2016:i:4:d:10.1007_s10898-016-0446-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.