Publications associées à A column generation algorithm for the vehicle routing problem with soft time windows

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.

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

Maryam Kamgarpour, Tyler Summers, Baiwei Guo, Orcun Karaca

Actuator placement is an active field of research which has received significant attention for its applications in complex dynamical networks. In this paper, we study the problem of finding a set of actuator placements minimizing the metric that measures t ...

2020

Realizability of planar point embeddings from angle measurements

Majed El Helou, Adam James Scholefield, Frederike Dümbgen

Localization of a set of nodes is an important and a thoroughly researched problem in robotics and sensor networks. This paper is concerned with the theory of localization from inner-angle measurements. We focus on the challenging case where no anchor loca ...

2020

Window Size Effects on Subjective Impressions of Daylit Spaces: Indoor Studies at High Latitudes Using Virtual Reality

Marilyne Andersen, Jan Wienold, Kynthia Chamilothori

Daylight provision to the indoor space is affected by different building elements that cannot be fully controlled by the users, such as the window size of a space. The dimensions of the fenestration not only affect the lighting levels, but they also affect ...

2020

The electric autonomous dial-a-ride problem

Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi

In the Dial-a-Ride-Problem (DARP) a fleet of vehicles provides shared-ride services to users specifying their origin, destination, and preferred arrival time. Typically, the problem consists of finding minimum cost routes, satisfying operational constraint ...

Elsevier2019

Submodular Stochastic Probing on Matroids

Justin Dean Ward, Marek Adamczyk

In a stochastic probing problem we are given a universe E, and a probability that each element e in E is active. We determine if an element is active by probing it, and whenever a probed element is active, we must permanently include it in our solution. Mo ...

INFORMS2016

Vehicle routing with cross-dock selection

Mohammad Yousef Maknoon

The vehicle routing problem with cross-dock selection is a variant of the vehicle routing problem containing spatial and load synchronization constraints by which products are transferred and processed via at least one cross-dock. This paper presents a mat ...

Pergamon-Elsevier Science Ltd2016

Progressive Geometric Algorithms

Timur Bagautdinov

Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, an ...

Carleton Univ, Dept Mathematics & Statistics2015

Improving Christofides' Algorithm for the s-t Path TSP

Hyung Chan An

We present a deterministic (1+root 5/2)-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric metric cost on n vertices including two prespecified endpoints, the problem is to find a shortest Hamiltonian path between the t ...

Assoc Computing Machinery2015

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

Graph Chatbot

Chattez avec Graph Search

Results on Sparse Integer Programming and Geometric Independent Sets

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

Realizability of planar point embeddings from angle measurements

Linearly Convergent Frank-Wolfe with Backtracking Line-Search

Window Size Effects on Subjective Impressions of Daylit Spaces: Indoor Studies at High Latitudes Using Virtual Reality

The electric autonomous dial-a-ride problem

Submodular Stochastic Probing on Matroids

Vehicle routing with cross-dock selection

Progressive Geometric Algorithms

Improving Christofides' Algorithm for the s-t Path TSP

Results on Sparse Integer Programming and Geometric Independent Sets

Realizability of planar point embeddings from angle measurements

Linearly Convergent Frank-Wolfe with Backtracking Line-Search

Vehicle routing with cross-dock selection

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

Window Size Effects on Subjective Impressions of Daylit Spaces: Indoor Studies at High Latitudes Using Virtual Reality

Progressive Geometric Algorithms

The electric autonomous dial-a-ride problem

Submodular Stochastic Probing on Matroids

Improving Christofides' Algorithm for the s-t Path TSP