SearcharxivSearch

arXiv · 2506.12064

Fuzzy location and allocation Hub Network Design for Air Cargo Transportation Considering Sustainability and Time Window

Abstract

Hub location Problems seek to find hub facilities and assign non-hub nodes to them in such a way that the flow between origin and destination should be effectively established according to the desired goal. In general, in the literature of location, it is assumed that the time horizon of hub network design is a single time horizon. In the last two decades these problems have attracted special attention in the field of facility location problems and have wide applications in different fields including air cargo transportation. Cargo transportation is one of the most important economic sectors of any country. There are different ways to transport cargo, but air transport is preferred because it has high speed and security, so it is suitable for transporting goods related to technology, food, medicines, etc. In this article designing a hub network for air cargo transportation, taking into account hard and soft time windows along with considering the limited capacity for each hub under uncertainty is discussed. The proposed model is a developed model of an existing model in literature. Our Study has three linear functions: economic, environmental and social. In this article method of Fuzzy programming has been used to control the non-deterministic demand parameter. Results of model that has been solved by epsilon limitation method, NSGA-II, MOPSO and MOWOA algorithm show that as the uncertainty rate increases, the total costs of the system as well as the amount of environmental pollution increases. The reviews indicate the high performance of the NSGA-II algorithm in solving the proposed model.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ali Mohammad Malekdar, Mohsen Akbarpour Shirazi. 2025-06-01. Fuzzy location and allocation Hub Network Design for Air Cargo Transportation Considering Sustainability and Time Window. https://arxiv.org/abs/2506.12064

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

KEEP EXPLORING

Related papers

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM