A hierarchical solution approach for a multicommodity distribution problem under a special cost structure
Computers and Operations Research
2612 - 2624
Item Usage Stats
Motivated by the spare parts distribution system of a major automotive manufacturer in Turkey, we consider a multicommodity distribution problem from a central depot to a number of geographically dispersed demand points. The distribution of the items is carried out by a set of identical vehicles. The demand of each demand point can be satisfied by several vehicles and a single vehicle is allowed to serve multiple demand points. For a given vehicle, the cost structure is dictated by the farthest demand point from the depot among all demand points served by that vehicle. The objective is to satisfy the demand of each demand point with the minimum total distribution cost. We present a novel integer linear programming formulation of the problem as a variant of the network design problem. The resulting optimization problem becomes computationally infeasible for real-life problems due to the large number of integer variables. In an attempt to circumvent this disadvantage of using the direct formulation especially for larger problems, we propose a Hierarchical Approach that is aimed at solving the problem in two stages using partial demand aggregation followed by a disaggregation scheme. We study the properties of the solution returned by the Hierarchical Approach. We perform computational studies on a data set adapted from a major automotive manufacturer in Turkey. Our results reveal that the Hierarchical Approach significantly outperforms the direct formulation approach in terms of both the running time and the quality of the resulting solution especially on large instances.
Network design problems