2-level station location for bike sharing

DOI10.1007/978-3-030-57602-8_10MaRDI QIDQ2039650zbMATH OpenOpenAlexFDO

Authors Fengmin Wang, Xiaodong Hu, Chenchen Wu

Publication date 5 July 2021

Full work available at URL https://doi.org/10.1007/978-3-030-57602-8_10

zbMATH Keywords

approximation algorithmbike sharingfacility locationrandomized rounding

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Recommendations

• Stochastic optimization models for a bike-sharing problem with transshipment
• Cost-efficient allocation of bikes to stations in bike sharing systems
• Design of a public bicycle-sharing system with safety
• Dynamic repositioning strategy in a bike-sharing system; how to prioritize and how to rebalance a bike station
• Inventory rebalancing and vehicle routing in bike sharing systems

Cites work

• A 1.488 approximation algorithm for the uncapacitated facility location problem
• A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
• An improved approximation algorithm for the k-level facility location problem with soft capacities
• scientific article; zbMATH DE number 1559542 (Why is no real title available?)
• Improved approximation algorithms for capacitated facility location problems
• Improved Approximation Algorithms for the Uncapacitated Facility Location Problem

Cited in

(4)

• Stochastic optimization models for a bike-sharing problem with transshipment
• Design of a public bicycle-sharing system with safety
• A discrete model for bike share inventory
• Achieving location truthfulness in rebalancing supply-demand distribution for bike sharing

This page was built for publication: 2-level station location for bike sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2039650)