位置：成果数据库 > 期刊 > 期刊详情页
Pareto局部搜索算法的改进
  • ISSN号：1672-4143
  • 期刊名称：莆田学院学报
  • 时间：2012
  • 页码：47-52
  • 分类：TP301.6[自动化与计算机技术—计算机系统结构;自动化与计算机技术—计算机科学与技术]
  • 作者机构：[1]福州大学数学与计算机科学学院,福建福州350108
  • 相关基金：国家自然科学基金资助项目（61170308）
  • 相关项目：超大规模集成电路布局的ell-1模优化模型及其算法研究
作者： 郭敏|朱文兴|
关键词： 多目标组合优化, Pareto局部搜索, PARETO最优解, multi-objective combinatorial optimization, Pareto Local Search, Pareto optimal solution
中文摘要：

针对一个Pareto局部搜索（PLS）算法在解决多目标组合优化问题中所得到的解集与初始点的选取有关,提出该算法的改进。改进算法从初始解开始进行PLS搜索产生一组改进解集VF,然后对VF中的所有解再进行PLS搜索,如此重复直到满足终止条件。实例计算表明,PLSⅠ算法和算法Ⅱ能得到很好的解且解的质量优于PLS算法。

英文摘要：

The Pareto Local Search（PLS） algorithm is a novel method in multi-objective combinatorial optimization,which searches for a multi-objective local optimal solution set from an initial solution.To improve the algorithm,we take the solutions in a multi-objective local optimal solution set as initial solutions,and further search for a multi-objective local optimal solution set,until a stopping criterion is satisfied.Computational tests on several instances demonstrate the effectiveness of the improved algorithm.

同期刊论文项目
超大规模集成电路布局的ell-1模优化模型及其算法研究
期刊论文 48 会议论文 1 获奖 1
同项目期刊论文
A GRASP algorithm for multi-objective circuit partitioning
A discrete dynamic convexized method for the max-cut problem
An analytical placer for VLSI standard cell placement
A derivative-free variant called DFSA of Dekkers and Aarts' continuous simulated annealing algo
VLSI电路划分问题的分散搜索算法
A memetic algorithm for hardware software partitioning
A discrete dynamic convexized method for VLSI circuit partitioning
An alternating direction method for nash equilibrium of two-person games with alternating offers
A penalty function-based differential evolution algorithm for nonlinearly constrained global optimiz
An effective placer for large-scale mixed-size circuit placement
Combining clustered adaptive multi-start and discrete dynamic convexized methods for the max-cut pro
A placement flow for very large-scale mixed-size circuit placement
多维背包问题的变邻域填充函数算法
求解VLSI不可二划分布图规划问题的混合遗传算法
A method for detecting community structure in complex networks  
一种用于并行电路仿真的电路划分算法
A penalty decomposition method for the optimization problem with two $l_0$ norm constraints
求解VLSI标准单元布局问题的增强型遗传模拟退火算法
Solving the weighted MAX-SAT problem using the dynamic convexized method
A partial inexact alternating direction method for structured variational inequalities
VLSI等宽标准单元阵列布局问题的一个高效遗传算法
On a local search algorithm for the capacitated max-k-cut problem
A tabu search-based memetic algorithm for hardware/software partitioning
An augmented Lagrangian method for VLSI global placement
Nesterov's smoothing and excessive gap methods for an optimization problem in VLSI placement
An efficient memetic algorithm for solving the max-bisection problem
Speeding up a memetic algorithm for the max-bisection problem
An improvement of the penalty decomposition method for sparse approximation
Nonsmooth optimization method for VLSI global placement
A proximal alternating direction method of multipliers for a minimization problem with nonconvex con
The robust constant and its applications in random global search for unconstrained global optimizati
An effective discrete dynamic convexized method for solving the winner determination problem
The placement model and its nonlinear placement solver for VLSI global placement
A heuristic algorithm for the strip packing problem
一种求解最大二等分问题的分散搜索算法
求解可分离凸优化问题的非精确混合分裂算法
最优冲突回避码的具体构造
VLSI标准单元阵列布局问题的一个高效遗传算法
码重为3和7的最优光正交码的具体构造
一种求解同时博弈Nash平衡问题的非线性Jacobi算法
A HOMOTOPY-BASED ALTERNATING DIRECTION METHOD OF MULTIPLIERS FOR STRUCTURED CONVEX OPTIMIZATION＊t
期刊信息
  • 《莆田学院学报》
  • 主管单位:
  • 主办单位:莆田学院
  • 主编：宋一然
  • 地址：福建莆田市城厢区学园中街1133号
  • 邮编：351100
  • 邮箱：ptxyxb@163.com
  • 电话：0594-2680423
  • 国际标准刊号：ISSN：1672-4143
  • 国内统一刊号：ISSN：35-1261/Z
  • 邮发代号:
  • 获奖情况:
  • 国内外数据库收录:
  • 中国国家哲学社会科学学术期刊数据库
  • 被引量:2553