Capacitated Location-Allocation Hub Covering Problem in Manufacturing-Customer Interaction

Abstract

This paper presents a location-allocation hub covering considering capacity constraints for multiple hubs and allocates non-hub nodes including the manufacturer and the customer. The model is an integer linear programming minimizing the transfer costs and optimizes the allocation requests from the manufacturer to the customer passing through one or two hubs. It also simultaneously minimize the cost allocation requests and optimize the use of any existing network hub and the use of any existing network hub due to restrictions on the transfer or collect applications to hub. The model optimization is fulfilled using Lingo 9.0 software, and a discussion is comprehensibly illustrating the aspects of the proposed model.

Single hub location-allocation problem under robustness clustering concept

“…This field assumes different ways of capacities introduction in the model: capacities on flow into hub or total flow [10], the minimum flow value is needed to allow link between nonhub node and hub [11]. The hub locations problem applications in postal delivery services, emergency services and logistic systems [12][13][14]. The complex cost function (open/close hub costs, different costs for each link between nodes, costs limitation for the flow between hubs) and multiple hub allocations are presented in [15].…”