.png){kind=icon}
返回
Two phase algorithms for the bi-objective assignment problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2006.12.054.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present several algorithms for the bi-objective assignment problem. The algorithms are based on the two phase method, which is a general technique to solve multi-objective combinatorial optimisation (MOCO) problems. We give a description of the original two phase method for the bi-objective assignment problem, including an implementation of the variable fixing strategy of the original method. We propose several enhancements for the second phase, i.e., improved upper bounds and a combination of the two phase method with a population based heuristic using path relinking to improve computational performance. Finally, we describe a new technique for the second phase with a ranking approach, which outperforms all other tested algorithms. All of the algorithms have been tested on instances of varying size and range of objective function coefficients. We discuss the results obtained and explain our observations based on the distribution of objective function values. (C) 2007 Elsevier B.V. All rights reserved.
Keyword:
multi-objective optimisation
integer programming
assignment problem
two phase method
heuristic
path relinking
efficient solution
ranking algorithm
combinatorial optimization
metaheuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
A branch and bound algorithm for mixed zero-one multiple objective Linear programming零一多目标混合线性规划的分支定界算法
PREAI
分享收藏
查看更多内容