An evolution inequality of Sobolev type involving a nonlinear convolution term is considered.By using the nonlinear capacity method and the contradiction argument,the non-existence of the nontrivial local weak solutio...An evolution inequality of Sobolev type involving a nonlinear convolution term is considered.By using the nonlinear capacity method and the contradiction argument,the non-existence of the nontrivial local weak solution is proved.展开更多
In this paper,by utilizing the Marcinkiewicz-Zygmund inequality and Rosenthal-type inequality of negatively superadditive dependent(NSD)random arrays and truncated method,we investigate the complete f-moment convergen...In this paper,by utilizing the Marcinkiewicz-Zygmund inequality and Rosenthal-type inequality of negatively superadditive dependent(NSD)random arrays and truncated method,we investigate the complete f-moment convergence of NSD random variables.We establish and improve a general result on the complete f-moment convergence for Sung’s type randomly weighted sums of NSD random variables under some general assumptions.As an application,we show the complete consistency for the randomly weighted estimator in a nonparametric regression model based on NSD errors.展开更多
This study proposes a graphical user interface(GUI) based on an enhanced bacterial foraging optimization(EBFO) to find the optimal locations and sizing parameters of multi-type DFACTS in large-scale distribution syste...This study proposes a graphical user interface(GUI) based on an enhanced bacterial foraging optimization(EBFO) to find the optimal locations and sizing parameters of multi-type DFACTS in large-scale distribution systems.The proposed GUI based toolbox,allows the user to choose between single and multiple DFACTS allocations,followed by the type and number of them to be allocated.The EBFO is then applied to obtain optimal locations and ratings of the single and multiple DFACTS.This is found to be faster and provides more accurate results compared to the usual PSO and BFO.Results obtained with MATLAB/Simulink simulations are compared with PSO,BFO and enhanced BFO.It reveals that enhanced BFO shows quick convergence to reach the desired solution there by yielding superior solution quality.Simulation results concluded that the EBFO based multiple DFACTS allocation using DSSSC,APC and DSTATCOM is preferable to reduce power losses,improve load balancing and enhance voltage deviation index to 70%,38% and 132% respectively and also it can improve loading factor without additional power loss.展开更多
The time dependent vehicle routing problem with time windows（TDVRPTW） is considered. A multi-type ant system（MTAS） algorithm hybridized with the ant colony system（ACS）and the max-min ant system（MMAS） algorithm...The time dependent vehicle routing problem with time windows（TDVRPTW） is considered. A multi-type ant system（MTAS） algorithm hybridized with the ant colony system（ACS）and the max-min ant system（MMAS） algorithms is proposed. This combination absorbs the merits of the two algorithms in solutions construction and optimization separately. In order to improve the efficiency of the insertion procedure, a nearest neighbor selection（NNS） mechanism, an insertion local search procedure and a local optimization procedure are specified in detail. And in order to find a balance between good scouting performance and fast convergence rate, an adaptive pheromone updating strategy is proposed in the MTAS. Computational results confirm the MTAS algorithm＇s good performance with all these strategies on classic vehicle routing problem with time windows（VRPTW） benchmark instances and the TDVRPTW instances, and some better results especially for the number of vehicles and travel times of the best solutions are obtained in comparison with the previous research.展开更多
This paper discusses an optimization of operating a p ermutation circulation-type vehicle routing system (PCVRS, for short), in w hich several stages are located along by a single loop, and a fleet of vehicles travels...This paper discusses an optimization of operating a p ermutation circulation-type vehicle routing system (PCVRS, for short), in w hich several stages are located along by a single loop, and a fleet of vehicles travels on the loop unidirectionally and repeatedly. Traveling on the loop, each vehicle receives an object from the loading stage and then carries it to a cert ain processing stage, or receives an object from a certain processing stage and then carries it to the unloading stage per a turnaround. No passing is allowed f or the vehicles on the loop (from which the system is called permutation, and th is restriction may cause interferences between vehicles). Material handling systems such as PCVRS are actually encountered in flexible man ufacturing systems and in automated storage/retrieval systems. In this paper, we propose a heuristic algorithm for operating the PCVRS, which i ncorporates a new scheduling method for the vehicles with the SPT (shortest proc essing time) numbering of jobs and a round-robin manner of allocating jobs to t he stages, aiming to reduce interferences between the vehicles. We also give num erical results with respect to system performances attained by the heuristic. Description of the system The PCVRS consists of a set of n v vehicles V={V 1,V 2,...,V n v}, a set of n s, processing stages S p={S 1,S 2,...,S n s}, a loading stage S 0 and an unloading stage S n s +1. We denote by S=S p∪{S 0,S n s+l} the set of all the stages. The vehicles travel on a single loop unidirectionany and repeated ly. The system layout is depicted in Fig.1. There is a set of n jobs J={J 1,J 2,...,J n} to be processed b y the vehicles. Each job consists of two tasks: That is, each vehicle receives a n object from S 0 and then carries it to S l with a certain l∈{1,2, ...,n s} (a throw-in job), or receives an object from S l with a certain l∈{1,2,...,n s} and then carries it to S n s+1 (a throw-out job ) per a turnaround. The loop consists of buffer zones BZ(l) and travel zones TZ(l) (see Fig. 1). Each buffer zone BZ(l) is placed in front of stage S l, l=0,1,..., n s, n s+1, in order to avoid a collision between vehicles (i.e., the syste m adopts the so-called zone control strategy). A heuristic algorithm We develop a heuristic algorithm to obtain a good performance for the PCVRS. An operation π={A/B/C} for the PCVRS consists of three decision factors: (A) Numbering jobs Jobs are loaded into S 0 according to an assending order of job numbers. In this paper, we use the following rules to number jobs: SPT: Order jobs in the shortest processing time rule, i.e., P 1≤P 2≤...≤P n for the set of jobs J={J 1,J 2,...,J n}, rather than the FCFS numbering (i.e., number jobs in first-come-first-served order). The SPT rule intends to reduce interferences between two adjacent vehicles at stages. (B) Allocating jobs to stages For the purpose of balancing loads of processing stages, we adopt the following to allocate jobs to the stages: ORDER: Allocate n jobs to n s, processing stages by an in-order manner , i.e., let l(i) be the index of processing stage allocated job J i by ORDER, it holds that l(i)=n s+1-(i-[(i-1)/n s]n s).(1) The ORDER rule intends to process jobs parallel at stages as many as possible. (C) Scheduling vehicles The following method for scheduling vehicles under ORDER rule is already known: Fig.1 The vehicle ro uting system, PCVRS Fig.2 Mean turnaroun d times by heuristics Unchange: Assign n jobs to n v vehicles such that let k(i) be the i ndex of vehicle processing job J i, then k(i)= i-[(i-1)/n v]n v.(2) In csse of n v≥n s, mod (n v,n s)=0 or n v<n s, mod (n s,n v)=0 (mod(x,y) is the remainder of x/y), the number of interferences between vehicles is minimized at stage S 1 under Unchange sche dules, while in the other cases it is not [Lu et al. (2001a)]. Therefore, in t his paper, we develop a new scheduling method of the vehicles, denoted by Ex change, to modify Unchange schedules. Note展开更多
The qualitative behavior of solutions for a generalized Gause type predator prey system was studied.A large number of biological and bioeconomic models are special cases of this system.The system was investigated in t...The qualitative behavior of solutions for a generalized Gause type predator prey system was studied.A large number of biological and bioeconomic models are special cases of this system.The system was investigated in the region D={(x,y)|x>0,y>0} because of the biological meaning of the system.The authors derived some sufficient conditions for the boundedness of the solutions and the existence of limit cycles of the system,which ensure that the system has at least one limit cycle.The theory of limit sets of autonomous plane systems and the theorem of cycle field of Poincare Bendixson are efficiently employed in the research.The main results and their consequences presented not only generalize some known results,but also improve some corresponding results of other authors.展开更多
该文基于大电网运行实践,聚焦于全网电力平衡资源的统一优化,研究新型电力系统的全网一体化电力平衡(integrated power balancing,IPB)机理。首先,构建IPB的数学模型,其中涉及“平衡区域”、“输电通道”和“输电路径”等关键要素。基...该文基于大电网运行实践,聚焦于全网电力平衡资源的统一优化,研究新型电力系统的全网一体化电力平衡(integrated power balancing,IPB)机理。首先,构建IPB的数学模型,其中涉及“平衡区域”、“输电通道”和“输电路径”等关键要素。基于数学模型,推导IPB的网络方程,用以描述网络结构约束;其次,将电力平衡目标如电力供应和新能源消纳等与网络方程结合,推导作为IPB基本数学原理的动态方程,方程由4种过程形式组成——自然互济供电、成本互济供电、自然互济新能源消纳和成本互济新能源消纳;再次,将实际工程条件引入动态方程,分析总结工程实践用一体化电力平衡基础模式及其衍生的8种子构型;最后,通过实例验证所提理论分析的有效性和意义。展开更多
基金Supported by Scientific Research Fund of Hunan Provincial Education Departmen(t23A0361)。
文摘An evolution inequality of Sobolev type involving a nonlinear convolution term is considered.By using the nonlinear capacity method and the contradiction argument,the non-existence of the nontrivial local weak solution is proved.
基金supported by the National Social Science Fundation(Grant No.21BTJ040)the Project of Outstanding Young People in University of Anhui Province(Grant Nos.2023AH020037,SLXY2024A001).
文摘In this paper,by utilizing the Marcinkiewicz-Zygmund inequality and Rosenthal-type inequality of negatively superadditive dependent(NSD)random arrays and truncated method,we investigate the complete f-moment convergence of NSD random variables.We establish and improve a general result on the complete f-moment convergence for Sung’s type randomly weighted sums of NSD random variables under some general assumptions.As an application,we show the complete consistency for the randomly weighted estimator in a nonparametric regression model based on NSD errors.
基金Project supported by Borujerd Branch,Islamic Azad University,Iran
文摘This study proposes a graphical user interface(GUI) based on an enhanced bacterial foraging optimization(EBFO) to find the optimal locations and sizing parameters of multi-type DFACTS in large-scale distribution systems.The proposed GUI based toolbox,allows the user to choose between single and multiple DFACTS allocations,followed by the type and number of them to be allocated.The EBFO is then applied to obtain optimal locations and ratings of the single and multiple DFACTS.This is found to be faster and provides more accurate results compared to the usual PSO and BFO.Results obtained with MATLAB/Simulink simulations are compared with PSO,BFO and enhanced BFO.It reveals that enhanced BFO shows quick convergence to reach the desired solution there by yielding superior solution quality.Simulation results concluded that the EBFO based multiple DFACTS allocation using DSSSC,APC and DSTATCOM is preferable to reduce power losses,improve load balancing and enhance voltage deviation index to 70%,38% and 132% respectively and also it can improve loading factor without additional power loss.
文摘The time dependent vehicle routing problem with time windows（TDVRPTW） is considered. A multi-type ant system（MTAS） algorithm hybridized with the ant colony system（ACS）and the max-min ant system（MMAS） algorithms is proposed. This combination absorbs the merits of the two algorithms in solutions construction and optimization separately. In order to improve the efficiency of the insertion procedure, a nearest neighbor selection（NNS） mechanism, an insertion local search procedure and a local optimization procedure are specified in detail. And in order to find a balance between good scouting performance and fast convergence rate, an adaptive pheromone updating strategy is proposed in the MTAS. Computational results confirm the MTAS algorithm＇s good performance with all these strategies on classic vehicle routing problem with time windows（VRPTW） benchmark instances and the TDVRPTW instances, and some better results especially for the number of vehicles and travel times of the best solutions are obtained in comparison with the previous research.
文摘This paper discusses an optimization of operating a p ermutation circulation-type vehicle routing system (PCVRS, for short), in w hich several stages are located along by a single loop, and a fleet of vehicles travels on the loop unidirectionally and repeatedly. Traveling on the loop, each vehicle receives an object from the loading stage and then carries it to a cert ain processing stage, or receives an object from a certain processing stage and then carries it to the unloading stage per a turnaround. No passing is allowed f or the vehicles on the loop (from which the system is called permutation, and th is restriction may cause interferences between vehicles). Material handling systems such as PCVRS are actually encountered in flexible man ufacturing systems and in automated storage/retrieval systems. In this paper, we propose a heuristic algorithm for operating the PCVRS, which i ncorporates a new scheduling method for the vehicles with the SPT (shortest proc essing time) numbering of jobs and a round-robin manner of allocating jobs to t he stages, aiming to reduce interferences between the vehicles. We also give num erical results with respect to system performances attained by the heuristic. Description of the system The PCVRS consists of a set of n v vehicles V={V 1,V 2,...,V n v}, a set of n s, processing stages S p={S 1,S 2,...,S n s}, a loading stage S 0 and an unloading stage S n s +1. We denote by S=S p∪{S 0,S n s+l} the set of all the stages. The vehicles travel on a single loop unidirectionany and repeated ly. The system layout is depicted in Fig.1. There is a set of n jobs J={J 1,J 2,...,J n} to be processed b y the vehicles. Each job consists of two tasks: That is, each vehicle receives a n object from S 0 and then carries it to S l with a certain l∈{1,2, ...,n s} (a throw-in job), or receives an object from S l with a certain l∈{1,2,...,n s} and then carries it to S n s+1 (a throw-out job ) per a turnaround. The loop consists of buffer zones BZ(l) and travel zones TZ(l) (see Fig. 1). Each buffer zone BZ(l) is placed in front of stage S l, l=0,1,..., n s, n s+1, in order to avoid a collision between vehicles (i.e., the syste m adopts the so-called zone control strategy). A heuristic algorithm We develop a heuristic algorithm to obtain a good performance for the PCVRS. An operation π={A/B/C} for the PCVRS consists of three decision factors: (A) Numbering jobs Jobs are loaded into S 0 according to an assending order of job numbers. In this paper, we use the following rules to number jobs: SPT: Order jobs in the shortest processing time rule, i.e., P 1≤P 2≤...≤P n for the set of jobs J={J 1,J 2,...,J n}, rather than the FCFS numbering (i.e., number jobs in first-come-first-served order). The SPT rule intends to reduce interferences between two adjacent vehicles at stages. (B) Allocating jobs to stages For the purpose of balancing loads of processing stages, we adopt the following to allocate jobs to the stages: ORDER: Allocate n jobs to n s, processing stages by an in-order manner , i.e., let l(i) be the index of processing stage allocated job J i by ORDER, it holds that l(i)=n s+1-(i-[(i-1)/n s]n s).(1) The ORDER rule intends to process jobs parallel at stages as many as possible. (C) Scheduling vehicles The following method for scheduling vehicles under ORDER rule is already known: Fig.1 The vehicle ro uting system, PCVRS Fig.2 Mean turnaroun d times by heuristics Unchange: Assign n jobs to n v vehicles such that let k(i) be the i ndex of vehicle processing job J i, then k(i)= i-[(i-1)/n v]n v.(2) In csse of n v≥n s, mod (n v,n s)=0 or n v<n s, mod (n s,n v)=0 (mod(x,y) is the remainder of x/y), the number of interferences between vehicles is minimized at stage S 1 under Unchange sche dules, while in the other cases it is not [Lu et al. (2001a)]. Therefore, in t his paper, we develop a new scheduling method of the vehicles, denoted by Ex change, to modify Unchange schedules. Note
文摘The qualitative behavior of solutions for a generalized Gause type predator prey system was studied.A large number of biological and bioeconomic models are special cases of this system.The system was investigated in the region D={(x,y)|x>0,y>0} because of the biological meaning of the system.The authors derived some sufficient conditions for the boundedness of the solutions and the existence of limit cycles of the system,which ensure that the system has at least one limit cycle.The theory of limit sets of autonomous plane systems and the theorem of cycle field of Poincare Bendixson are efficiently employed in the research.The main results and their consequences presented not only generalize some known results,but also improve some corresponding results of other authors.
文摘该文基于大电网运行实践,聚焦于全网电力平衡资源的统一优化,研究新型电力系统的全网一体化电力平衡(integrated power balancing,IPB)机理。首先,构建IPB的数学模型,其中涉及“平衡区域”、“输电通道”和“输电路径”等关键要素。基于数学模型,推导IPB的网络方程,用以描述网络结构约束;其次,将电力平衡目标如电力供应和新能源消纳等与网络方程结合,推导作为IPB基本数学原理的动态方程,方程由4种过程形式组成——自然互济供电、成本互济供电、自然互济新能源消纳和成本互济新能源消纳;再次,将实际工程条件引入动态方程,分析总结工程实践用一体化电力平衡基础模式及其衍生的8种子构型;最后,通过实例验证所提理论分析的有效性和意义。
