Vehicle routing problem with load compatibility constraints

Author

Ramachandran, Parthasarathy

Author_Institution

Indian Inst. of Sci., Bangalore, India

fYear

2009

fDate

8-11 Dec. 2009

Firstpage

339

Lastpage

343

Abstract

The major contribution of this paper is to introduce load compatibility constraints in the mathematical model for the capacitated vehicle routing problem with pickup and deliveries. The employee transportation problem in the Indian call centers and transportation of hazardous materials provided the motivation for this variation. In this paper we develop a integer programming model for the vehicle routing problem with load compatibility constraints. Specifically two types of load compatibility constraints are introduced, namely mutual exclusion and conditional exclusion. The model is demonstrated with an application from the employee transportation problem in the Indian call centers.

Keywords

integer programming; transportation; Indian call centers; capacitated vehicle routing problem; conditional exclusion; employee transportation problem; integer programming model; load compatibility constraints; mathematical model; mutual exclusion; Costs; Electronic mail; Flammability; Hazardous materials; Hazards; Linear programming; Mathematical model; Routing; Transportation; Vehicles; Integer programming; Transportation; Vehicle routing problem; load compatibility constraints;

fLanguage

English

Publisher

ieee

Conference_Titel

Industrial Engineering and Engineering Management, 2009. IEEM 2009. IEEE International Conference on

Conference_Location

Hong Kong

Print_ISBN

978-1-4244-4869-2

Electronic_ISBN

978-1-4244-4870-8

Type

conf

DOI

10.1109/IEEM.2009.5373342

Filename

5373342