基于客户需求的现金押运路线问题研究  

The Cash-in-transit Vehicle Routing Problem with Customer Denomination Demand

作　　者：徐国勋[1] 李妍峰[1,2] 李军[1] 

机构地区：[1]西南交通大学经济管理学院,四川成都610031 [2]西南交通大学服务科学与创新四川省重点实验室,四川成都610031

出　　处：《信息系统学报》2017年第1期72-83,共12页China Journal of Information Systems

基　　金：国家自然科学基金项目(71571150,71361006);教育部人文社会科学研究项目(14YJA630026);四川省哲学社会科学重点研究基地项目(QGXH15-05);中央高校基本科研业务费项目(26815WCX03);成都市科技局项目(2015-RK00-00038-ZF);四川省科技厅项目(2017JY0225)

摘　　要：本文以现金物流为研究背景,不同于以往对客户需求的研究,提出了一类考虑客户券别要求的现金押运路线问题,并以现金券别均衡和运输成本减少为目标,建立了相应的混合整数规划模型。根据模型的性质,设计了一种基于局部搜索和多样性管理机制的遗传算法进行求解。数值实验对模型特性和算法性能进行了分析,结果表明券别因素增加了运输成本,影响了押运路线,改进的遗传算法能求解更大规模的问题,得到质量较好的解。Based on cash logistics problem, different from the previous researches focusing on arriving on schedule and meeting demand, this paper proposes a kind of vehicle routing problem by considering cash denominations, and presents an integer programming formulation to balance cash denominations and reduce transportation costs. According to the characteristics of the model, this paper develops a genetic algorithm with efficient local search based improvement heuristics and diversity management mechanism. The numerical studies are adopted to analyze problem characteristics and the method performance. The results reveal that cash factors increase the transportation costs, change the transportation routing. The improvement genetic algorithm can solve much larger problem and produce high quality solutions.

关 键 词：现金物流 客户需求 券别均衡 车辆路径问题 遗传算法 

分 类 号：F253.4[经济管理—国民经济]