Related papers: TIPS: Mining Top-K Locations to Minimize User-Inco…
Transit vehicles operating under skip-stop service visit only a subset of the stops residing along a corridor. It is a strategy commonly used to increase vehicle speeds and reduce patron travel times. The present paper develops a continuous…
Facility location problems often permit facilities to be located at any position. But what if this is not the case in practice? What if facilities can only be located at particular locations like a highway exit or close to a bus stop? We…
Drivers offering spare seats in their vehicles on long-distance (interurban) trips often have to pick up or drop off passengers in cities en route. In that case it is necessary to agree on a meeting point. Often, this is done by proposing…
Dynamic facility location problems aim at placing one or more valuable resources over a planning horizon to meet customer demand. Existing literature commonly assumes that customer demand quantities are defined independently for each time…
We develop a new Location Verification System (LVS) focussed on network-based Intelligent Transport Systems and vehicular ad hoc networks. The algorithm we develop is based on an information-theoretic framework which uses the received…
In recent years, there has been an increasing awareness to traffic localization techniques driven by the problematic of hotspot offloading solutions, the emergence of heterogeneous networks (HetNet) with small cells' deployment and the…
Recent advances in wireless technologies have enabled many new applications in Intelligent Transportation Systems (ITS) such as collision avoidance, cooperative driving, congestion avoidance, and traffic optimization. Due to the vulnerable…
We consider the classic Facility Location problem on planar graphs (non-uniform, uncapacitated). Given an edge-weighted planar graph $G$, a set of clients $C\subseteq V(G)$, a set of facilities $F\subseteq V(G)$, and opening costs…
In last-mile routing, the task of finding a route is often framed as a Traveling Salesman Problem to minimize travel time and associated cost. However, solutions stemming from this approach do not match the realized paths as drivers deviate…
In this paper we study a facility location problem in the plane in which a single point (facility) and a rapid transit line (highway) are simultaneously located in order to minimize the total travel time of the clients to the facility,…
An optimal base station (BS) location depends on the traffic (user) distribution, propagation pathloss and many system parameters, which renders its analytical study difficult so that numerical algorithms are widely used instead. In this…
In this paper we provide a finite set of candidates to be one of the endpoints of an optimal solution for the problem of locating simultaneously a service facility and a rapid transit line.
By fully exploiting the mobility of unmanned aerial vehicles (UAVs), UAV-based aerial base stations (BSs) can move closer to ground users to achieve better communication conditions. In this paper, we consider a scenario where an aerial BS…
We consider the facility location problem in the one-dimensional setting where each facility can serve a limited number of agents from the algorithmic and mechanism design perspectives. From the algorithmic perspective, we prove that the…
Solving the road congestion problem is one of the most pressing issues in moderncities since it causes time wasting, pollution, higher industrial costs and huge roadmaintenance costs. Advances in ITS technologies and the advent of…
In the facility location problem, the task is to place one or more facilities so as to minimize the sum of the agent costs for accessing their nearest facility. Heretofore, in the strategic version, agent locations have been assumed to be…
This paper addresses the problem of planning time-optimal trajectories for multiple cooperative agents along specified paths through a static road network. Vehicle interactions at intersections create non-trivial decisions, with complex…
One important problem in crowdsourcing is that of assigning tasks to workers. We consider a scenario where a worker is traveling on a preferred/typical path (e.g., from school to home) and there is a set of tasks available to be performed.…
ATMs enable the public to perform financial transactions. Banks try to strategically position their ATMs in order to maximize transactions and revenue. In this paper, we introduce a model which provides a score to an ATM location, which…
The problem of providing meaningful routing directions over road networks is of great importance. In many real-life cases, the fastest route may not be the ideal choice for providing directions in written, spoken text, or for an unfamiliar…