Skip to content
naulon

Not checkedNot checked for notices yet.

Heuristički algoritam za projektovanje ruta vozila u transportnom sistemu 'nazovi vožnju' / Heuristic algorithm for static dial-a-ride problem

Gordana Radivojević

Vojnotehnički Glasnik · 2006

doi:10.5937/vojtehg0604465r (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Transportni sistem "Nazovi vožnju" (Dial-a-Ride) oblik je prevoza u kojem prevozilac poseduje vozni park i realizuje prevoz na relacijama i u vreme kako to zahtevaju korisnici. Osnovni problem organizatora prevoza je definisanje ruta i reda vožnje saobraćajnih sredstava, tako da se realizuje skup zahteva za prevoz. U radu je opisan heuristički algoritam za projektovanje ruta i redova vožnje saobraćajnih sredstava za statički slučaj transportnog sistema "Nazovi vožnju". Razvijeni heuristički algoritam ima mogućnost primene u konkretnim uslovima. / Dial-a-Ride system is a way of transport in which a transporter owns a fleet and realizes transport when and where customers ask for it. Different versions of this type of transportation are present in every day practice. The main problem here is route design and scheduling to realize the set of transport requests. In this paper it is described a heuristic algorithm for route design and scheduling for the static Dial-a-Ride problem. The developed algorithm can be applied in real situations.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.