Parallel Construction Heuristic Combined with Constraint Propagation for the Car Sequencing Problem

For the car sequencing（CS） problem, the draw-backs of the ＂sliding windows＂ technique used in the objective function have not been rectified, and no high quality initial solution has been acquired to accelerate the improvement of the solution quality. Firstly, the objective function is improved to solve the double and bias counting of violations broadly discussed. Then, a new method combining heuristic with constraint propagation is proposed which constructs initial solutions under a parallel framework. Based on constraint propagation, three filtering rules are designed to intersecting with three greedy functions, so the variable domain is narrowed in the process of the construction. The parallel framework is served to show its robustness in terms of the quality of the solution since it greatly increases the performance of obtaining the best solution. In the computational experiments, 109 instances of 3 sets from the CSPLib＇ s benchmarks are used to test the performance of the proposed method. Experiment results show that the proposed method outperforms others in acquiring the best-known results for 85 best-known results of 109 are obtained with only one construction. The proposed research provides an avenue to remedy the deficiencies of ＂sliding windows＂ technique and construct high quality initial solutions.

CLASSIFICATION OF BIFURCATIONS FOR NONLINEAR DYNAMICAL PROBLEMS WITH CONSTRAINTS

Bifurcation of periodic solutions widely existed in nonlinear dynamical systems is a kind oftonstrained one in intrinsic quality because its amplitude is always non-negative Classification of the bifurcations with the type of constraint was discussed. All its six types of transition sets are derived, in which three types are newly found and a method is proposed for analyzing the constrained bifurcation.

DEPICT:A High-level Formal Language for Modeling Constraint Satisfaction Problems

The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the fact that constraints are inherently declarative, attention is quickly turning toward developing high-level programming languages within which such problems can be modeled and also solved. Along these lines, this paper presents DEPICT, the language. Its use is illustrated through modeling a number of benchmark examples. The paper continues with a description of a prototype system within which such models may be interpreted. The paper concludes with a description of a sample run of this interpreter showing how a problem modeled as such is typically solved.

Evolutionary Programming for IP/MIP Problems with Linear Constraints

In this paper, we propose a modified evolutionary programming with dynamic domain for solving nonlinear IP/MIP problems with linear constraints, without involving penalty function or any transformation for the problem to a linear model or others. The numerical results show that the new algorithm gives a satisfactory performance in which it works of high speed, and accuracy in IP/MIP problems.

SEQUENTIAL QUADRATIC PROGRAMMING METHODS FOR OPTIMAL CONTROL PROBLEMS WITH STATE CONSTRAINTS

A kind of direct methods is presented for the solution of optimal control problems with state constraints. These methods are sequential quadratic programming methods. At every iteration a quadratic programming which is obtained by quadratic approximation to Lagrangian function and linear approximations to constraints is solved to get a search direction for a merit function. The merit function is formulated by augmenting the Lagrangian function with a penalty term. A line search is carried out along the search direction to determine a step length such that the merit function is decreased. The methods presented in this paper include continuous sequential quadratic programming methods and discreate sequential quadratic programming methods.

Reduction and Analysis of a Max-Plus Linear System to a Constraint Satisfaction Problem for Mixed Integer Programming

This research develops a solution method for project scheduling represented by a max-plus-linear (MPL) form. Max-plus-linear representation is an approach to model and analyze a class of discrete-event systems, in which the behavior of a target system is represented by linear equations in max-plus algebra. Several types of MPL equations can be reduced to a constraint satisfaction problem (CSP) for mixed integer programming. The resulting formulation is flexible and easy-to-use for project scheduling;for example, we can obtain the earliest output times, latest task-starting times, and latest input times using an MPL form. We also develop a key method for identifying critical tasks under the framework of CSP. The developed methods are validated through a numerical example.

THE CHARACTERIZATION OF EFFICIENCY AND SADDLE POINT CRITERIA FOR MULTIOBJECTIVE OPTIMIZATION PROBLEM WITH VANISHING CONSTRAINTS

In this article, we focus to study about modified objective function approach for multiobjective optimization problem with vanishing constraints. An equivalent η-approximated multiobjective optimization problem is constructed by a modification of the objective function in the original considered optimization problem. Furthermore, we discuss saddle point criteria for the aforesaid problem. Moreover, we present some examples to verify the established results.

银行分支机构准入管制放松影响企业多元化经营机理探讨——基于中国城市商业银行分支机构的实证检验

企业多元化经营受益于银行发放多元化经营所需资金贷款,受制于银行发挥债权人治理作用的外部监督。笔者基于资源基础理论和代理理论,以2004—2020年中国沪深A股上市公司为研究样本,结合城市商业银行分支机构数据,利用多元线性回归方法,实证检验了银行分支机构准入管制放松对企业多元化经营是否有影响以及影响的方式、方向和程度。检验结果证实:银行分支机构准入管制放松与企业多元化经营显著正相关;在银行分支机构准入管制放松正向影响企业多元化经营过程中,银行缓解企业融资约束和增加企业管理层攫取私利行为具有中介效应;企业聘请会计师事务所的审计质量和企业的内部控制质量发挥调节作用。本研究尝试性地将银行管制体制改革与企业多元化经营结合起来探究银行分支机构准入管制放松对企业多元化经营的影响机理,在一定程度上拓展了资源基础理论和代理理论的应用边界,丰富了银行管制和企业多元化经营的相关文献,研究结论能够为银行业体制改革和企业多元化经营提供理论依据。

