Utility Driven Job Selection Problem on Road Networks

07/16/2022
by   Mayank Singhal, et al.
0

In this paper, we study the problem of Utility Driven Job Selection on Road Networks for which the inputs are: a road network with the vertices as the set of Point-Of-Interests (Henceforth mentioned as POI) and the edges are road segments joining the POIs, a set of jobs with their originating POI, starting time, duration, and the utility. A worker can earn the utility associated with the job if (s)he performs this. As the jobs are originating at different POIs, the worker has to move from one POI to the other one to take up the job. Some budget is available for this purpose. Any two jobs can be taken up by the worker only if the finishing time of the first job plus traveling time from the POI of the first job to the second one should be less than or equal to the starting time of the second job. We call this constraint as the temporal constraint. The goal of this problem is to choose a subset of the jobs to maximize the earned utility such that the budget and temporal constraints should not be violated. We present two solution approaches with detailed analysis. First one of them works based on finding the locally optimal job at the end of every job and we call this approach as the Best First Search Approach. The other approach is based on the Nearest Neighbor Search on road networks. We perform a set of experiments with realworld trajectory datasets to demonstrate the efficiency and effectiveness of the proposed solution approaches. We observe that the proposed approaches lead to more utility compared to baseline methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2019

Should we Embed? A Study on the Online Performance of Utilizing Embeddings for Real-Time Job Recommendations

In this work, we present the findings of an online study, where we explo...
research
07/17/2018

Discovering Job Preemptions in the Open Science Grid

The Open Science Grid(OSG) is a world-wide computing system which facili...
research
05/10/2021

A Social Distancing-Based Facility Location Approach for Combating COVID-19

In this paper, we introduce and study the problem of facility location a...
research
05/30/2020

Measuring and Visualizing Place-Based Space-Time Job Accessibility

Place-based accessibility measures, such as the gravity-based model, are...
research
07/16/2022

Envyfree Trip Planning in Group Trip Planning Query Problem

In recent times, Group Trip Planning Query (henceforth referred to as GT...
research
03/07/2022

Fabchain: Managing Audit-able 3D Print Job over Blockchain

Improvements in fabrication devices such as 3D printers are becoming pos...
research
09/19/2018

The Multi-Round Sequential Selection Problem

In the Sequential Selection Problem (SSP), immediate and irrevocable dec...

Please sign up or login with your details

Forgot password? Click here to reset