以航空票务公司免费接送服务为背景,针对其业务流程中的车次分配与调度问题建立以最小化成本为目标的0—1混合整数规划模型.该模型同时考虑了顾客满意度和司机满意度,将二者作为模型的约束条件,并使用满意度函数来定量化描述满意度这一定性因素.通过分别调节模型中顾客和司机的满意度期望值,可以得到不同满意度下的近似最小成本.根据问题自身的两个特点,提出一种基于排列的聚类优先启发式算法,并且与现有的类似算法进行比较,说明了算法的有效性.最后给出了一种确定发车时间范围的方法,以提高决策的灵活性和实用性.
Under the background of free pickup and delivery service in ticket sales company, a 0-1 mixed integer programming model with the objective of minimizing costs is established in point of the vehicle allocation and scheduling problem in the service' s process. Customer satisfaction and driver satisfaction are considered simultaneously as constraints, and the qualitative factor of satisfaction is quantified by satisfaction degree function. Through adjusting the expectation level of customer and driver respectively, near-minimized costs under different satisfaction levels are obtained. According to two distinctive characteristics of the problem, a permutation-based cluster priority heuristics ( PB- CPH) is developed, and it is compared with existing similar algorithms to verify its effectiveness. Finally, a method of setting the range of start-up time is proposed, which can increase flexibility and practicability of the decision.