Modified Exact Jacobian Semidefinite Programming Relaxation for Celis-Dennis-Tapia Problem

A modified exact Jacobian semidefinite programming(SDP)relaxation method is proposed in this paper to solve the Celis-Dennis-Tapia(CDT)problem using the Jacobian matrix of objective and constraining polynomials.In the modified relaxation problem,the number of introduced constraints and the lowest relaxation order decreases significantly.At the same time,the finite convergence property is guaranteed.In addition,the proposed method can be applied to the quadratically constrained problem with two quadratic constraints.Moreover,the efficiency of the proposed method is verified by numerical experiments.

A Hybrid Genetic Algorithm for Vehicle Routing Problem with Complex Constraints

Most research on the Vehicle Routing Problem （VRP） is focused on standard conditions, which is not suitable for specific cases. A Hybrid Genetic Algorithm is proposed to solve a Vehicle Routing Problem （VRP） with complex side constraints. A novel coding method is designed especially for side constraints. A greedy algorithm combined with a random algorithm is introduced to enable the diversity of the initial population, as well as a local optimization algorithm employed to improve the searching efficiency. In order to evaluate the performance, this mechanism has been implemented in an oil distribution center, the experimental and executing results show that the near global optimal solution can be easily and quickly obtained by this method, and the solution is definitely satisfactory in the VRP application.

面向复杂物流配送场景的车辆路径规划多任务辅助进化算法

在现代社会中,复杂物流配送场景的车辆路径规划问题(Vehicle routing problem,VRP)一般带有时间窗约束且需要提供同时取送货的服务.这种复杂物流配送场景的车辆路径规划问题是NP-难问题.当其规模逐渐增大时,一般的数学规划方法难以求解,通常使用启发式方法在限定时间内求得较优解.然而,传统的启发式方法从原大规模问题直接开始搜索,无法利用先前相关的优化知识,导致收敛速度较慢.因此,提出面向复杂物流配送场景的车辆路径规划多任务辅助进化算法(Multitask-based assisted evolutionary algorithm,MBEA),通过使用迁移优化方法加快算法收敛速度,其主要思想是通过构造多个简单且相似的子任务用于辅助优化原大规模问题.首先从原大规模问题中随机选择一部分客户订单用于构建多个不同的相似优化子任务,然后使用进化多任务(Evolutional multitasking,EMT)方法用于生成原大规模问题和优化子任务的候选解.由于优化子任务相对简单且与原大规模问题相似,其搜索得到的路径特征可以通过任务之间的知识迁移辅助优化原大规模问题,从而加快其求解速度.最后,提出的算法在京东物流公司快递取送货数据集上进行验证,其路径规划效果优于当前最新提出的路径规划算法.

绿色创新对企业投资效率的影响研究

在我国致力于实现“碳达峰”“碳中和”目标的背景下,绿色创新作为一种新型创新技术,对企业实现高质量发展及可持续发展至关重要。本文以2012—2021年我国A股上市公司为研究样本,实证检验绿色创新对企业投资效率的影响及融资约束与代理问题在其中的作用机制。研究发现,绿色创新能显著提高企业的投资效率,具体表现为抑制过度投资与缓解投资不足。机制检验发现,绿色创新能通过缓解融资约束与降低代理问题两条路径,提高企业的投资效率。异质性分析发现,在非重污染行业以及东部地区,绿色创新对投资效率的提升作用更显著。本文研究有助于推动企业与经济社会可持续发展。

基于离散粒子群算法的管道保温结构优化研究

针对目前管道保温结构优化算法不稳定、结果优化程度不高的问题,建立以经济效益为目标函数,以满足国家散热损失标准等条件为约束函数的离散型数学模型。以BPSO算法为基础改变其位置更新规则,防止种群进化失效;采用自适应权重增加粒子的全局和局部搜索能力;充分利用模拟退火算法的思想避免出现早熟现象。应用改进的算法分别对普通蒸汽管道和核电站的蒸汽管道进行系统仿真实验。结果表明,该算法能够在满足国家散热损失标准等条件下取得最优解,可以为管道保温结构提供合理的优化方案。

带隐藏约束昂贵黑箱问题的自适应代理优化方法

针对带隐藏约束的昂贵黑箱全局优化问题,提出采用自适应转换搜索策略的代理优化方法。在转换搜索子步中采用与已估值点个数相关的标准差在当前最优点附近通过随机扰动生成候选点,以更好地平衡局部搜索和全局搜索。为更好地近似真实黑箱目标函数,采用了自适应组合目标代理模型。在50个测试问题上进行了数值实验,计算结果说明了所提算法的有效性。

