Parallel and distributed local search in COMET

Computers and Operations Research

Volumn 36, Issue 8, 2009, Pages 2357-2375

  Michel, Laurent ^a   See, Andrew ^a   Van Hentenryck, Pascal ^b  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b BROWN UNIVERSITY   (United States)

Author keywords

Combinatorial optimization; Constraint programming; Distributed; Language; Local search; Parallel

Indexed keywords

ABSTRACTING; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINED OPTIMIZATION; CONSTRAINT THEORY; LEARNING ALGORITHMS; LINGUISTICS; OPTIMIZATION; PARALLEL ALGORITHMS; PROGRAMMING THEORY; STRUCTURED PROGRAMMING;

CONSTRAINT PROGRAMMING; DISTRIBUTED; LANGUAGE; LOCAL SEARCH; PARALLEL;

PARALLEL PROGRAMMING;

EID: 58549117284     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.08.014     Document Type: Article

References (36)

1. Moore G.E. Cramming more components onto integrated circuits. Electronics 38 8 (1965) 114-117
2. Luby M., Sinclair A., and Zuckerman D. Optimal speedup of Las Vegas algorithms. Information Processing Letters 47 4 (1993) 173-180
3. Gomes C., Selman B., Crato N., and Kautz H. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning 24 1/2 (2000) 67-100
4. Mauricio G., Resende C., and Werneck R.F. A hybrid multistart heuristic for the uncapacitated facility location problem. European Journal of Operational Research 174 1 (2006) 54-68
5. Harm G, Van Hentenryck P. A multistart variable neighborhood search for uncapacitated warehouse location. In: Proceedings of the 6th metaheuristics international conference (MIC-2005), Vienna, Austria, August 2005.
6. Laguna M. Scatter search. Handbook of applied optimization (2002), Oxford University Press, Oxford 183-193
7. Perron L. Search procedures and parallelism in constraint programming. In: Proceedings of the fifth international conference on the principles and practice of constraint programming, Alexandria, Virginia, October 1999. p. 346-60.
8. Van Hentenryck P, Michel L. Control abstractions for local search. In: Proceedings of the ninth international conference on principles and practice of constraint programming, Cork, Ireland, 2003. p. 65-80.
9. Michel L, Van Hentenryck P. A constraint-based architecture for local search. In: Conference on object-oriented programming systems, languages, and applications, Seattle, November 2002. p. 101-10.
10. Van Hentenryck P., and Michel L. Constraint-based local search (2005), MIT Press, Cambridge, MA
11. Nowicki E., and Smutnicki C. A fast taboo search algorithm for the job shop problem. Management Science 42 6 (1996) 797-813
12. Gnu lightning 〈http://www.gnu.org/software/lightning〉.
13. Minton S., Johnston M., Philips A., and Laird P. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58 1-3 (1992) 161-205
14. Hentenryck P, Michel L. Synthesis of constraint-based local search algorithms from high-level models. In: Proceedings of the AAAI-2007, August 2007.
15. Xu Y, Ralphs T, Ladányi L, Saltzman M. Alps: a framework for implementing parallel tree search algorithms. The next wave in computing, optimization, and decision technologies, 2005. p. 319-34.
16. Michel L., and Van Hentenryck P. A simple tabu search for warehouse location. European Journal of Operational Research 157 3 (2004) 576-591
17. Dell'Amico M., and Trubian M. Applying tabu search to the job-shop scheduling problem. Annals of Operations Research 41 (1993) 231-252
18. Ilog Solver 6.2. Documentation. Ilog SA, Gentilly, France, 2006.
19. Van Hentenryck P, Michel L, Liu L. Constraint-based combinators for local search. In: Proceedings of the tenth international conference on principles and practice of constraint programming, Toronto, Canada, October 2004. p. 47-61.
20. Dorne R., and Hao J.K. Tabu search for graph coloring, T-colorings and set T-colorings, chapter meta-heuristics: advances and trends in local search paradigms for optimization (1998), Kluwer Academic Publishers, Dordrecht p. 77-92
21. Dotu I., and Van Hentenryck P. A simple hybrid evolutionary algorithm for finding Golomb rulers. Evolutionary computation, 2005 (2005), IEEE, New York 2018-2023
22. Walser J. Integer optimization by local search (1998), Springer, Berlin
23. Schulte C. Parallel search made simple. In: Proceedings of TRICS, a post-conference workshop of CP 2000, Singapore, September 2000.
24. Dagum L., and Menon R. OpenMP: an industry-standard API for shared-memory programming. IEEE Computational Science and Engineering 5 (1998) 46-55
25. Chandra R., Dagum L., Kohr D., Maydan D., McDonald J., and Menon R. Parallel programming in OpenMP (2000), Morgan Kaufmann, Los Altos, CA ISBN:1558606718
26. Van Hentenryck P, Michel L. Nondeterministic control for hybrid search. In: Proceedings of the second international conference on the integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CP-AI-OR'05), Prague, May 2005.
27. Chamberlain B, Choi S-E, Deitz S, Snyder L. The high-level parallel language ZPL improves productivity and performance. In: Proceedings of the IEEE international workshop on productivity and performance in high-end computing, 2004.
28. Allen, Chase, Luchangco, Maessen, Ryu, Steele, Tobin-Hochstadt. The fortress language specification, V0.866. Sun microsystems, February 2006.
29. Deitz S. Renewed hope for data parallelism: unintegrated support for task parallelism in zpl. Technical Report UW-CSE-2003-12-04; December 2003.
30. Blumofe R., Joerg C., Kuszmaul B., Leiserson C., Randall K., and Zhou Y. Cilk: an efficient multithreaded runtime system. Journal of Parallel and Distributed Computing 37 1 (1996) 55-69
31. Supercomputing Technologies Group MIT Laboratory for Computer Science, Cambridge, MA. Cilk Reference Manual v5.4.2.3 (rev 2867), April 2006.
32. Ralphs T., Ládanyi L., and Saltzman M. A library hierarchy for implementing scalable parallel search algorithms. Journal of Supercomputing 28 2 (2004) 215-234
33. Michel L, See A, Hentenryck P. Parallelizing constraint programs transparently. In: Principles and practice of constraint programming, September 2007.
34. Goodale T, Allen G, Lanfermann G, Masso J, Radke T, Seidel E, et al. The cactus framework and toolkit: design and applications. In: High performance computing for computational science-VECPAR 2002: 5th international conference, Porto, Portugal, June 2002. p. 15-36.
35. Philippsen M., and Zenger M. JavaParty-transparent remote objects in Java. Concurrency: Practice & Experience 6 (1995) 109-133
36. Yokoo M., Durfee E.H., Ishida T., and Kuwabara K. The distributed constraint satisfaction problem: formalization and algorithms. Knowledge and Data Engineering 10 5 (1998) 673-685