-
Optimization methods for solving transportation problems on networks : doctoral dissertationPrnaver, KatjaIn this thesis we study problems from real situations, which can be applied to network graphs and solved using mathematical graph theory. We start with the problem of oriented network design. The ... problem originates from networks, where the flow over the arcs is important and many times limited with the capacity of the networks. There are several techniques and results on the problem of assigning the flow through the network channels. In our problem, we try to find the optimal network structure, which could be used in the design phase of the network. With metaheuristics, we search for optimal network structures for a given number of nodes. We define triangle neighborhood and compare the results of the algorithm with the conjecture by Choplin et al. [8]. Further, we study the problem of order picking and order batching in block structured warehouses. For order picking problem, we present the extension of a dynamic programming algorithm by Ratliff and Rosenthal [42], which enables the development of an algorithm for an unlimited number of blocks. In order to achieve this, a new presentation of states and transitions of dynamic programming algorithm is given. We prove that the resulting path is optimal for the given structure. We compare the optimal path lengths to the results found in literature and also investigate the impact of warehouse layout parameters onto the routing. Closely related to the problem of order picking, we investigate the order batching problem. We discuss the variation of the order batching problem with time windows and present the algorithmic approach to solving the problem. The previously presented optimal path algorithm is applied in the algorithm to ensure even better quality of results. We introduce the evaluation function of a batch and compare the results of the algorithm with the test data from the literature as well as with data from the real warehouse. We conclude by summarizing the results and stating some possible extensions and further work.Type of material - dissertation ; adult, seriousPublication and manufacture - [Maribor : K. Prnaver], 2011Language - englishCOBISS.SI-ID - 256276736
Link(s):
Digital Library of the University of Maribor – DLUM
Digitalna knjižnica Slovenije - dLib.siDostop z namenskih računalnikov v prostorih NUK
Author
Prnaver, Katja
Other authors
Zmazek, Blaž |
Pisinger, David
Topics
Univerzitetna in visokošolska dela |
teorija grafov |
omrežja |
optimizacija |
iskanje najkrajše poti |
problem trgovskega potnika |
algoritmi |
metahevristike |
komisioniranje |
graph theory |
networks |
optimization |
shortest path problem |
traveling salesman problem |
algorithms |
metaheuristics |
order batching
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Call number – location, accession no. ... |
Copy status | Reservation |
---|---|---|
D DIS 0000000051 PRNAVER K. Optimization IN: 920110054 D DIS 51 PRNAVER K. Optimization IN: 920110054 |
available - reading room
|
![loading ... loading ...](themes/default/img/ajax-loading.gif)
![loading ... loading ...](themes/default/img/ajax-loading.gif)
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|---|
Prnaver, Katja | 28584 |
Zmazek, Blaž | 15571 |
Pisinger, David | ![]() |
Select pickup location:
Material pickup by post
Notification
Select pickup location
Pickup location | Material status | Reservation |
---|
Please wait a moment.
Miklošičeva knjižnica - FPNM bo od 17. 6. 2024 do 30. 9. 2024 odprta vsak dan od ponedljka do petka od 8.00 do 14.00.
Srečno.
Kolektiv Miklošičeve knjižnice - FPNM