摘要
主要研究一类带服务半径的服务站截流选址-分配问题(FCLM).首先提出了考虑服务半径d的FCLM模型,并给出了相应的启发式算法.然而对于很多服务站接受服务的客户分为产生于网络结点的固定需求量和产生于网络路径的过路需求量两大类.因此,随后提出了考虑固定需求量的服务半径D和过路需求量的服务半径d的混合FCLM问题的0-1整数规划模型,给出了启发式算法.
This article considers a class of the flow capturing location-allocation model （FCLM） with service radius. With the assumption that the customer flows at most be serviced for one time, the decision objective for service providers is to find the optimal locations for such service facilities to maximize the number of customers ＂captured＂. This sort of problem is called FCLM. Actually the customer flows on the path can go to the facility with a deviation distance, which can be endured. This paper proposes the FCLM with service radius and gives an heuristic greedy algorithm. For many kinds of facilities, their customers can be divided into two parts ： dedicated-trip demand from the nodes and by-passing flow demand form the paths. Hence, a hybrid FCLM with dedicated-trip demand service radius D and by-passing flow demand service radius d is proposed. A heuristic greedy substitute algorithm presented solves the example network.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2006年第1期117-122,共6页
Systems Engineering-Theory & Practice
基金
国家自然科学基金(70271027)
关键词
服务半径
截流
选址
贪婪算法
service radius
flow capturing
location
greedy algorithm
