IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v44y2022i5d10.1007_s10878-022-00907-5.html
   My bibliography  Save this article

Using the method of conditional expectations to supply an improved starting point for CCLS

Author

Listed:
  • Daniel Berend

    (Ben-Gurion University)

  • Shahar Golan

    (Jerusalem College of Technology)

  • Yochai Twitto

    (Shamoon College of Engineering)

Abstract

This paper proposes to combine the method of conditional expectations (MOCE, also known as Johnson’s Algorithm) with the state-of-the-art heuristic configuration checking local search (CCLS), to solve maximum satisfiability (Max Sat) instances. First, MOCE is used to find an outstanding assignment, and then CCLS explores the solution space, starting at this assignment. This combined heuristic, which we call MOCE–CCLS, is shown to provide a significant improvement over each of its parts: MOCE and CCLS. An additional contribution of this paper is the results of a comprehensive comparative evaluation of MOCE–CCLS versus CCLS on various benchmarks. On random benchmarks, the combined heuristic reduces the number of unsatisfied clauses by up to tens of percents. On Max Sat 2016 and 2021 public competition benchmarks, which include crafted and industrial instances also, MOCE–CCLS outperforms CCLS as well. To provide an empirical basis to the above result, this work further explores the correlation between the quality of initial assignments provided to CCLS and that of the corresponding final assignments. Empirical results show that the correlation is significant and long-lasting. Thus, under practical time constraints, the quality of the initial assignment is crucial to the performance of local search heuristics.

Suggested Citation

  • Daniel Berend & Shahar Golan & Yochai Twitto, 2022. "Using the method of conditional expectations to supply an improved starting point for CCLS," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3711-3734, December.
    • Handle: RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00907-5
    DOI: 10.1007/s10878-022-00907-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-022-00907-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-022-00907-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Pieter-Tjerk de Boer & Dirk Kroese & Shie Mannor & Reuven Rubinstein, 2005. "A Tutorial on the Cross-Entropy Method," Annals of Operations Research, Springer, vol. 134(1), pages 19-67, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mattrand, C. & Bourinet, J.-M., 2014. "The cross-entropy method for reliability assessment of cracked structures subjected to random Markovian loads," Reliability Engineering and System Safety, Elsevier, vol. 123(C), pages 171-182.
    2. R. Y. Rubinstein, 2005. "A Stochastic Minimum Cross-Entropy Method for Combinatorial Optimization and Rare-event Estimation," Methodology and Computing in Applied Probability, Springer, vol. 7(1), pages 5-50, March.
    3. Kin-Ping Hui, 2011. "Cooperative Cross-Entropy method for generating entangled networks," Annals of Operations Research, Springer, vol. 189(1), pages 205-214, September.
    4. Mathieu Balesdent & Jérôme Morio & Loïc Brevault, 2016. "Rare Event Probability Estimation in the Presence of Epistemic Uncertainty on Input Probability Distribution Parameters," Methodology and Computing in Applied Probability, Springer, vol. 18(1), pages 197-216, March.
    5. Tran, Cong Quoc & Keyvan-Ekbatani, Mehdi & Ngoduy, Dong & Watling, David, 2021. "Stochasticity and environmental cost inclusion for electric vehicles fast-charging facility deployment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    6. Xi Chen & Enlu Zhou, 2015. "Population model-based optimization," Journal of Global Optimization, Springer, vol. 63(1), pages 125-148, September.
    7. Lvyang Qiu & Shuyu Li & Yunsick Sung, 2021. "3D-DCDAE: Unsupervised Music Latent Representations Learning Method Based on a Deep 3D Convolutional Denoising Autoencoder for Music Genre Classification," Mathematics, MDPI, vol. 9(18), pages 1-17, September.
    8. Zhou, Yuekuan & Zheng, Siqian, 2020. "Climate adaptive optimal design of an aerogel glazing system with the integration of a heuristic teaching-learning-based algorithm in machine learning-based optimization," Renewable Energy, Elsevier, vol. 153(C), pages 375-391.
    9. Akimoto, Youhei & Auger, Anne & Hansen, Nikolaus, 2022. "An ODE method to prove the geometric convergence of adaptive stochastic algorithms," Stochastic Processes and their Applications, Elsevier, vol. 145(C), pages 269-307.
    10. Anastasia Spiliopoulou & Ioannis Papamichail & Markos Papageorgiou & Yannis Tyrinopoulos & John Chrysoulakis, 2017. "Macroscopic traffic flow model calibration using different optimization algorithms," Operational Research, Springer, vol. 17(1), pages 145-164, April.
    11. Huang, Zhenzhen & Kwok, Yue Kuen & Xu, Ziqing, 2024. "Efficient algorithms for calculating risk measures and risk contributions in copula credit risk models," Insurance: Mathematics and Economics, Elsevier, vol. 115(C), pages 132-150.
    12. Deng, Xiangtian & Zhang, Yi & Jiang, Yi & Zhang, Yi & Qi, He, 2024. "A novel operation method for renewable building by combining distributed DC energy system and deep reinforcement learning," Applied Energy, Elsevier, vol. 353(PB).
    13. Zhang, Yali & Shang, Pengjian, 2019. "Multivariate multiscale distribution entropy of financial time series," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 515(C), pages 72-80.
    14. Chen, Siliang & Chen, Kang & Zhu, Xu & Jin, Xinqiao & Du, Zhimin, 2022. "Deep learning-based image recognition method for on-demand defrosting control to save energy in commercial energy systems," Applied Energy, Elsevier, vol. 324(C).
    15. A. Gouda & T. Szántai, 2008. "Rare event probabilities in stochastic networks," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 16(4), pages 441-461, December.
    16. Liang Huang & Juanjuan Zhu & Mulan Qiu & Xiaoxiang Li & Shasha Zhu, 2022. "CA-BASNet: A Building Extraction Network in High Spatial Resolution Remote Sensing Images," Sustainability, MDPI, vol. 14(18), pages 1-15, September.
    17. Reuven Y. Rubinstein, 2006. "How Many Needles are in a Haystack, or How to Solve #P-Complete Counting Problems Fast," Methodology and Computing in Applied Probability, Springer, vol. 8(1), pages 5-51, March.
    18. Ad Ridder & Bruno Tuffin, 2012. "Probabilistic Bounded Relative Error Property for Learning Rare Event Simulation Techniques," Tinbergen Institute Discussion Papers 12-103/III, Tinbergen Institute.
    19. Mehni, Moien Barkhori & Mehni, Mohammad Barkhori, 2023. "Reliability analysis with cross-entropy based adaptive Markov chain importance sampling and control variates," Reliability Engineering and System Safety, Elsevier, vol. 231(C).
    20. Wu, Xin & Nie, Lei & Xu, Meng, 2017. "Robust fuzzy quality function deployment based on the mean-end-chain concept: Service station evaluation problem for rail catering services," European Journal of Operational Research, Elsevier, vol. 263(3), pages 974-995.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00907-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.