International Journal of Mathematics and Computational Science
Articles Information
International Journal of Mathematics and Computational Science, Vol.1, No.5, Oct. 2015, Pub. Date: Jul. 16, 2015
A Simulated Annealing Method to Optimize the Order of the Sequences in Continuous-Casting
Pages: 282-287 Views: 2277 Downloads: 1146
[01] Achraf Touil, University Hassan 1st, Laboratory of Mechanics, Industrial Management and Innovation, FST, Settat, Morocco.
[02] Abdelwahed Echchtabi, University Hassan 1st, Laboratory of Mechanics, Industrial Management and Innovation, FST, Settat, Morocco.
[03] Adil Bellabdaoui, University Mohamed V Souissi’ Information Technology Team and Corporate Management, ENSIAS, Rabat, Morocco.
The purpose of this paper is to propose a simulated annealing algorithm to maximize the production and minimize the processing time in the steelmaking continuous casting by optimizing the order of the sequences (a sequence is a group of jobs with the same chemical characteristics). Based on the work of [1] a mixed integer programming for scheduling Steelmaking-Continuous casting production with the object to minimize the makespan. The order of the sequences in continuous casting is assumed fixed. Our contribution is to analyze and suggest an additional way to determine the optimal order. A simulated annealing algorithm restricted by a tabu list (SATL) is addressed to obtain the optimal order. After parameter tuning of the algorithm, the proposed algorithm was implemented to different instances using a .NET application and the commercial software solver Cplex v12.5.
Steel-Making, Continous-Casting, Metaheuristics, Simulated Annealing, Tabu List
[01] Bellabdaoui et al, 2006 “A mixed-integer linear programming model for the continuous casting planning”, International Journal of Production Economics, Vol.104, pp. 260-270, 2006.
[02] Bellabdaoui et al, 2005 “A heuristic algorithm for scheduling the steelmaking continuous casting process”, in Pacific Journal of Optimization, Vol. 1, No. 3, pp. 447-464, 2005.
[03] Pacciarelli, D., and M. Pranzo. 2004. “Production scheduling in a Steelmaking-Continuous Casting Plant. “Computers and Chemical Engineering28: 2823–2835.
[04] Tang, L., J. Liu, A. Rong, and Z. Yang. 2000. “A Mathematical Programming Model for Scheduling Steelmaking-Continuous Casting Production”. European Journal of Operational Research120: 423–435.
[05] Atighehchian, A., M. Bijari, and H. Tarkesh. 2009. “A Novel Hybrid Algorithm for Scheduling Steelmaking Continuous Casting Production. “Computers & Operations Research36: 2450–2461.
[06] Pan, Q.-K., L. Wang, K. Mao, J.-H. Zhao, and M. Zhang. 2013. “An Effective Artificial Bee Colony Algorithm for a Real-world Hybrid Flowshop Problem in Steelmaking Process.” IEEE Transactions on Automation Science and Engineering10: 307–322.
[07] Xujun, Z., and L. Zhimin. 2009. “Model and Solution for the Steelmaking-Continuous Casting Scheduling Problem Based on Constraint Programming Method.” In Proceedings IEEE – International Conference on Information Technology and Computer Science (ITCS 2009), 19–22, Kiev.
[08] Nearchou and al.2004 ‘’A novel metaheuristic approach for the flow shop scheduling problem”, Engineering Applications of Artificial Intelligence, 17(3), pp 289–300.
[09] Naderi et al. 2009 “An improved simulated annealing for hybrid flow shops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness”, Expert Systems with Application, 36(6), pp 9625-9633.
[10] Bandyopadhyay and al. 2008 “A simulated annealing-based multi objective optimization algorithm: AMOSA”, IEEE Transactions on Evolutionary.
[11] Czapinski, 2010 “Parallel simulated annealing with genetic enhancement for flow shop problem.” Computers and Industrial Engineering, 59(4), pp 778-785.
[12] Nawaz, M., Enscore, E. Jr and Ham, 1983, “A heuristic algorithm for the M machine, n-job flowshop sequencing problem”, Omega, Vol. 11 No. 1, pp. 91-95.
MA 02210, USA
AIS is an academia-oriented and non-commercial institute aiming at providing users with a way to quickly and easily get the academic and scientific information.
Copyright © 2014 - American Institute of Science except certain content provided by third parties.