论文信息 - Integer linear programming formulation for a vehicle routing problem

Integer linear programming formulation for a vehicle routing problem

Abstract A mixed integer linear programming formulation is given for the vehicle routing problem constrained by vehicle capacity and distance travelled. This corrects an error in the formulation recently proposed by Kulkarni and Bhave.

Louis Caccetta | L. Caccetta | N. Achuthan | Nirmala Achuthan

[1] L. Bodin. ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[2] C. D. J. Waters,et al. Expanding the scope of linear programming solutions for vehicle scheduling problems , 1988 .

[3] Gilbert Laporte,et al. Optimal Routing under Capacity and Distance Restrictions , 1985, Oper. Res..

[4] R. A. Zemlin,et al. Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[5] G. R. Brodie,et al. Integer linear programming formulation for vehicle routing problems , 1988 .

[6] P. Bhave,et al. Integer programming formulations of vehicle routing problems , 1985 .