Effective Neighborhood Operators for Solving the Flexible Demand Assignment Problem

IEEE Transactions on Automation Science and Engineering

Volumn 5, Issue 2, 2008, Pages 289-297

  Wang, Fan ^a   Lim, Andrew ^b  

^a SUN YAT SEN UNIVERSITY   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Assignment; Bin packing; Manufacturing; Metaheuristic

Indexed keywords

COMPUTATIONAL METHODS; COSTS; EARNINGS; MANUFACTURE; PROBLEM SOLVING;

BIN PACKING; FLEXIBLE DEMAND ASSIGNMENT;

MATHEMATICAL OPERATORS;

EID: 41949112231     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2007.897615     Document Type: Article

References (15)

1. A. Balakrishnan and J. Geunes, "Production planning with flexible product specifications: An application to specialty steel manufacturing," Oper. Res., vol. 51, no. 1, pp. 94-112, 2003.
2. J. Barcelo and J. Cansanovas, "A heuristic Lagrangian algorithm for the capacitated plant location problem," Eur. J. Oper. Res., vol. 15, pp. 212-226, 1984.
3. H. P. Christos and S. Kenneth, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
4. M. R. Garey, E. G. Coffman, and D. S. Johnson, Approximation Algorithms for Bin-Packing - An Updated Survey. New York: SpringerVerlag, 1984, pp. 49-106.
5. M. R. Garey and D. S. Johnson, New York, Freeman, 1979.
6. A. M. Geoffrion, "Lagrangian relaxation for integer programming," Math. Pmgmmming Study, vol. 2, pp. 82-114, 1974.
7. W. Huang, "Optimization models for sourcing decisions in supply chain management," Ph.D. dissertation, 2004.
8. D. S. Johnson and C. C. McGeoch, Network flows and matching: First DIMACS implementation challenge.
9. J. G. Klincewicz and H. Luss, "A Lagrangian relaxation heuristic for capacitated facility location with single-source constraints," J. Oper. Res. Soc., vol. 37, no. 5, pp. 495-500, 1986.
10. R. Korf, "An improved algorithm for optimal bin packing," in Proc. Int. Joint Conf. Arti. Intell. (UCAI-03), Acapulco, Mexico, Aug. 2003, pp. 1252-1258.
11. R. Korf, "A new algorithm for optimal bin packing," in Proc. Nat. Conf. Artif. Intell., AAAI-02, Edmonton, AB, Canada, Jul. 2002, pp. 731-736.
12. J. B. Orlin, R. K. Ahuja, and D. Sharma, "Very large scale neighborhood search," Int. Trans. Oper. Res., vol. 7. pp. 301-317, 2000.
13. J. B. Orlin, R. K. Ahuja, O. Ergun, and A. Punnen, "A survey of very large scale neighborhood search techniques," Discrete Appl. Math., vol. 123, pp. 75-102, 2002.
14. D. Simchi-Levi, "New worst-case resutls for the bin-packing problem," Naval Res. Logist., vol. 41, pp. 579-585, 1994.
15. P. M. Thompson and H. N. Psaraftis, "Cyclic transfer algorithms for multi-vehicle routing and scheduling problems," Oper. Res., vol. 41, pp. 935-946, 1993.