  We propose a new model for fair division and vehicle routing, where drivers
have monotone profit preferences, and their vehicles have feasibility
constraints, for customer requests. For this model, we design two new axiomatic
notions for fairness for drivers: FEQ1 and FEF1. FEQ1 encodes driver pairwise
bounded equitability. FEF1 encodes driver pairwise bounded envy freeness. We
compare FEQ1 and FEF1 with popular fair division notions such as EQ1 and EF1.
We also give algorithms for guaranteeing FEQ1 and FEF1, respectively.
