Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1504.03170

Search algorithms for efficient logistics chains

Serge Lawrencenko·Irina A. Duborkina
View original source ↗Read source document ↗Export metadata ↓

Abstract

Logistics networks arise whenever there is a transfer of material substance or objects (such as checked baggage on international flights) as well as energy, information, or finance through links (channels). A general concept of logistics network is suggested and motivated for modeling a service of any kind supplied through links between the nodes of the network. The efficiency of a single link is defined to be the ratio of the volume of useful service at the output node to the volume of expended service at the input node of the link (for a specific period of time). Similarly, the efficiency of a chain is the ratio of the volume of service at the output to the volume of service at the input of the chain. The overall efficiency of the chain is calculated as the product of the efficiencies of its links; the more efficiency of the chain, the less are the losses in the chain. This paper introduces the notion of inadequacy of service in such a way that the overall inadequacy of a chain is equal to the sum of the inadequacies of its links. So the efficiencies are being multiplied, whereas the inadequacies are being added. Thus, the antagonistic pair (efficiency, inadequacy) appears to be analogous to the pair (reliability, entropy) in communication theory. Various possible interpretations of the proposed logistic model are presented: energy, material, information and financial networks. Four algorithms are provided for logistics chain search: two algorithms for finding the most effective chain from a specified origin to a specified destination, and two algorithms for finding the guaranteed minimum level of service between any pair of unspecified nodes in a given network. An example is shown as to how one of the algorithms finds the most efficient energy chain from the electrical substation to a specified user in a concrete energy network.

Explore related subjects

cs.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Serge Lawrencenko, Irina A. Duborkina. 2015-04-09. Search algorithms for efficient logistics chains. https://doi.org/10.12737/11889

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Beyond Kruskal: Polynomial-Time Tensor Decomposition under the Lovitz-Petrov Condition

Identifiability criteria certify that a given tensor decomposition is a unique rank decomposition. Kruskal's classical condition is one of the best-known deterministic criteria for identifiability. However, no polynomial-time decomposition algorithm is known under the Kruskal condition, and verifying the condition itself is NP-hard. Lovitz and Petrov introduced a strictly more general identifiability condition which, in contrast, is polynomial-time verifiable, but no polynomial-time decomposition algorithm was previously known under this condition. We give a polynomial-time algorithm for tensor decomposition under the Lovitz--Petrov condition. Moreover, combining our algorithm with polynomial-time verification of the Lovitz--Petrov condition yields an efficient end-to-end certification procedure: after computing a decomposition, one can deterministically certify in polynomial time that it is unique and therefore of minimum rank. This contrasts with an arbitrary tensor decomposition, which certifies only an upper bound on the tensor rank, while determining tensor rank is NP-hard in general.

cs.DS↗
arXiv2026

Poisson Exchange Beyond Submodularity: Effective Approximation Algorithms for Offline and Online Subset Selection over Matroids

Over the past decade, a growing body of research has shown that $γ$-weak submodularity broadly arises in numerous subset selection tasks, including feature selection, neural network pruning, and video summarization. Despite its prevalence, maximizing a $γ$-weakly submodular function subject to a general matroid constraint remains challenging. To date, the only known approximation guarantee is the conservative $(1+1/γ)^{-2}$ factor established by \citet{chen2018weakly}. To improve upon this result, this paper proposes a novel algorithm called \MGPE, which repeatedly performs maximum-gain local exchanges through careful control of a non-homogeneous Poisson clock, and proves that this \MGPE\ can attain an approximation ratio arbitrarily close to $ρ_γ=1-\left(γ/(2-γ)\right)^{ \frac{γ^2}{2(1-γ)} }$. In sharp contrast to the previous guarantee, our obtained factor $ρ_γ$ not only strictly improves upon $(1+1/γ)^{-2}$ for every $γ\in(0,1]$, but also can asymptotically approach the optimal $(1-1/e)$-approximation for submodular maximization as $γ\to1$. Furthermore, we surprisingly find that when the matroid constraint reduces to a cardinality or the objective satisfies the stronger notion of $α$-weak DR-submodularity, \MGPE\ can automatically recover the tight approximation ratios of $1-e^{-γ}$ and $1-e^{-α}$, respectively. Here, $α\in(0,1]$ denotes the DR ratio.

cs.DS↗
arXiv2026

Approximating Prize-Collecting TSP below 1.556

The prize-collecting traveling salesperson problem is a variant of the metric traveling salesperson problem in which vertices may be left unvisited by paying their associated penalties. The objective is to minimize the length of the tour plus the total penalty of the unvisited vertices. Blauth, Klein, and Nägele gave the previously best-known LP-relative $1.599$-approximation. We show that a simpler version of their algorithm, obtained by omitting the splitting-off preprocessing before the tree decomposition, has an LP-relative approximation ratio of $1.555761$. The improvement comes entirely from a new analysis of the parity-correction step: a simple analysis already gives $1.56$, and the stated factor follows from a numerical parameter search with exact verification.

cs.DS↗