Hybridizing the cross-entropy method: An application to the max-cut problem

Computers and Operations Research

Volumn 36, Issue 2, 2009, Pages 487-498

  Laguna, Manuel ^a   Duarte, Abraham ^b   Martí, Rafael ^c  

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSIDAD REY JUAN CARLOS   (Spain)

^c UNIVERSITY OF VALENCIA   (Spain)

Author keywords

Combinatorial optimization; Cross entropy; Local search; Max cut problem; Metaheuristics

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; ENTROPY; OPTIMIZATION;

COMBINATORIAL OP-TIMIZATION PROBLEM; CROSS-ENTROPY; CROSS-ENTROPY METHODS; FUTURE APPLICATIONS; LOCAL SEARCH; MAX-CUT PROBLEM; METAHEURISTICS;

HEURISTIC METHODS;

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

References (14)

1. Rubinstein R.Y. Optimization of computer simulation models with rare events. European Journal of Operational Research 99 (1997) 89-112
2. Rubinstein R.Y. The simulated entropy method for combinatorial and continuous optimization. Methodology and Computing in Applied Probability 2 (1999) 127-190
3. Rubinstein R.Y. Combinatorial optimization, cross-entropy, ants and rare events. In: Uryasev S., and Pardalos P.M. (Eds). Stochastic optimization: algorithms and applications (2001), Kluwer Academic Publishers, Dordrecht 304-358
4. de Boer P-T, Kroese DP, Mannor S, Rubinstein RY. The cross-entropy method for combinatorial optimization, rare event simulation and neural computation. Annals of Operations Research 2005; 134.
5. Chepuri K., and Homem-de-Mello T. Solving the vehicle routing problem with stochastic demands using the cross-entropy method. Annals of Operations Research 134 (2005) 153-181
6. Alon G., Kroese D.P., Raviv T., and Rubinstein R.Y. Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment. Annals of Operations Research 134 (2005) 137-151
7. deBoer P.-T., Kroese D.P., Mannor S., and Rubinstein R.Y. A tutorial of the cross entropy method. Annals of Operations Research 134 (2005) 19-67
8. Rubinstein R.Y. Cross-entropy and rare events for maximal cut and partition problems. ACM Transaction on Modeling and Computer Simulation 12 1 (2002) 27-53
9. Festa P., Pardalos P.M., Resende M.G.C., and Ribeiro C.C. Randomized heuristics for the max-cut problem. Optimization Methods & Software 7 (2002) 1033-1058
10. Goemans M.X., and Williams D.P. Improved approximation algorithms for the max-cut and satisfiability problems using semidefinite programming. Journal of the ACM 42 (1995) 1115-1145
11. Burer S., Monteiro R.D.C., and Zang Y. Rank-two relaxation heuristics for max-cut and other binary quadratic programs. SIAM Journal on Optimization 12 (2001) 503-521
12. Helmberg C., and Rendl F. A spectral bundle method for semidefinite programming. SIAM Journal on Optimization 10 (2000) 673-696
13. Adenso-Díaz B., and Laguna M. Fine-tuning of algorithms using partial experimental designs and local search. Operations Research 54 1 (2006) 99-114
14. Van Keken P. Linux PC single CPU benchmark comparison; 2005 〈http://www.geo.lsa.umich.edu/∼keken/benchmarks/single_cpu.html〉.