CrushSCI.com
292.2Average days
253Median days
218Fastest days
475Longest days
142025 publications

Paper Review Records

All Paper Review Records

6 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.

475 days

Computing Optimal Populations for Binary Problems Using Logic Minimization

Authors
Pier Luca LanziShow moreShow less
Affiliations
1. Politecnico di Milano, Milano, Italy pierluca.lanzi@polimi.itShow moreShow less
Source PDF DOI Publisher page
218 days

Analysis and Simplification of the Winner of the CEC 2022 Optimization Competition on Single Objective Bound Constrained Search

Authors
Rafał BiedrzyckiShow moreShow less
Affiliations
1. Warsaw University of Technology, Institute of Computer Science, Warsaw, 00-665, Poland rafal.biedrzycki@pw.edu.plShow moreShow less
Source PDF DOI Publisher page
258 days

Exploring Automated Algorithm Design Synergizing Large Language Models and Evolutionary Algorithms: Survey and Insights

Authors
He Yu; Jing LiuShow moreShow less
Affiliations
1. School of Artificial Intelligence, Xidian University, 2 South Taibai Road, Xi’an, Shaanxi 710071, China yuhe001@stu.xidian.edu.cn; 2. Guangzhou Institute of Technology, Xidian University, Knowledge City, Guangzhou, Guangdong 510555, China; 3. School of Artificial Intelligence, Xidian University, 2 South Taibai Road, Xi’an, Shaanxi 710071, China neouma@mail.xidian.edu.cnShow moreShow less
Source PDF DOI Publisher page
307 days

Illuminating the Diversity-Fitness Trade-Off in Black-Box Optimization

Authors
Maria Laura Santoni; Elena Raponi; Aneta Neumann; Frank Neumann; Mike Preuss; Carola DoerrShow moreShow less
Affiliations
1. Sorbonne Université, CNRS, LIP6, Paris, France maria-laura.santoni@lip6.fr; 2. Leiden Institute of Advanced Computer Science, Universiteit Leiden, 2333 CC Leiden, The Netherlands e.raponi@liacs.leidenuniv.nl; 3. Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide SA, 5005, Australia aneta.neumann@adelaide.edu.au; 4. Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide SA, 5005, Australia frank.neumann@adelaide.edu.au; 5. Leiden Institute of Advanced Computer Science, Universiteit Leiden, 2333 CC Leiden, The Netherlands m.preuss@liacs.leidenuniv.nl; 6. Sorbonne Université, CNRS, LIP6, Paris, France carola.doerr@lip6.frShow moreShow less
Source PDF DOI Publisher page
247 days

The Cost of Randomness in Evolutionary Algorithms: Crossover Can Save Random Bits

Authors
Carlo Kneissl; Dirk SudholtShow moreShow less
Affiliations
1. Chair of Algorithms for Intelligent Systems, University of Passau, Passau, Germany car.kneissl@gmail.com; 2. Chair of Algorithms for Intelligent Systems, University of Passau, Passau, Germany dirk.sudholt@uni-passau.deShow moreShow less
Source PDF DOI Publisher page
248 days

MO-SMAC: Multiobjective Sequential Model-Based Algorithm Configuration

Authors
Jeroen G. Rook; Carolin Benjamins; Jakob Bossek; Heike Trautmann; Holger H. Hoos; Marius LindauerShow moreShow less
Affiliations
1. Data Management & Biometrics, University of Twente, The Netherlands j.g.rook@utwente.nl; 2. Institute of Artificial Intelligence, Leibniz University Hannover, Germany c.benjamins@ai.uni-hannover.de; 3. Machine Learning and Optimisation, Paderborn University, Germany jakob.bossek@uni-paderborn.de; 4. Machine Learning and Optimisation, Paderborn University, Germany heike.trautmann@uni-paderborn.de; 5. Data Management & Biometrics, University of Twente, The Netherlands; 6. Artificial Intelligence Methodology, RTWH Aachen University, Germany hh@aim.rwth-aachen.de; 7. ADA Research Group, Leiden University, The Netherlands; 8. University of British Columbia, Canada; 9. Institute of Artificial Intelligence, L3S Research Center Leibniz University Hannover, Germany m.lindauer@ai.uni-hannover.deShow moreShow less
Source PDF DOI Publisher page

FAQ

How long does EVOLUTIONARY COMPUTATION take to review a manuscript?

As of 2026-11-19, CrushSCI has 6 complete review records for EVOLUTIONARY COMPUTATION. The fastest paper went from submission to acceptance in 218 days (Analysis and Simplification of the Winner of the CEC 2022 Optimization Competition on Single Objective Bound Constrained Search, received 2024-09-05, accepted 2025-04-11); the slowest took 475 days. The average is 292.2 days and the median is 253 days.

Expert Matching · Case Demo

Turn Your Submission Goalsinto a Verifiable Journal Plan

Share your field, deadline, and author profile. CrushSCI uses real review records to suggest a title direction, shortlist journals, and estimate timelines.

We will reply within 30 minutes.

CrushSCI online

Client

I work in environmental engineering and need an SCI paper published within three months. I have no grant funding or prominent co-author. Which journals could I target?

CrushSCI

Yes. We will first screen for feasibility against the 90-day deadline, then identify comparable papers without grant support or prominent co-authors. The final shortlist will prioritize research quality and journal scope.

Suggested title
Machine Learning and Life-Cycle Assessment for Predicting and Optimizing Carbon Emissions in Urban Wastewater Treatment

SampleLatest 5 valid paper samples from 2026

Average review59.6 days

Median65 days

Contact CrushSCI

Contact CrushSCI

Leave your email address to discuss academic polishing, structural refinement, or one-to-one guidance.

We will reply within 30 minutes.

Selected service: Academic Consulting Service

Leave your email address

Or email us directly at leader@crushsci.com

Enter your email address so we can reply. Your details will remain private.