| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 4 / 4
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
2.
The obnoxious center problem on weighted cactus graphs
Blaž Zmazek, Janez Žerovnik, 2001, objavljeni povzetek znanstvenega prispevka na konferenci

Opis: Problem nezaželenih centrov v grafu predstavlja določitev takšne lokacije na povezavah grafa, da je njena minimalna razdalja do poljubne točke grafa kolikor se da velika. Uteži na točkah grafa lahko predstavljajo njihovo občutljivost, ki jo je moč oceniti z eno izmed konstantno mnogo vrednosti. Kadar je vsaki točki grafa prirejena ena izmed ▫$c$▫ različnih vrednosti (uteži) glede na njeno občutljivost, rešujemo tako imenovan problem nezaželenih centrov na grafu z ovrednotenimi točkami. V tem članku bomo predstavili algoritem, ki določi nezaželeni center na kaktusu z ovrednotenimi točkami v linearnem času ▫$O(cn)$▫, kjer je ▫$n$▫ število točk in ▫$c$▫ število uteži.
Ključne besede: matematika, operacijsko raziskovanje, teorija grafov, lokacijski problemi, problem centra, nezaželjeni centri, algoritmi z linearno časovno zahtevnostjo, mathematics, operations research, graph theory, location problems, center problem, obnoxious facilities, linear time algorithm
Objavljeno: 10.07.2015; Ogledov: 439; Prenosov: 48
URL Povezava na celotno besedilo

3.
A modular hybrid approach to employee timetabling
Drago Bokal, Gašper Fijavž, Bor Harej, Andrej Taranenko, Klemen Žagar, 2008, objavljeni znanstveni prispevek na konferenci

Opis: We consider a classical employee timetabling problem: a set of employees with various skill levels, qualifications, workload and availability distributions has to be assigned to a set of shifts, each requiring a prescribed number of qualified employees and spanning a given time period. The novelty of our approach is a hybrid combination of the methods proposed in bibliography, such that we leverage the advantages of known methods while minimizing their disadvantages. Thus, we first apply the generalized local hill-climbing with randomized neighborhoods to quickly reach the vicinity of local optima, and then use the tabu search to explore more of the search space around those solutions. Our experiments show that the resulting hybrid technique performs better than the comparable approaches presented in bibliography due to the hybrid nature of the technique. In addition, we propose a modular design that utilizes dependency injection to compose the the search algorithm. Together with careful modeling, this approach allows for constant-time evaluation of each possible step in the neighborhood and for an easy evaluation of different hybrid combinations that can be combined and parameterized at runtime.
Ključne besede: operacijsko raziskovanje, razporejanje zaposlenih, urniki, lokalna optimizacija, operations research, employee timetabling, generalized local hill-climbing, tabu search, hybrid local optimization
Objavljeno: 10.07.2015; Ogledov: 235; Prenosov: 30
URL Povezava na celotno besedilo

4.
Heuristic approach to inventory control with advance capacity information
Marko Jakšič, Borut Rusjan, 2009, izvirni znanstveni članek

Opis: There is a growing trend of information sharing within modern supply chains. This trend is mainly stimulated by recent developments in information technology and the increasing awareness that accurate and timely information helps firms cope with volatile and uncertain business conditions. We model a periodic-review, single-item, capacitated stochastic inventory system, where a supply chain member has the ability to obtain advance capacity information (‘ACI’) about future supply capacity availability. ACI is used to reduce the uncertainty of future supply and thus enables the decision-maker to make better ordering decisions. We develop an easily applicable heuristic based on insights gained from an analysis of the optimal policy. In a numerical study we quantify the benefits of ACI and compare the performance of the proposed heuristic with the optimal performance. We illustrate the conditions in which the procedure is working well and comment on its practical applicability.
Ključne besede: inventories, supply, stochastic processes, operations research, heuristics
Objavljeno: 30.11.2017; Ogledov: 201; Prenosov: 121
.pdf Celotno besedilo (1,02 MB)
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.08 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici