Optimizing logistics routings in a network perspective of supply and demand nodes

Abstract

In this study, a logistics network is modeled as a network with heterogeneous nodes as $$ G\left( {S,D,E} \right) $$ , where S is a set of nodes with supply features, D is a set of nodes with demand features, and E is a set of connections indicating the linkages between the nodes. Thus, the model of logistics routings is considered to have distinct operating features, such that the supply and demand sources are both considered. In addition, multiple supply routes for a demand source are considered; that is, items can be delivered from multiple supply sources via different routes to a demand source. This ensures the efficiency of the logistics routings and enhances customer satisfaction. Flexible delivery paths between a pair of supply and demand nodes are considered. Here, logistics routes are designed and updated with their relevant service times for various scenarios of different capacities of the supply sources and volumes of the demand sources. Lastly, an industrial case study is presented to demonstrate the effectiveness of the proposed modeling approach.