Solution Algorithms for Generalized Logistics Network Model - An Equilibrium Approach

• Main Authors: Hsuan Wang, 王宣
• Other Authors: Suh-Wen CHIOU
• Format: Others
• Language: en_US
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/54564159076359074209

碩士 === 國立東華大學 === 全球運籌管理研究所 === 93 === A four-tier generalized logistics network is considered. Four kinds of agencies include the vendors, the plants, the retailers and the markets. The corresponding objectives are optimized with respect to the product price and flow. An equilibrium approach in terms of the optimization model and variational inequality is used to solve this problem. It is reasonable to assume the agencies have limited capacity, and the capacity constraint is considered in the model. In the logistics network, the second tier agency can sell directly to the markets by pass the third tier agency. Conventional algorithms solving the equilibrium problems are used. We propose a new solution algorithm called simplified restricted simplicial decomposition (SRSD) to solve the four-tier generalized logistics network and the computations are made when compare with conventional methods. This method is constructed based on the main idea of restricted simplicial decomposition (RSD) with fixed value of weighting factors that used in RSD method. Three network examples are used to test how to determine the size and the values of the weighting factors of extreme points of SRSD method by experimental trials. We find the size of extreme point of SRSD method is not large as recommended in literature. Furthermore, in our studies the weighting factors are suggested as the average value of the number of extreme points. Good computation results have been found which shows the computational efficiency and comparativeness of the proposed algorithm when apply to the logistics network.