A New Innovative Cooling Law for Simulated Annealing Algorithms

The present paper proposes an original and innovative cooling law in the field of Simulated Annealing (SA) algorithms. Particularly, such a law is based on the evolution of different initial seeds on which the algorithm works in parallel. The efficiency control of the new proposal, executed on problems of different kind, shows that the convergence quickness by using such a new cooling law is considerably greater than that obtained by traditional laws. Furthermore, it is shown that the effectiveness of the SA algorithm arising from the proposed cooling law is independent of the problem type. This last feature reduces the number of parameters to be initially fixed, so simplifying the preliminary calibration process necessary to optimize the algorithm efficiency.

[1]  I-Tung Yang,et al.  Performing complex project crashing analysis with aid of particle swarm optimization algorithm , 2007 .

[2]  Jatinder N. D. Gupta,et al.  Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times , 2009 .

[3]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[5]  Kathleen Steinhöfel,et al.  Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing , 2008, Comput. Oper. Res..

[6]  Rong-Ceng Leou,et al.  A new method for unit maintenance scheduling considering reliability and operation expense , 2006 .

[7]  K. Dowsland.  Some experiments with simulated annealing techniques for packing problems , 1993 .

[8]  Cheng Wu,et al.  A simulated annealing algorithm for single machine scheduling problems with family setups , 2009, Comput. Oper. Res..

[9]  Sou-Sen Leu,et al.  GA-BASED MULTICRITERIA OPTIMAL MODEL FOR CONSTRUCTION SCHEDULING , 1999 .

[10]  Huang,et al.  AN EFFICIENT GENERAL COOLING SCHEDULE FOR SIMULATED ANNEALING , 1986 .

[11]  P. Luh,et al.  Job shop scheduling with group-dependent setups, finite buffers, and long time horizon , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[12]  J.W. Fowler,et al.  Heuristics for minimizing total weighted tardiness in complex job shops , 2005 .

[13]  Hark Hwang,et al.  Job shop scheduling with sequence dependent setup times to minimize makespan , 2003 .

[14]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1989, Encyclopedia of GIS.

[15]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (3rd ed.) , 1996 .

[16]  Stephen C. H. Leung,et al.  A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem , 2012, Comput. Oper. Res..

[17]  Sebastian Sitarz,et al.  Ant algorithms and simulated annealing for multicriteria dynamic programming , 2009, Comput. Oper. Res..

[18]  Peter Rossmanith,et al.  Simulated Annealing , 2008, Taschenbuch der Algorithmen.

[19]  Bruce E. Hajek,et al.  Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

[20]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

[21]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[22]  Abdollah Aghaie,et al.  Ant colony optimization algorithm for stochastic project crashing problem in PERT networks using MC simulation , 2009 .

[23]  W. Duncan.  A GUIDE TO THE PROJECT MANAGEMENT BODY OF KNOWLEDGE , 1996 .

[24]  Shih-Wei Lin,et al.  Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm , 2013, Comput. Oper. Res..

[25]  Peter E.D. Love,et al.  Using improved genetic algorithms to facilitate time-cost optimization , 1997 .

[26]  Wilbert E. Wilhelm,et al.  Scheduling and lot sizing with sequence-dependent setup: A literature review , 2006 .

[27]  Mehmet Bayram Yildirim,et al.  An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times , 2012, Comput. Oper. Res..

[28]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[29]  Reza Tavakkoli-Moghaddam,et al.  Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing , 2012, Comput. Oper. Res..

[30]  Chinyao Low,et al.  Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines , 2005, Comput. Oper. Res..

[31]  Hong Zhou,et al.  Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times , 2001, Ann. Oper. Res..

[32]  Zülal Güngör,et al.  An application of fuzzy goal programming to a multiobjective project network problem , 2001, Fuzzy Sets Syst..

[33]  Xinchao Zhao,et al.  Simulated annealing algorithm with adaptive neighborhood , 2011, Appl. Soft Comput..

[34]  Alain Hertz,et al.  An Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints , 1996, Discret. Appl. Math..

[35]  Saeed Zolfaghari,et al.  Adaptive temperature control for simulated annealing: a comparative study , 2004, Comput. Oper. Res..

[36]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[37]  S. C. Kim,et al.  Scheduling jobs with uncertain setup times and sequence dependency , 1997 .

[38]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[39]  Chung-Wei Feng,et al.  Using genetic algorithms to solve construction time-cost trade-off problems , 1997 .

[40]  Matthew J. Liberatore,et al.  Extending project time¿cost analysis by removing precedence relationships and task streaming , 2006 .

[41]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[42]  Heng Li,et al.  Using machine learning and GA to solve time-cost trade-off problems , 1999 .