This paper develops a fast algorithm for computing the equilibrium assignment with the perturbed utility route choice (PURC) model. Without compromise, this allows the significant advantages of the PURC model to be used in large-scale applications. We form ...
We develop an algorithm to solve the bottleneck assignment problem (BAP) that is amenable to having computation distributed over a network of agents. This consists of exploring how each component of the algorithm can be distributed, with a focus on one com ...
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 ...
Semidefinite programming (SDP) is a powerful framework from convex optimization that has striking potential for data science applications. This paper develops a provably correct algorithm for solving large SDP problems by economizing on both the storage an ...
The next technological revolution will be interwoven to the proliferation of intelligent systems. As we bridge the gap between physical and cyber worlds, we will give rise to large-scale, multi-agent based technologies. A key challenge that cities of the f ...
We present a novel anytime heuristic (ALMA), inspired by the human principle of altruism, for solving the assignment problem. ALMA is decentralized, completely uncoupled, and requires no communication between the participants. We prove an upper bound on th ...
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 ...
The distribution networks are experiencing important changes driven by the massive integration of renewable energy conversion systems. However, the lack of direct controllability of the Distributed Generations (DGs) supplying Active Distribution Networks ( ...
This thesis addresses three challenges in algorithmic mechanism design, which seeks to devise computationally efficient mechanisms consisting of an outcome rule and a payment rule that implement desirable outcomes in strategic equilibrium. The first challe ...
A novel omnidirectional visual sensor called the Panoptic camera is introduced. The Panoptic camera is an omnidirectional multi-aperture visual system which is realized by mounting multiple camera sensors on a hemispherical frame. The introduced visual sen ...
The Vehicle Routing Problem (VRP) has been extensively studied over the last twenty years, because it is an abstraction of many real-life logistics problems. In its multiple-depot variant (MDVRP), the routes of vehicles located at various depots must be op ...
Collaborative ad-hoc dissemination of information has been proposed as an efficient means to disseminate information among devices in a wireless ad-hoc network. Devices help in forwarding the information channels to the entire network, by disseminating the ...
