Study on multi-stage logistic chain network: a spanning tree-based genetic algorithm approach

[1]  Pierre Hansen,et al.  A Plant and Warehouse Location Problem , 1977 .

[2]  D. Tcha,et al.  A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints , 1984 .

[3]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[4]  Choong Y. Lee,et al.  A cross decomposition algorithm for a multiproduct-multitype facility location problem , 1993, Comput. Oper. Res..

[5]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (2nd, extended ed.) , 1994 .

[6]  Charles C. Palmer,et al.  An approach to a problem in network design using genetic algorithms , 1994, Networks.

[7]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[8]  Cb Bernhard Tilanus.  Introduction to information systems in logistics and transportation , 1997 .

[9]  M. Rönnqvist,et al.  Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem , 1997 .

[10]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[11]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[12]  Hasan Pirkul,et al.  A multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution , 1998, Comput. Oper. Res..

[13]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[14]  Américo Azevedo,et al.  Order planning for networked make-to-order enterprises—a case study , 2000, J. Oper. Res. Soc..

[15]  Chi-Chun Lo,et al.  A multiobjective hybrid genetic algorithm for the capacitated multipoint network design problem , 2000, IEEE Trans. Syst. Man Cybern. Part B.