摘要
本文从顾客满意度和成本出发,对航空票务公司免费接送顾客的车次分配和调度问题进行研究,首先分析了票务公司免费接送服务的业务流程;然后给出了基于时间的顾客满意度函数,并建立了在一定顾客满意度下成本最小的车次调度模型;最后利用集划分方法求解该模型。集划分包括以下两步:第一步采用广度优先搜索生成全部车次集;第二步提出了一种启发式算法。通过仿真分析比较,验证了启发式算法的有效性。
New pickup and delivery free service is provided for customers to airport in Flight Ticket Sales Company. The problem arises to schedule these ordered customers into the vehicle such that customers is satisfied while operation cost should be minimum. We use a set partitioning approach for the bus scheduling problem that consists of two steps. The first clustering step identifies segments of possible bus tours such that more than one person is transported at a time; the aim in this step is to enumerate all possible clusters that have the minimal ride time. In the second we have developed a heuristics and adopt the function bintprog of MATLAB 0 - 1 integral programming for the solutions. The computational results show the effectiveness of the heuristics.
出处
《管理工程学报》
CSSCI
北大核心
2010年第3期156-160,共5页
Journal of Industrial Engineering and Engineering Management
基金
国家自然科学基金资助项目(70721001
70625001)
教育部博士点基金和教育部新世纪优秀人才支持计划(NCET-04-280)
关键词
免费接送机场服务
时间满意度
车辆调度问题
集划分
free pick-up to airport service
time satisfaction function
vehicle schedule problem
set partition
