File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Solving a static repositioning problem in bike-sharing systems using iterated tabu search

TitleSolving a static repositioning problem in bike-sharing systems using iterated tabu search
Authors
Ho, SCSzeto, WY
KeywordsBike-sharing
Static repositioning
Tabu search
Issue Date2014
PublisherPergamon. The Journal's web site is located at http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description
Citation
Transportation Research. Part E: Logistics and Transportation Review, 2014, v. 69, p. 180-198 How to Cite?
DOI: http://dx.doi.org/10.1016/j.tre.2014.05.017
AbstractIn this paper, we study the static bike repositioning problem where the problem consists of selecting a subset of stations to visit, sequencing them, and determining the pick-up/drop-off quantities (associated with each of the visited stations) under the various operational constraints. The objective is to minimize the total penalties incurred at all the stations. We present an iterated tabu search heuristic to solve the described problem. Experimental results show that this simple heuristic can generate high quality solutions using small computing times.
Persistent Identifierhttp://hdl.handle.net/10722/202640
ISSN
1366-5545
2021 Impact Factor: 10.047
2020 SCImago Journal Rankings: 2.042
ISI Accession Number ID
WOS:000341472800011

 

DC FieldValueLanguage
dc.contributor.authorHo, SC-
dc.contributor.authorSzeto, WY-
dc.date.accessioned2014-09-19T09:14:10Z-
dc.date.available2014-09-19T09:14:10Z-
dc.date.issued2014-
dc.identifier.citationTransportation Research. Part E: Logistics and Transportation Review, 2014, v. 69, p. 180-198-
dc.identifier.issn1366-5545-
dc.identifier.urihttp://hdl.handle.net/10722/202640-
dc.description.abstractIn this paper, we study the static bike repositioning problem where the problem consists of selecting a subset of stations to visit, sequencing them, and determining the pick-up/drop-off quantities (associated with each of the visited stations) under the various operational constraints. The objective is to minimize the total penalties incurred at all the stations. We present an iterated tabu search heuristic to solve the described problem. Experimental results show that this simple heuristic can generate high quality solutions using small computing times.-
dc.languageeng-
dc.publisherPergamon. The Journal's web site is located at http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description-
dc.relation.ispartofTransportation Research. Part E: Logistics and Transportation Review-
dc.rightsNOTICE: this is the author’s version of a work that was accepted for publication in Transportation Research. Part E: Logistics and Transportation Review. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Transportation Research. Part E: Logistics and Transportation Review, 2014, v. 69, p. 180-198. DOI: 10.1016/j.tre.2014.05.017-
dc.rightsThis work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.-
dc.subjectBike-sharing-
dc.subjectStatic repositioning-
dc.subjectTabu search-
dc.titleSolving a static repositioning problem in bike-sharing systems using iterated tabu search-
dc.typeArticle-
dc.identifier.emailSzeto, WY: ceszeto@hku.hk-
dc.identifier.authoritySzeto, WY=rp01377en_US
dc.description.naturepostprint-
dc.identifier.doi10.1016/j.tre.2014.05.017-
dc.identifier.scopuseid_2-s2.0-84904344170-
dc.identifier.hkuros236072-
dc.identifier.volume69-
dc.identifier.spage180-
dc.identifier.epage198-
dc.identifier.isiWOS:000341472800011-
dc.publisher.placeUnited Kingdom-
dc.identifier.issnl1366-5545-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats