Essec\Faculty\Model\Contribution {#2190
  #_index: "academ_contributions"
  #_id: "3372"
  #_source: array:26 [
    "id" => "3372"
    "slug" => "a-path-relinking-algorithm-for-the-generalized-assignment-problem"
    "yearMonth" => "2004-01"
    "year" => "2004"
    "title" => "A Path Relinking Algorithm for the Generalized Assignment Problem"
    "description" => "ALFANDARI, L., PLATEAU, A. et TOLLA, P. (2004). A Path Relinking Algorithm for the Generalized Assignment Problem. Dans: <i>Metaheuristics Computer Decision-making</i>. 1st ed. Kluwer Academic Publishers, pp. 1-17."
    "authors" => array:3 [
      0 => array:3 [
        "name" => "ALFANDARI Laurent"
        "bid" => "B00000901"
        "slug" => "alfandari-laurent"
      ]
      1 => array:1 [
        "name" => "PLATEAU A."
      ]
      2 => array:1 [
        "name" => "TOLLA P."
      ]
    ]
    "ouvrage" => "Metaheuristics Computer Decision-making"
    "keywords" => []
    "updatedAt" => "2021-09-06 14:06:32"
    "publicationUrl" => null
    "publicationInfo" => array:3 [
      "pages" => "1-17"
      "volume" => null
      "number" => null
    ]
    "type" => array:2 [
      "fr" => "Chapitres"
      "en" => "Book chapters"
    ]
    "support_type" => array:2 [
      "fr" => "Editeur"
      "en" => "Publisher"
    ]
    "countries" => array:2 [
      "fr" => null
      "en" => null
    ]
    "abstract" => array:2 [
      "fr" => "The Generalized Assignment Problem (GAP) consists in finding a maximum-profit assignment of tasks to agents with capacity constraints. In this paper, a path relinking heuristic is proposed for the GAP. The main feature of our path relinking is that both feasible and infeasible solutions are inserted in the reference set of elite solutions, trade-off between feasibility and infeasibility being ruled through a penalty coefficient for infeasibility. Since exploration of the solution space is very sensitive to this penalty coefficient, the coefficient is dynamically updated at each round of combinations so that a balance is kept between feasible and infeasible solutions in the reference set. Numerical experiments reported on classical testbed instances of the OR-library show that the algorithm compares favorably to several other methods in the literature. In particular, more than 95% of the instances in the test-file were solved to optimality with short computation time."
      "en" => "Le problème d'affectation généralisée consiste à affecter un ensemble de tâches à un ensemble d'agents ayant des capacités limitées, de façon à optimiser le profit généré. Dans cet article, nous proposons une heuristique de recomposition de chemins pour ce problème. La caractéristique principale de notre algorithme est que l'ensemble de référence est composé de solutions à la fois réalisables et non réalisables, le coefficient de pénalité associé à la violation des capacités des agents étant continuellement recalculé au cours de l'exécution de l'algorithme de façon à maintenir un seuil d'équilibre entre solutions réalisables et non réalisables dans la population. Des expériences numériques menées sur des instances classiques de la bibliothèque OR-library montrent que l'algorithme surclasse plusieurs autres méthodes existantes sur ces instances. En particulier, l'optimum a été trouvé en un temps de calcul limité pour plus de 95% des instances du fichier-test."
    ]
    "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-20T04:21:44.000Z"
    "docTitle" => "A Path Relinking Algorithm for the Generalized Assignment Problem"
    "docSurtitle" => "Book chapters"
    "authorNames" => "<a href="/cv/alfandari-laurent">ALFANDARI Laurent</a>, PLATEAU A., TOLLA P."
    "docDescription" => "<span class="document-property-authors">ALFANDARI Laurent, PLATEAU A., TOLLA P.</span><br><span class="document-property-authors_fields">Information Systems, Decision Sciences and Statistics</span> | <span class="document-property-year">2004</span>"
    "keywordList" => ""
    "docPreview" => "<b>A Path Relinking Algorithm for the Generalized Assignment Problem</b><br><span>2004-01 | Book chapters </span>"
    "docType" => "research"
    "publicationLink" => "<a href="#" target="_blank">A Path Relinking Algorithm for the Generalized Assignment Problem</a>"
  ]
  +lang: "en"
  +"_type": "_doc"
  +"_score": 9.080004
  +"parent": null
}