Show simple item record

dc.contributor.authorAlfandari, Laurent
dc.contributor.authorPlateau, Agnès
dc.contributor.authorTolla, Pierre
dc.date.accessioned2011-04-12T15:27:46Z
dc.date.available2011-04-12T15:27:46Z
dc.date.issued2001
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/5967
dc.language.isoenen
dc.subjectcombinatorial optimizationen
dc.subjectassignmenten
dc.subjectheuristicsen
dc.subject.ddc003en
dc.titleA two-phase path-relinking algorithm for the generalized assignment problemen
dc.typeCommunication / Conférence
dc.description.abstractenWe propose a two-phase Path-Relinking (PR) heuristic for the NP-hard Generalized Assignment Problem. The first phase of the algorithm combines LP-solving, cuts and local search for obtaining a population of solutions with guided diversity. The second phase applies the PR template to the population built at phase one. Both feasible and infeasible solutions are inserted in the reference set during combinations of PR. The trade-off between feasibility and infeasibility is controlled through a penalty coefficient for infeasibility which is dynamically updated throughout the search for maintaining a balance between feasible and infeasible solutions in the reference set. Numerical experiments on classical testbed instances of the OR-library show the practical efficiency of the method.en
dc.identifier.citationpages13en
dc.description.sponsorshipprivateouien
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.conftitle4th Metaheuristics International Congress (MIC'01)en
dc.relation.confdate2001-07
dc.relation.confcityPortoen
dc.relation.confcountryPortugalen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record