Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/99105
DC FieldValueLanguage
dc.contributorDepartment of Industrial and Systems Engineeringen_US
dc.contributorDepartment of Logistics and Maritime Studiesen_US
dc.creatorZhang, Wen_US
dc.creatorXu, Men_US
dc.creatorWang, Sen_US
dc.date.accessioned2023-06-14T01:00:21Z-
dc.date.available2023-06-14T01:00:21Z-
dc.identifier.issn1366-5545en_US
dc.identifier.urihttp://hdl.handle.net/10397/99105-
dc.language.isoenen_US
dc.publisherElsevier Ltden_US
dc.subjectFacility locationen_US
dc.subjectService pricingen_US
dc.subjectCustomer choice behavioren_US
dc.subjectSelf-serviceen_US
dc.titleJoint location and pricing optimization of self-service in urban logistics considering customers’ choice behavioren_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume174en_US
dc.identifier.doi10.1016/j.tre.2023.103128en_US
dcterms.abstractSelf-services by widely-deployed stations allow customers to pick up their packages themselves and have great potential to reduce last-mile delivery cost by aggregating spatial demands. An efficient self-service design for the locations of self-service stations and the service price will help to shift customers from the home-delivery service to the cost-effective self-service, thus reducing the vehicle routing cost of the dedicated fleet. This study proposes a comprehensive modeling and optimization framework for the joint self-service station location and service price (SLSP) optimization problem considering customers’ choice behavior and vehicle routing in order to maximize the profit of the logistics service providers in the last-mile delivery system. Logit equilibrium and Wardrop equilibrium conditions are employed to characterize the delivery service choice and route choice behavior of customers. A convex optimization model is developed to capture the distribution of customers opting for home-delivery service and self-services at various locations, who aim to maximize their expected utilities. We then formulate the SLSP problem as a mathematical program with complementarity constraints. An active set algorithm is proposed to solve the model effectively. Numerical experiments based on the Nguyen-Dupuis and Sioux Falls networks are conducted to demonstrate the proposed framework and derive managerial insights.en_US
dcterms.accessRightsembargoed accessen_US
dcterms.bibliographicCitationTransportation research. Part E, Logistics and transportation review, June 2023, v. 174, 103128en_US
dcterms.isPartOfTransportation research. Part E, Logistics and transportation reviewen_US
dcterms.issued2023-06-
dc.identifier.scopus2-s2.0-85153324665-
dc.identifier.eissn1878-5794en_US
dc.identifier.artn103128en_US
dc.description.validate202306 bcchen_US
dc.description.oaNot applicableen_US
dc.identifier.FolderNumbera2108-
dc.identifier.SubFormID46626-
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextResearch Committee of The Hong Kong Polytechnic University; National Natural Science Foundation of Chinaen_US
dc.description.pubStatusPublisheden_US
dc.date.embargo2026-06-30en_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Open Access Information
Status embargoed access
Embargo End Date 2026-06-30
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

102
Last Week
0
Last month
Citations as of Nov 9, 2025

SCOPUSTM   
Citations

17
Citations as of Dec 19, 2025

WEB OF SCIENCETM
Citations

16
Citations as of Dec 18, 2025

Google ScholarTM

Check

Altmetric


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