Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/89906
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Civil and Environmental Engineeringen_US
dc.contributorDepartment of Logistics and Maritime Studiesen_US
dc.creatorHuang, Den_US
dc.creatorGu, Yen_US
dc.creatorWang, Sen_US
dc.creatorLiu, Zen_US
dc.creatorZhang, Wen_US
dc.date.accessioned2021-05-13T08:32:36Z-
dc.date.available2021-05-13T08:32:36Z-
dc.identifier.issn0968-090Xen_US
dc.identifier.urihttp://hdl.handle.net/10397/89906-
dc.language.isoenen_US
dc.publisherPergamon Pressen_US
dc.rights© 2019 Elsevier Ltd. All rights reserved.en_US
dc.rights© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/.en_US
dc.rightsThe following publication Huang, D., Gu, Y., Wang, S., Liu, Z., & Zhang, W. (2020). A two-phase optimization model for the demand-responsive customized bus network design. Transportation Research Part C: Emerging Technologies, 111, 1-21 is available at https://dx.doi.org/10.1016/j.trc.2019.12.004.en_US
dc.subjectBranch-and-bound algorithmen_US
dc.subjectCustomized busen_US
dc.subjectDemand-responsive transiten_US
dc.subjectDynamic insertionen_US
dc.subjectHierarchical decision-making problemen_US
dc.titleA two-phase optimization model for the demand-responsive customized bus network designen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage1en_US
dc.identifier.epage21en_US
dc.identifier.volume111en_US
dc.identifier.doi10.1016/j.trc.2019.12.004en_US
dcterms.abstractThis paper proposes a new optimization model for the network design problem of the demand-responsive customized bus (CB). The proposed model consists of two phases: inserting passenger requests dynamically in an interactive manner (dynamic phase) and optimizing the service network statically based on the overall demand (static phase). In the dynamic phase, we propose a hierarchical decision-making model to describe the interactive manner between operator and passengers. The CB network design problem is formulated in a mixed-integer program with the objective of maximizing operator's revenue. The CB passenger's travel behavior is measured by a discrete choice model given the trip plan provided by the operator. A dynamic insertion method is developed to address the proposed model in the dynamic phase. For the network design problem in the static phase, the service network is re-optimized based on the confirmed passengers with strict time deviation constraints embedded in the static multi-vehicle pickup and delivery problem. An exact solution method is developed based on the branch-and-bound (B&B) algorithm. Numerical examples are conducted to verify the proposed models and solution algorithms.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationTransportation research. Part C, Emerging technologies, Feb. 2020, v. 111, p. 1-21en_US
dcterms.isPartOfTransportation research. Part C, Emerging technologiesen_US
dcterms.issued2020-02-
dc.identifier.scopus2-s2.0-85076342341-
dc.description.validate202105 bcvcen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumbera0794-n08-
dc.identifier.SubFormID1659-
dc.description.fundingSourceOthersen_US
dc.description.fundingTextNSFC projectsen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Huang_Two-Phase_Optimization_Model.pdfPre-Published version2.27 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

106
Last Week
0
Last month
Citations as of Apr 14, 2025

Downloads

291
Citations as of Apr 14, 2025

SCOPUSTM   
Citations

208
Citations as of Dec 19, 2025

WEB OF SCIENCETM
Citations

133
Citations as of Oct 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.