A Study of Grouping Heuristicson Vehicle Scheduling ProblemBased on Changeable Expenditure Coefficient Model

Yong Zeng (Tsinghua University, Beijing)
Da-Cheng Liu (Tsinghua University, Beijing)
Ju-Xuan Li (Military Transportation Academy, Tianjin)
Xiang-Yu Hou (Tsinghua University, Beijing)

Indonesian Journal of Electrical Engineering and Computer Science
Vol 11, No 1: January 2013

A kind of vehicle scheduling problem(VSP) with non-full load and combined pick-up and delivery is studied， a changeable expenditure coefficient model according to the actual load is made，and grouping heuristicsalgorithmunder restrictions of vehicleload capacity、working time and mileage is designed to minimize the number of vehicle、the distance of empty load and the useless freight turnover．By programming and calculating，an example proves the algorithm is feasible and effectual. DOI: http://dx.doi.org/10.11591/telkomnika.v11i1.1913