File Download

There are no files associated with this item.

Supplementary

Conference Paper: An EABC approach with exact loading and unloading strategies for static bike repositioning problem

TitleAn EABC approach with exact loading and unloading strategies for static bike repositioning problem
Authors
Shui, CSSzeto, WY
Issue Date2018
Citation
The INFORMS 2018 Annual Meeting, Phoenix, USA, 4-7 November 2018 How to Cite?
AbstractThis study investigates a bike repositioning problem (BRP) that determines the routes of the repositioning vehicles and the loading and unloading quantities at each bike station to firstly minimize the total demand dissatisfaction and then service time. To reduce the computation time to solve the loading and unloading sub-problem of the BRP, a novel set of loading and unloading strategies is proposed, proved to be optimal for a given route, and then embedded into an enhanced artificial bee colony algorithm to solve the BRP. Numerical studies show the computation efficiency of the proposed solution method and the trade-off between total demand dissatisfaction and the service time
DescriptionTC29: Modeling and Analysis of Emerging Mobility Services and Systems
Persistent Identifierhttp://hdl.handle.net/10722/276001

 

DC FieldValueLanguage
dc.contributor.authorShui, CS-
dc.contributor.authorSzeto, WY-
dc.date.accessioned2019-09-10T02:53:57Z-
dc.date.available2019-09-10T02:53:57Z-
dc.date.issued2018-
dc.identifier.citationThe INFORMS 2018 Annual Meeting, Phoenix, USA, 4-7 November 2018-
dc.identifier.urihttp://hdl.handle.net/10722/276001-
dc.descriptionTC29: Modeling and Analysis of Emerging Mobility Services and Systems-
dc.description.abstractThis study investigates a bike repositioning problem (BRP) that determines the routes of the repositioning vehicles and the loading and unloading quantities at each bike station to firstly minimize the total demand dissatisfaction and then service time. To reduce the computation time to solve the loading and unloading sub-problem of the BRP, a novel set of loading and unloading strategies is proposed, proved to be optimal for a given route, and then embedded into an enhanced artificial bee colony algorithm to solve the BRP. Numerical studies show the computation efficiency of the proposed solution method and the trade-off between total demand dissatisfaction and the service time-
dc.languageeng-
dc.relation.ispartofINFORMS 2018 Annual Meeting-
dc.titleAn EABC approach with exact loading and unloading strategies for static bike repositioning problem-
dc.typeConference_Paper-
dc.identifier.emailShui, CS: csshui@hku.hk-
dc.identifier.emailSzeto, WY: ceszeto@hku.hk-
dc.identifier.authoritySzeto, WY=rp01377-
dc.identifier.hkuros303276-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats