The complexity of cost constrained vehicle scheduling problem

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Niksirat Malihe; HASHEMI SEYED NASER

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: AUT Journal of Mathematics and Computing Year:2021 | Volume:2 | Issue:1 Page(s): 109-115

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

The complexity of cost constrained vehicle scheduling problem

Author(s)

Niksirat Malihe | HASHEMI SEYED NASER | Issue Writer Certificate

Keywords

Vehicle scheduling prob-lem

Fixed job scheduling

NP-complete

Approximation algorithm

APX

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 di, erent time processing cost. The goal of this problem is to , nd 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.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Niksirat, Malihe, & HASHEMI, SEYED NASER. (2021). The complexity of cost constrained vehicle scheduling problem. AUT JOURNAL OF MATHEMATICS AND COMPUTING, 2(1), 109-115. SID. https://sid.ir/paper/1043865/en

Vancouver: Copy

Niksirat Malihe, HASHEMI SEYED NASER. The complexity of cost constrained vehicle scheduling problem. AUT JOURNAL OF MATHEMATICS AND COMPUTING[Internet]. 2021;2(1):109-115. Available from: https://sid.ir/paper/1043865/en

IEEE: Copy

Malihe Niksirat, and SEYED NASER HASHEMI, “The complexity of cost constrained vehicle scheduling problem,” AUT JOURNAL OF MATHEMATICS AND COMPUTING, vol. 2, no. 1, pp. 109–115, 2021, [Online]. Available: https://sid.ir/paper/1043865/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops