Flying elephants: a general method for solving non-differentiable problems.
Saved in:
| Title: | Flying elephants: a general method for solving non-differentiable problems. |
|---|---|
| Authors: | Xavier, Adilson1 adilson@cos.ufrj.br, Xavier, Vinicius1 vinicius@cos.ufrj.br |
| Source: | Journal of Heuristics. Aug2016, Vol. 22 Issue 4, p649-664. 16p. |
| Subjects: | Hyperbolic geometry, Distance geometry, Metric spaces, Metaheuristic algorithms, Heuristic |
| 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Heuristics is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 116918357 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Flying elephants: a general method for solving non-differentiable problems. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Xavier%2C+Adilson%22">Xavier, Adilson</searchLink><relatesTo>1</relatesTo><i> adilson@cos.ufrj.br</i><br /><searchLink fieldCode="AR" term="%22Xavier%2C+Vinicius%22">Xavier, Vinicius</searchLink><relatesTo>1</relatesTo><i> vinicius@cos.ufrj.br</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+Heuristics%22">Journal of Heuristics</searchLink>. Aug2016, Vol. 22 Issue 4, p649-664. 16p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Hyperbolic+geometry%22">Hyperbolic geometry</searchLink><br /><searchLink fieldCode="DE" term="%22Distance+geometry%22">Distance geometry</searchLink><br /><searchLink fieldCode="DE" term="%22Metric+spaces%22">Metric spaces</searchLink><br /><searchLink fieldCode="DE" term="%22Metaheuristic+algorithms%22">Metaheuristic algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Heuristic%22">Heuristic</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Journal of Heuristics is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=116918357 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s10732-014-9268-8 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 16 StartPage: 649 Subjects: – SubjectFull: Hyperbolic geometry Type: general – SubjectFull: Distance geometry Type: general – SubjectFull: Metric spaces Type: general – SubjectFull: Metaheuristic algorithms Type: general – SubjectFull: Heuristic Type: general Titles: – TitleFull: Flying elephants: a general method for solving non-differentiable problems. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Xavier, Adilson – PersonEntity: Name: NameFull: Xavier, Vinicius IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 08 Text: Aug2016 Type: published Y: 2016 Identifiers: – Type: issn-print Value: 13811231 Numbering: – Type: volume Value: 22 – Type: issue Value: 4 Titles: – TitleFull: Journal of Heuristics Type: main |
| ResultId | 1 |
