Nicolas Zufferey

Cette personne n’est plus à l’EPFL

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (21)

Ant Metaheuristic with Adapted Personalities for the Vehicle Routing Problem

Rémy Glardon, Nicolas Zufferey, Jaime Farres

At each generation of an ant algorithm, each ant builds a solution step by step by adding an element to it. Each choice is based on the greedy force (short term profit or heuristic information) and the trail system (central memory which collects informatio ...

Springer Int Publishing Ag2015

Ant Metaheuristics with Adapted Personalities for Vehicle Routing Problem

Rémy Glardon, Nicolas Zufferey, Jaime Farres

2015

Tabu search using variable amplitude for dimensioning an assembly/ disassembly production system

Naoufel Cheikhrouhou, Nicolas Zufferey

2012

A heuristic for nonlinear global optimization

Michel Bierlaire, Michaël Clément Louis Ghislain Thémans, Nicolas Zufferey

We propose a new heuristic for nonlinear global optimization combining a variable neighborhood search framework with a modified trust-region algorithm as local search. The proposed method presents the capability to prematurely interrupt the local search if ...

2010

Variable space search for graph coloring (vol 156, pg 2551, 2008)

Nicolas Zufferey, Matthieu Plumettaz

2009

A graph coloring heuristic using partial solutions and a reactive tabu scheme

Nicolas Zufferey

Most of the recent heuristics for the graph coloring problem start from an infeasible k-coloring (adjacent vertices may have the same color) and try to make the solution feasible through a sequence of color exchanges. In contrast, our approach (called FOO- ...

2008

Variable space search for graph coloring

Nicolas Zufferey, Matthieu Plumettaz

Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, ..., k}) to each vertex of G so that no edge has both endpoints with the same color. We propose a new local search methodology, ...

2008

Graph colouring approaches for a satellite range scheduling problem

Nicolas Zufferey, Patrick Amstutz, Philippe Giaccari

A goal of this paper is to efficiently adapt the best ingredients of the graph colouring techniques to an NP-hard satellite range scheduling problem, called MuRRSP. We propose two new heuristics for the MuRRSP, where as many jobs as possible have to be sch ...

2008

A heuristic for nonlinear global optimization

Michel Bierlaire, Michaël Clément Louis Ghislain Thémans, Nicolas Zufferey

2008

A heuristic for nonlinear global optimization

Michel Bierlaire, Michaël Clément Louis Ghislain Thémans, Nicolas Zufferey

We propose a new heuristic for nonlinear global optimization combining a variable neighbourhood search framework with a modified trust-region algorithm as local search. The proposed method presents the capability to prematurely interrupt the local search i ...

2008

Page 2 sur 3