卡车
任务(项目管理)
匹配(统计)
集合(抽象数据类型)
计算机科学
联盟
运输工程
模拟
工程类
汽车工程
数学
地理
统计
考古
程序设计语言
系统工程
作者
Mei Lin Feng,Yaorong Cheng
标识
DOI:10.1016/j.aej.2020.05.015
摘要
This paper mainly proposes and solves a two-phase truck-cargo (T-C) matching model for truck alliance and task set in drop-and-pull (D-P) transport. Firstly, the candidate trucks were selected for each task through feature matching between the set of trucks and the set of tasks. Next, the trucks were grouped into a truck alliance; the demand-capacity fitness (DCF) between the truck alliance and task set was computed based on the demand vector of the task set and the demand vector of the truck alliance; a T-C matching model for truck alliance and task set was established to maximize the DCF. Finally, the GA was introduced to solve the proposed model on MATLAB with and without truck alliance. The solving results show that the truck alliance can effectively improve the DCF, and optimize the allocation of social resources.
科研通智能强力驱动
Strongly Powered by AbleSci AI