We used the well-known set covering problem (SCP) to model the vehicle routing problem and developed a Lagrangian relaxation based heuristics.

• 本研究将车辆路线问题转以集合涵盖问题描述，再以常用之拉氏松弛法为基础，结合变数产生法之观念来设计一启发式演算法。