Improved Model for Strategic-Loading-Station Location Problem under Incomplete Information

Abstract:

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.

• Periodical: Key Engineering Materials (Volumes 474-476)
• Pages: 151-157
• DOI: https://doi.org/10.4028/www.scientific.net/KEM.474-476.151
• Online since: April 2011
• Authors: Qi Liang Ren, Ming Ming Li, Qing Li, Jin Shan Chen, Bo Li
• Keywords: Bound Algorithm, Branch Algorithm, Location, Model, Strategic Loading Station

References

[1] Marin A., Pelegrin B. A Branch-And-Bound Algorithm for the Transportation Problem with Location of P-Transshipment Points [J], Computers & Operations Research, 1997, 24(7): 659-678.

DOI: 10.1016/s0305-0548(96)00078-0

[2] Klose A. An LP-Based Heuristic for Two-Stage Capacitated Facility Location Problems[J], Journal of the Operational Research Society, 1999, 50(2): 157-166.

DOI: 10.1057/palgrave.jors.2600675

[3] Klose A. A Lagrangean Relax-and-Cut Approach for the Two-Stage Capacitated Facility Location[J], European Journal of Operational Research, 2000, 126(2): 408-421.

DOI: 10.1016/s0377-2217(99)00300-8

[4] Altiparmak F., Gen M., Lin L. et, al. A Genetic Algorithm Approach for Multi-Objective Optimization of Supply Chain Networks[J]. Computers&IndustrialEngineering, 2006, 51(1): 196-215.

DOI: 10.1016/j.cie.2006.07.011