Template design under demand uncertainty by integer linear local search

International Journal of Production Research

Volumn 44, Issue 22, 2006, Pages 4915-4928

  Prestwich, S D ^a   Tarim, S A ^a   Hnich, B ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b IZMIR UNIVERSITY OF ECONOMICS   (Turkey)

Author keywords

Demand uncertainty; Integer linear local search; Template design

Indexed keywords

INTEGER LINEAR LOCAL SEARCH; LOCAL SEARCH ALGORITHMS; TEMPLATE DESIGNS;

ALGORITHMS; COMBINATORIAL MATHEMATICS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; STRATEGIC PLANNING;

PRODUCTION ENGINEERING;

EID: 33749574552     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540600621060     Document Type: Article

References (21)

1. Abramson, D., Dang, H. and Krishnamoorthy, M., A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm. Ann. Oper. Res., 1996, 63, 129-150.
2. Abramson, D. and Randall, M., A simulated annealing code for general integer linear programs. Ann. Oper. Res., 1999, 86, 3-24.
3. Connolly, D., General purpose simulated annealing. J. oper. Res. Soc., 1992, 43, 495-505.
4. Hoos, H.H. and Stützle, T., Stochastic Local Search: Foundations and Applications, 2004 (Morgan Kaufmann: San Francisco, CA).
5. Lin, S. and Kernighan, B.W., An effective heuristic for the traveling salesman problem. Oper. Res., 1973, 21, 498-516.
6. Lokketangen, A. and Glover, F., Tabu search for zero-one mixed integer programming with advanced level strategies and learning. Int. J. Oper. quant. Mgmt, 1995, 1, 89-108.
7. McAllester, D.A., Selman, B. and Kautz, H.A., Evidence for invariants in local search, in Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Application of Artificial Intelligence Conference, 1997, pp. 321-326.
8. Mills, P. and Tsang, E.P.K., Guided local search for solving SAT and weighted MAX-SAT problems. J. Automat. Reason., 2000, 24, 205-223.
9. Neto, T. and Pedroso, J.P., GRASP for Linear Integer Programming. Metaheuristics: Computer Decision-Making, pp. 545-574, 2004 (Kluwer Academic: Dordrecht).
10. Ormond, A.J. and Williams, H.P., A survey of different integer programming formulations of the travelling salesman problem. Working Paper No. LSEOR 04.67, London School of Economics and Political Science, UK, 2004.
11. Pedroso, J.P., An evolutionary solver for linear integer programming. BSIS Technical Report 98-7, Riken Brain Science Institute, Wako-shi, Saitama, Japan, 1998.
12. Prestwich, S.D., Negative effects of modeling techniques on search performance. Ann. Oper. Res., 2003, 118, 137-150.
13. Prestwich, S.D., Incomplete dynamic backtracking for linear pseudo-Boolean problems. Ann. Oper. Res., 2004, 130, 57-73.
14. Prestwich, S.D., Random walk with continuously smoothed variable weights. In Eighth International Conference on Theory and Applications of Satisfiability Testing, Lecture Notes in Computer Science, Vol. 3569, pp. 203-215, 2005 (Springer: Berlin).
15. Prestwich, S.D. and Roli, A., Symmetry breaking and local search spaces. In Second International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science, Vol. 3524, pp. 273-287, 2005 (Springer: Berlin).
16. Proll, L. and Smith, B.M., Integer linear programming and constraint programming approaches to a template design problem. INFORMS J. Comput., 1998, 10, 265-275.
17. Selman, B., Kautz, H.A. and Cohen, B., Noise strategies for improving local search, in Proceedings of the Twelfth National Conference on Artificial Intelligence, 1994, pp. 337-343.
18. Tarim, S.A. and Miguel, I., A hybrid Benders' decomposition method for solving stochastic constraint programs with linear recourse, in Joint Annual Workshop of ERCIM/ CoLogNet, 2005.
19. Walser, J.P., Solving linear pseudo-Boolean constraint problems with local search, in Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997, pp. 269-274.
20. Walser, J.P., Iyer, R. and Venkatasubramanyan, N., An integer local search method with application to capacitated production planning, in Fifteenth National Conference on Artificial Intelligence, 1998, pp. 373-379.
21. Wu, Z. and Wah, B.W., An efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems, in Proceedings of the Seventeenth National Conference on Artificial Intelligence, 2000, pp. 310-315.