Improved Model for Strategic-Loading-Station Location Problem under Incomplete Information
In order to realize scientific planning the layout of strategic loading station, the strategic-loading –station location problem was proposed, which is related to determine the location of each stay with station and the transportation plan on the precise of satisfying the general location constraints and problem related special constraints. Based on theory of capacitated facility location with multiple souring in two stage supply chain, one mixed integer linear programming model was established which took whole logistic cost embedding transportation and location costs as objective. When confronted with small and medium size problem, this model could be exactly solved by optimization software using branch and bound algorithm, and when the problem size was big, this model could be heuristically solved by genetic algorithm which used 0-1 and priority-based combined encoding method to represent solution, cost-based and random-generated combined method to generate initial solution, solution repaired strategy and penalty method and special fitness function to deal illegal individual, and greedy based method to heuristically solve transshipment problem. At last, according to computational tests on randomly generated data demonstrated the practical feasibility of this method.
Q. L. Ren et al., "Improved Model for Strategic-Loading-Station Location Problem under Incomplete Information", Key Engineering Materials, Vols. 474-476, pp. 151-157, 2011