The distributed flexible job shop scheduling problem(DFJSP)has attracted great attention with the growth of the global manufacturing industry.General DFJSP research only considers machine constraints and ignores worke...The distributed flexible job shop scheduling problem(DFJSP)has attracted great attention with the growth of the global manufacturing industry.General DFJSP research only considers machine constraints and ignores worker constraints.As one critical factor of production,effective utilization of worker resources can increase productivity.Meanwhile,energy consumption is a growing concern due to the increasingly serious environmental issues.Therefore,the distributed flexible job shop scheduling problem with dual resource constraints(DFJSP-DRC)for minimizing makespan and total energy consumption is studied in this paper.To solve the problem,we present a multi-objective mathematical model for DFJSP-DRC and propose a Q-learning-based multi-objective grey wolf optimizer(Q-MOGWO).In Q-MOGWO,high-quality initial solutions are generated by a hybrid initialization strategy,and an improved active decoding strategy is designed to obtain the scheduling schemes.To further enhance the local search capability and expand the solution space,two wolf predation strategies and three critical factory neighborhood structures based on Q-learning are proposed.These strategies and structures enable Q-MOGWO to explore the solution space more efficiently and thus find better Pareto solutions.The effectiveness of Q-MOGWO in addressing DFJSP-DRC is verified through comparison with four algorithms using 45 instances.The results reveal that Q-MOGWO outperforms comparison algorithms in terms of solution quality.展开更多
In this work, we prove the existence and uniqueness of the solution of the generalized Schrödinger equation in the periodic distributional space P’. Furthermore, we prove that the solution depends continuously r...In this work, we prove the existence and uniqueness of the solution of the generalized Schrödinger equation in the periodic distributional space P’. Furthermore, we prove that the solution depends continuously respect to the initial data in P’. Introducing a family of weakly continuous operators, we prove that this family is a semigroup of operators in P’. Then, with this family of operators, we get a fine version of the existence and dependency continuous theorem obtained. Finally, we provide some consequences of this study.展开更多
In this study, a distributed optimal control problem for <em>n</em> × <em>n</em> cooperative hyperbolic systems with infinite order operators and Dirichlet conditions are considered. The e...In this study, a distributed optimal control problem for <em>n</em> × <em>n</em> cooperative hyperbolic systems with infinite order operators and Dirichlet conditions are considered. The existence and uniqueness of the state of these systems are proved. The necessary and sufficient conditions for optimality of distributed control with constraints are found, and the set of equations and inequalities that defining the optimal control of these systems is also obtained. Finally, some examples for the control problem without constraints are given.展开更多
Currently,manufacturing enterprises face increasingly fierce market competition due to the various demands of customers and the rapid development of economic globalization.Hence,they have to extend their production mo...Currently,manufacturing enterprises face increasingly fierce market competition due to the various demands of customers and the rapid development of economic globalization.Hence,they have to extend their production mode into distributed environments and establish multiple factories in various geographical locations.Nowadays,distributed manufacturing systems have been widely adopted in industrial production processes.In recent years,many studies have been done on the modeling and optimization of distributed scheduling problems.This work provides a literature review on distributed scheduling problems in intelligent manufacturing systems.By summarizing and evaluating existing studies on distributed scheduling problems,we analyze the achievements and current research status in this field and discuss ongoing studies.Insights regarding prior works are discussed to uncover future research directions,particularly swarm intelligence and evolutionary algorithms,which are used for managing distributed scheduling problems in manufacturing systems.This work focuses on journal papers discovered using Google Scholar.After reviewing the papers,in this work,we discuss the research trends of distributed scheduling problems and point out some directions for future studies.展开更多
An improved quantum-behaved particle swarm optimization (IQPSO) algorithm is employed to deter- mine aerosol size distribution (ASD). The direct problem is solved using the anomalous diffraction approximation and ...An improved quantum-behaved particle swarm optimization (IQPSO) algorithm is employed to deter- mine aerosol size distribution (ASD). The direct problem is solved using the anomalous diffraction approximation and Lambert-Beer's Law. Compared with the standard particle swarm optimization algo- rithm, the stochastic particle size optimization algorithm and the original QPSO, our IQPSO has faster convergence speed and higher accuracy within a smaller number of generations. Optimization param- eters for the IQPSO were also evaluated; we recommend using four measurement wavelengths and S0 particles. Size distributions of various aerosol types were estimated using the IQPSO under dependent and independent models. Finally, experimental ASDs at different locations in Harbin were recovered using the IQPSO. All our results confirm that the IQpSO algorithm is an effective and reliable technique for estimatinz ASD.展开更多
In this paper, we investigate the superconvergence property and the L∞-errorestimates of mixed finite element methods for a semilinear elliptic control problem. Thestate and co-state are approximated by the lowest or...In this paper, we investigate the superconvergence property and the L∞-errorestimates of mixed finite element methods for a semilinear elliptic control problem. Thestate and co-state are approximated by the lowest order Raviart-Thomas mixed finite element spaces and the control variable is approximated by piecewise constant functions.We derive some superconvergence results for the control variable. Moreover, we derive L^(∞)-error estimates both for the control variable and the state variables. Finally, anumerical example is given to demonstrate the theoretical results.展开更多
This paper considers a distributed nonsmooth resource allocation problem of minimizing a global convex function formed by a sum of local nonsmooth convex functions with coupled constraints.A distributed communication-...This paper considers a distributed nonsmooth resource allocation problem of minimizing a global convex function formed by a sum of local nonsmooth convex functions with coupled constraints.A distributed communication-efficient mirror-descent algorithm,which can reduce communication rounds between agents over the network,is designed for the distributed resource allocation problem.By employing communication-sliding methods,agents can find aε-solution in O(1/ε)communication rounds while maintaining O(1/ε^(2))subgradient evaluations for nonsmooth convex functions.A numerical example is also given to illustrate the effectiveness of the proposed algorithm.展开更多
Conflicts between two or more parties arise for various reasons andperspectives. Thus, resolution of con-flicts frequently relies on some form of negotiation. Thispaper presents a general problem-solving framework for...Conflicts between two or more parties arise for various reasons andperspectives. Thus, resolution of con-flicts frequently relies on some form of negotiation. Thispaper presents a general problem-solving framework for modeling multi-issue multilateral negotiationusing fuzzy constraints. Agent negotiation is formulated as a distributed fuzzy constraintsatisfaction problem (DFCSP). Fuzzy constrains are thus used to naturally represent each agent''sdesires involving imprecision and human conceptualization, particularly when lexical imprecision andsubjective matters are concerned. On the other hand, based on fuzzy constraint-basedproblem-solving, our approach enables an agent not only to systematically relax fuzzy constraints togenerate a proposal, but also to employ fuzzy similarity to select the alternative that is subjectto its acceptability by the opponents. This task of problem-solving is to reach an agreement thatbenefits all agents with a high satisfaction degree of fuzzy constraints, and move towards the dealmore quickly since their search focuses only on the feasible solution space. An application tomultilateral negotiation of a travel planning is provided to demonstrate the usefulness andeffectiveness of our framework.展开更多
基金supported by the Natural Science Foundation of Anhui Province(Grant Number 2208085MG181)the Science Research Project of Higher Education Institutions in Anhui Province,Philosophy and Social Sciences(Grant Number 2023AH051063)the Open Fund of Key Laboratory of Anhui Higher Education Institutes(Grant Number CS2021-ZD01).
文摘The distributed flexible job shop scheduling problem(DFJSP)has attracted great attention with the growth of the global manufacturing industry.General DFJSP research only considers machine constraints and ignores worker constraints.As one critical factor of production,effective utilization of worker resources can increase productivity.Meanwhile,energy consumption is a growing concern due to the increasingly serious environmental issues.Therefore,the distributed flexible job shop scheduling problem with dual resource constraints(DFJSP-DRC)for minimizing makespan and total energy consumption is studied in this paper.To solve the problem,we present a multi-objective mathematical model for DFJSP-DRC and propose a Q-learning-based multi-objective grey wolf optimizer(Q-MOGWO).In Q-MOGWO,high-quality initial solutions are generated by a hybrid initialization strategy,and an improved active decoding strategy is designed to obtain the scheduling schemes.To further enhance the local search capability and expand the solution space,two wolf predation strategies and three critical factory neighborhood structures based on Q-learning are proposed.These strategies and structures enable Q-MOGWO to explore the solution space more efficiently and thus find better Pareto solutions.The effectiveness of Q-MOGWO in addressing DFJSP-DRC is verified through comparison with four algorithms using 45 instances.The results reveal that Q-MOGWO outperforms comparison algorithms in terms of solution quality.
文摘In this work, we prove the existence and uniqueness of the solution of the generalized Schrödinger equation in the periodic distributional space P’. Furthermore, we prove that the solution depends continuously respect to the initial data in P’. Introducing a family of weakly continuous operators, we prove that this family is a semigroup of operators in P’. Then, with this family of operators, we get a fine version of the existence and dependency continuous theorem obtained. Finally, we provide some consequences of this study.
文摘In this study, a distributed optimal control problem for <em>n</em> × <em>n</em> cooperative hyperbolic systems with infinite order operators and Dirichlet conditions are considered. The existence and uniqueness of the state of these systems are proved. The necessary and sufficient conditions for optimality of distributed control with constraints are found, and the set of equations and inequalities that defining the optimal control of these systems is also obtained. Finally, some examples for the control problem without constraints are given.
基金supported in part by the National Natural Science Foundation of China(Nos.61603169,61703220,and 61873328)China Postdoctoral Science Foundation Funded Project(No.2019T120569)+3 种基金Shandong Province Outstanding Youth Innovation Team Project of Colleges and Universities of China(No.2020RWG011)Shandong Province Colleges and Universities Youth Innovation Talent Introduction and Education Programthe Faculty Research Grants(FRG)from Macao University of Science and TechnologyShandong Provincial Key Laboratory for Novel Distributed Computer Software Technology。
文摘Currently,manufacturing enterprises face increasingly fierce market competition due to the various demands of customers and the rapid development of economic globalization.Hence,they have to extend their production mode into distributed environments and establish multiple factories in various geographical locations.Nowadays,distributed manufacturing systems have been widely adopted in industrial production processes.In recent years,many studies have been done on the modeling and optimization of distributed scheduling problems.This work provides a literature review on distributed scheduling problems in intelligent manufacturing systems.By summarizing and evaluating existing studies on distributed scheduling problems,we analyze the achievements and current research status in this field and discuss ongoing studies.Insights regarding prior works are discussed to uncover future research directions,particularly swarm intelligence and evolutionary algorithms,which are used for managing distributed scheduling problems in manufacturing systems.This work focuses on journal papers discovered using Google Scholar.After reviewing the papers,in this work,we discuss the research trends of distributed scheduling problems and point out some directions for future studies.
基金Support from the National Natural Science Foundation of China (No. 51476043), the Major National Scientific Instruments and Equipment Development Special Foundation of China (No. 51327803) and the Foundation for Innovative Research Groups of the National Natural Science Foundation of China (No. 51421063) is gratefully acknowledged.
文摘An improved quantum-behaved particle swarm optimization (IQPSO) algorithm is employed to deter- mine aerosol size distribution (ASD). The direct problem is solved using the anomalous diffraction approximation and Lambert-Beer's Law. Compared with the standard particle swarm optimization algo- rithm, the stochastic particle size optimization algorithm and the original QPSO, our IQPSO has faster convergence speed and higher accuracy within a smaller number of generations. Optimization param- eters for the IQPSO were also evaluated; we recommend using four measurement wavelengths and S0 particles. Size distributions of various aerosol types were estimated using the IQPSO under dependent and independent models. Finally, experimental ASDs at different locations in Harbin were recovered using the IQPSO. All our results confirm that the IQpSO algorithm is an effective and reliable technique for estimatinz ASD.
文摘In this paper, we investigate the superconvergence property and the L∞-errorestimates of mixed finite element methods for a semilinear elliptic control problem. Thestate and co-state are approximated by the lowest order Raviart-Thomas mixed finite element spaces and the control variable is approximated by piecewise constant functions.We derive some superconvergence results for the control variable. Moreover, we derive L^(∞)-error estimates both for the control variable and the state variables. Finally, anumerical example is given to demonstrate the theoretical results.
基金supported by the National Natural Science Foundation of China under Grant Nos.72101026,61621063the State Key Laboratory of Intelligent Control and Decision of Complex Systems。
文摘This paper considers a distributed nonsmooth resource allocation problem of minimizing a global convex function formed by a sum of local nonsmooth convex functions with coupled constraints.A distributed communication-efficient mirror-descent algorithm,which can reduce communication rounds between agents over the network,is designed for the distributed resource allocation problem.By employing communication-sliding methods,agents can find aε-solution in O(1/ε)communication rounds while maintaining O(1/ε^(2))subgradient evaluations for nonsmooth convex functions.A numerical example is also given to illustrate the effectiveness of the proposed algorithm.
文摘Conflicts between two or more parties arise for various reasons andperspectives. Thus, resolution of con-flicts frequently relies on some form of negotiation. Thispaper presents a general problem-solving framework for modeling multi-issue multilateral negotiationusing fuzzy constraints. Agent negotiation is formulated as a distributed fuzzy constraintsatisfaction problem (DFCSP). Fuzzy constrains are thus used to naturally represent each agent''sdesires involving imprecision and human conceptualization, particularly when lexical imprecision andsubjective matters are concerned. On the other hand, based on fuzzy constraint-basedproblem-solving, our approach enables an agent not only to systematically relax fuzzy constraints togenerate a proposal, but also to employ fuzzy similarity to select the alternative that is subjectto its acceptability by the opponents. This task of problem-solving is to reach an agreement thatbenefits all agents with a high satisfaction degree of fuzzy constraints, and move towards the dealmore quickly since their search focuses only on the feasible solution space. An application tomultilateral negotiation of a travel planning is provided to demonstrate the usefulness andeffectiveness of our framework.