IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v22y2016i4d10.1007_s10732-014-9268-8.html
   My bibliography  Save this article

Flying elephants: a general method for solving non-differentiable problems

Author

Listed:
  • Adilson Elias Xavier

    (Federal University of Rio de Janeiro)

  • Vinicius Layter Xavier

    (Federal University of Rio de Janeiro)

Abstract

Flying Elephants (FE) is a generalization and a new interpretation of the Hyperbolic Smoothing approach. The article introduces the fundamental smoothing procedures. It contains a general overview of successful applications of the approach for solving a select set of five important problems, namely: distance geometry, covering, clustering, Fermat–Weber and hub location. For each problem the original non-smooth formulation and the succedaneous completely differentiable one are presented. Computational experiments for all related problems obtained results that exhibited a high level of performance according to all criteria: consistency, robustness and efficiency. For each problem some results to illustrate the performance of FE are also presented.

Suggested Citation

  • Adilson Elias Xavier & Vinicius Layter Xavier, 2016. "Flying elephants: a general method for solving non-differentiable problems," Journal of Heuristics, Springer, vol. 22(4), pages 649-664, August.
  • Handle: RePEc:spr:joheur:v:22:y:2016:i:4:d:10.1007_s10732-014-9268-8
    DOI: 10.1007/s10732-014-9268-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-014-9268-8
    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/s10732-014-9268-8?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. Jack Brimberg & Pierre Hansen & Nenad Mladenović & Eric D. Taillard, 2000. "Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem," Operations Research, INFORMS, vol. 48(3), pages 444-460, June.
    2. Ivan Contreras & Jean-François Cordeau & Gilbert Laporte, 2011. "Benders Decomposition for Large-Scale Uncapacitated Hub Location," Operations Research, INFORMS, vol. 59(6), pages 1477-1490, December.
    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. Maciej Kruszyna, 2022. "NOAH as an Innovative Tool for Modeling the Use of Suburban Railways," Sustainability, MDPI, vol. 15(1), pages 1-17, December.
    2. Mudassir Shams & Bruno Carpentieri, 2024. "A High-Order Numerical Scheme for Efficiently Solving Nonlinear Vectorial Problems in Engineering Applications," Mathematics, MDPI, vol. 12(15), pages 1-33, July.

    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. Schweiger, Katharina & Sahamie, Ramin, 2013. "A hybrid Tabu Search approach for the design of a paper recycling network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 98-119.
    2. Pawel Kalczynski & Jack Brimberg & Zvi Drezner, 2022. "Less is more: discrete starting solutions in the planar p-median problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 34-59, April.
    3. An, Yu & Zhang, Yu & Zeng, Bo, 2015. "The reliable hub-and-spoke design problem: Models and algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 103-122.
    4. Ivan Contreras & Moayad Tanash & Navneet Vidyarthi, 2017. "Exact and heuristic approaches for the cycle hub location problem," Annals of Operations Research, Springer, vol. 258(2), pages 655-677, November.
    5. Junming Liu & Weiwei Chen & Jingyuan Yang & Hui Xiong & Can Chen, 2022. "Iterative Prediction-and-Optimization for E-Logistics Distribution Network Design," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 769-789, March.
    6. Camilo Ortiz-Astorquiza & Ivan Contreras & Gilbert Laporte, 2019. "An Exact Algorithm for Multilevel Uncapacitated Facility Location," Transportation Science, INFORMS, vol. 53(4), pages 1085-1106, July.
    7. Lin, Cheng-Chang & Lee, Shwu-Chiou, 2018. "Hub network design problem with profit optimization for time-definite LTL freight transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 104-120.
    8. Vatsa, Amit Kumar & Jayaswal, Sachin, 2015. "A New Formulation and Benders' Decomposition for Multi-period facility Location Problem with Server Uncertainty," IIMA Working Papers WP2015-02-07, Indian Institute of Management Ahmedabad, Research and Publication Department.
    9. Zvi Drezner & Said Salhi, 2017. "Incorporating neighborhood reduction for the solution of the planar p-median problem," Annals of Operations Research, Springer, vol. 258(2), pages 639-654, November.
    10. N Aras & M Orbay & I K Altinel, 2008. "Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 64-79, January.
    11. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    12. Blanco, Víctor & Gázquez, Ricardo & Ponce, Diego & Puerto, Justo, 2023. "A branch-and-price approach for the continuous multifacility monotone ordered median problem," European Journal of Operational Research, Elsevier, vol. 306(1), pages 105-126.
    13. Alumur, Sibel A. & Campbell, James F. & Contreras, Ivan & Kara, Bahar Y. & Marianov, Vladimir & O’Kelly, Morton E., 2021. "Perspectives on modeling hub location problems," European Journal of Operational Research, Elsevier, vol. 291(1), pages 1-17.
    14. Zvi Drezner & Jack Brimberg & Nenad Mladenović & Said Salhi, 2015. "Solving the planar p-median problem by variable neighborhood and concentric searches," Journal of Global Optimization, Springer, vol. 63(3), pages 501-514, November.
    15. Bernardes Real, Luiza & O'Kelly, Morton & de Miranda, Gilberto & Saraiva de Camargo, Ricardo, 2018. "The gateway hub location problem," Journal of Air Transport Management, Elsevier, vol. 73(C), pages 95-112.
    16. García, Sergio & Landete, Mercedes & Marín, Alfredo, 2012. "New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem," European Journal of Operational Research, Elsevier, vol. 220(1), pages 48-57.
    17. Mustafa C. Camur & Thomas Sharkey & Chrysafis Vogiatzis, 2022. "The Star Degree Centrality Problem: A Decomposition Approach," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 93-112, January.
    18. Bischoff, Martin & Dächert, Kerstin, 2009. "Allocation search methods for a generalized class of location-allocation problems," European Journal of Operational Research, Elsevier, vol. 192(3), pages 793-807, February.
    19. Faiz, Tasnim Ibn & Noor-E-Alam, Md, 2019. "Data center supply chain configuration design: A two-stage decision approach," Socio-Economic Planning Sciences, Elsevier, vol. 66(C), pages 119-135.
    20. Brimberg, Jack & Drezner, Zvi & Mladenović, Nenad & Salhi, Said, 2014. "A new local search for continuous location problems," European Journal of Operational Research, Elsevier, vol. 232(2), pages 256-265.

    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:joheur:v:22:y:2016:i:4:d:10.1007_s10732-014-9268-8. 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.