Concept

Tabu search

Related publications (100)

The virtue of patience in low complexity scheduling of packetized media with feedback

Pascal Frossard, Christophe De Vleeschouwer

We consider streaming of pre-encoded and packetized media over best-effort networks in presence of acknowledgment feedbacks. We first review the rate-distortion optimization framework in such scenarios. Given an estimation of future transmission resources, ...

2007

Numerical methods and models relevant to transportation applications

Michaël Clément Louis Ghislain Thémans

In this thesis, we focus on standard classes of problems in numerical optimization: unconstrained nonlinear optimization as well as systems of nonlinear equations. More precisely, we consider two types of unconstrained nonlinear optimization problems. On t ...

EPFL2007

A heuristic for nonlinear global optimization relevant to discrete choice models estimation

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

In most applications related to transportation, it is of major importance to be able to identify the global optimum of the associated optimization problem. The work we present in this paper is motivated by the optimization problems arising in the maximum l ...

2007

A heuristic for global nonlinear optimization

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

The proposed heuristic combines a variable neighborhood search (VNS) framework with a local search performed by a trust-region algorithm. The curvature of the function is exploited to generate the neighborhoods. Numerical results illustrate an excellent be ...

2007

A novel optimization approach for minimum cost design of trusses

Abhinav Gupta

This paper describes new optimization strategies that offer significant improvements in performance over existing methods for bridge-truss design. In this study, a real-world cost function that consists of costs on the weight of the truss and the number of ...

2007

A Dynamically Constrained Genetic Algorithm For Hardware-software Partitioning

Guillaume Zufferey, Pierre-André Mudry

In this article, we describe the application of an enhanced genetic algorithm to the problem of hardware-software codesign. Starting from a source code written in a high-level language our algorithm determines, using a dynamically-weighted fitness function ...

2006

A Propagation/Local Search Hybrid for Distributed Optimization

Boi Faltings, Adrian Petcu

We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decisions based only on local information, and full inference methods that guarant ...

2005

Suboptimal colorings and solution of large chromatic scheduling problems

Ivo Blöchliger

Graph Coloring is a very active field of research in graph theory as well as in the domain of the design of efficient heuristics to solve problems which, due to their computational complexity, cannot be solved exactly (no guarantee that an optimal solution ...

EPFL2005

The virtue of patience in low complexity scheduling of packetized media with feedback

Pascal Frossard, Christophe De Vleeschouwer

2005

Sur la planification de tournées de véhicules scolaires

The purpose of school bus services is to carry children from their homes to school and back. Scheduling and routing such services manually can be a long and tedious task, as it gives rise to complex combinatorial problems. To tackle those, we propose vario ...

EPFL2004

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.