Autonomous resource allocation of smart workshop for cloud machining orders

Author(s):  
Jizhuang Hui ◽  
Jingyuan Lei ◽  
Kai Ding ◽  
Fuqiang Zhang ◽  
Jingxiang Lv

Abstract In order to realize the online allocation of collaborative processing resource of smart workshop in the context of cloud manufacturing, a multi-objective optimization model of workshop collaborative resources (MOM-WCR) was proposed. Considering the optimization objectives of processing time, processing cost, product qualification rate, and resource utilization, MOM-WCR was constructed. Based on the time sequence of workshop processing tasks, the workshop collaborative manufacturing resource was integrated in MOM-WCR. Fuzzy analytic hierarchy process (FAHP) was adopted to simplified the multi-objective problem into the single-objective problem. Then, the improved firefly algorithm which integrated the particle swarm algorithm (IFA-PSA) was used to solve MOM-WCR. Finally, a group of connecting rod processing experiments were used to verify the model proposed in this paper. The results show that the model is feasible in the application of workshop-level resource allocation in the context of cloud manufacturing, and the improved firefly algorithm shows good performance in solving the multi-objective resource allocation problem.

Author(s):  
Fuqiang Zhang ◽  
Jizhuang Hui ◽  
Bin Zhu ◽  
Yunxin Guo

In order to conduct resource sharing and deployment in cloud manufacturing environment, a concept of collaborative manufacturing chain was proposed. Based on machining tasks with the sequential characteristics, the proposed model considering the criteria of service cost, service time, service quality and service utilization was constructed. Fuzzy analytical hierarchy process was adopted to add the above multi-criteria model to a single objective problem. Then, an improved firefly algorithm was used to solve a reasonable collaborative manufacturing chain scheme. Based on the discrete characteristics of the collaborative manufacturing chain, iterative position function was improved to make the solution space to be a discrete domain. Furthermore, particle swarm optimization was used to optimize the step length factor α, attraction degree β0 and light absorption coefficient γ so as to prevent the firefly algorithm from local optimum. Compared with the genetic algorithm, numerical result suggests that the improved firefly algorithm has more advantages in convergence speed and solving efficiency. It is expected that this study can provide a useful reference for the service composition of collaborative manufacturing chain.


2020 ◽  
Vol 39 (3) ◽  
pp. 3259-3273
Author(s):  
Nasser Shahsavari-Pour ◽  
Najmeh Bahram-Pour ◽  
Mojde Kazemi

The location-routing problem is a research area that simultaneously solves location-allocation and vehicle routing issues. It is critical to delivering emergency goods to customers with high reliability. In this paper, reliability in location and routing problems was considered as the probability of failure in depots, vehicles, and routs. The problem has two objectives, minimizing the cost and maximizing the reliability, the latter expressed by minimizing the expected cost of failure. First, a mathematical model of the problem was presented and due to its NP-hard nature, it was solved by a meta-heuristic approach using a NSGA-II algorithm and a discrete multi-objective firefly algorithm. The efficiency of these algorithms was studied through a complete set of examples and it was found that the multi-objective discrete firefly algorithm has a better Diversification Metric (DM) index; the Mean Ideal Distance (MID) and Spacing Metric (SM) indexes are only suitable for small to medium problems, losing their effectiveness for big problems.


Author(s):  
Ata Khalili ◽  
Shayan Zargari ◽  
Qingqing Wu ◽  
Derrick Wing Kwan Ng ◽  
Rui Zhang

2021 ◽  
Vol 117 ◽  
pp. 498-509
Author(s):  
Chu-ge Wu ◽  
Wei Li ◽  
Ling Wang ◽  
Albert Y. Zomaya

Sign in / Sign up

Export Citation Format

Share Document