The complexity of cost constrained vehicle scheduling problem

Document Type : Original Article

Authors

1 Department of Computer Science, Faculty of Computer and Industrial Engineering, Birjand University of Technology, Birjand, Iran

2 Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran

10.22060/ajmc.2021.19454.1046

Abstract

This paper considered the cost constrained vehicle scheduling problem under the constraint that the total number of vehicles is known in advance. Each depot has a different time processing cost. The goal of this problem is to find a feasible minimum cost schedule for vehicles. A mathematical formulation of the problem is developed and the complexity of the problem when there are more than two depots is investigated. It is proved that in this case, the problem is NP-complete. Also, it is showed that there is not any constant ratio approximation algorithm for the problem, i.e., it is in the complexity class APX.

Keywords

Main Subjects


Volume 2, Issue 1
Winter and Spring 2021
Pages 109-115
  • Receive Date: 04 January 2021
  • Revise Date: 26 January 2021
  • Accept Date: 28 January 2021