0-1规划的连续化解法及其在选址问题中的应用.pdfVIP

0-1规划的连续化解法及其在选址问题中的应用 C O N T I N U O U S A L G O R I T H M T O 0-1 P R O G R A M M I N G A N D A P P L I C A T I O N S O N L O C A T I O N P R O B L E M A B S T R A C T Location Problem is one of the classic operations research and is usually formulated as a typical 0-1 linear programming. Due to its combinatorial nature, it has rare effective algorithms for solving large scale problems al­ though various algorithms have been put forward. This paper first converts the original linear 0-1 model to a non-smooth dual program by using la- grangian relaxation method and then obtains a smoothing algorithm by employing the aggregate function. Its application to examples of the loca­ tion problem verify the effectiveness of proposed algorithm. The main contents are organized as follows: In chapter 1, this paper introduced three kinds of basic location prob­ lems and their 0-1 programming models. In chapter 2, some algorithms for 0-1 programming problem are intro­ duced. In chapter 3, it is devoted mainly to the smoothing algorithm for linear 0-1 programming, and its potential use for nonlinear 0-1 programming is also explored. In chapter 4, the smoothing algorithm is applied to two location prob­ lems, thereby its effectiveness is verified. K E Y W O R D S : Location Problem, 0-1 Programming, Lagrangian Relaxation, Smoothing algorithm ii 河北工业大学硕士学位论文 目 录 中 © 摘 要 i = © 摘 要 ii 辟 麵 v 第 一 章 基 于 0-1规 划 的 选 址 问 题 简 介 1 § 1 - 1 P -中位问题 1 § 1 - 2 P -中 心 问题2 § 1 — 3 覆盖问题 3 § 1 — 4 本 章小结 4 第 二 章 0-1