| 数学规划与约束规划整合下的多目标分组排序问题研究 |
| |
| 引用本文： | 龚晶. 数学规划与约束规划整合下的多目标分组排序问题研究[J]. 运筹学学报, 2016, 20(1): 61-74. DOI: 10.15960/j.cnki.issn.1007-6093.2016.01.006 |
| |
| 作者姓名： | 龚晶 |
| |
| 作者单位： | 1. 暨南大学应急管理学院，广州 510632 |
| |
| 基金项目： | 国家自然科学基金(No. 71401062)；广东省自然科学基金(No. s2013010014179) |
| |
| 摘 要： | 分组排序问题属于NP-难题, 单纯的数学规划模型或约束规划模型都无法在有效时间内解决相当规模的此类问题. 控制成本、缩短工期和减少任务延迟是排序问题的三个基本目标, 在实际工作中决策者通常需要兼顾三者, 并在 三者之间进行权衡. 多目标分组排序问题 的研究增强了排序问题的实际应用价值, 有利于帮助决策者处理复杂的多目标环境. 然而, 多目标的引入也增加了问题求解难度, 针对数学规划擅长寻找最优, 约束规划擅长排序的特点, 将两类方法整合起来, 提出一个基于Benders分解算法, 极大提高了此类问题的求解 效率.
|
| 关 键 词： | 多目标分组排序 数学规划 约束规划 Benders分解算法 |
| 收稿时间： | 2014-11-19 |
Integration of mathematical programming with constraint programming for multi-objective planning and scheduling |
| |
| GONG Jing. Integration of mathematical programming with constraint programming for multi-objective planning and scheduling[J]. OR Transactions, 2016, 20(1): 61-74. DOI: 10.15960/j.cnki.issn.1007-6093.2016.01.006 |
| |
| Authors: | GONG Jing |
| |
| Affiliation: | 1. School of Emergency Management, Jinan University, Guangzhou 510632, China |
| |
| Abstract: | Planning and scheduling, a NP-hard problem, can be viewed as a decision-making process of allocating limited resources to tasks over time with the goal of optimizing a certain objective. Neither mathematical programming nor constraint programming can solve it in the reasonable time. Minimum cost, minimum makespan and minimum tardiness are three classical objectives for this problem. The requirements from a real world application might be that several goals need to be achieved simultaneously. Based on Benders decomposition approach, this paper proposed an algorithm integrating mathematical programming and constraint programming for solving multi-objective planning and scheduling. |
| |
| Keywords: | multiple-objective planning and scheduling mathematical programming constraint programming Benders decomposition |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《运筹学学报》浏览原始摘要信息 |
|
点击此处可从《运筹学学报》下载全文 |
|
