转运(资讯保安)
车辆路径问题
计算机科学
整数规划
布线(电子设计自动化)
运筹学
服务(商务)
数学优化
计算机网络
工程类
业务
算法
数学
计算机安全
营销
作者
Qihuan Zhang,Min Huang,Yang Yu
标识
DOI:10.1109/ccdc.2018.8407173
摘要
This paper addresses the multi-type products collaborative vehicle routing problem with time windows by ways of transshipment (CoVRPTWT). This problem is mainly to solve the cooperation between small and medium-sized logistics enterprises. On the basis of meeting the requirements of customer service time and request, the logistics enterprises cooperate through transshipment to reduce the total cost. A mixed integer linear programming model with constraints of time and request is established to minimize the total cost. Cplex is used to solve the problem. Finally, the computational results indicate that transshipment can efficiently reduce cost and the addition of time windows will increase the cost.
科研通智能强力驱动
Strongly Powered by AbleSci AI