1. Optimization methods for solving transportation problems on networksKatja Prnaver, 2011, dissertation Abstract: In 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. Keywords: graph theory, networks, optimization, shortest path problem, traveling salesman problem, algorithms, metaheuristics, order batching Published: 03.06.2011; Views: 3982; Downloads: 164 Full text (925,86 KB) |
2. Chepoi Victor, Dragan Feodor F., Vaxes Yann: Distance and routing labeling schemes for non-positively curved plane graphs. J. Algorithms 61 (2006), no. 2, 60-88.Boštjan Brešar, 2006, review, book review, critique Keywords: mathematics, graph theory, distance labeling scheme, routing labeling scheme, efficient algorithms Published: 31.05.2012; Views: 1079; Downloads: 14 Link to full text |
3. On edge connectivity of direct products of graphsXiang-Lan Cao, Špela Brglez, Simon Špacapan, Elkin Vumar, 2011, original scientific article Abstract: Let ▫$lambda(G)$▫ be the edge connectivity of ▫$G$▫. The direct product of graphs ▫$G$▫ and ▫$H$▫ is the graph with vertex set ▫$V(G times H) = V(G) times V(H)$▫, where two vertices ▫$(u_1,v_1)$▫ and ▫$(u_2,v_2)$▫ are adjacent in ▫$G times H$▫ if ▫$u_1u_2 in E(G)$▫ and ▫$v_1v_2 in E(H)$▫. We prove that ▫$lambda(G times K_n) = min{n(n-1)lambda(G), (n-1)delta(G)}$▫ for every nontrivial graph ▫$G$▫ and ▫$n geqslant 3$▫. We also prove that for almost every pair of graphs ▫$G$▫ and ▫$H$▫ with ▫$n$▫ vertices and edge probability ▫$p$▫, ▫$G times H$▫ is ▫$k$▫-connected, where ▫$k=O((n/log n)^2)$▫. Keywords: mathematics, graph theory, combinatorial problems, connectivity, direct product, graph product, separating set Published: 01.06.2012; Views: 1585; Downloads: 184 Link to full text |
4. 2-local 3/4-competitive algorithm for multicoloring hexagonal graphsPetra Šparl, Janez Žerovnik, 2005, original scientific article Abstract: An important optimization problem in the design of cellular networks is to assign sets of frequencies to transmitters to avoid unacceptable interference.A cellular network is generally modeled as a subgraph of the infinite triangular lattice. Frequency assignment problem can be abstracted asa multicoloring problem on a weighted hexagonal graph, where the weights represent the number of calls to be assigned at vertices. In this paper we present a distributed algorithm for multicoloring hexagonal graphs using only the local clique numbers ▫$omega_1(v)$▫ and ▫$omega_2(v)$▫ at each vertex v of the given hexagonal graph, which can be computed from local information available at thevertex. We prove the algorithm uses no more than ▫$4omega(G)/3$▫ colors for any hexagonal graph G, without explicitly computing the global clique number ▫$omega(G)$▫. We also prove that our algorithm is 2-local, i.e., the computation at a vertex v ▫$in$▫ G uses only information about the demands of vertices whose graph distance from v is less than or equal to 2. Keywords: mathematics, graph theory, graph colouring, 2-local distributed algorithm, cellular networks, frequency planning Published: 01.06.2012; Views: 1396; Downloads: 66 Link to full text |
5. Encyclopedia of complexity and systems sciencedictionary, encyclopaedia, lexicon, manual, atlas, map Abstract: Encyclopedia of Complexity and Systems Science provides an authoritative single source for understanding and applying the concepts of complexity theory together with the tools and measures for analyzing complex systems in all fields of science and engineering. The science and tools of complexity and systems science include theories of self-organization, complex systems, synergetics, dynamical systems, turbulence, catastrophes, instabilities, nonlinearity, stochastic processes, chaos, neural networks, cellular automata, adaptive systems, and genetic algorithms. Examples of near-term problems and major unknowns that can be approached through complexity and systems science include: The structure, history and future of the universe; the biological basis of consciousness; the integration of genomics, proteomics and bioinformatics as systems biology; human longevity limits; the limits of computing; sustainability of life on earth; predictability, dynamics and extent of earthquakes, hurricanes, tsunamis, and other natural disasters; the dynamics of turbulent flows; lasers or fluids in physics, microprocessor design; macromolecular assembly in chemistry and biophysics; brain functions in cognitive neuroscience; climate change; ecosystem management; traffic management; and business cycles. All these seemingly quite different kinds of structure formation have a number of important features and underlying structures in common. These deep structural similarities can be exploited to transfer analytical methods and understanding from one field to another. This unique work will extend the influence of complexity and system science to a much wider audience than has been possible to date. Keywords: cellular automata, complex networks, computational nanoscience, ecological complexity, ergodic theory, fractals, game theory, granular computing, graph theory, intelligent systems, perturbation theory, quantum information science, system dynamics, traffic management, chaos, climate modelling, complex systems, dynamical sistems, fuzzy theory systems, nonlinear systems, soft computing, stochastic processes, synergetics, self-organization, systems biology, systems science Published: 01.06.2012; Views: 1581; Downloads: 78 Link to full text |
6. Microeconomics : an integrated approachDavid Besanko, Ronald Ray Braeutigam, higher education textbook Keywords: microeconomics, economic analyses, problematics, problem solving, theory of rational expectations, supply, demand, general equilibrium, consumer, opportunities, mathematical economy, input-output, costs, minimization, competitiveness, competitive advantage, market, application, monopolies, oligopolies, game theory, behavior, market structure, risk, informations, externalities, public goods, graphic methods, graph theory, textbooks, exercises, manuals Published: 01.06.2012; Views: 1843; Downloads: 29 Link to full text |
7. |
8. |
9. Wide diameter of Cartesian graph bundlesIztok Banič, Janez Žerovnik, 2010, published scientific conference contribution Abstract: Fault tolerance and transmission delay of networks are important concepts in network design. The notions are strongly related to connectivity and diameter of a graph, and have been studied by many authors. Wide diameter of a graph combines studying connectivity with the diameter of a graph. Diameter with width ▫$k$▫ of a graph ▫$G$▫, ▫$k$▫-diameter, is defined as the minimum integer ▫$d$▫ for which there exist at least ▫$k$▫ internally disjoint paths of length at most ▫$d$▫ between any two distinct vertices in ▫$G$▫. Denote by ▫${mathscr D}_c(G)$▫ the ▫$c$▫-diameter of ▫$G$▫ and ▫$kappa(G)$▫ the connectivity of ▫$G$▫. In the context of computer networks, wide diameters of Cartesian graph products have been recently studied by many authors. Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let ▫$G$▫ be a Cartesian graph bundle with fiber ▫$F$▫ over base ▫$B$▫, ▫$0 < a le kappa(F)$▫, and ▫$0 < b le kappa(B)$▫. We prove that ▫${mathscr D}_{a+b}(G) le {mathscr D}_a(F) + {mathscr D}_b(B) + 1$▫. Moreover, if ▫$G$▫ is a graph bundle with fiber ▫$F ne K_2$▫ over base ▫$B ne K_2$▫, then ▫${mathscr D}_{a+b}(G) le {mathscr D}_a(F) + {mathscr D}_b(B)$▫. The bounds are tight. Keywords: mathematics, graph theory, Cartesian graph products, Cartesian graph bundles, wide diameter Published: 07.06.2012; Views: 1181; Downloads: 61 Link to full text |
10. |