Reliable multi-product multi-vehicle multi-type link logistics network design: A hybrid heuristic algorithm

This paper considers the reliable multi-product multi-vehicle multi-type link logistics network design problem (rmlndp) with system disruptions, which is concerned with facilities locating, transshipment links constructing, and also allocating them to the customers in order to satisfy their demand with minimum expected total cost (including locating costs, link constructing costs, and also expected transshipment costs in normal and disruption conditions). the motivating application of this class of problem is in multi-product, multi-vehicle, and multi-type link logistics network design regarding to system disruptions simultaneously. in fact, the decision makers in this area are not only concerned with the facility locating costs, link constructing costs, and logistical costs of the system but also by focusing on the several system disruption states in order to be able to provide a reliable sustainable multi configuration logistic network system. all facility location plans, link construction plans and also link transshipment plans of demands in the problem must be efficiently determined while considering the several system disruptions. the problem is modeled as a mixed integer programming (mip) model. also, a hybrid heuristic, based on linear programming (lp) relaxation approach, is proposed. computational experiments illustrate that the provided algorithm will be able to substantially outperform the proposed integer programming model in terms of both finding and verifying the efficient optimal (or near optimal) solution at a reasonable processing time.