Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/99069
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Logistics and Maritime Studies | en_US |
| dc.creator | Hu, Z | en_US |
| dc.creator | Huang, D | en_US |
| dc.creator | Wang, S | en_US |
| dc.date.accessioned | 2023-06-14T01:00:02Z | - |
| dc.date.available | 2023-06-14T01:00:02Z | - |
| dc.identifier.issn | 2473-2907 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10397/99069 | - |
| dc.language.iso | en | en_US |
| dc.publisher | American Society of Civil Engineers (ASCE) | en_US |
| dc.rights | © ASCE | en_US |
| dc.rights | This material may be downloaded for personal use only. Any other use requires prior permission of the American Society of Civil Engineers. This material may be found at https://ascelibrary.org/doi/10.1061/JTEPBS.TEENG-7812. | en_US |
| dc.subject | Targeted bus exterior advertising | en_US |
| dc.subject | Bus scheduling | en_US |
| dc.subject | Bus deadheading | en_US |
| dc.subject | Biobjective optimization | en_US |
| dc.subject | Non-dominated Sorting Genetic Algorithm-II-Large Neighborhood Search (NSGA-II-LNS) | en_US |
| dc.title | Joint optimization of bus scheduling and targeted bus exterior advertising | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.volume | 149 | en_US |
| dc.identifier.issue | 5 | en_US |
| dc.identifier.doi | 10.1061/JTEPBS.TEENG-7812 | en_US |
| dcterms.abstract | Bus exterior advertising provides a powerful way to establish brand awareness because it can reach a mass of audiences with a high frequency. For a certain advertisement category, advertising effectiveness is largely dependent upon its exposure times to the target audience who takes interest in advertisement, which is termed targeted advertising. Given that the distribution of target audiences over a city varies among different advertisement categories, a practical way of enhancing overall advertising effectiveness is to deploy a bus with certain advertisement category to the bus line that best fits its target area. This gives rise to a decision-making problem of targeted bus exterior advertising and bus scheduling. In this paper, the problem is formulated as a biobjective optimization model with objectives of maximizing the quantified advertising effectiveness and minimizing the number of bus fleet size to cover all trips. The advertising effectiveness is quantified using audience demographic data. The deadheading of buses is also enabled in the scheduling process to facilitate both objectives. The Non-dominated Sorting Genetic Algorithm-II-Large Neighborhood Search (NSGA-II-LNS) algorithm is developed to solve the biobjective problem with the incorporation of large neighborhood search operators into the framework of the NSGA-II to improve solution quality. Various experiments were set up to verify the proposed model and solution algorithm. | en_US |
| dcterms.accessRights | open access | en_US |
| dcterms.bibliographicCitation | Journal of transportation engineering. Part A : Systems, May 2023, v. 149, no. 5, 04023022 | en_US |
| dcterms.isPartOf | Journal of transportation engineering. Part A : Systems | en_US |
| dcterms.issued | 2023-05 | - |
| dc.identifier.scopus | 2-s2.0-85149105247 | - |
| dc.identifier.eissn | 2473-2893 | en_US |
| dc.identifier.artn | 04023022 | en_US |
| dc.description.validate | 202306 bcch | en_US |
| dc.description.oa | Accepted Manuscript | en_US |
| dc.identifier.FolderNumber | a2096 | - |
| dc.identifier.SubFormID | 46566 | - |
| dc.description.fundingSource | Self-funded | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.description.oaCategory | Green (AAM) | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Hu_Joint_Optimization_Bus.pdf | Pre-Published version | 909.06 kB | Adobe PDF | View/Open |
Page views
76
Citations as of Apr 14, 2025
Downloads
74
Citations as of Apr 14, 2025
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



