The vehicle allocation problem: alternative formulation and branch-and-price method
The Vehicle Allocation Problem (VAP) consists of repositioning empty vehicles across a set of terminals over a given planning horizon so as to maximize the profits generated from serving demand for transportation of goods between pair of terminals. This problem has been classically modeled using an extended space-time network which captures the staging of the … Read more