Related papers: Competitive Facility Location under Random Utiliti…
The assortment problem in revenue management is the problem of deciding which subset of products to offer to consumers in order to maximise revenue. A simple and natural strategy is to select the best assortment out of all those that are…
We introduce a strategic decision-making problem faced by logistics providers (LPs) seeking facility location decisions that lead to profitable operations. The profitability depends on the revenue generated through agreements with shippers,…
We provide nearly optimal algorithms for online facility location (OFL) with predictions. In OFL, $n$ demand points arrive in order and the algorithm must irrevocably assign each demand point to an open facility upon its arrival. The…
We consider the problem of online allocation (matching and assortments) of reusable resources where customers arrive sequentially in an adversarial fashion and allocated resources are used or rented for a stochastic duration that is drawn…
Optimizing car sharing systems under demand uncertainty is an emerging problem for ensuring profitable and sustainable operations of these services while taking into account quality of service concerns. With the increasing adoption of…
An essential consideration in urban transit facility planning is service efficiency and accessibility. Previous research has shown that reducing the number of facilities along a route may increase efficiency but decrease accessibility.…
Nonlinear programming problems are useful in designing and assigning work schedule and also in transporting goods and services from known sources to specified destinations. The objective function could be linear or nonlinear depending on…
Truck platooning, a linking technology of trucks on the highway, has gained enormous attention in recent years due to its benefits in energy and operation cost savings. However, most existing studies on truck platooning limit their focus on…
We consider optimal route planning when the objective function is a general nonlinear and non-monotonic function. Such an objective models user behavior more accurately, for example, when a user is risk-averse, or the utility function needs…
Public transport is vital for meeting people's mobility needs. Providers need to plan their services well to offer high quality and low cost. Optimized planning can benefit providers, customers, and municipalities. The planning process for…
Decision-making problems can be modeled as combinatorial optimization problems with Constraint Programming formalisms such as Constrained Optimization Problems. However, few Constraint Programming formalisms can deal with both optimization…
A route planning query has many real-world applications and has been studied extensively in outdoor spaces such as road networks or Euclidean space. Despite its many applications in indoor venues (e.g., shopping centres, libraries,…
We study the strategic decision-making problem of assigning time windows to customers in the context of vehicle routing applications that are affected by operational uncertainty. This problem, known as the Time Window Assignment Vehicle…
Given a set of clients with demands, the Capacitated Vehicle Routing problem is to find a set of tours that collectively cover all client demand, such that the capacity of each vehicle is not exceeded and such that the sum of the tour…
In this paper we study local routing strategies on geometric graphs. Such strategies use geometric properties of the graph like the coordinates of the current and target nodes to route. Specifically, we study routing strategies in the…
We study joint optimization of service placement, request routing, and CPU sizing in a cooperative MEC system. The problem is considered from the perspective of the service provider (SP), which delivers heterogeneous MEC-enabled…
Within this paper, the problem of 3D structural inspection path planning for distributed infrastructure using aerial robots that are subject to time constraints is addressed. The proposed algorithm handles varying spatial properties of the…
We study the facility location mechanism design problem where $n$ agents report their locations in Euclidean space, and the output is a single facility location. The cost function of each agent is the distance from the returned facility,…
We consider a vehicle routing problem which seeks to minimize cost subject to time window and synchronization constraints. In this problem, the fleet of vehicles is categorized into regular and special vehicles. Some customers require both…
We study the problem of online facility location with delay. In this problem, a sequence of $n$ clients appear in the metric space, and they need to be eventually connected to some open facility. The clients do not have to be connected…