File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A multiple type bike repositioning problem

TitleA multiple type bike repositioning problem
Authors
Issue Date2016
PublisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/trb
Citation
Transportation Research Part B: Methodological, 2016, v. 90, p. 263-278 How to Cite?
AbstractThis paper investigates a new static bicycle repositioning problem in which multiple types of bikes are considered. Some types of bikes that are in short supply at a station can be substituted by other types, whereas some types of bikes can occupy the spaces of other types in the vehicle during repositioning. These activities provide two new strategies, substitution and occupancy, which are examined in this paper. The problem is formulated as a mixed-integer linear programming problem to minimize the total cost, which consists of the route travel cost, penalties due to unmet demand, and penalties associated with the substitution and occupancy strategies. A combined hybrid genetic algorithm is proposed to solve this problem. This solution algorithm consists of (i) a modified version of a hybrid genetic search with adaptive diversity control to determine routing decisions and (ii) a proposed greedy heuristic to determine the loading and unloading instructions at each visited station and the substitution and occupancy strategies. The results show that the proposed method can provide high-quality solutions with short computing times. Using small examples, this paper also reveals problem properties and repositioning strategies in bike sharing systems with multiple types of bikes.
Persistent Identifierhttp://hdl.handle.net/10722/229157
ISSN
2015 Impact Factor: 3.769
2015 SCImago Journal Rankings: 3.905

 

DC FieldValueLanguage
dc.contributor.authorLi, Y-
dc.contributor.authorSzeto, WY-
dc.contributor.authorLong, J-
dc.contributor.authorShui, CS-
dc.date.accessioned2016-08-23T14:09:20Z-
dc.date.available2016-08-23T14:09:20Z-
dc.date.issued2016-
dc.identifier.citationTransportation Research Part B: Methodological, 2016, v. 90, p. 263-278-
dc.identifier.issn0191-2615-
dc.identifier.urihttp://hdl.handle.net/10722/229157-
dc.description.abstractThis paper investigates a new static bicycle repositioning problem in which multiple types of bikes are considered. Some types of bikes that are in short supply at a station can be substituted by other types, whereas some types of bikes can occupy the spaces of other types in the vehicle during repositioning. These activities provide two new strategies, substitution and occupancy, which are examined in this paper. The problem is formulated as a mixed-integer linear programming problem to minimize the total cost, which consists of the route travel cost, penalties due to unmet demand, and penalties associated with the substitution and occupancy strategies. A combined hybrid genetic algorithm is proposed to solve this problem. This solution algorithm consists of (i) a modified version of a hybrid genetic search with adaptive diversity control to determine routing decisions and (ii) a proposed greedy heuristic to determine the loading and unloading instructions at each visited station and the substitution and occupancy strategies. The results show that the proposed method can provide high-quality solutions with short computing times. Using small examples, this paper also reveals problem properties and repositioning strategies in bike sharing systems with multiple types of bikes.-
dc.languageeng-
dc.publisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/trb-
dc.relation.ispartofTransportation Research Part B: Methodological-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.titleA multiple type bike repositioning problem-
dc.typeArticle-
dc.identifier.emailSzeto, WY: ceszeto@hku.hk-
dc.identifier.emailLong, J: jclong@HKUCC-COM.hku.hk-
dc.identifier.authoritySzeto, WY=rp01377-
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1016/j.trb.2016.05.010-
dc.identifier.hkuros262904-
dc.identifier.volume90-
dc.identifier.spage263-
dc.identifier.epage278-
dc.publisher.placeUnited Kingdom-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats