Research Highlights • We introduce the Profitable Pre-assigned Pickup and Delivery Problem with compatibility. • We propose a mixed-integer programming formulation for the problem. • We develop a matheuristic to solve larger and more complex instances. • We analyze operational trade-offs using controlled experiments.
Darvish et al. (Wed,) studied this question.