This paper focuses on the optimization method for multi-skilled painting personnel scheduling.The budget working time analysis is carried out considering the influence of operating area,difficulty of spraying area,mul...This paper focuses on the optimization method for multi-skilled painting personnel scheduling.The budget working time analysis is carried out considering the influence of operating area,difficulty of spraying area,multi-skilled workers,and worker’s efficiency,then a mathematical model is established to minimize the completion time. The constraints of task priority,paint preparation,pump management,and neighbor avoidance in the ship block painting production are considered. Based on this model,an improved scatter search(ISS)algorithm is designed,and the hybrid approximate dynamic programming(ADP)algorithm is used to improve search efficiency. In addition,the two solution combination methods of path-relinking and task sequence combination are used to enhance the search breadth and depth. The numerical experimental results show that ISS has a significant advantage in solving efficiency compared with the solver in small scale instances;Compared with the scatter search algorithm and genetic algorithm,ISS can stably improve the solution quality. Verified by the production example,ISS effectively shortens the total completion time of the production,which is suitable for scheduling problems in the actual painting production of the shipyard.展开更多
With the expansion of the application scope of social computing problems,many path problems in real life have evolved from pure path optimization problems to social computing problems that take into account various so...With the expansion of the application scope of social computing problems,many path problems in real life have evolved from pure path optimization problems to social computing problems that take into account various social attributes,cultures,and the emotional needs of customers.The actual soft time window vehicle routing problem,speeding up the response of customer needs,improving distribution efficiency,and reducing operating costs is the focus of current social computing problems.Therefore,designing fast and effective algorithms to solve this problem has certain theoretical and practical significance.In this paper,considering the time delay problem of customer demand,the compensation problem is given,and the mathematical model of vehicle path problem with soft time window is given.This paper proposes a hybrid tabu search(TS)&scatter search(SS)algorithm for vehicle routing problem with soft time windows(VRPSTW),which mainly embeds the TS dynamic tabu mechanism into the SS algorithm framework.TS uses the scattering of SS to avoid the dependence on the quality of the initial solution,and SS uses the climbing ability of TS improves the ability of optimizing,so that the quality of search for the optimal solution can be significantly improved.The hybrid algorithm is still based on the basic framework of SS.In particular,TS is mainly used for solution improvement and combination to generate new solutions.In the solution process,both the quality and the dispersion of the solution are considered.A simulation experiments verify the influence of the number of vehicles and maximum value of tabu length on solution,parameters’control over the degree of convergence,and the influence of the number of diverse solutions on algorithm performance.Based on the determined parameters,simulation experiment is carried out in this paper to further prove the algorithm feasibility and effectiveness.The results of this paper provide further ideas for solving vehicle routing problems with time windows and improving the efficiency of vehicle routing problems and have strong applicability.展开更多
In the purpose of dealing with the inconsistency of the machine dimensions in cell formation and layout problems,comprehensively taking into account such factors as alternative process routings, lot splitting, cell in...In the purpose of dealing with the inconsistency of the machine dimensions in cell formation and layout problems,comprehensively taking into account such factors as alternative process routings, lot splitting, cell input and output( I / O)locations,an integrated cell formation and layout model considering unequal machine dimensions is established which aims at minimizing intra-cell material handling cost,inter-cell material handling cost and cell expansion cost. A sequence pair-based scatter search algorithm is proposed which simultaneously adopts the roulette wheel selection operator as a subsets combination method to improve the quality of new solutions and the dynamic reference sets updating method to accelerate the convergence rate. Through the comparison of the results achieved by the proposed algorithm, Lingo and simulated annealing under different problem scales,the correctness of the model and the effectiveness of the algorithm are verified.展开更多
Considering the imprecise nature of the data in real-world problems, the earliness/tardiness （E/T） fiowshop scheduling problem with uncertain processing time and distinct due windows is concerned in this paper. A fu...Considering the imprecise nature of the data in real-world problems, the earliness/tardiness （E/T） fiowshop scheduling problem with uncertain processing time and distinct due windows is concerned in this paper. A fuzzy scheduling model is established and then transformed into a deterministic one by employing the method of maximizing the membership function of middle value. Moreover, an effective scatter search based particle swarm optimization （SSPSO） algorithm is proposed to minimize the sum of total earliness and tardiness penalties. The proposed SSPSO algorithm incorporates the scatter search （SS） algorithm into the frame of particle swarm optimization （PSO） algorithm and gives full play to their characteristics of fast convergence and high diversity. Besides, a differential evolution （DE） scheme is used to generate solutions in the SS. In addition, the dynamic update strategy and critical conditions are adopted to improve the performance of SSPSO. The simulation results indicate the superiority of SSPSO in terms of effectiveness and efficiency.展开更多
Janmark, Meyer, and Wong showed that continuous-time quantum walk search on known families of strongly regular graphs（SRGs） with parameters（N, k, λ, μ） achieves full quantum speedup. The problem is reconsidered ...Janmark, Meyer, and Wong showed that continuous-time quantum walk search on known families of strongly regular graphs（SRGs） with parameters（N, k, λ, μ） achieves full quantum speedup. The problem is reconsidered in terms of scattering quantum walk, a type of discrete-time quantum walks. Here, the search space is confined to a low-dimensional subspace corresponding to the collapsed graph of SRGs. To quantify the algorithm＇s performance, we leverage the fundamental pairing theorem, a general theory developed by Cottrell for quantum search of structural anomalies in star graphs.The search algorithm on the SRGs with k scales as N satisfies the theorem, and results can be immediately obtained, while search on the SRGs with k scales as√N does not satisfy the theorem, and matrix perturbation theory is used to provide an analysis. Both these cases can be solved in O（√N） time steps with a success probability close to 1. The analytical conclusions are verified by simulation results on two SRGs. These examples show that the formalism on star graphs can be applied more generally.展开更多
基金Sponsored by the Ministry of Industry and Information Technology of China(Grant No.MIIT[2019]359)。
文摘This paper focuses on the optimization method for multi-skilled painting personnel scheduling.The budget working time analysis is carried out considering the influence of operating area,difficulty of spraying area,multi-skilled workers,and worker’s efficiency,then a mathematical model is established to minimize the completion time. The constraints of task priority,paint preparation,pump management,and neighbor avoidance in the ship block painting production are considered. Based on this model,an improved scatter search(ISS)algorithm is designed,and the hybrid approximate dynamic programming(ADP)algorithm is used to improve search efficiency. In addition,the two solution combination methods of path-relinking and task sequence combination are used to enhance the search breadth and depth. The numerical experimental results show that ISS has a significant advantage in solving efficiency compared with the solver in small scale instances;Compared with the scatter search algorithm and genetic algorithm,ISS can stably improve the solution quality. Verified by the production example,ISS effectively shortens the total completion time of the production,which is suitable for scheduling problems in the actual painting production of the shipyard.
基金This work was supported by the National Natural Science Foundation of China(61772196,61472136)the Hunan Provincial Focus Social Science Fund(2016ZDB006)Thanks to Professor Weijin Jiang for his guidance and suggestions on this research.Funding Statement。
文摘With the expansion of the application scope of social computing problems,many path problems in real life have evolved from pure path optimization problems to social computing problems that take into account various social attributes,cultures,and the emotional needs of customers.The actual soft time window vehicle routing problem,speeding up the response of customer needs,improving distribution efficiency,and reducing operating costs is the focus of current social computing problems.Therefore,designing fast and effective algorithms to solve this problem has certain theoretical and practical significance.In this paper,considering the time delay problem of customer demand,the compensation problem is given,and the mathematical model of vehicle path problem with soft time window is given.This paper proposes a hybrid tabu search(TS)&scatter search(SS)algorithm for vehicle routing problem with soft time windows(VRPSTW),which mainly embeds the TS dynamic tabu mechanism into the SS algorithm framework.TS uses the scattering of SS to avoid the dependence on the quality of the initial solution,and SS uses the climbing ability of TS improves the ability of optimizing,so that the quality of search for the optimal solution can be significantly improved.The hybrid algorithm is still based on the basic framework of SS.In particular,TS is mainly used for solution improvement and combination to generate new solutions.In the solution process,both the quality and the dispersion of the solution are considered.A simulation experiments verify the influence of the number of vehicles and maximum value of tabu length on solution,parameters’control over the degree of convergence,and the influence of the number of diverse solutions on algorithm performance.Based on the determined parameters,simulation experiment is carried out in this paper to further prove the algorithm feasibility and effectiveness.The results of this paper provide further ideas for solving vehicle routing problems with time windows and improving the efficiency of vehicle routing problems and have strong applicability.
基金Shanghai Municipal Natural Science Foundation,China(No.10ZR1431700)
文摘In the purpose of dealing with the inconsistency of the machine dimensions in cell formation and layout problems,comprehensively taking into account such factors as alternative process routings, lot splitting, cell input and output( I / O)locations,an integrated cell formation and layout model considering unequal machine dimensions is established which aims at minimizing intra-cell material handling cost,inter-cell material handling cost and cell expansion cost. A sequence pair-based scatter search algorithm is proposed which simultaneously adopts the roulette wheel selection operator as a subsets combination method to improve the quality of new solutions and the dynamic reference sets updating method to accelerate the convergence rate. Through the comparison of the results achieved by the proposed algorithm, Lingo and simulated annealing under different problem scales,the correctness of the model and the effectiveness of the algorithm are verified.
基金supported by National Natural Science Foundation of China(Nos.61174040 and 61104178)Shanghai Commission of Science and Technology(No.12JC1403400)the Fundamental Research Funds for the Central Universities
文摘Considering the imprecise nature of the data in real-world problems, the earliness/tardiness （E/T） fiowshop scheduling problem with uncertain processing time and distinct due windows is concerned in this paper. A fuzzy scheduling model is established and then transformed into a deterministic one by employing the method of maximizing the membership function of middle value. Moreover, an effective scatter search based particle swarm optimization （SSPSO） algorithm is proposed to minimize the sum of total earliness and tardiness penalties. The proposed SSPSO algorithm incorporates the scatter search （SS） algorithm into the frame of particle swarm optimization （PSO） algorithm and gives full play to their characteristics of fast convergence and high diversity. Besides, a differential evolution （DE） scheme is used to generate solutions in the SS. In addition, the dynamic update strategy and critical conditions are adopted to improve the performance of SSPSO. The simulation results indicate the superiority of SSPSO in terms of effectiveness and efficiency.
基金supported by the National Natural Science Foundation of China(Grant Nos.61502101 and 61170321)the Natural Science Foundation of Jiangsu Province,China(Grant No.BK20140651)the Research Fund for the Doctoral Program of Higher Education of China(Grant No.20110092110024)
文摘Janmark, Meyer, and Wong showed that continuous-time quantum walk search on known families of strongly regular graphs（SRGs） with parameters（N, k, λ, μ） achieves full quantum speedup. The problem is reconsidered in terms of scattering quantum walk, a type of discrete-time quantum walks. Here, the search space is confined to a low-dimensional subspace corresponding to the collapsed graph of SRGs. To quantify the algorithm＇s performance, we leverage the fundamental pairing theorem, a general theory developed by Cottrell for quantum search of structural anomalies in star graphs.The search algorithm on the SRGs with k scales as N satisfies the theorem, and results can be immediately obtained, while search on the SRGs with k scales as√N does not satisfy the theorem, and matrix perturbation theory is used to provide an analysis. Both these cases can be solved in O（√N） time steps with a success probability close to 1. The analytical conclusions are verified by simulation results on two SRGs. These examples show that the formalism on star graphs can be applied more generally.
