Ensuring Privacy through Distributed Computation in Multiple-Depot Vehicle Routing Problems

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.

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 ...

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environment wi ...

The monumental progress in the development of machine learning models has led to a plethora of applications with transformative effects in engineering and science. This has also turned the attention of the research community towards the pursuit of construc ...

This thesis develops mathematical programming frameworks to operate electric autonomous vehicles in the context of ride-sharing services. The introduced problem is a novel variant of the Dial-a-Ride Problem (DARP), denoted by the electric Autonomous Dial-a ...

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 ...

This paper presents a new All-In-One (AIO) implementation of an existing formulation to design adaptive structures through Total Energy Optimization (TEO). The method implemented in previous work is a nested optimization process, here named TEO-Nested. Num ...

In this thesis we give new algorithms for two fundamental graph problems. We develop novel ways of using linear programming formulations, even exponential-sized ones, to extract structure from problem instances and to guide algorithms in making progress. S ...

Unexpected disruptions occur for many reasons in railway networks and cause delays, cancellations, and, eventually, passenger inconvenience. This thesis focuses on the railway timetable rescheduling problem from a macroscopic point of view in case of lar ...

Many of the currently best-known approximation algorithms for NP-hard optimization problems are based on Linear Programming (LP) and Semi-definite Programming (SDP) relaxations. Given its power, this class of algorithms seems to contain the most favourable ...

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 ...

The complexity of evaluating chance constraints makes chance-constrained programming problem difficult to solve. One way to handle this complexity is by devising satisficing measures for the relevant uncertainties. This paper focuses on solving the stochas ...

We consider a complex recyclable waste collection problem that extends the class of vehicle routing problems with intermediate facilities by integrating a heterogeneous fixed fleet and a flexible assignment of destination depots. Several additional side co ...

We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges to make a given graph Eulerian, whereas our approach also allows for the removal of certain edges leading to a d ...

With the popularization of online social networks (OSNs) and smart mobile devices, photo sharing is becoming a part of people’ daily life. An unprecedented number of photos are being uploaded and shared everyday through online social networks or photo host ...

At each generation of an ant algorithm, each ant builds a solution step by step by adding an element to it. Each choice is based on the greedy force (short term profit or heuristic information) and the trail system (central memory which collects informatio ...

In this thesis, we present new approximation algorithms as well as hardness of approximation results for NP-hard vehicle routing problems related to public transportation. We consider two different problem classes that also occur frequently in areas such a ...

A new decomposition optimization algorithm, called path-following gradient-based decomposition, is proposed to solve separable convex optimization problems. Unlike path-following Newton methods considered in the literature, this algorithm does not require ...

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 ...

Ensuring Privacy through Distributed Computation in Multiple-Depot Vehicle Routing Problems

Chat with Graph Search

Differentially private multi-agent constraint optimization

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Certification of Bottleneck Task Assignment With Shortest Path Criteria

Probabilistic methods for neural combinatorial optimization

The electric autonomous dial-a-ride problem

Waste collection inventory routing with non-stationary stochastic demands

Minimum energy adaptive structures – All-In-One problem formulation

New Graph Algorithms via Polyhedral Techniques

Integration of passenger satisfaction in railway timetable rescheduling for major disruptions

Strengths and Limitations of Linear Programming Relaxations

Vehicle routing with cross-dock selection

Satisficing measure approach for vehicle routing problem with time windows under uncertainty

Integrating a heterogeneous fixed fleet and a flexible assignment of destination depots in the waste collection VRP with intermediate facilities

Removing and Adding Edges for the Traveling Salesman Problem

Secure JPEG Scrambling enabling Privacy in Photo Sharing

Ant Metaheuristic with Adapted Personalities for the Vehicle Routing Problem

Ant Metaheuristics with Adapted Personalities for Vehicle Routing Problem

Approximation algorithms for regret minimization in vehicle routing problems

Path-following gradient-based decomposition algorithms for separable convex optimization

The School Bus Problem on Trees