Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout

International Journal of Production Research

Volumn 47, Issue 18, 2009, Pages 5185-5202

  Lee, Mi Lim ^a   Kim, Jae Gon ^b   Kim, Yeong Dae ^c  

^a Georgia Institute of Technology   (United States)

^b SolarLight Ltd   (South Korea)

^c Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Flow path; Heuristics; Layout planning; Material flow network design; Mixed integer program

Indexed keywords

BLOCK LAYOUT; COMPUTATION TIME; COMPUTATIONAL EXPERIMENT; EFFICIENT DESIGNS; FLOW PATH; INPUT AND OUTPUTS; LAGRANGIAN RELAXATION; LAGRANGIAN RELAXATION TECHNIQUES; LAYOUT PLANNING; LINEAR PROGRAMMING RELAXATION; MATERIAL FLOW; MATERIAL FLOW NETWORK DESIGN; MATERIAL FLOW NETWORKS; MIXED INTEGER PROGRAMMING; MIXED-INTEGER PROGRAMS; NON-SMOOTH; PENALTY COST; PROBLEM INSTANCES; TEST PROBLEM; TRANSPORTATION COST;

COMPUTATIONAL EFFICIENCY; DYNAMIC PROGRAMMING; HEURISTIC ALGORITHMS; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; LINEARIZATION; MATERIALS;

INTEGER PROGRAMMING;

EID: 70449686077     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540802050852     Document Type: Article

References (35)

1. Armour, G.C. and Buffa, E.S., 1963. A heuristic algorithm and simulation approach to relative location of facilities. Management Science, 9, 294-309.
2. Balakrishnan, A., Magnanti, T.L., and Mirchandani, P., 1997. Network design. New York: John Wiley & Sons.
3. Chittratanawat, S. and Noble, J.S., 1997. An integrated approach for facility layout, P/D location and material handling system design. International Journal of Production Research, 37, 683-706.
4. Clossey, J., Laporte, G., and Soriano, P., 2001. Solving arc routing problems with turn penalties. Journal of Operational Research Society, 52, 433-439.
5. Colin, R.R., 1993. Modern heuristic techniques for combinatorial problems. New York: John Wiley and Sons.
6. Choi, S. and Noble, J.S., 2000. An integrated material flow system approach for determining the economic production quantity (EPQ). International Journal of Production Research, 38, 3485-3511.
7. Crainic, T.G. and Gendreau, M., 2000. A simplex-based tabu search method for capacitated network design. INFORMS Journal on Computing, 12, 223-236.
8. Crainic, T.G., Frangioni, A., and Gendron, B., 2001. Bundle-based relaxation methods for multicommodiry capacitated network design. Discrete Applied Mathematics, 112, 311-334.
9. Fisher, M.L., 1981. The Lagrangean relaxation method for solving integer programming problems. Management Science, 27, 1-18.
10. Fisher, M.L., 1985. An applications oriented guide to Lagrangean relaxation. Interfaces, 15, 10-21.
11. Gendron, B. and Crainic, T.G., 1994. Relaxations for Multicommodity capacitated network design problems. Research Report CRT-965, Centre de Recherche sur les Transports, Universite de Montreal, Canada.
12. Gendron, B., Crainic, T.G., and Frangioni, A., 1999. Multicommodity capacitated network design. In: B. Sanso and P. Soriano, eds. Telecommunications network planning. Norwell: Kluwer Academic Publishers, 1-19.
13. Geoffrion, A.M., 1974. Lagrangean relaxation for integer programming. Mathematical Programming Study, 2, 82-114.
14. Ghamlouche, I., Crainic, T.G., and Gendreau, M., 2003. Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Operations Research, 51, 655-667.
15. Ghamlouche, I., Crainic, T.G., and Gendreau, M., 2004. Path relinking. Cycle-based neighbourhoods and capacitated multicommodity network design. Annals of Operations Research, 131, 109-133.
16. Goetschalckx, M. and Palliyil, G.A., 1994. A comprehensive model for the concurrent determination of aisles and load stations for aisle-based material handling systems. In: Proceedings of the 3rd material handling research colloquium, Grand Rapids, MI, USA, 161-188.
17. Goetz, W.G. and Egbelu, P.J., 1990. Guide path design and location of load pick-up/drop-off points for an automated guide vehicle system. International Journal of Production Research, 28, 927-941.
18. Held, M., Wolfe, P., and Crowder, H.P., 1974. Validation of subgradient optimisation. Mathematical Programming, 6, 62-88.
19. Holmberg, K. and Yuan, D., 2000. A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Operations Research, 48, 461-481.
20. Kim, J.-G. and Goetschalckx, M., 2005. A mixed integer programming model for modifying a block layout to facilitate smooth material flows. Lecture Notes in Computer Science, 3483, 322-332.
21. Kim, J.-G. and Kim, Y.-D., 1998. A space partitioning method for facility layout problems with shape constraints. IIE Transactions, 30, 947-957.
22. Kim, J.-G. and Kim, Y.-D., 1999. A branch and bound algorithm for locating I/O points of departments on the block layout. Journal of the Operational Research Society, 50, 517-525.
23. Kiaran, A.S. and Tansel, B.C., 1989. Optimal pickup point location in material handling networks. International Journal of Production Research, 27, 1475-1486.
24. Lee, J.H., Chung, C.-Y., Lee, B.H. and Choi, M.H., 1998. Turn penalty problem model for minimum time AGV routing. In: Proceedings of the IECON'97 23rd international conference on industrial electronics, control and instrumentation, 3, New Orleans, LA, USA 1323-1326.
25. Magnanti, T.L. and Wong, R.T., 1986. Network design and transportation planning: models and algorithms. Transportation Science, 18, 1-55.
26. Norman, B.A., Arapoglu, R.A., and Smith, A.E., 2001. Integrated facilities design using a contour distance metric. IIE Transactions, 33, 337-344.
27. Peters, B.A. and Yang, T., 1997. Integrated facility layout and material handling system design in semiconductor fabrication facilities. IEEE Transactions on semiconductor manufacturing, 10, 360-369.
28. Rajagopalan, S., Heragu, S.S., and Taylor, G.D., 2004. A lagrangian relaxation approach to solving the integrated pick-up/drop-off point and AGV flowpath design problem. Applied Mathematical Modeling, 28, 735-750.
29. Seo, Y.H., 1994. Integrated manufacturing systems design: Integrated approach to process plan selection and AGV guidepath design. Journal of the Korean Institute of Industrial Engineers, 20, 151-166.
30. Sohn, K.I. and Kim, J.H., 1993. A study on the optimal flow path design of unidirectional AGV systems. Journal of the Korean Institute of Industrial Engineers, 19, 43-52.
31. Szczerba, R.J., Chen, D.Z. and Klenk, K.S., 1997. Minimum turn/shortest path problems: a framedsubspace approach. In: IEEE international conference on system, man, and cybernetics, 1, Orlando, FL, USA 398-403.
32. Tanchoco, J.M.A. and Sinreich, D., 1992. OSL-optimal single loop guide paths for AGVS. International Journal of Production Research, 30, 665-681.
33. Van Camp, D.J., Carter, M.W., and Vannelli, A., 1991. A nonlinear optimisation approach for solving facility layout problems. European Journal of Operational Research, 57, 174-189.
34. Welgama, P.S. and Gibson, P.R., 1996. An integrated methodology for automating the determination of layout and materials handling system. International Journal of Production Research, 34, 2247-2264.
35. Wu, Y. and Appleton, E., 2002. Integrated design of the block layout and aisle structure by simulated annealing. International Journal of Production Research, 40, 2353-2366.