考虑个体客户满意度的多车程生鲜品配送路径优化

随着生鲜电商的兴起,生鲜品的道路运输量越来越大,其配送任务越来越复杂,提升客户满意度是生鲜品配送的重要目标组成。文章以一个具有配送自主权的生鲜品供应商为研究对象,以整个计划周期内生鲜品配送的车辆运输成本最小及客户满意度最大为双目标,且客户满意度从顾客的个体视角考虑,构建双目标多车程带时间窗及考虑订单打包时间的车辆路径优化模型。基于ε-约束方法,设计了两阶段变邻域搜索(VNS)和模拟退火(SA)相结合的元启发式算法,基于车辆构造初始路线,并针对性地提出了3点改进措施,包括通过数学性质推导下界、减少求解过程中不必要的搜索空间以及规避求解过程中被支配解的后优化处理。最后,以Solomon标准算例为基础构造算例对所设计的算法进行了计算实验,其求解结果表明:其设计的算法具有有效性,并通过敏感性分析得出相关管理启示。

Numerical Solutions to the Robin Inverse Problem with Nonnegativity Constraints

We present iterative numerical methods for solving the inverse problem of recovering the nonnegative Robin coefficient from partial boundary measurement of the solution to the Laplace equation. Based on the boundary integral equation formulation of the problem, nonnegativity constraints in the form of a penalty term are incorporated conveniently into least-squares iteration schemes for solving the inverse problem. Numerical implementation and examples are presented to illustrate the effectiveness of this strategy in improving recovery results.

求解有服务顺序限制的MDMOVRPTW的IHHO算法

针对有服务顺序限制的带时间窗的多需求多目标车辆路径问题(multi-demand and multi-objective vehicle routing problem with time window,MDMOVRPTW),在考虑多种需求由不同车辆按顺序服务等约束条件的同时,构建了最小化配送成本和最大化客户满意度的多目标模型。根据模型的特点设计了改进的哈里斯鹰优化(improved Harris hawks optimization,IHHO)算法,随机地将种群中部分支配解作为父代解,用临时组合算子和4种交叉算子搜索新解。最后,算例测试结果表明,相较于传统的哈里斯鹰优化算法,IHHO算法的求解性能得到了有效改善,各操作算子中交叉算子2的求解效果最好。将IHHO算法用于实例中,求解结果得到了改善,充分验证了IHHO算法的有效性。

云资源调度的回答集程序描述性求解

针对求解难度为NP完全的基础设施即服务(IaaS)模式云资源调度问题,本文提出一种基于回答集程序(ASP)的描述性优化求解方法,并对其正确性进行分析。首先,把满足虚拟机CPU使用的情况下关闭尽可能多的主机做为减少云平台能耗的方法,将云资源调度问题形式化表述;其次,结合形式化描述以及减少云平台能耗的策略,将云资源调度问题用ASP编码为描述性(优化)问题,并分析其正确性;最后,在公开的PlanetLab数据集上进行实验,结果显示,ASP方法可在保障服务质量的同时减少集群能耗,最高可节能13%以上。这表明ASP方法在云资源调度问题上是有效的,从而提供一种易理解、易修改并能充分利用ASP最新工具成果的有效云资源调度新方法。

基于MILP的轻量级密码算法ACE与SPIX的线性分析

研究了轻量级密码算法ACE与SPIX的线性性质.给出了环型与门组合结构精确的混合整数线性规划下的线性性质刻画,并将算法ACE与SPIX的非线性操作转化为环型与门组合.基于此构建了ACE置换与SLISCP置换的混合整数线性规划下的线性模型,求解模型得到了2至4步ACE置换与2至5步SLISCP置换最优的线性迹.证明了7步、12步ACE置换分别达到了128比特与320比特的安全目标,7步、13步SLISCP置换分别达到了128比特与256比特的安全目标.对于任意步数的ACE置换与SLISCP置换,认证加密算法ACE-AE-128与SPIX均能够抵抗明文处理阶段的线性区分攻击.

两种高效局部搜索算法求解RB模型实例

RB(revised B)模型是一种在约束可满足问题中具备精确相变增长域的随机实例模型,提出两种高效的启发式局部搜索算法用于解决RB模型生成的大值域约束可满足问题。首先为基于权重指导搜索的W-MCH算法,该算法通过约束判断和违反约束数计分来进行搜索,并引入了基于约束违反概率的权重计算公式,根据其关联的约束权重进行修正,再对变量进行迭代调整。然后提出最小化值域的MDMCH算法,该算法通过记录违反约束和逐步消除已违反约束变量的启发式策略来减少搜索空间,并在最小化后的变量域内重新校准变量赋值,进而有效提高算法的收敛速度。此外,还提出了融入模拟退火策略的WSCH和MDSCH算法,这两种算法都能根据变量的表征特点对变量域进行针对性的搜索。实验结果表明,与多种启发式算法相比,这两种算法在精度与时间效率方面均呈现明显提升,在复杂难解的实例中能够提供高效的求解效率,验证了算法的有效性和优越性。