Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
474820 | Computers & Operations Research | 2009 | 12 Pages |
Abstract
Cross-entropy has been recently proposed as a heuristic method for solving combinatorial optimization problems. We briefly review this methodology and then suggest a hybrid version with the goal of improving its performance. In the context of the well-known max-cut problem, we compare an implementation of the original cross-entropy method with our proposed version. The suggested changes are not particular to the max-cut problem and could be considered for future applications to other combinatorial optimization problems.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Manuel Laguna, Abraham Duarte, Rafael Martí,