S'abonner navigation icon
FR
navigation icon menu icon S'abonner
navigation icon Accueil navigation icon Catalogue
icon language Langues navigation icon Menu
icon close
icon arrow

Rechercher

icon searchbar

Rechercher

Catalogue

icon close
icon close
icon close
icon language

Langues

icon close

Résultat de recherche pour

"Lao Zi"

icon

Filtres

0
icon sort

Trier
Traineeship proposal ANALYSIS AND COMPARISON OF PARAMETER TUNING FOR LOCAL SEARCH ALGORITHMSLocation either University of Nantes LINA or University of Angers LERIA FranceSalary up to for the whole periodStarting date May Duration at least monthsContact Charlotte Truchet charlotte nantes fr and Frédéric Saubion Frederic angers frContextDuring the last decades impressive improvements have been achieved to solve complexoptimization problems issued from real world applications which involve more and more dataand constraints In order to tackle large scale instances and intricate problem structures sophisticated solving techniques have been developed and combined to provide efficientsolvers Among the different solving paradigms local search has been widely used as an incompleteoptimization technique for solving such problems It is now integrated in solvers and combinedwith other techniques Local search mainly relies on the basic concept of neighbourhood Starting from an initialconfiguration a local search algorithm tries to reach the optimum by moving locally from aconfiguration to one of its neighbours according to its evaluation The performance of such analgorithm is strongly related to its ability to explore and exploit the search landscape Forinstance when faced to a very rugged landscape one should be able to escape from manylocal optima while in presence of large plateaus one should be able to widely explore thespace In order to manage the balance between exploitation and exploration various efficientheuristics have been proposed usually relying on stochastic perturbations and restarts Unfortunately these heuristics are most of the time controlled by parameters whose settinghas a great impact on the efficiency of the algorithm Well known parameters are for instancethe temperature cooling schedule in simulated annealing or the amount of random walk Parameter tuning is nowadays a crucial issue and various tuning methods have beendeveloped including a dynamic management of parameters during the solving process ... icon
Category

Documents

Rapports de stage

Traineeship proposal ANALYSIS AND COMPARISON OF PARAMETER TUNING FOR LOCAL SEARCH ALGORITHMSLocation either University of Nantes LINA or University of Angers LERIA FranceSalary up to for the whole periodStarting date May Duration at least monthsContact Charlotte Truchet charlotte nantes fr and Frédéric Saubion Frederic angers frContextDuring the last decades impressive improvements have been achieved to solve complexoptimization problems issued from real world applications which involve more and more dataand constraints In order to tackle large scale instances and intricate problem structures sophisticated solving techniques have been developed and combined to provide efficientsolvers Among the different solving paradigms local search has been widely used as an incompleteoptimization technique for solving such problems It is now integrated in solvers and combinedwith other techniques Local search mainly relies on the basic concept of neighbourhood Starting from an initialconfiguration a local search algorithm tries to reach the optimum by moving locally from aconfiguration to one of its neighbours according to its evaluation The performance of such analgorithm is strongly related to its ability to explore and exploit the search landscape Forinstance when faced to a very rugged landscape one should be able to escape from manylocal optima while in presence of large plateaus one should be able to widely explore thespace In order to manage the balance between exploitation and exploration various efficientheuristics have been proposed usually relying on stochastic perturbations and restarts Unfortunately these heuristics are most of the time controlled by parameters whose settinghas a great impact on the efficiency of the algorithm Well known parameters are for instancethe temperature cooling schedule in simulated annealing or the amount of random walk Parameter tuning is nowadays a crucial issue and various tuning methods have beendeveloped including a dynamic management of parameters during the solving process ...

Charlotte Truchet