摘要
讨论了一个在竞争环境下使获利最大的竞争选址双层规划模型,其中上层模型做出选址决策,下层模型确定产品的纳什均衡价格。在保证了不合作状态下双方价格均衡解的存在性和唯一性的前提下,设计了求解该模型的选址-定价启发式算法程序。通过贪心算法和交换算法产生禁忌搜索的初始解,设置了合理的禁忌搜索算法参数,最后通过具有一定规模的实例计算,证明了该算法在求解此类问题中的可行性和科学有效性。
In this paper, we discuss a bi-level programming model for facility location strategy and product pricing strategy in order to obtain the best profit in a competitive environment. The upper-level model focuses on location decision, while the lower-level model is used to investigate the Nash equilibrium prices. Based on the existence and uniqueness of a Nash equilibrium price when companies are non-cooperative in the lower-level model, a CLPH（competitive location pricing of heuristic） procedure-in which the initial solution is produced by a greedy add algorithm and a vertex substitution algorithm and the parameters in the Taboo search are set reasonably-has been designed to tackle this problem. Finally, a numerical example is presented to illustrate the feasibility and validity of this algorithm application.
出处
《北京化工大学学报（自然科学版）》
CAS
CSCD
北大核心
2009年第1期108-111,共4页
Journal of Beijing University of Chemical Technology(Natural Science Edition)
基金
国家自然科学基金(70701003)
关键词
竞争选址
双层规划
纳什均衡
禁忌搜索
启发式算法
competitive location
bi-level programming
Nash equilibrium
Taboo search
heuristic algorithm
