Abstract
In this chapter we show how CE can be employed to solve combinatorial optimization problems (COPs) from various fields. Our goal is to illustrate the flexibility and efficiency of the CE algorithm. We believe that the CE approach could open up a whole range of possible applications, for example in computational biology, graph theory, and scheduling Section 7.1 deals with an application of the CE method concerning the alignment of DNA sequences; this section is based partly on [98]. In Sections 7.2–7.4, adapted from [113], the CE method is used to solve the single machine total weighted tardiness problem (SMTWTP), the single machine common due date problem (SMDDP), and the capacitated vehicle routing problem (CVRP). Finally, in Section 7.5 we consider various CE approaches for solving the maximum clique and related graph problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science+Business Media New York
About this chapter
Cite this chapter
Rubinstein, R.Y., Kroese, D.P. (2004). Applications of CE to COPs. In: The Cross-Entropy Method. Information Science and Statistics. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4321-0_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4321-0_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-1940-3
Online ISBN: 978-1-4757-4321-0
eBook Packages: Springer Book Archive