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.
The Discrete Split Delivery Vehicle Routing Problem with Time Windows (DSDVRPTW) consists of designing the optimal set of routes to serve, at least cost, a given set of customers while respecting constraints on vehicles capacity and customer time windows. ...
We present the results of searches for high-energy muon neutrinos from 41 gamma-ray bursts (GRBs) in the northern sky with the IceCube detector in its 22 string configuration active in 2007/2008. The searches cover both the prompt and a possible precursor ...
We present an optimization algorithm developed for a provider of software planning tools for distribution logistics companies. The algorithm computes a daily plan for a heterogeneous fleet of vehicles, that can depart from different depots and must visit a ...
We present an exact optimization algorithm for the Orienteering Problem with Time Windows (OPTW). The algorithm is based on bi-directional and bounded dynamic programming with decremental state space relaxation. We compare different strategies proposed in ...
To fix a bug, software developers have to examine the bug-gy execution to locate defects. They employ different ap-proaches (e.g., setting breakpoints, inserting printing statements in the code) to navigate over buggy execution and inspect program state at ...
The adoption of multi- and many-core architectures for mainstream computing undoubtedly brings profound changes in the way software is developed. In particular, the use of fine grained locking as the multi-core programmer’s coordination methodology is cons ...
Institute of Electrical and Electronics Engineers2010
The Split Delivery Vehicle Routing Problem (SDVRP) is a variant version of the classical VRP in which each customer can be visited by more than one vehicle which serves a fraction of its demand. The Discrete SDVRP is another variant in which the delivery r ...
The Discrete Split Delivery Vehicle Routing Problem with Time Windows (DSDVRPTW) consists of designing the optimal set of routes to serve, at least cost, a given set of customers while respecting constraints on vehicles capacity and customer time windows. ...
The major objectives of this paper are: (1) to review the pros and cons of the scenarios of past anthropogenic land cover change (ALCC) developed during the last ten years, (2) to discuss issues related to pollen-based reconstruction of the past land-cover ...
The Discrete Split Delivery Vehicle Routing Problem with Time Windows (DSDVRPTW) consists of designing the optimal set of routes to serve, at least cost, a given set of customers while respecting constraints on vehicles' capacity and customer time windows. ...
