快递公司选址问题及程序设计摘要快递作为一种快速的运输方式，兴起于20世纪70年代的发达国家。随着经济的发展，中国的快递业进入全面发展阶段，越来越多的快递公司面临公司业务点的选址问题。本文从公司运行成本、经营区的离散度、经营规模适度等角度建立目标函数，从规模约束、经营区互不相交等方面建立约束条件，进而建立了这类问题的数学模型——带有“边界约束”的非线性规划模型。虽然目前关于非线性规划模型已有了许多成熟的算法，如遗传算法、粒子群算法、微粒群算法等。但是，这些算法对处理带“边界约束”的数学模型相当困难。本文不仅根据模型的特征，给出了近似最优解的算法，也分析了主要因素对模型的影响。最后用一个实例展示了模型及算法的实用性。
关键词：选址问题，边界约束，非线性规划模型，算法
Mathematical methods and program designing for express company location problems
Abstract
In 1970s ,expressage rose in developed countries as a faster mean of transportation, while in China it has come into its own with the rapid development of economy ,which made it a difficulty for express companies to shorten their costs by selecting the best site.
In this thesis, in order to solve this problem, a nonlinear programming with the boundary restriction is built. Here, the objective function is establishes from the company operating costs, management area dispersion, scale of operation. And constraint conditions are given at the angle of size constraints and business district. Although there have been many mature algorithms for nonlinear programming model, such as genetic algorithm, the particle swarm optimization algorithm and the particle swarm algorithm, it is difficult to apply these algorithms to solve the mathematical model with boundary constraint. In the thesis we not only presents the algorithm of the approximate optimal solution according to the model, but also analyzes the influence of the main factors in the model. At last, an example is given for demonstration.
Key words:location problem，boundary restriction ，nonlinear programming model，algorithm
*若需了解更多与协助请咨询↓→[电脑QQ][手机QQ]【数据协助】
