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

Alternative evaluation functions for the cyclic bandwidth sum problem

Author

Listed:
  • Rodriguez-Tello, Eduardo
  • Lardeux, Frédéric
  • Duarte, Abraham
  • Narvaez-Teran, Valentina

Abstract

One essential element for the successful application of metaheuristics is the evaluation function. It should be able to make fine distinctions among the potential solutions in order to avoid producing wide plateaus (valleys) in the fitness landscape, on which detecting a promising search direction could be hard for certain local search strategies. In the specific case of the cyclic bandwidth sum (CBS) problem, the heuristics reported have used directly the objective function of the optimization problem to assess the quality of potential solutions. Nevertheless, such a conventional function does not allow to efficiently establish preferences among distinct potential solutions. In order to cope with this important issue, three new more refined evaluation functions for the CBS problem are introduced in this paper.

Suggested Citation

  • Rodriguez-Tello, Eduardo & Lardeux, Frédéric & Duarte, Abraham & Narvaez-Teran, Valentina, 2019. "Alternative evaluation functions for the cyclic bandwidth sum problem," European Journal of Operational Research, Elsevier, vol. 273(3), pages 904-919.
    • Handle: RePEc:eee:ejores:v:273:y:2019:i:3:p:904-919
    DOI: 10.1016/j.ejor.2018.09.031
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718308075
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2018.09.031?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. Porumbel, Daniel & Goncalves, Gilles & Allaoui, Hamid & Hsu, Tienté, 2017. "Iterated Local Search and Column Generation to solve Arc-Routing as a permutation set-covering problem," European Journal of Operational Research, Elsevier, vol. 256(2), pages 349-367.
    2. Coelho, V.N. & Grasas, A. & Ramalhinho, H. & Coelho, I.M. & Souza, M.J.F. & Cruz, R.C., 2016. "An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints," European Journal of Operational Research, Elsevier, vol. 250(2), pages 367-376.
    3. George Henrique Godim Fonseca & Haroldo Gambini Santos & Túlio Ângelo Machado Toffolo & Samuel Souza Brito & Marcone Jamilson Freitas Souza, 2016. "GOAL solver: a hybrid local search based solver for high school timetabling," Annals of Operations Research, Springer, vol. 239(1), pages 77-97, April.
    4. Pieter Smet & Burak Bilgin & Patrick De Causmaecker & Greet Vanden Berghe, 2014. "Modelling and evaluation issues in nurse rostering," Annals of Operations Research, Springer, vol. 218(1), pages 303-326, July.
    5. Karapetyan, Daniel & Mitrovic Minic, Snezana & Malladi, Krishna T. & Punnen, Abraham P., 2015. "Satellite downlink scheduling problem: A case study," Omega, Elsevier, vol. 53(C), pages 115-123.
    6. Helena R. Lourenço & Olivier C. Martin & Thomas Stützle, 2010. "Iterated Local Search: Framework and Applications," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, chapter 0, pages 363-397, Springer.
    7. Garza-Fabre, Mario & Toscano-Pulido, Gregorio & Rodriguez-Tello, Eduardo, 2015. "Multi-objectivization, fitness landscape transformation and search performance: A case of study on the hp model for protein structure prediction," European Journal of Operational Research, Elsevier, vol. 243(2), pages 405-422.
    8. Rodriguez-Tello, Eduardo & Hao, Jin-Kao & Torres-Jimenez, Jose, 2008. "An improved simulated annealing algorithm for bandwidth minimization," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1319-1335, March.
    9. Murovec, Boštjan, 2015. "Job-shop local-search move evaluation without direct consideration of the criterion’s value," European Journal of Operational Research, Elsevier, vol. 241(2), pages 320-329.
    10. Derbel, Bilel & Humeau, Jérémie & Liefooghe, Arnaud & Verel, Sébastien, 2014. "Distributed localized bi-objective search," European Journal of Operational Research, Elsevier, vol. 239(3), pages 731-743.
    11. Ying-Da Chen & Jing-Ho Yan, 2007. "A study on cyclic bandwidth sum," Journal of Combinatorial Optimization, Springer, vol. 14(2), pages 295-308, October.
    12. Lochtefeld, Darrell F. & Ciarallo, Frank W., 2015. "Multi-objectivization Via Decomposition: An analysis of helper-objectives and complete decomposition," European Journal of Operational Research, Elsevier, vol. 243(2), pages 395-404.
    13. Benlic, Una & Epitropakis, Michael G. & Burke, Edmund K., 2017. "A hybrid breakout local search and reinforcement learning approach to the vertex separator problem," European Journal of Operational Research, Elsevier, vol. 261(3), pages 803-818.
    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. Sergio Cavero & Eduardo G. Pardo & Abraham Duarte, 2022. "A general variable neighborhood search for the cyclic antibandwidth problem," Computational Optimization and Applications, Springer, vol. 81(2), pages 657-687, March.

    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. Carlos Segura & Carlos A. Coello Coello & Gara Miranda & Coromoto León, 2016. "Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization," Annals of Operations Research, Springer, vol. 240(1), pages 217-250, May.
    2. Zhang, Yue & Zhang, Qi & Farnoosh, Arash & Chen, Siyuan & Li, Yan, 2019. "GIS-Based Multi-Objective Particle Swarm Optimization of charging stations for electric vehicles," Energy, Elsevier, vol. 169(C), pages 844-853.
    3. Barry B. & Quim Castellà & Angel A. & Helena Ramalhinho Lourenco & Manuel Mateo, 2012. "ILS-ESP: An Efficient, Simple, and Parameter-Free Algorithm for Solving the Permutation Flow-Shop Problem," Working Papers 636, Barcelona School of Economics.
    4. Pan, Quan-Ke & Ruiz, Rubén, 2012. "Local search methods for the flowshop scheduling problem with flowtime minimization," European Journal of Operational Research, Elsevier, vol. 222(1), pages 31-43.
    5. Bulhões, Teobaldo & Subramanian, Anand & Erdoğan, Güneş & Laporte, Gilbert, 2018. "The static bike relocation problem with multiple vehicles and visits," European Journal of Operational Research, Elsevier, vol. 264(2), pages 508-523.
    6. Verbiest, Floor & Cornelissens, Trijntje & Springael, Johan, 2019. "A matheuristic approach for the design of multiproduct batch plants with parallel production lines," European Journal of Operational Research, Elsevier, vol. 273(3), pages 933-947.
    7. Cordeau, Jean-François & Dell’Amico, Mauro & Falavigna, Simone & Iori, Manuel, 2015. "A rolling horizon algorithm for auto-carrier transportation," Transportation Research Part B: Methodological, Elsevier, vol. 76(C), pages 68-80.
    8. Ibarra-Rojas, Omar J. & Rios-Solis, Yasmin A., 2012. "Synchronization of bus timetabling," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 599-614.
    9. David Wolfinger & Fabien Tricoire & Karl F. Doerner, 2019. "A matheuristic for a multimodal long haul routing problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(4), pages 397-433, December.
    10. Eduardo Queiroga & Anand Subramanian & Rosa Figueiredo & Yuri Frota, 2021. "Integer programming formulations and efficient local search for relaxed correlation clustering," Journal of Global Optimization, Springer, vol. 81(4), pages 919-966, December.
    11. Mu He & Qinghua Wu & Yongliang Lu, 2022. "Breakout local search for the cyclic cutwidth minimization problem," Journal of Heuristics, Springer, vol. 28(5), pages 583-618, December.
    12. Yongji Jia & Wang Zeng & Yanting Xing & Dong Yang & Jia Li, 2020. "The Bike-Sharing Rebalancing Problem Considering Multi-Energy Mixed Fleets and Traffic Restrictions," Sustainability, MDPI, vol. 13(1), pages 1-15, December.
    13. Bhanuteja Sainathuni & Bradley Guthrie & Pratik J. Parikh & Nan Kong, 2019. "Distribution planning for products with varying life cycles," Flexible Services and Manufacturing Journal, Springer, vol. 31(1), pages 41-74, March.
    14. Behrooz Koohestani & Riccardo Poli, 2015. "Addressing the envelope reduction of sparse matrices using a genetic programming system," Computational Optimization and Applications, Springer, vol. 60(3), pages 789-814, April.
    15. Paredes-Belmar, Germán & Montero, Elizabeth & Lüer-Villagra, Armin & Marianov, Vladimir & Araya-Sassi, Claudio, 2022. "Vehicle routing for milk collection with gradual blending: A case arising in Chile," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1403-1416.
    16. Vansteenwegen, Pieter & Mateo, Manuel, 2014. "An iterated local search algorithm for the single-vehicle cyclic inventory routing problem," European Journal of Operational Research, Elsevier, vol. 237(3), pages 802-813.
    17. Noushin Niknafs & Violeta Beleva-Guthrie & Daniel Q Naiman & Rachel Karchin, 2015. "SubClonal Hierarchy Inference from Somatic Mutations: Automatic Reconstruction of Cancer Evolutionary Trees from Multi-region Next Generation Sequencing," PLOS Computational Biology, Public Library of Science, vol. 11(10), pages 1-26, October.
    18. Xu, Yifan & Wandelt, Sebastian & Sun, Xiaoqian, 2021. "Airline integrated robust scheduling with a variable neighborhood search based heuristic," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 181-203.
    19. 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.
    20. Erika Buson & Roberto Roberti & Paolo Toth, 2014. "A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem," Operations Research, INFORMS, vol. 62(5), pages 1095-1106, October.

    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:273:y:2019:i:3:p:904-919. 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.