The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
An Improved Differential Evolution Algorithm for Practical Dynamic Scheduling in Steelmaking-Continuous Casting Production
Abstract
This paper studies a challenging problem of dynamic scheduling in steelmaking-continuous casting (SCC) production. The problem is to re-optimize the assignment, sequencing, and timetable of a set of existing and new jobs among various production stages for the new environment when unforeseen changes occur in the production system. We model the problem considering the constraints of the practical technological requirements and the dynamic nature. To solve the SCC scheduling problem, we propose an improved differential evolution (DE) algorithm with a real-coded matrix representation for each individual of the population, a two-step method for generating the initial population, and a new mutation strategy. To further improve the efficiency and effectiveness of the solution process for dynamic use, an incremental mechanism is proposed to generate a new initial population for the DE whenever a real-time event arises, based on the final population in the last DE solution process. Computational experiments on randomly generated instances and the practical production data show that the proposed improved algorithm can obtain better solutions compared to other algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Addelman, S. (1979) · Technometrics · doi:10.1080/00401706.1979.10489788 · Cited by 6,750
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
JADE: Adaptive Differential Evolution With Optional External Archive
Zhang, J., & Sanderson, A. C. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2014613 · Cited by 3,739
Price, K. V. (2004) · Cited by 3,344
Statistics for experimenters: design, innovation, and discovery
(2006) · Choice Reviews Online · doi:10.5860/choice.43-3429 · Cited by 1,644
Evolutionary Optimization in Uncertain Environments—A Survey
Jin, Y., & Branke, J. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.846356 · Cited by 1,572
A survey of dynamic scheduling in manufacturing systems
Ouelhadj, D., & Petrović, S. (2008) · Journal of Scheduling · doi:10.1007/s10951-008-0090-8 · Cited by 1,031
Recent advances in differential evolution: a survey and experimental analysis
Neri, F., & Tirronen, V. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-009-9137-2 · Cited by 923
Memory enhanced evolutionary algorithms for changing optimization problems
Branke, J. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.785502 · Cited by 743
Islam, S. M., Das, S., Ghosh, S., Roy, S., & Suganthan, P. N. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2011.2167966 · Cited by 604
Nonstationary function optimization using genetic algorithm with dominance and diploidy
Goldberg, D. E., & Smith, R. E. (1987) · international conference on Genetic algorithms · Cited by 366
A review of planning and scheduling systems and methods for integrated steel production
Tang, L., Liu, J., Rong, A., & Yang, Z. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00240-x · Cited by 362
Self-citationYang, S., & Li, C. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2046667 · Cited by 344
Hansen, N., Niederberger, A. S. P., Guzzella, L., & Koumoutsakos, P. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.924423 · Cited by 323
Enhancing Differential Evolution Utilizing Proximity-Based Mutation Operators
Epitropakis, M. G., Tasoulis, D. K., Pavlidis, N. G., Plagianakos, V. P., & Vrahatis, M. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2083670 · Cited by 316
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
Yang, S., & Yao, X. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.913070 · Cited by 259
(2005) · Natural Computing Series · doi:10.1007/3-540-31306-0 · Cited by 256
A genetic algorithm for the linear transportation problem
Vignaux, G. A., & Michalewicz, Z. (1991) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.87092 · Cited by 239
DynDE: a Differential Evolution for Dynamic Optimization Problems
Mendes, R., & Mohais, A. S. (2005) · 2005 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2005.1555047 · Cited by 211
Yang, S., Cheng, H., & Wang, F. (2010) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2009.2023676 · Cited by 179
Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization
(2009) · Studies in Computational Intelligence · doi:10.1007/978-3-540-92151-6 · Cited by 171
Dorronsoro, B., & Bouvry, P. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2081369 · Cited by 165
Dynamic scheduling—a survey of research
Suresh, V., & Chaudhuri, D. (1993) · International Journal of Production Economics · doi:10.1016/0925-5273(93)90007-8 · Cited by 161
Dynamic scheduling of steel casting and milling using multi-agents
Cowling, P., Ouelhadj, D., & Petrović, S. (2004) · Production Planning & Control · doi:10.1080/09537280410001662466 · Cited by 88
An Evolutionary Computing Approach to Robust Design in the Presence of Uncertainties
Chan, R. R., & Sudhoff, S. D. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2046666 · Cited by 33
Cited by
Recent advances in differential evolution – An updated survey
Das, S., Mullick, S. S., & Suganthan, P. N. (2016) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2016.01.004 · Cited by 1,592
Differential Evolution With an Individual-Dependent Mechanism
Tang, L., Dong, Y., & Liu, J. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2360890 · Cited by 310
Self-citation
Metadata
- Authors
- Tang, L., Zhao, Y., & Liu, J.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2014-04
- Volume
- 18
- Issue
- 2
- Pages
- 209-225
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2152028815
- Cited by
- 287
- References
- 26
- FWCI
- 67.20
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.