The capacitated plant location problem with customers and suppliers matching

Transportation Research Part E: Logistics and Transportation Review

Volumn 46, Issue 3, 2010, Pages 469-480

  Zhu, Zhanguo ^a,b   Chu, Feng ^c   Sun, Linyan ^a,d  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

^c UNIVERSITY OF EVRY   (France)

^d XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Integer linear programming; Lagrangian relaxation; Matching; Plant location

Indexed keywords

HEURISTICS; INDUSTRIAL LOCATION; LAGRANGIAN ANALYSIS; LINEAR PROGRAMING; LOCATION-ALLOCATION MODEL; OPTIMIZATION;

EID: 74449084770     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2009.09.002     Document Type: Article

References (33)

1. Aksen D., and Altinkemer K. A location-routing problem for the conversion to the click-and-mortar retailing: the static case. European Journal of Operational Research 186 (2008) 554-575
2. Amiri A. Designing a distribution network in a supply chain system: formulation and efficient solution procedure. European Journal of Operational Research 171 (2006) 567-576
3. Balinski M.L. Integer programming: methods, uses, computation. Management Science 12 (1965) 253-313
4. Caballero R., González M., Guerrero F.M., Molina J., and Paralera C. Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia. European Journal of Operational Research 177 (2007) 1751-1763
5. Cornuejols G., Sridharan R., and Thizy J.M. A comparison of heuristics and relaxations for the capacitated plant location problem. European Journal of Operational Research 50 (1991) 280-297
6. Cortinhal M.J., and Captivo M.E. Upper and lower bounds for the single source capacitated location problem. European Journal of Operational Research 151 (2003) 333-351
7. Eilon S., Watson-Gandy C.D.T., and Christofides N. Distribution Management Mathematical, Modeling and Practical Analysis (1971), Griffin, London
8. Fisher M.L. The Lagrangian relaxation method for solving integer programming problem. Management Science 27 (1981) 1-18
9. Gao L.L., and Robinson E.P. A dual-based optimization procedure for the two-echelon uncapacitated facility location problem. Naval Research Logistics 39 (1992) 191-212
10. Gendreau M., Laporte G., and Hertz A. An approximation algorithm for the traveling salesman problem with backhauls. Operations Research 45 (1997) 639-641
11. Gourdin E., Labbe M., and Lapporte G. The uncapacitated facility location problem with client matching. Operations Research 48 (2000) 671-685
12. Hakimi S. Optimum location of switching centers and the absolute centers and medians of a graph. Operations Research 12 (1964) 450-459
13. Hinojosa Y., Puerto J., and Fernández F.R. A multiperiod two-echelon multicommodity capacitated plant location problem. European Journal of Operational Research 123 (2000) 271-291
14. Holmberg K., Rönnqvist M., and Yuan D. An exact algorithm for the capacitated facility location problems with single sourcing. European Journal of Operational Research 113 (1999) 544-599
15. Imai A., Nishimura E., and Current J. A Lagrangian relaxation-based heuristic for the vehicle routing with full container load. European Journal of Operational Research 176 (2007) 17-105
16. Jacobsen S.K. Heuristics for the capacitated plant location model. European Journal of Operational Research 12 (1983) 253-261
17. Klose A., and Drexl A. Facility location models for distribution system design. European Journal of Operational Research 162 (2005) 4-29
18. Laporte G. A survey of algorithms for location-routing problems. Investigación Operativa 1 (1989) 93-123
19. Li J., Chu F., and Prins C. Lower and upper bounds for acapacitated plant location problem with multi commodity flow. Computers and Operations Research 36 (2009) 3019-3030
20. Marín A. Lower bounds for the two-stage uncapacitated facility location problem. European Journal of Operational Research 179 (2007) 1126-1142
21. Martello S., and Toth P. Knapsack Problems: Algorithm and Computer Implementations (1990), John Wiley& Son Ltd., New York
22. Melo M.T., Nickel S., and Saldanha-da-Gama F. Facility location and supply chain management - a review. European Journal of Operational Research 196 (2009) 401-412
23. Min H., Jayaraman V., and Srivastava R. Combined location-routing problems: a research directions synthesis and future research direction. European Journal of Operational Research 108 (1998) 1-15
24. Nagy G., and Salhi S. Location-routing: issues, models and methods. European Journal of Operational Research 177 (2007) 649-672
25. Nozick L.K. The fixed charge facility location problem with coverage restrictions. Transportation Research Part E 37 (2001) 281-296
26. Osman I.H., and Wassan N.A. A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls. Journal of Scheduling 5 (2002) 263-285
27. Owen S.H., and Daskin M.S. Strategic facility location: a review. European Journal of Operational Research 111 (1998) 423-447
28. Pisinger D. A minimal algorithm for the 0-1 knapsack problem. Operations Research 45 (1997) 758-767
29. Ro H., and Tcha D. A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints. European Journal of Operational Research 18 (1984) 349-358
30. Toregas C., Swain R., ReVelle C., and Bergman L. The location of emergency service facilities. Operations Research 19 (1971) 1363-1373
31. Tragantalerngsak S., Holt J., and Rönnqvist M. Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem. European Journal of Operational Research 102 (1997) 611-625
32. Webb M.H.J. Cost functions in the location of depots for multiple-delivery journeys. Operational Research Quarterly 19 (1968) 311C320
33. Yang, Z., Chen, H., Chu, F., 2007. Facility location problem with minimum capacity constraints. In: International Conference on Industrial Engineering and Systems Management, IESM.