Pre-selection Strategies for the Collaborative Vehicle Routing Problem with Time Windows.

In horizontal coalitions for auction-based exchange of transportation requests, (freight) carriers have to identify requests that are selected for offering to coalition partners. This paper contributes pre-selection strategies, where requests are selected based on their approximated potential to increase the carriers' profit. In a computational study, the strategies' ability to achieve savings is analyzed.