An approximation algorithm for the location of dairy enterprises under time constraints
An approximation algorithm for the location of dairy enterprises under time constraints
复制标题
时间约束下乳品企业选址的近似算法
DOI：
10.1016/j.ejor.2006.09.048
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
B. Manos
中科院分区：
文献类型：
--
作者：
J. Papathanasiou;B. Manos
设施选址问题是乳品企业战略规划的重要组成部分。这种长期投资的决策过程相当复杂，其中涉及的许多问题属于NP - Hard类算法，因此试图对该问题进行数学建模的运营研究人员面临的挑战是显著的。在过去几年中出现了一些模型，试图找到解决问题的办法。本文介绍了一个饱和竞争市场的模型，其中包括一个高的投资风险，以及一个小的利润率的错误决定的新来者。时间是一个关键因素，特别是对于生命周期有限的敏感产品。使用近似算法，然后将解与最佳解进行比较。在算法的设计和实现过程中，重点讨论了软件程序的运行时间。
The facility location problem constitutes a major part of the strategic planning of a dairy enterprise. The decision making process for such a long term investment is rather complicated, with many of the issues involved belonging to the NP – Hard class of algorithms and therefore the challenge for operational researchers who attempt to mathematically model the problem is significant. A number of models have appeared in the last few years in an attempt to find a solution to the problem. This paper introduces a model pertaining to saturated and competitive markets, which include a high investment risk as well as a small margin for incorrect decisions of the newcomers. Time is a crucial element, especially for sensitive products with a limited life span cycle. An approximation algorithm is used and the solution is then compared with the optimal one. Emphasis was given to the running time of the software program, both in the designing and the implementation of the algorithm.