Two heuristic solution concepts for the vehicle selection problem in line haul transports

In this article we will develop a mathematical model for a cost-efficient selection of vehicles with varying capacities for line haul transports with leasing options. For this integer optimization problem, which is a variant of the generalized assignment problem known as NP-hard, we will compare two heuristic solution concepts and try to answer the question in which cases a user should choose an exact or approximate solution concept depending on different data instances of the problem.

► A mathematical model for vehicle selection for line haul in hub-and-spoke networks is developed.
► Two different heuristic solution concepts are proposed based on real life problem properties.
► Their efficiency for different generated problems is analyzed.
► Conditions are stated in which cases such heuristic solution concepts lead to good results.