Quadratic Programming for the Vehicle Routing Problem

摘要：

The classical capacitated vehicle routing problem (VRP) is discussed in this paper. A quadratic programming formulation for the problem is proposed. Compared with a common mixed integer linear programming (MIP) formulation in the literature, the number of total constraints is significantly reduced through avoiding the subtour elimination constraints. The simplicity of the new model is beneficial for the formulation of more complicated VRP variants. It also introduces the possibility of using the well-known quadratic programming algorithms for solving the vehicle routing problem.

关键词： Vehicle routing problem Quadratic programming

作者: Ping Ji Hongtao Wu Yongzhong Wu

作者单位: Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University,Hung Hom, Kowloon, Hong Kong, China

会议类型: 国际会议

会议名称: The Seventh International Symposium(ISORA08)(第七届国际效力研究及其应用学术会议)

会议地点: 云南丽江

会议语种:英文

页码: 82-90

在线出版日期: 2008-10-31（万方平台首次上网日期，不代表论文的发表时间）