Concept

Problème de tournées de véhicules

Publications associées (106)

Polynomial Approximations for Continuous Linear Programs

Continuous linear programs have attracted considerable interest due to their potential for modeling manufacturing, scheduling, and routing problems. While efficient simplex-type algorithms have been developed for separated continuous linear programs, crude ...

2012

A Location-Inventory Model for Large Three-Level Supply Chains

Jean-Sébastien Tancrez

We study the location-inventory problem in three-level supply networks. Our model integrates three decisions: the distribution centers location, flows allocation, and shipment sizes. We propose a nonlinear continuous formulation, including transportation, ...

Elsevier2012

Resource-based Planning with Timelines

Jingshi Li

Real world planning applications typically involve making decisions that consumes limited resources, which requires both planning and scheduling. In this paper we propose a new approach that bridges the gap between planning and scheduling by explicitly mod ...

2012

Scalable Routing Easy as PIE: a Practical Isometric Embedding Protocol

Patrick Thiran, Julien Pierre Sacha Herzen

We present PIE, a scalable routing scheme that achieves 100% packet delivery and low path stretch. It is easy to implement in a distributed fashion and works well when costs are associated to links. Scalability is achieved by using virtual coordinates in a ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

A column generation algorithm for the vehicle routing problem with soft time windows

Matteo Salani

The Vehicle Routing Problem with Time Windows consists of computing a minimum cost set of routes for a fleet of vehicles of limited capacity visiting a given set of customers with known demand, with the additional constraint that each customer must be visi ...

2011

Container Terminal Management

Ilaria Vacca

This thesis deals with models and methods for large scale optimization problems; in particular, we focus on decision problems arising in the context of seaport container terminals for the efficient management of terminal operations. Large-scale optimizatio ...

EPFL2011

The School Bus Problem on Trees

Laura Sanità, Adrian Aloysius Bock

The School Bus Problem is an NP-hard vehicle routing problem in which the goal is to route buses that transport children to a school such that for each child, the distance travelled on the bus does not exceed the shortest distance from the child's home to ...

Springer-Verlag Berlin2011

Optimal Exact Path-Following for Constrained Differentially Flat Systems

Timm Faulwasser

We propose a dynamic optimization approach to calculate optimal feedforward controls for exact path-following problems of differentially flat systems. Besides the derivation of a small dimensional optimal control problem, we provide easily checkable condit ...

2011

P2P Video Streaming with Inter-session Network Coding

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze, Jonnahtan Eduardo Saltarin De Arco

We present a novel receiver-driven p2p system for delivery of multiple concurrent time constrained data streams in overlay networks. We propose an effective combination of rateless coding with intra- and inter-session network coding to efficiently exploit ...

2011

CoPhy: A Scalable, Portable, and Interactive Index Advisor for Large Workloads

Anastasia Ailamaki, Debabrata Dash

Index tuning, i.e., selecting the indexes appropriate for a workload, is a crucial problem in database system tuning. In this paper, we solve index tuning for large problem instances that are common in practice, e.g., thousands of queries in the workload, ...

2011

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search