惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
J
Java Code Geeks
I
InfoQ
V
Visual Studio Blog
M
MIT News - Artificial intelligence
H
Help Net Security
博客园_首页
Blog — PlanetScale
Blog — PlanetScale
F
Fortinet All Blogs
Apple Machine Learning Research
Apple Machine Learning Research
人人都是产品经理
人人都是产品经理
G
Google Developers Blog
A
About on SuperTechFans
腾讯CDC
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Last Week in AI
Last Week in AI
小众软件
小众软件
aimingoo的专栏
aimingoo的专栏
罗磊的独立博客
大猫的无限游戏
大猫的无限游戏
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
云风的 BLOG
云风的 BLOG
S
SegmentFault 最新的问题
WordPress大学
WordPress大学

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Dynamic capacity allocation of hybrid transportation unit...
Paul Bischoff, Benedikt Lienkamp, Tarun Rambha, Maximilian Schif · 2024-11-30 · via math.CO updates on arXiv.org

To improve the utilization of public transportation systems (PTSs) during off-peak hours, we present an algorithmic framework that designs PTSs with hybrid transportation units (HTUs), which can transport passengers or freight by leveraging a flexible interior. Against this background, we study a capacitated network design problem to enable cargo-hitching in existing PTSs. Specifically, we study a setting with fixed vehicle routes and timetables in which vehicles can be equipped with HTUs to enable cargo-hitching. We optimize the network design from a total cost perspective to account for normalized network design costs tied to the investment in HTUs and freight routing costs. We present an algorithmic framework that encodes some of the problem's constraints in a spatially and temporally expanded, layered graph, and solves the resulting network design problem with a price-and-branch algorithm. We apply this framework to a case study based on the subway network in the city of Munich. Our algorithm outscales commercial solvers by a factor of six and yields integer feasible solutions with a median integrality gap of less than 1.56% for all instances. We show that cargo-hitching with HTUs increases the utilization of PTSs, especially during off-peak hours, without cannibalizing passenger service level and quality. We quantify the value of hybrid transportation units (HTUs) at up to 3.2% of the total cost. Moreover, we present a sensitivity analysis that indicates that cargo-hitching is worthwhile if truck-based transport occurs at an externality cost of more than 1.5 EUR per vehicle and kilometer and loading and unloading costs of less than 2.0 EUR per passenger equivalent.