Genetic subgradient method for solving location-allocation problems

Applied Soft Computing Journal

Volumn 7, Issue 1, 2007, Pages 373-386

  Doong, Shing Hwang ^a   Lai, Chih Chin ^b   Wu, Chih Hung ^c  

^a SHU TE UNIVERSITY   (Taiwan)

^b NATIONAL UNIVERSITY OF TAINAN   (Taiwan)

^c NATIONAL UNIVERSITY OF KAOHSIUNG   (Taiwan)

Author keywords

Allocation; Genetic algorithm; Location; Subgradient

Indexed keywords

OPERATIONS RESEARCH; PROBLEM SOLVING; RESOURCE ALLOCATION;

LOCATION-ALLOCATION PROBLEMS; SUBGRADIENT; SUBGRADIENTS;

GENETIC ALGORITHMS;

EID: 33750961987     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2005.06.008     Document Type: Article

References (27)

1. Baldacci R., Hadjiconstantinou E., Maniezzo V., and Mingozzi A. A new method for solving capacitated location problems based on a set partitioning approach. Comput. Oper. Res. 29 (2002) 365-386
2. p norm location-allocation problem. Math. Programming 66 (1994) 283-312
3. Bradley S.P., Hax A.C., and Magnanti T.L. Applied Mathematical Programming (1977), Addison-Wesley Publishing Company
4. J. Brimberg, P. Hansen, N. Mladenović, É.D. Taillard, Improvements and Comparison of Heuristics for Solving the Multisource Weber Problem, Technical Report IDSIA-33-97, IDSIA, Lugano, 1997.
5. Brimberg J., and Mladenović N. Solving the continuous location-allocation problem with Tabu search. Stud. Location Anal. 8 (1996) 23-32
6. Carter M.W., and Price C.C. Operations Research: A Practical Introduction (2001), CRC Press, Boca Raton
7. Cooper L. Heuristic methods for location-allocation problems. SIAM Rev. 6 (1964) 1-18
8. Fisher M.L. The Lagrangian relaxation method for solving integer programming problem. Manag. Sci. 27 (1981) 1-18
9. Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine Learning (1989), Addison-Wesley, Reading
10. Gong D., Gen M., Yamazaki G., and Xu W. Planar location-allocation with obstacles problem. Presented at the Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics. Beijing, China (1996) 2671-2676
11. Gong D., Yamazaki G., and Gen M. Evolutionary program for optimal design of material distribution system. Presented at the Proceedings of IEEE International Conference on Evolutionary Computation. Nayoya University, Japan (1996) 139-143
12. Hakimi S.L., and Kuo C.C. On a general network location-production-allocation problem. Eur. J. Oper. Res. 55 (1991) 31-45
13. Hansen P., Mladenović N., and Taillard E. Heuristic solution of the multisource Weber problem as a p-median problem. Oper. Res. Lett. 22 (1998) 55-62
14. Holland J.H. Adaptation in Natural and Artificial systems (1975), The University of Michigan Press, Ann Arbor
15. Holmberg K., Ronnqvist M., and Yuan D. An exact algorithm for the capacitated facility location problems with single sourcing. Eur. J. Oper. Res. 113 (1999) 544-559
16. Klose A. A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem. Eur. J. Oper. Res. 126 (2000) 408-421
17. Lai C.-C. A novel A novel clustering approach using hierarchical genetic algorithms. Intell. Automation Soft Comput. 11 (2005) 143-153
18. Lai C.-C., and Doong S.-H. An optimal material distribution system based on nested genetic algorithm. IEICE Trans. Inform. Syst. E87-D (2003) 780-784
19. Lorena L.A.N., and Senne E.L.F. A column generation approach to capacitated p-median problems. Comput. Oper. Res. 31 (2004) 863-876
20. Love R.F., Morris J.G., and Wesolowsky G.O. Facilities Locations: Models and Methods (1988), North-Holland, New York
21. Lozano S., Guerrero F., Onieva L., and Larrañeta J. Kohonen maps for solving a class of location-allocation problems. Eur. J. Oper. Res. 108 (1998) 106-117
22. Michalewicz M. Genetic Algorithms + Data Structure = Evolution Program (1996), Springer-Verlag, Berlin
23. Oduguwa V., Tiwari A., and Roy R. Evolutionary computing in manufacturing industry: an overview of recent applications. Appl. Soft Comput. 5 (2005) 281-299
24. Pierrot H.J., and Hinterding R. Using multi-chromosomes to solve a simple mixed integer problem. Presented at the 10th Australian Joint Conference on Artificial Intelligence. Lecture Notes in Computer Science, 1342, Perth, Australia (1997) 137-146
25. Polyak B.T. Minimization of un-smooth functions. USSR Comput. Math. Math. Phys. 9 (1969) 14-29
26. Rahman S.-U., and Smith D.K. Use of location-allocation models in health service development planning in developing nations. Eur. J. Oper. Res. 123 (2000) 437-452
27. Ronnqvist M., Tragantalerngsak S., and Holt J. A repeated matching heuristic for the single-source capacitated facility location problem. Eur. J. Oper. Res. 116 (1999) 51-68