The complexity of cost constrained vehicle scheduling problem
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 formula...
| Hlavní autoři: | , |
|---|---|
| Médium: | Článek |
| Jazyk: | English |
| Vydáno: |
Amirkabir University of Technology
2021-02-01
|
| Edice: | AUT Journal of Mathematics and Computing |
| Témata: | |
| On-line přístup: | https://ajmc.aut.ac.ir/article_4274_68f3cbb47d8809e62a4acbba2ee0cc75.pdf |
| Shrnutí: | 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. |
|---|---|
| ISSN: | 2783-2449 2783-2287 |