A Petri net model for vehicle scheduling problem

  • Corina Dima Dunarea de Jos University of Galati
Keywords: Petri nets, vehicle scheduling problem, modelling


Vehicle scheduling problem consists in assigning vehicles to a set of time-tabled trips, wishing to minimize the objective cost function. Two aprroaches of the problem were studied: single-depot vehicle scheduling problem (SDVSP) and multiple-depot vehicle scheduling problem (MDVSP). There are known several methos of solving this problem based mainly on liniar programming, branch and bound, graph colouring thechniques. SDVSP is solvable in polynomial time, while MDSVP is NP hard. The main propose of this paper is to present a model based on Petri nets for the vehicle sceduling problem. We defined priced timed workflow nets as a suitable model for SDVSP. We tried to emphasize the advantages of using Petri nets in order to describe this kind of planning problems.

How to Cite
Dima, C. (2022) “A Petri net model for vehicle scheduling problem”, Analele Universității ”Dunărea de Jos” din Galați. Fascicula II, Matematică, fizică, mecanică teoretică / Annals of the ”Dunarea de Jos” University of Galati. Fascicle II, Mathematics, Physics, Theoretical Mechanics, 45(2), pp. 110-114. doi: https://doi.org/10.35219/ann-ugal-math-phys-mec.2022.2.11.

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.