Related papers: Maximizing Revenues for Online-Dial-a-Ride
We consider a distribution logistics scenario where a shipping operator, managing a limited amount of resources, receives a stream of collection requests, issued by a set of customers along a booking time-horizon, that are referred to a…
Online allocation problems with resource constraints are central problems in revenue management and online advertising. In these problems, requests arrive sequentially during a finite horizon and, for each request, a decision maker needs to…
The limited capacity of drones and future one- or two-seat modular vehicles requires multiple units to serve a single large customer (i.e., a customer whose demand exceeds a single vehicle's capacity) simultaneously, whereas small customers…
In several important routing contexts it is required to identify a set of routes, each of which optimizes a different criterion. For instance, in the context of vehicle routing, one route would minimize the total distance traveled, while…
Multi-vehicle routing has become increasingly important with the rapid development of autonomous vehicle technology. Dial-a-ride problem, a variant of vehicle routing problem (VRP), deals with the allocation of customer requests to…
Auctions are widely used in exchanges to match buy and sell requests. Once the buyers and sellers place their requests, the exchange determines how these requests are to be matched. The two most popular objectives used while determining the…
The interval scheduling problem is one variant of the scheduling problem. In this paper, we propose a novel variant of the interval scheduling problem, whose definition is as follows: given jobs are specified by their {\em release times},…
This paper discusses the graph covering problem in which a set of edges in an edge- and node-weighted graph is chosen to satisfy some covering constraints while minimizing the sum of the weights. In this problem, because of the large…
Vehicular cloud computing has emerged as a promising solution to fulfill users' demands on processing computation-intensive applications in modern driving environments. Such applications are commonly represented by graphs consisting of…
This study explores the potential of using ride-hailing vehicles (RVs) for integrated passenger and freight transport based on shared mobility. In this crowd-sourced mode, ride-hailing platforms can profit from parcel delivery services, and…
On-demand ridepooling systems offer flexible services pooling multiple passengers into one vehicle, complementing traditional bus services. We propose a transportation system combining the spatial aspects of a fixed sequence of bus stops…
We extend the Mobile Server Problem, introduced in SPAA'17, to a model where k identical mobile resources, here named servers, answer requests appearing at points in the Euclidean space. In order to reduce communication costs, the positions…
We consider TSP with time windows and service time. In this problem we receive a sequence of requests for a service at nodes in a metric space and a time window for each request. The goal of the online algorithm is to maximize the number of…
In the network activation problem, each edge in a graph is associated with an activation function, that decides whether the edge is activated from node-weights assigned to its end-nodes. The feasible solutions of the problem are the…
We consider a robust version of the revenue maximization problem, where a single seller wishes to sell $n$ items to a single unit-demand buyer. In this robust version, the seller knows the buyer's marginal value distribution for each item…
The revenue maximization problem of service provider is considered and different pricing schemes to solve the above problem are implemented. The service provider can choose an apt pricing scheme subjected to limited resources, if he knows…
Correctly estimating how demand respond to prices is fundamental for airlines willing to optimize their pricing policy. Under some conditions, these policies, while aiming at maximizing short term revenue, can present too little price…
In the Travelling Salesman Problem, every vertex of an edge-weighted graph has to be visited by an agent who traverses the edges of the graph. In this problem, it is usually assumed that the costs of each edge are given in advance, making…
With the rapid development of smart mobile devices, the car-hailing platforms (e.g., Uber or Lyft) have attracted much attention from both the academia and the industry. In this paper, we consider an important dynamic car-hailing problem,…
This paper analyzes the problem of assigning weights to edges incrementally in a dynamic complete bipartite graph consisting of producer and consumer nodes. The objective is to minimize the overall cost while satisfying certain constraints.…