An algorithm using the heuristic technique of Simulated Annealing to solve a scheduling problem is presented, focusing on the scheduling issues. The approximated method is examined together with its key parameters (fr...An algorithm using the heuristic technique of Simulated Annealing to solve a scheduling problem is presented, focusing on the scheduling issues. The approximated method is examined together with its key parameters (freezing, tempering, cooling, number of contours to be explored), and the choices made in identifying these parameters are illustrated to generate a good algorithm that efficiently solves the scheduling problem.展开更多
This paper presents an improved hybrid algorithm and a multi-objective model to tackle the scheduling problem of multiple Automated Guided Vehicles(AGVs)under the composite operation mode.The multi-objective model aim...This paper presents an improved hybrid algorithm and a multi-objective model to tackle the scheduling problem of multiple Automated Guided Vehicles(AGVs)under the composite operation mode.The multi-objective model aims to minimize the maximum completion time,the total distance covered by AGVs,and the distance traveled while empty-loaded.The improved hybrid algorithm combines the improved genetic algorithm(GA)and the simulated annealing algorithm(SA)to strengthen the local search ability of the algorithm and improve the stability of the calculation results.Based on the characteristics of the composite operation mode,the authors introduce the combined coding and parallel decoding mode and calculate the fitness function with the grey entropy parallel analysis method to solve the multi-objective problem.The grey entropy parallel analysis method is a combination of the grey correlation analysis method and the entropy weighting method to solve multi-objective solving problems.A task advance evaluation strategy is proposed in the process of crossover and mutation operator to guide the direction of crossover and mutation.The computational experiments results show that the improved hybrid algorithm is better than the GA and the genetic algorithm with task advance evaluation strategy(AEGA)in terms of convergence speed and solution results,and the effectiveness of the multi-objective solution is proved.All three objectives are optimized and the proposed algorithm has an optimization of 7.6%respectively compared with the GA and 3.4%compared with the AEGA in terms of the objective of maximum completion time.展开更多
In this paper combined with the advantages of genetic algorithm and simulated annealing, brings forward a parallel genetic simulated annealing hybrid algorithm (PGSAHA) and applied to solve task scheduling problem i...In this paper combined with the advantages of genetic algorithm and simulated annealing, brings forward a parallel genetic simulated annealing hybrid algorithm (PGSAHA) and applied to solve task scheduling problem in grid computing. It first generates a new group of individuals through genetic operation such as reproduction, crossover, mutation, etc, and than simulated anneals independently all the generated individuals respectively. When the temperature in the process of cooling no longer falls, the result is the optimal solution on the whole. From the analysis and experiment result, it is concluded that this algorithm is superior to genetic algorithm and simulated annealing.展开更多
In this paper a simulated annealing(SA)algorithm is presented for the 0/1 mul- tidimensional knapsack problem.Problem-specific knowledge is incorporated in the algorithm description and evaluation of parameters in ord...In this paper a simulated annealing(SA)algorithm is presented for the 0/1 mul- tidimensional knapsack problem.Problem-specific knowledge is incorporated in the algorithm description and evaluation of parameters in order to look into the perfor- mance of finite-time implementations of SA.Computational results show that SA per- forms much better than a genetic algorithm in terms of solution time,whilst having a modest loss of solution quality.展开更多
Bin planning (arrangements) is a key factor in the timber industry. Improper planning of the storage bins may lead to inefficient transportation of resources, which threaten the overall efficiency and thereby limit th...Bin planning (arrangements) is a key factor in the timber industry. Improper planning of the storage bins may lead to inefficient transportation of resources, which threaten the overall efficiency and thereby limit the profit margins of sawmills. To address this challenge, a simulation model has been developed. However, as numerous alternatives are available for arranging bins, simulating all possibilities will take an enormous amount of time and it is computationally infeasible. A discrete-event simulation model incorporating meta-heuristic algorithms has therefore been investigated in this study. Preliminary investigations indicate that the results achieved by GA based simulation model are promising and better than the other meta-heuristic algorithm. Further, a sensitivity analysis has been done on the GA based optimal arrangement which contributes to gaining insights and knowledge about the real system that ultimately leads to improved and enhanced efficiency in sawmill yards. It is expected that the results achieved in the work will support timber industries in making optimal decisions with respect to arrangement of storage bins in a sawmill yard.展开更多
Considering the uncertainty of the speed of horizontal transportation equipment,a cooperative scheduling model of multiple equipment resources in the automated container terminal was constructed to minimize the comple...Considering the uncertainty of the speed of horizontal transportation equipment,a cooperative scheduling model of multiple equipment resources in the automated container terminal was constructed to minimize the completion time,thus improving the loading and unloading efficiencies of automated container terminals.The proposed model integrated the two loading and unloading processes of“double-trolley quay crane+AGV+ARMG”and“single-trolley quay crane+container truck+ARMG”and then designed the simulated annealing particle swarm algorithm to solve the model.By comparing the results of the particle swarm algorithm and genetic algorithm,the algorithm designed in this paper could effectively improve the global and local space search capability of finding the optimal solution.Furthermore,the results showed that the proposed method of collaborative scheduling of multiple equipment resources in automated terminals considering hybrid processes effectively improved the loading and unloading efficiencies of automated container terminals.The findings of this study provide a reference for the improvement of loading and unloading processes as well as coordinated scheduling in automated terminals.展开更多
A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exp...A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exploration and exploitation. In the clonal selection mechanism, clonal selection, hypermutation and receptor edit theories are presented to construct an evolutionary searching mechanism which is used for exploration. In the local search mechanism, a simulated annealing local search algorithm based on Nowicki and Smutnicki's neighborhood is presented to exploit local optima. The proposed algorithm is examined using some well-known benchmark problems. Numerical results validate the effectiveness of the proposed algorithm.展开更多
文摘An algorithm using the heuristic technique of Simulated Annealing to solve a scheduling problem is presented, focusing on the scheduling issues. The approximated method is examined together with its key parameters (freezing, tempering, cooling, number of contours to be explored), and the choices made in identifying these parameters are illustrated to generate a good algorithm that efficiently solves the scheduling problem.
基金the Shandong Province Key Research and Development Program under Grant No.2021SFGC0601.
文摘This paper presents an improved hybrid algorithm and a multi-objective model to tackle the scheduling problem of multiple Automated Guided Vehicles(AGVs)under the composite operation mode.The multi-objective model aims to minimize the maximum completion time,the total distance covered by AGVs,and the distance traveled while empty-loaded.The improved hybrid algorithm combines the improved genetic algorithm(GA)and the simulated annealing algorithm(SA)to strengthen the local search ability of the algorithm and improve the stability of the calculation results.Based on the characteristics of the composite operation mode,the authors introduce the combined coding and parallel decoding mode and calculate the fitness function with the grey entropy parallel analysis method to solve the multi-objective problem.The grey entropy parallel analysis method is a combination of the grey correlation analysis method and the entropy weighting method to solve multi-objective solving problems.A task advance evaluation strategy is proposed in the process of crossover and mutation operator to guide the direction of crossover and mutation.The computational experiments results show that the improved hybrid algorithm is better than the GA and the genetic algorithm with task advance evaluation strategy(AEGA)in terms of convergence speed and solution results,and the effectiveness of the multi-objective solution is proved.All three objectives are optimized and the proposed algorithm has an optimization of 7.6%respectively compared with the GA and 3.4%compared with the AEGA in terms of the objective of maximum completion time.
基金Supported by the National Basic ResearchProgramof China (973 Program2003CB314804)
文摘In this paper combined with the advantages of genetic algorithm and simulated annealing, brings forward a parallel genetic simulated annealing hybrid algorithm (PGSAHA) and applied to solve task scheduling problem in grid computing. It first generates a new group of individuals through genetic operation such as reproduction, crossover, mutation, etc, and than simulated anneals independently all the generated individuals respectively. When the temperature in the process of cooling no longer falls, the result is the optimal solution on the whole. From the analysis and experiment result, it is concluded that this algorithm is superior to genetic algorithm and simulated annealing.
基金This work was supported by the National Natural Science Foundation of China (No. 10201026, 10672111).
文摘In this paper a simulated annealing(SA)algorithm is presented for the 0/1 mul- tidimensional knapsack problem.Problem-specific knowledge is incorporated in the algorithm description and evaluation of parameters in order to look into the perfor- mance of finite-time implementations of SA.Computational results show that SA per- forms much better than a genetic algorithm in terms of solution time,whilst having a modest loss of solution quality.
文摘Bin planning (arrangements) is a key factor in the timber industry. Improper planning of the storage bins may lead to inefficient transportation of resources, which threaten the overall efficiency and thereby limit the profit margins of sawmills. To address this challenge, a simulation model has been developed. However, as numerous alternatives are available for arranging bins, simulating all possibilities will take an enormous amount of time and it is computationally infeasible. A discrete-event simulation model incorporating meta-heuristic algorithms has therefore been investigated in this study. Preliminary investigations indicate that the results achieved by GA based simulation model are promising and better than the other meta-heuristic algorithm. Further, a sensitivity analysis has been done on the GA based optimal arrangement which contributes to gaining insights and knowledge about the real system that ultimately leads to improved and enhanced efficiency in sawmill yards. It is expected that the results achieved in the work will support timber industries in making optimal decisions with respect to arrangement of storage bins in a sawmill yard.
基金supported by the National Key R&D Program of China(Grant No.2017YFC0805309)Natural Science Foundation of Fujian Province(Grant No.2021J01820)Department of Education of Fujian Province Project(Grant Nos.JAT190294 and JAT210230).
文摘Considering the uncertainty of the speed of horizontal transportation equipment,a cooperative scheduling model of multiple equipment resources in the automated container terminal was constructed to minimize the completion time,thus improving the loading and unloading efficiencies of automated container terminals.The proposed model integrated the two loading and unloading processes of“double-trolley quay crane+AGV+ARMG”and“single-trolley quay crane+container truck+ARMG”and then designed the simulated annealing particle swarm algorithm to solve the model.By comparing the results of the particle swarm algorithm and genetic algorithm,the algorithm designed in this paper could effectively improve the global and local space search capability of finding the optimal solution.Furthermore,the results showed that the proposed method of collaborative scheduling of multiple equipment resources in automated terminals considering hybrid processes effectively improved the loading and unloading efficiencies of automated container terminals.The findings of this study provide a reference for the improvement of loading and unloading processes as well as coordinated scheduling in automated terminals.
文摘A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exploration and exploitation. In the clonal selection mechanism, clonal selection, hypermutation and receptor edit theories are presented to construct an evolutionary searching mechanism which is used for exploration. In the local search mechanism, a simulated annealing local search algorithm based on Nowicki and Smutnicki's neighborhood is presented to exploit local optima. The proposed algorithm is examined using some well-known benchmark problems. Numerical results validate the effectiveness of the proposed algorithm.