首页 | 本学科首页   官方微博 | 高级检索  
     

基于量子粒子群求解多制程订单选择问题
引用本文:王 桢,黄 磊. 基于量子粒子群求解多制程订单选择问题[J]. 计算机工程与应用, 2015, 51(15): 236-239
作者姓名:王 桢  黄 磊
作者单位:北京交通大学 经济管理学院,北京 100082
摘    要:针对订单选择问题,考虑订单具有不同制程的特征,建立了以总收益为目标的混合整数非线性规划模型。以量子粒子群优化算法为框架进行求解,采用基于排序的粒子编码方案表达0-1变量和整数变量,提出四种种群初始化策略以便提高求解质量,并在迭代过程中对不可行解进行修复。通过对比验证,结果表明模型和算法可行、有效。

关 键 词:订单选择  多制程  量子粒子群  

Quantum PSO algorithm for order selection problem with multiple process routes
WANG Zhen,HUANG Lei. Quantum PSO algorithm for order selection problem with multiple process routes[J]. Computer Engineering and Applications, 2015, 51(15): 236-239
Authors:WANG Zhen  HUANG Lei
Affiliation:School of Economics and Management, Beijing Jiaotong University, Beijing 100082, China
Abstract:Considering the characteristic of multiple process routes, this paper focuses on the order selection problem. A mixed integer non-linear programming model is built with objective of maximizing the total profits. A quantum-behaved PSO-based algorithm is employed as solution mainframe in which a sequence-based particle coding solution is designed to represent decision variables and integer variables and four population initiation strategies are proposed to improve the solution quality. A repair mechanism for infeasible solutions is adopted in iteration. By computational comparison tests, it can be proven that the model and algorithm are feasible and effective.
Keywords:order selection  multiple process routes  Quantum-behaved Particle Swarm Optimization(QPSO)  
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号