Concept
Arc routing
Publications associées (50)
Differentially private multi-agent constraint optimization
Boi Faltings, Sujit Prakash Gujar, Aleksei Triastcyn, Sankarshan Damle
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 ...
Dordrecht2024Contextual 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 ...
2023Waste 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 LTD2020The 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 ...
Elsevier2019Stability-Aware Integrated Routing and Scheduling for Control Applications in Ethernet Networks
Real-time communication over Ethernet is becoming important in various application areas of cyber-physical systems such as industrial automation and control, avionics, and automotive networking. Since such applications are typically time critical, Ethernet ...
2018Constant 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