Essec\Faculty\Model\Contribution {#2190
  #_index: "academ_contributions"
  #_id: "13017"
  #_source: array:26 [
    "id" => "13017"
    "slug" => "a-genetic-algorithm-for-the-close-enough-traveling-salesman-problem-with-application-to-solar-panels-diagnostic-reconnaissance"
    "yearMonth" => "2022-05"
    "year" => "2022"
    "title" => "A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance"
    "description" => "DI PLACIDO, A., ARCHETTI, C. et CERRONE, C. (2022). A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance. <i>Computers & Operations Research</i>, 145, pp. 105831."
    "authors" => array:3 [
      0 => array:3 [
        "name" => "ARCHETTI Claudia"
        "bid" => "B00773540"
        "slug" => "archetti-claudia"
      ]
      1 => array:1 [
        "name" => "DI PLACIDO Andrea"
      ]
      2 => array:1 [
        "name" => "CERRONE Carmine"
      ]
    ]
    "ouvrage" => ""
    "keywords" => array:4 [
      0 => "Close-enough TSP"
      1 => "Genetic algorithm"
      2 => "Conic programming"
      3 => "Solar panel diagnosis"
    ]
    "updatedAt" => "2023-01-27 01:00:43"
    "publicationUrl" => "https://doi.org/10.1016/j.cor.2022.105831"
    "publicationInfo" => array:3 [
      "pages" => "105831"
      "volume" => "145"
      "number" => ""
    ]
    "type" => array:2 [
      "fr" => "Articles"
      "en" => "Journal articles"
    ]
    "support_type" => array:2 [
      "fr" => "Revue scientifique"
      "en" => "Scientific journal"
    ]
    "countries" => array:2 [
      "fr" => null
      "en" => null
    ]
    "abstract" => array:2 [
      "fr" => "This paper addresses a variant of the classical Traveling Salesman Problem known as Close-Enough Traveling Salesman Problem . In this problem, there is a set of nodes (customers, targets), each of them associated with a region, denoted as neighborhood, that contains it. The goal is to determine the shortest tour that visits all the nodes, where a node is visited when the tour traverses or reaches the region associated with the node. We propose a genetic algorithm (GA), which uses several strategies to optimize the tour, such as 2opt, second-order cone programming, and a bisection algorithm. The proposed approach is tested on 62 benchmark instances."
      "en" => "This paper addresses a variant of the classical Traveling Salesman Problem known as Close-Enough Traveling Salesman Problem . In this problem, there is a set of nodes (customers, targets), each of them associated with a region, denoted as neighborhood, that contains it. The goal is to determine the shortest tour that visits all the nodes, where a node is visited when the tour traverses or reaches the region associated with the node. We propose a genetic algorithm (GA), which uses several strategies to optimize the tour, such as 2opt, second-order cone programming, and a bisection algorithm. The proposed approach is tested on 62 benchmark instances."
    ]
    "authors_fields" => array:2 [
      "fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
      "en" => "Information Systems, Decision Sciences and Statistics"
    ]
    "indexedAt" => "2024-04-16T08:22:05.000Z"
    "docTitle" => "A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance"
    "docSurtitle" => "Journal articles"
    "authorNames" => "<a href="/cv/archetti-claudia">ARCHETTI Claudia</a>, DI PLACIDO Andrea, CERRONE Carmine"
    "docDescription" => "<span class="document-property-authors">ARCHETTI Claudia, DI PLACIDO Andrea, CERRONE Carmine</span><br><span class="document-property-authors_fields">Information Systems, Decision Sciences and Statistics</span> | <span class="document-property-year">2022</span>"
    "keywordList" => "<a href="#">Close-enough TSP</a>, <a href="#">Genetic algorithm</a>, <a href="#">Conic programming</a>, <a href="#">Solar panel diagnosis</a>"
    "docPreview" => "<b>A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance</b><br><span>2022-05 | Journal articles </span>"
    "docType" => "research"
    "publicationLink" => "<a href="https://doi.org/10.1016/j.cor.2022.105831" target="_blank">A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance</a>"
  ]
  +lang: "en"
  +"_type": "_doc"
  +"_score": 8.746462
  +"parent": null
}