Pith. sign in

REVIEW

An Overview of a Break Assignment Problem Considering Area Coverage

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2101.04527 v1 pith:YDFU4JEQ submitted 2021-01-08 math.OC

classification math.OC
keywords breakcoverageareabapcacconsideringfleetmodelproblem
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Prolonged focused work periods decrease efficiency with related decline of attention and performance. Therefore, emergency fleet break scheduling should consider both area coverage by idle vehicles (related to the fleet's target arrival time to incidents) and vehicle crews' service requirements for breaks to avoid fatigue. In this paper, we propose a break assignment problem considering area coverage (BAPCAC) addressing this issue. Moreover, we formulate a mathematical model for the BAPCAC problem. Based on available historical spatio-temporal incident data and service requirements, the BAPCAC model can be used not only to dimension the size of the fleet at the tactical level, but also to decide upon the strategies related with break scheduling. Moreover, the model could be used to compute (suboptimal) locations for idle vehicles in each time period and arrange vehicles' crews' work breaks considering given break and coverage constraints.

Discussion (0). Continue with ORCID to comment.

Pith tools