Vehicle Routing Problem Optimization Through Mixed Integer Programming: A Methodology Proposed For Finding The Optimal Solution of The Problem.

Abstract

The mixed integer programming has proven to be an excellent tool for optimizing the vehicle routing problems. The vehicles move from distribution centers of companies to their customers. The trucks carrying out the transport of these goods are limited in number and capacity, and the transportation costs vary between routes and types of trucks. In addition, customers require varying demands for those products. The aim of this paper is to show the difficulties encountered in modeling the vehicle routing problem when mixed integer mathematical programming models are used, and propose a solution methodology to find the optimal solution when the mathematical models used do not provide the optimal solution by themselves.