A Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem

Authors

1 Assistant Professor, Department of Mathematics, Faculty of Science, Bu-Ali Sina University, Hamedan, Iran

2 Assistant Professor, Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran

3 Associate Professor, Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran

Abstract

The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after serving the last customer. Because of its numerous applications in industrial and service problems, a new model of the HFFOVRP based on mixed integer programming is proposed in this paper. Furthermore, due to its NP-hard nature, an ant colony system (ACS) algorithm was proposed. Since there were no existing benchmarks, this study generated some test problems. From the comparison with the results of exact algorithm, the proposed algorithm showed that it can provide better solutions within a comparatively shorter period of time.

Keywords