Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems
From MaRDI portal
Publication:6168933
DOI10.1007/978-3-031-22105-7_9arXiv2208.11832MaRDI QIDQ6168933FDOQ6168933
Authors: Hongyi Jiang, Samitha Samaranayake 
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Abstract: In this article, we propose algorithms to address two critical transportation system problems: the Generalized Real-Time Line Planning Problem (GRLPP) and the Generalized Budgeted Multi-Visit Team Orienteering Problem (GBMTOP). The GRLPP aims to optimize high-capacity line plans for multimodal transportation networks to enhance connectivity between passengers and lines. The GBMTOP focuses on finding optimal routes for a team of heterogeneous vehicles within budget constraints to maximize the reward collected. We present two randomized approximation algorithms for the generalized budgeted multi-assignment problem (GBMAP), which arises when items need to be assigned to bins subject to capacity constraints, budget constraints, and other feasibility constraints. Each item can be assigned to at most a specified number of bins, and the goal is to maximize the total reward. GBMAP serves as the foundation for solving GRLPP and GBMTOP. In addition to these two algorithms, our contributions include the application of our framework to GRLPP and GBMTOP, along with corresponding models, numerical experiments, and improvements on prior work.
Full work available at URL: https://arxiv.org/abs/2208.11832
Cites Work
- A threshold of ln n for approximating set cover
- Tight approximation algorithms for maximum separable assignment problems
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- Maximizing a monotone submodular function subject to a matroid constraint
- A direct connection approach to integrated line planning and passenger routing
- Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
- The online stochastic generalized assignment problem
- Bayesian combinatorial auctions: expanding single buyer mechanisms to many buyers
- Packing items into several bins facilitates approximating the separable assignment problem
- Simultaneous network line planning and traffic assignment
- Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems
Cited In (3)
- Note on the applicability of the VCG mechanism to capacitated assignment problems and extensions
- Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems
- Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems
This page was built for publication: Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168933)
