作者: L. R. Foulds
DOI:
关键词: Set (abstract data type) 、 Heuristic (computer science) 、 Constraint (information theory) 、 Optimality criterion 、 Job shop scheduling 、 Mathematical optimization 、 Routing (electronic design automation) 、 Engineering
摘要: SUMMARY The vehicle scheduling problem is concerned, with routing a fleet of vehicles each capacity constraint and which are based at central depot, to visit set delivery points. optimality criterion most frequently taken as the total distance travelled be minimized. This paper discusses this problem, surveys literature on it presents some new ideas heuristic solution procedures.