A fully polynomial time approximation scheme for a stop schedule of a transportation line without branches
For a transportation line without branches, passenger service scheduling is mainly concerned with the determination of stop schedules for planned service trips. A mixed-integer programming method is proposed to maximize customer satisfaction by minimizing the total number of in-vehicle passengers du...
Gespeichert in:
| Veröffentlicht in: | Engineering optimization Jg. 57; H. 5; S. 1323 - 1342 |
|---|---|
| 1. Verfasser: | |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Taylor & Francis
04.05.2025
|
| Schlagworte: | |
| ISSN: | 0305-215X, 1029-0273 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | For a transportation line without branches, passenger service scheduling is mainly concerned with the determination of stop schedules for planned service trips. A mixed-integer programming method is proposed to maximize customer satisfaction by minimizing the total number of in-vehicle passengers during trips. A heuristic algorithm is proposed for a given number of service trips, in which the error bound of the heuristic is restricted by the number of stations. When the given number of service trips is sufficient to provide express services for all origin-destination pairs, the heuristic provides an optimal solution. However, the error bound of the heuristic approaches infinity as the number of stations increases. A fully polynomial time-approximation algorithm is proposed, where the number of service trips is a decision variable. Finally, the proposed algorithm was applied to the stop-schedule problem of a river bus operating along the Han River in Seoul, Korea. |
|---|---|
| AbstractList | For a transportation line without branches, passenger service scheduling is mainly concerned with the determination of stop schedules for planned service trips. A mixed-integer programming method is proposed to maximize customer satisfaction by minimizing the total number of in-vehicle passengers during trips. A heuristic algorithm is proposed for a given number of service trips, in which the error bound of the heuristic is restricted by the number of stations. When the given number of service trips is sufficient to provide express services for all origin-destination pairs, the heuristic provides an optimal solution. However, the error bound of the heuristic approaches infinity as the number of stations increases. A fully polynomial time-approximation algorithm is proposed, where the number of service trips is a decision variable. Finally, the proposed algorithm was applied to the stop-schedule problem of a river bus operating along the Han River in Seoul, Korea. |
| Author | Jeong, In-Jae |
| Author_xml | – sequence: 1 givenname: In-Jae surname: Jeong fullname: Jeong, In-Jae email: ijeong@hanyang.ac.kr organization: Hanyang University |
| BookMark | eNp9kMtqwzAUREVJoUnaTyjoB-zqYdnyriH0BYFuWuhOyJZEFGTLSAqp_752k267ujD3zMDMCix632sA7jHKMeLoAVHECGZfOUGkyAllGPP6CiwxInWGSEUXYDkz2QzdgFWMB4QwRYgvwWEDzdG5EQ7ejb3vrHQw2U5DOQzBf9tOJut7GNu9nkTjA5QwJj_8KuroNPRmklKQfRx8SGfc2V7Dk017f0ywmX4THG_BtZEu6rvLXYPP56eP7Wu2e3952252WUsYT1mlZKtYgagqOG-4YYrLuqzrRktiyqpSVVm0JVOGm6KtW6qaqmaclVTjEhcG0TVg59w2-BiDNmIIU48wCozEPJj4G0zMg4nLYJPv8eyz_dSzkycfnBJJjs4HM3ewUdD_I34ATQN2sw |
| Cites_doi | 10.1002/atr.1278 10.1016/j.cor.2022.106116 10.1016/j.tre.2019.08.012 10.1080/23249935.2020.1798554 10.3141/2289-04 10.1080/18756891.2011.9727864 10.1016/j.trb.2010.01.003 10.3141/2197-02 10.1201/9781420010749.ch9 10.1016/j.omega.2015.11.003 10.1016/j.trc.2013.06.004 10.1016/S0191-2615(99)00013-2 10.1016/j.tre.2020.102119 10.1016/j.trc.2015.09.013 10.1007/s12469-013-0067-7 10.1016/j.tre.2015.08.007 10.1016/j.ejor.2023.07.031 10.1155/2017/3097681 |
| ContentType | Journal Article |
| Copyright | 2024 Informa UK Limited, trading as Taylor & Francis Group 2024 |
| Copyright_xml | – notice: 2024 Informa UK Limited, trading as Taylor & Francis Group 2024 |
| DBID | AAYXX CITATION |
| DOI | 10.1080/0305215X.2024.2351189 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1029-0273 |
| EndPage | 1342 |
| ExternalDocumentID | 10_1080_0305215X_2024_2351189 2351189 |
| Genre | Research Article |
| GroupedDBID | -~X .7F .QJ 0BK 0R~ 29G 2DF 30N 4.4 5GY 5VS AAENE AAGDL AAHIA AAJMT AALDU AAMIU AAPUL AAQRR ABCCY ABFIM ABHAV ABJNI ABLIJ ABPAQ ABPEM ABTAI ABXUL ABXYU ACGEJ ACGFS ACGOD ACIWK ACTIO ADCVX ADGTB ADXPE AEISY AENEX AEOZL AEPSL AEYOC AFKVX AFRVT AGDLA AGMYJ AHDZW AIJEM AIYEW AJWEG AKBVH AKOOK ALMA_UNASSIGNED_HOLDINGS ALQZU AQRUH AQTUD AVBZW AWYRJ BLEHA CCCUG CE4 CS3 DGEBU DKSSO EBS E~A E~B GTTXZ H13 HF~ HZ~ H~P IPNFZ J.P KYCEM LJTGL M4Z NA5 NX~ O9- P2P PQQKQ RIG RNANH ROSJB RTWRZ S-T SNACF TASJS TBQAZ TDBHL TEN TFL TFT TFW TN5 TNC TTHFI TUROJ TWF UT5 UU3 ZGOLN ~S~ AAYXX CITATION |
| ID | FETCH-LOGICAL-c258t-7dacd5403d488b8f5d8a9699bea2f677d764c65df8f4c9c3db7958563e1614f03 |
| IEDL.DBID | TFW |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001228628500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-215X |
| IngestDate | Sat Nov 29 07:54:19 EST 2025 Mon Oct 20 23:46:53 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c258t-7dacd5403d488b8f5d8a9699bea2f677d764c65df8f4c9c3db7958563e1614f03 |
| PageCount | 20 |
| ParticipantIDs | informaworld_taylorfrancis_310_1080_0305215X_2024_2351189 crossref_primary_10_1080_0305215X_2024_2351189 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-05-04 |
| PublicationDateYYYYMMDD | 2025-05-04 |
| PublicationDate_xml | – month: 05 year: 2025 text: 2025-05-04 day: 04 |
| PublicationDecade | 2020 |
| PublicationTitle | Engineering optimization |
| PublicationYear | 2025 |
| Publisher | Taylor & Francis |
| Publisher_xml | – name: Taylor & Francis |
| References | Schuurman P. (e_1_3_3_16_1) 2011 e_1_3_3_7_1 e_1_3_3_6_1 e_1_3_3_9_1 e_1_3_3_8_1 e_1_3_3_18_1 e_1_3_3_17_1 e_1_3_3_19_1 e_1_3_3_14_1 e_1_3_3_13_1 e_1_3_3_15_1 e_1_3_3_3_1 e_1_3_3_10_1 e_1_3_3_21_1 e_1_3_3_2_1 e_1_3_3_20_1 e_1_3_3_5_1 e_1_3_3_12_1 e_1_3_3_4_1 e_1_3_3_11_1 |
| References_xml | – ident: e_1_3_3_3_1 doi: 10.1002/atr.1278 – ident: e_1_3_3_12_1 – ident: e_1_3_3_9_1 doi: 10.1016/j.cor.2022.106116 – ident: e_1_3_3_19_1 doi: 10.1016/j.tre.2019.08.012 – ident: e_1_3_3_8_1 doi: 10.1080/23249935.2020.1798554 – ident: e_1_3_3_11_1 doi: 10.3141/2289-04 – volume-title: Lectures in Scheduling year: 2011 ident: e_1_3_3_16_1 – ident: e_1_3_3_15_1 doi: 10.1080/18756891.2011.9727864 – ident: e_1_3_3_13_1 doi: 10.1016/j.trb.2010.01.003 – ident: e_1_3_3_18_1 doi: 10.3141/2197-02 – ident: e_1_3_3_17_1 doi: 10.1201/9781420010749.ch9 – ident: e_1_3_3_20_1 doi: 10.1016/j.omega.2015.11.003 – ident: e_1_3_3_14_1 doi: 10.1016/j.trc.2013.06.004 – ident: e_1_3_3_2_1 doi: 10.1016/S0191-2615(99)00013-2 – ident: e_1_3_3_6_1 doi: 10.1016/j.tre.2020.102119 – ident: e_1_3_3_10_1 doi: 10.1016/j.trc.2015.09.013 – ident: e_1_3_3_5_1 doi: 10.1007/s12469-013-0067-7 – ident: e_1_3_3_4_1 doi: 10.1016/j.tre.2015.08.007 – ident: e_1_3_3_7_1 doi: 10.1016/j.ejor.2023.07.031 – ident: e_1_3_3_21_1 doi: 10.1155/2017/3097681 |
| SSID | ssj0013008 |
| Score | 2.3925602 |
| Snippet | For a transportation line without branches, passenger service scheduling is mainly concerned with the determination of stop schedules for planned service... |
| SourceID | crossref informaworld |
| SourceType | Index Database Publisher |
| StartPage | 1323 |
| SubjectTerms | error bound fully polynomial approximation Origin-destination stop schedule |
| Title | A fully polynomial time approximation scheme for a stop schedule of a transportation line without branches |
| URI | https://www.tandfonline.com/doi/abs/10.1080/0305215X.2024.2351189 |
| Volume | 57 |
| WOSCitedRecordID | wos001228628500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAWR databaseName: Taylor & Francis Journals Complete customDbUrl: eissn: 1029-0273 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0013008 issn: 0305-215X databaseCode: TFW dateStart: 19740101 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxQADb0R5yQNrSh6OH2OFqJgqhiK6RXZsi6KqqZoE0X-Pz0lEO8ACq-WzThc7d2fffR9Cd9TENtRKBzJKZECYoYGExFUrRoxOc05S5ckm2HjMp1Px3FYTlm1ZJeTQtgGK8P9qONxSlV1F3D3sUeeppi67i8kghqcwDi18zvXD0ZyMXr_fEULPSQcSAYh0PTw_rbLlnbawSze8zujwH_Q9QgdtyImHzR45RjtmcYL2N4AIT9H7EMM9_Bovi_kaGpXdfGCdxx5y_HPW9DdilwkbN-jUxRIDJIEf0fXc4MK6oapDSm-mg6oYLnqLusIKGDzeTHmGXkaPk4enoGVhCPI45VXAtMy1i-sS7c664jbVXAoqhDIytpQxzSjJaaottyQXOeA1C5eD0MS4YJLYMDlHvUWxMBcIQ_qVJPD-rgWhEeWMRcJKE2kRpqmJ-mjQWT9bNmAbWdRhmLZGzMCIWWvEPhKb3yir_C2HbShJsuRX2cs_yF6hvRh4gKHwkVyjXrWqzQ3azT-qWbm69VvwC6Bo2c8 |
| linkProvider | Taylor & Francis |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELagIAEDb0R5emBNaRI_xwpRFVE6FdEtcmJbgKqmalNE_z2-PEQ6wAKr5bOsi517-O77ELphJrBtHWtP-aHyCDfMUxC46pgTo2kiCI1zsgk-GIjRSNZ7YaCsEmJoWwBF5P9quNyQjK5K4m7hkDpTNXLhXUBaAbyFCbmONqiztYCfP-y-fL8ktHNWOhDxQKbq4vlpmRX7tIJeWrM73b3_2PE-2i29TtwpjskBWjOTQ7RTwyI8Qu8dDGst8TQdL6FX2c0H4nmco45_vhUtjtgFw8YNuv1ihQGVIB_Ri7HBqXVDWQWWXkyHvWLI9aaLDMdA4vFq5sfouXs_vOt5JRGDlwRUZB7XKtHOtQu1u-6xsFQLJZmUsVGBZZxrzkjCqLbCkkQmANksXRjCQuP8SWLb4QlqTNKJOUUYIrAwhCd4LQnzmeDcl1YZX8s2pcZvolal_mha4G1EfgVjWioxAiVGpRKbSNY_UpTliQ5bsJJE4a-yZ3-QvUZbveFTP-o_DB7P0XYAtMBQB0kuUCObLcwl2kw-srf57Co_j196jd35 |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwED5BQQgG3ojy9MAaaBLHjscKiECgqkMR3SIntkVR1VRtiui_x5eHaAdYYLV8lnU55x4-fx_AFdOeaalEOdL1pUO5Zo7ExFUlnGoVpCENkoJsgnc6Yb8vulU34bRqq8Qc2pRAEcW_Gg_3WJm6I-4GbdR6qr7N7jx67eFVWChWYc2GzgyNvBe9fl8ktApSOhRxUKZ-xPPTMkvuaQm8dMHtRDv_sOFd2K5iTtIujWQPVvRoH7YWkAgP4L1NsBA_J-NsOMeXynY-0s6TAnP8c1A-cCQ2FdZ20G6XSIKYBMWImg01yYwdymuo9HI6bpVgpTeb5SRBCo83PT2El-i-d_vgVDQMTuoFYe5wJVNlAztf2cOehCZQoRRMiERLzzDOFWc0ZYEyoaGpSBGwWdgkhPnaRpPUtPwjaIyykT4GgvmX7-MFvBKUuSzk3BVGaleJVhBotwnXtfbjcYm2Ebs1iGmlxBiVGFdKbIJY_EZxXpQ5TMlJEvu_yp78QfYSNrp3Ufz82Hk6hU0POYGxCZKeQSOfzPQ5rKcf-WA6uSis8Qv29dyr |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+fully+polynomial+time+approximation+scheme+for+a+stop+schedule+of+a+transportation+line+without+branches&rft.jtitle=Engineering+optimization&rft.au=Jeong%2C+In-Jae&rft.date=2025-05-04&rft.pub=Taylor+%26+Francis&rft.issn=0305-215X&rft.eissn=1029-0273&rft.volume=57&rft.issue=5&rft.spage=1323&rft.epage=1342&rft_id=info:doi/10.1080%2F0305215X.2024.2351189&rft.externalDocID=2351189 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-215X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-215X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-215X&client=summon |