摘要
将多车场车流分配问题等价为一个广义指派问题，然后用ＳＡ算法将其分解为单车场问题，最后用修正的Ｃｌａｒｋｅ－Ｗｒｉｇｈｔ启发式算法给出单车场问题的所有巡回路线．
This paper formulates the multipledepot vehicle scheduling problem (MDVSP)as a equivalent generalized assignment problem(GAP), and then decomposes MDVSP into a singledepot problem. Finally, ClarkeWright algorithm is revised and then used to solve the singledepot problem.
出处
《西安交通大学学报》
EI
CAS
CSCD
北大核心
1997年第12期111-116,共6页
Journal of Xi'an Jiaotong University
