| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Search the digital library catalog Help

Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 6 / 6
First pagePrevious page1Next pageLast page
1.
2.
3.
An optimal permutation routing algorithm for full-duplex hexagonal mesh networks
Ignasi Sau Walls, Janez Žerovnik, 2006

Abstract: In the permutation routing problem, each processor is the origin of at most one packet and each processor is the destination of no more than one packet. We study this problem in an hexagonal network (that is, a finite convex subgraph of a triangular grid), a widely used network in practical applications. We use the addressing scheme described by F.G. Nocetti, I. Stojmenovic and J. Zhang (2002, IEEE Trans. on Parallel and Distrib. Systems). In this paper, a distributed optimal routing algorithm for full-duplex hexagonal mesh networks is presented. Furthermore, we prove that this algorithm is oblivious and translation invariant.
Keywords: mathematics, hexagonal networks, permutation routing, shortest path, distributed algorithm, communication networks, oblivious algorithm
Published: 10.07.2015; Views: 390; Downloads: 21
URL Link to full text

4.
GHG emissions reduction based on a heuristic optimization approach
Dejan Dragan, Klemen Prah, Tomaž Kramberger, Maja Fošner, 2013, published scientific conference contribution

Abstract: Since the transport causes about 26% of global CO2 emissions, the need to reduce greenhouse gas emissions (GHG) is becoming increasingly necessary. To achieve this objective, several approaches were adopted, like for example the employment of alternative sustainable technologies, or the enforcement of changes in driving skills. In contrast with this kind of approaches, an interesting approach is to reduce the vehicle miles of travel (VMT). In this paper, the concept of VMT reduction based on a heuristic optimization approach is introduced. The suitability of this concept has been tested for the School Bus Routing Problem (SBRP). Working mechanisms of the adopted heuristic optimization algorithms are briefly explained. As can be seen from the results, the optimization of bus stops, bus routes and driving schedules can significantly reduce the amount of VMT and consequently the amount of CO2 emissions.
Keywords: transport planning, environment, heuristic optimization approach, school bus routing problem
Published: 10.07.2015; Views: 714; Downloads: 16
URL Link to full text

5.
An optimal permutation routing algorithm on full-duplex hexagonal networks
Ignasi Sau Walls, Janez Žerovnik, 2008, original scientific article

Abstract: In the permutation routing problem, each processor is the origin of at most one packet and the destination of no more than one packet. The goal is to minimize the number of time steps required to route all packets to their respective destinations, under the constraint that each link can be crossed simultaneously by no more than one packet. We study this problem in a hexagonal network, i.e. a finite subgraph of a triangular grid, which is a widely used network in practical applications. We present an optimal distributed permutation routing algorithm for full-duplex hexagonal networks, using the addressing scheme described by Nocetti et al. Furthermore, we prove that this algorithm is oblivious and translation invariant.
Keywords: mathematics, hexagonal networks, permutation routing, shortest path, distributed algorithm, communication networks, oblivious algorithm
Published: 10.07.2015; Views: 406; Downloads: 66
.pdf Full text (535,46 KB)
This document has many files! More...

6.
Študija o stroškovnem vidiku smiselnosti ukinitve skladišča v hčerinski družbi ETI Madžarska podjetja ETI d.d.
Katja Plesnik, 2018, master's thesis/paper

Abstract: Skladišča podjetjem služijo kot blažilci negotovosti materialnega toka, ki kljub zastojem v proizvodnji in transportu omogočajo pravočasno dostavo blaga končnim odjemalcem. S tem podjetja dvigujejo zadovoljstvo svojih končnih odjemalcev s poslovanjem podjetja in preprečujejo beg h konkurenci. Prav zaradi teh razlogov je odločitev o ukinitvi skladišča strateškega pomena in jo je potrebno podrobno analizirati. V magistrskem delu smo analizirali stroškovni vidik smiselnosti ukinitve skladišča ETI HU, saj le-to podjetju trenutno predstavlja najbolj pereč problem. Raziskave smo se lotili z dvostopenjskim procesom reševanja problema, kjer smo v prvi fazi izdelali simulacijski model poslovanja podjetja s skladiščem ETI HU, v drugi fazi pa smo izdelali simulacijsko-optimizacijski model za neposreden transport blaga grosistom na Madžarskem z novim manjšim optimalno upravljanim skladiščem v matičnem podjetju. Na podlagi razvitih modelov smo nato oblikovali dve stroškovni funkciji, s katerimi smo izračunali celotne stroške poslovanja podjetja, tako v trenutni, kot tudi v simulirani situaciji. Stroškovna funkcija je sestavljena iz treh glavnih kategorij stroškov, in sicer letnih stroškov priprave blaga na odpremo v podjetju, letnih stroškov celotnega transporta in letnih stroškov skladiščenja. Simulacijske modele smo oblikovali v programskem okolju Netlogo, izračune stroškov pa smo zaradi njihove kompleksnosti sprogramirali v programu Matlab. Čeprav smo na stroške gledali skozi izračunana matematična upanja, predvsem pri izračunu stroškov skladiščenja, in je končen rezultat neka groba ocena skupnih stroškov poslovanja podjetja, lahko brez večjih tveganj trdimo, da so dobljeni rezultati dovolj dobri za sprejemanje tako strateško pomembnih odločitev.
Keywords: skladišče, transport, simulacijski model, stroškovni vidik, optimalno upravljanje zalog, »Inventory routing« problem, ETI d. d.
Published: 04.06.2018; Views: 184; Downloads: 27
.pdf Full text (4,21 MB)

Search done in 0.19 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica