Abstract

In this paper, we consider a variant of a truckload open vehicle routing problem with time windows, which is suitable for modeling vehicle routing operations during a humanitarian crisis. We present two integer linear programming models to formulate the problem. The first one is an arc-based mixed integer linear programming model that can be solved using a general purpose solver. For the second formulation, we first devise a task adjacency graph, that we use to develop a path-based integer linear program. We then propose a column generation framework to solve large-scale instances. Finally, we perform numerical experiments to compare the performance of the two models. Our computational results show that the path-based formulation solved using our proposed column generation framework outperforms the arc-based mixed integer linear program in solution time, without sacrificing solution quality.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call