Publications related to Arc routing

Differentially private multi-agent constraint optimization

Boi Faltings, Sankarshan Damle, Sujit Prakash Gujar, Aleksei Triastcyn

Distributed constraint optimization (DCOP) is a framework in which multiple agents with private constraints (or preferences) cooperate to achieve a common goal optimally. DCOPs are applicable in several multi-agent coordination/allocation problems, such as ...

Dordrecht2024

Contextual Stochastic Bilevel Optimization

Daniel Kuhn, Andreas Krause, Yifan Hu, Jie Wang

We introduce contextual stochastic bilevel optimization (CSBO) -- a stochastic bilevel optimization framework with the lower-level problem minimizing an expectation conditioned on some contextual information and the upper-level decision variable. This fram ...

2023

Waste collection inventory routing with non-stationary stochastic demands

Michel Bierlaire, Sacha Varone, Mohammad Yousef Maknoon, Iliya Dimitrov Markov

We solve a rich routing problem inspired from practice, in which a heterogeneous fixed fleet is used for collecting recyclable waste from large containers over a finite planning horizon. Each container is equipped with a sensor that communicates its level ...

PERGAMON-ELSEVIER SCIENCE LTD2020

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

Constant factor approximation for ATSP with two edge weights

Ola Nils Anders Svensson, Jakub Tarnawski

We give a constant factor approximation algorithm for the Asymmetric Traveling Salesman Problem on shortest path metrics of directed graphs with two different edge weights. For the case of unit edge weights, the first constant factor approximation was give ...

SPRINGER HEIDELBERG2018

A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem

Ola Nils Anders Svensson, Jakub Tarnawski

We give a constant-factor approximation algorithm for the asymmetric traveling salesman problem. Our approximation guarantee is analyzed with respect to the standard LP relaxation, and thus our result confirms the conjectured constant integrality gap of th ...

ASSOC COMPUTING MACHINERY2018

A general framework for routing problems with stochastic demands

Michel Bierlaire, Sacha Varone, Mohammad Yousef Maknoon, Iliya Dimitrov Markov

We introduce a unified modeling and solution framework for various classes of rich vehicle and inventory routing problems as well as other probability-based routing problems with a time-horizon dimension. Demand is assumed to be stochastic and non-stationa ...

2017

Robust optimal control with adjustable uncertainty sets

Maryam Kamgarpour, John Lygeros, Xiaojing Zhang

In this paper, we develop a unified framework for studying constrained robust optimal control problems with adjustable uncertainty sets. In contrast to standard constrained robust optimal control problems with known uncertainty sets, we treat the uncertain ...

2017

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.

Arc routing

Differentially private multi-agent constraint optimization

Contextual Stochastic Bilevel Optimization

Waste collection inventory routing with non-stationary stochastic demands

The electric autonomous dial-a-ride problem

The electric autonomous dial-a-ride problem

Stability-Aware Integrated Routing and Scheduling for Control Applications in Ethernet Networks

Constant factor approximation for ATSP with two edge weights

A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem

A general framework for routing problems with stochastic demands

Robust optimal control with adjustable uncertainty sets

Graph Chatbot

Chat with Graph Search

Differentially private multi-agent constraint optimization

A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem

Robust optimal control with adjustable uncertainty sets

Contextual Stochastic Bilevel Optimization

Waste collection inventory routing with non-stationary stochastic demands

Stability-Aware Integrated Routing and Scheduling for Control Applications in Ethernet Networks

The electric autonomous dial-a-ride problem

A general framework for routing problems with stochastic demands

Constant factor approximation for ATSP with two edge weights

The electric autonomous dial-a-ride problem