Bike rebalancing: How to find a balanced matching in the k center problem?

Jinxiang Gan, Guochuan Zhang and Yuhao Zhang

European Journal of Operational Research, 2024, vol. 316, issue 3, 845-855

Abstract: In the bike-sharing system, inspired by the problem proposed by O’Mahony and Shmoys (AAAI 2015), we present a new model called the balanced k center problem with matching constraints. Given a network containing the same number of two types of points, supply points and demand points, we aim to allocate k (supply) centers for supply points, and k (demand) centers for demand points. The k supply centers should be perfectly matched with the k demand centers, within an allowed distance. The goal is to minimize the maximum distance from each supply (or demand) point to its closest supply (or demand) centers.

Keywords: Linear programming; Approximation algorithms; Capacitated k-center problem; Matching (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221724001838
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:316:y:2024:i:3:p:845-855

DOI: 10.1016/j.ejor.2024.03.009

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().