Problem statement: URPSM Unified RPSM(URPSM) problem Given o a road network g o a set of workers w o a set of requests r which are dynamically arrived o a weight parameter a o plan route su for each worker w to minimize unified cost oUC(W,R)=a·∑ w D(Sw)+∑reR-pr ● Constraints o each route is feasible o once requests are rejected, they can not be revokedProblem Statement： URPSM ⚫ Unified RPSM (URPSM) problem ⚫ Given: o a road network 𝐺 o a set of workers 𝑊 o a set of requests 𝑅 which are dynamically arrived o a weight parameter 𝛼 ⚫ Plan route S𝑤 for each worker 𝑤 to minimize unified cost o 𝑈𝐶 𝑊,𝑅 = 𝛼 ∙ σ𝑤𝜖𝑊 𝐷(𝑆𝑤) + σ𝑟𝜖𝑅− 𝑝𝑟 ⚫ Constraints: o each route is feasible o once requests are rejected, they can not be revoked 14