Integer programming formulations of vehicle routing problems

Various mathematical formulations are available for situations represented by vehicle routing problems. The assignment-based integer programming formulations of these problems are more common and easy to understand. Such formulations are discussed in this paper and a much simpler formulation for the...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 20; no. 1; pp. 58 - 67
Main Authors Kulkarni, R.V., Bhave, P.R.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.04.1985
Elsevier
Elsevier Sequoia S.A
SeriesEuropean Journal of Operational Research
Subjects
Applied sciences
assignment programming
Combinatorial analysis
Exact sciences and technology
Integer programming
Linear programming
Mathematical analysis
Miscellaneous
Operational research and scientific management
Operational research. Management science
Operations research
optimization
Routing
Scheduling
Traveling salesman problem
Vehicles
integer programming
assignment programming
optimization
Combinatorial analysis
Assignment
Integer programming
Transportation problem
Combinatory problem
Travelling salesman problem
Optimization
Vehicle dispatching problem
Mathematical programming
Online AccessGet full text

Cover

More Information
Summary:Various mathematical formulations are available for situations represented by vehicle routing problems. The assignment-based integer programming formulations of these problems are more common and easy to understand. Such formulations are discussed in this paper and a much simpler formulation for the vechicle routing problem is presented for the case, when all the vehicles have the same load capacity and maximum allowable cost per route.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(85)90284-X