Transportation Problem Model Supplemented with Optimisation of Vehicle Deadheading and Single Depot Parking

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27230%2F17%3A10237054" target="_blank" >RIV/61989100:27230/17:10237054 - isvavai.cz</a>

Result on the web

<a href="http://fim2.uhk.cz/mme/conferenceproceedings/mme2017_conference_proceedings.pdf" target="_blank" >http://fim2.uhk.cz/mme/conferenceproceedings/mme2017_conference_proceedings.pdf</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Transportation Problem Model Supplemented with Optimisation of Vehicle Deadheading and Single Depot Parking

Original language description

The transportation problem belongs to one of specialized problems of operations research. Its basic form is devoted to optimisation of transportation plans – how to supply customers from storehouses with homogeneous types of consignments. Optimisation criterions which are most often used are the total transportation costs or the total covered distance. In practice, we can find many possible applications of the transportation problem. For example, in rail transport the transportation problem can be applied in optimisation of capacity smoothing, in road transport in optimisation of transportation of empty containers between combined transport terminals and their customers and so on. To fulfil each transportation plan, we need some vehicles, the vehicles are assigned to a depot (or depots) where they are parked. The transportation plan usually consists of three types of trips. The first type trips are represented by the trips when the vehicles are loaded (the productive trips). The trips of the second and third type are non-productive (deadheading). The second type trips correspond to the trips of the empty vehicles going from the places of their unloading to the places where the vehicles are loaded again. The third type trips are the trips between the vehicle depots and the first loading places or the last places of unloading and the depots. However, the basic model of the transportation problem does not consider these second and third type trips. An isolated solution for the individual types of the trips of such transportation problem is not suitable because decomposition does not assure optimality of such solution. The presented article presents a model in which all the mentioned trip types are mutually interconnected. That means a solution got by the mathematical model is optimal. The article is focused on an example with any number of the vehicles, all the vehicles have the same depot where they are parked and the capacity of all the vehicles is assumed to be 1.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

20104 - Transport engineering

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2017

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Mathematical Methods in Economics: MME 2017 : 35th international conference : book of abstracts : Hradec Králové, Czech Republic, September 13th-15th, 2017

ISBN

978-80-7435-677-3

ISSN

—

e-ISSN

neuvedeno

Number of pages

6

Pages from-to

789-794

Publisher name

Gaudeamus

Place of publication

Hradec Králové

Event location

Hradec Králové

Event date

Sep 13, 2017

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

—