Mixed-integer second-order cone programming model for bus route clustering problem

•Propose a practical bus route clustering problem (BRCP).•Formulate a mixed-integer second-order cone programming (MISOCP) model.•Prove the problem is NP-hard.•Conduct extensive numerical experiments. Bus route clustering problem (BRCP) concerns the assignment of bus routes to different boarding loc...

Full description

Saved in:

Bibliographic Details
Published in:	Transportation research. Part C, Emerging technologies Vol. 102; pp. 351 - 369
Main Authors:	Wang, Shuaian, Zhang, Wei, Bie, Yiming, Wang, Kai, Diabat, Ali
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.05.2019
Subjects:	Bus passenger Bus route cluster Mixed-integer second-order cone program Bus passenger Mixed-integer second-order cone program Bus route cluster
ISSN:	0968-090X, 1879-2359
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	•Propose a practical bus route clustering problem (BRCP).•Formulate a mixed-integer second-order cone programming (MISOCP) model.•Prove the problem is NP-hard.•Conduct extensive numerical experiments. Bus route clustering problem (BRCP) concerns the assignment of bus routes to different boarding locations of a bus station with the objective of minimizing passenger waiting time. In this study, we formulate the BRCP as a mixed-integer second-order cone program (MISOCP). Simulations are conducted, in which the MISOCP model is applied to a major bus station in Hong Kong based on the network of actual bus routes. Experiments are tested for large size instances under different scenarios. Results show that the complexity of the BRCP is highly dependent on the overlapping degree of bus networks, while other factors, including the number of bus routes, destinations, and boarding locations have a joint effect; the influence is instance-specific based on different overlapping topologies of bus route networks.
AbstractList	•Propose a practical bus route clustering problem (BRCP).•Formulate a mixed-integer second-order cone programming (MISOCP) model.•Prove the problem is NP-hard.•Conduct extensive numerical experiments. Bus route clustering problem (BRCP) concerns the assignment of bus routes to different boarding locations of a bus station with the objective of minimizing passenger waiting time. In this study, we formulate the BRCP as a mixed-integer second-order cone program (MISOCP). Simulations are conducted, in which the MISOCP model is applied to a major bus station in Hong Kong based on the network of actual bus routes. Experiments are tested for large size instances under different scenarios. Results show that the complexity of the BRCP is highly dependent on the overlapping degree of bus networks, while other factors, including the number of bus routes, destinations, and boarding locations have a joint effect; the influence is instance-specific based on different overlapping topologies of bus route networks.
Author	Wang, Shuaian Diabat, Ali Wang, Kai Bie, Yiming Zhang, Wei
Author_xml	– sequence: 1 givenname: Shuaian surname: Wang fullname: Wang, Shuaian organization: Department of Logistics and Maritime Studies, Hong Kong Polytechnic University, Hung Hom, Hong Kong – sequence: 2 givenname: Wei surname: Zhang fullname: Zhang, Wei organization: Department of Logistics and Maritime Studies, Hong Kong Polytechnic University, Hung Hom, Hong Kong – sequence: 3 givenname: Yiming surname: Bie fullname: Bie, Yiming email: yimingbie@126.com organization: School of Transportation, Jilin University, Changchun 130022, China – sequence: 4 givenname: Kai orcidid: 0000-0002-3040-0422 surname: Wang fullname: Wang, Kai organization: Department of Logistics and Maritime Studies, Hong Kong Polytechnic University, Hung Hom, Hong Kong – sequence: 5 givenname: Ali surname: Diabat fullname: Diabat, Ali organization: Division of Engineering, New York University Abu Dhabi, Saadiyat Island, 129188 Abu Dhabi, United Arab Emirates
BookMark	eNp9kF9LwzAUxYNMcJt-AN_6BVqTpmsafJLhP5gIouBbSG9uR0bbjCQT_famzCcf9nTu5Z7fhXMWZDa6EQm5ZrRglNU3uyJ6KErKZEF5keSMzFkjZF7ylZyROZV1k1NJPy_IIoQdpcmyEnPy9mK_0eR2jLhFnwUEN5rceZOWNGK2927r9TDYcZsNzmCfdc5n7SFk3h0iZtAfQkQ_nZO17XG4JOed7gNe_emSfDzcv6-f8s3r4_P6bpNDxVjMSwCGHXSmLAHRgDSi4lpjhawtV5JzELKRDa-lMVgL1lVY67ZqS6xEBaLlSyKOf8G7EDx2CmzU0boxem17xaiaqlE7lapRUzWKcpUkkewfufd20P7nJHN7ZDBF-rLoVQCLI6CxHiEq4-wJ-hciFoFI
CitedBy_id	crossref_primary_10_3390_su14063627 crossref_primary_10_1016_j_trc_2025_105082 crossref_primary_10_3390_su13041827 crossref_primary_10_3390_su13094689 crossref_primary_10_3390_su13031342 crossref_primary_10_1016_j_tre_2023_103315 crossref_primary_10_1080_23249935_2020_1726525 crossref_primary_10_1111_mice_12684 crossref_primary_10_1080_23249935_2023_2253477 crossref_primary_10_1109_ACCESS_2020_2974740 crossref_primary_10_1088_1742_6596_1811_1_012010 crossref_primary_10_2478_amns_2024_2960 crossref_primary_10_1109_ACCESS_2020_3014609 crossref_primary_10_3390_su13094796 crossref_primary_10_3390_su16166853 crossref_primary_10_1016_j_physa_2021_126276 crossref_primary_10_1109_ACCESS_2019_2940315 crossref_primary_10_1016_j_eswa_2023_120352
Cites_doi	10.1061/(ASCE)0733-947X(2001)127:3(195) 10.1201/9781420010749.ch48 10.1061/(ASCE)TE.1943-5436.0000536 10.1016/0191-2615(82)90025-X 10.1007/978-1-4684-2001-2_9 10.1145/321958.321975 10.1016/j.tre.2011.05.011 10.1016/0377-2217(84)90155-3 10.1016/j.ejor.2015.12.006 10.1007/978-1-4757-3023-4_1 10.1016/j.trc.2019.02.006 10.1109/ICKS.2004.1313429 10.1016/0191-2615(86)90047-0 10.1016/j.trc.2018.04.016 10.1111/1467-8667.00309 10.1016/0191-2615(89)90034-9 10.1016/j.trc.2013.08.007 10.1016/j.ejor.2007.02.005 10.1016/j.trb.2017.12.013 10.1016/j.orl.2009.02.003 10.1016/j.trb.2015.03.002 10.1145/780542.780550 10.1287/mnsc.35.8.923 10.1061/(ASCE)0733-947X(2003)129:2(186) 10.1287/trsc.1070.0216 10.1007/PL00011380 10.1016/j.ejor.2013.01.001 10.1016/S0191-2615(00)00036-9 10.1016/j.trc.2018.01.004 10.1016/j.trc.2019.02.005 10.1016/j.trc.2013.06.004 10.1007/s10107-002-0355-5 10.1016/S0166-218X(01)00290-6 10.1016/j.trb.2015.03.004 10.1016/j.trc.2018.01.026 10.1287/trsc.9.2.115 10.1016/j.orl.2003.12.007 10.1016/j.trb.2014.05.008 10.1016/j.tre.2009.11.001 10.1016/j.eswa.2014.05.034 10.1016/j.trc.2011.01.003 10.1016/j.trc.2017.11.013 10.1111/1475-3995.d01-43 10.1016/j.ejor.2010.08.020 10.1287/opre.1070.0441 10.1007/s10107-002-0339-5
ContentType	Journal Article
Copyright	2019 Elsevier Ltd
Copyright_xml	– notice: 2019 Elsevier Ltd
DBID	AAYXX CITATION
DOI	10.1016/j.trc.2019.03.019
DatabaseName	CrossRef
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Economics Engineering
EISSN	1879-2359
EndPage	369
ExternalDocumentID	10_1016_j_trc_2019_03_019 S0968090X18308581
GroupedDBID	--K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN ABBOA ABLJU ABMAC ABMMH ABUCO ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEKER AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ASPBG AVARZ AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HAMUX HMY HVGLF HZ~ H~9 IHE J1W JJJVA KOM LY1 LY7 M3Y M41 MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PRBVW Q38 R2- RIG ROL RPZ SDF SDG SDS SES SET SEW SPC SPCBC SSB SSD SSO SSS SST SSV SSZ T5K TN5 WUQ XPP ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ADNMO AEIPS AFJKZ AGQPQ AIIUN ANKPU APXCP CITATION EFKBS ~HD
ID	FETCH-LOGICAL-c411t-2cc1efcfd22ceedc9d743aae4e1b25933c79898369dde671f4e6ab4b2e474c7b3
ISICitedReferencesCount	22
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000467516700020&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0968-090X
IngestDate	Sat Nov 29 07:06:42 EST 2025 Tue Nov 18 21:59:55 EST 2025 Fri Feb 23 02:16:17 EST 2024
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Keywords	Bus passenger Mixed-integer second-order cone program Bus route cluster
Language	English
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c411t-2cc1efcfd22ceedc9d743aae4e1b25933c79898369dde671f4e6ab4b2e474c7b3
ORCID	0000-0002-3040-0422
OpenAccessLink	http://hdl.handle.net/10397/98280
PageCount	19
ParticipantIDs	crossref_citationtrail_10_1016_j_trc_2019_03_019 crossref_primary_10_1016_j_trc_2019_03_019 elsevier_sciencedirect_doi_10_1016_j_trc_2019_03_019
PublicationCentury	2000
PublicationDate	2019-05-01
PublicationDateYYYYMMDD	2019-05-01
PublicationDate_xml	– month: 05 year: 2019 text: 2019-05-01 day: 01
PublicationDecade	2010
PublicationTitle	Transportation research. Part C, Emerging technologies
PublicationYear	2019
Publisher	Elsevier Ltd
Publisher_xml	– name: Elsevier Ltd
References	Sahni, Gonzalez (b0215) 1976; 23 Szeto, Wu (b0235) 2011; 209 Peña, F.J., Jiménez, A., Mateos, A., 2013. A first approach to the optimization of Bogota’s TransMilenio BRT system. In: Society 40th Anniversary Workshop–FORS40, pp. 94. Mulvey, Beck (b0165) 1984; 18 De La Vega, W.F., Karpinski, M., Kenyon, C., Rabani, Y., 2003. Approximation schemes for clustering problems. In: Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing, ACM, pp. 50–58. Niu, Zhou, Gao (b0185) 2015; 76 Yagiura, M., Ibaraki, T., 2007. Generalized Assignment Problem. In: Gonzale, T.F. (Ed.). Handbook of approximation algorithms and metaheuristics. Chapman and Hall/CRC in the Computer and Information Science Series, Chapter 48. Öncan (b0195) 2007; 45 Zolfaghari, Azizi, Jaber (b0295) 2004; 2 Yagiura, M., Ibaraki, T., 2004. Recent metaheuristic algorithms for the generalized assignment problem. In: Informatics Research for Development of Knowledge Society Infrastructure, 2004. ICKS 2004. International Conference on IEEE, pp. 229–237. Yu, Lam, Tam (b0280) 2011; 19 Spiess, Florian (b0225) 1989; 23 Hook, Wright (b0100) 2007 Lyu, Chow, Lee, Ng, Li, Zeng (b0135) 2019; 101 Chen, Sim, Sun (b0035) 2007; 55 Du, Chen, Quan, Long, Fung (b0055) 2011; 47 Farahani, Miandoabchi, Szeto, Rashidi (b0060) 2013; 229 New World First Bus Services Limited, 2016 (Accessed 3 February 2018) Szeto, Jiang (b0230) 2014; 67 Tom, Mohan (b0240) 2003; 129 Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M., 1999. The maximum clique problem. In: Handbook of Combinatorial Optimization, Springer, Boston, MA, pp.1–74. . Ben-Tal, Nemirovski (b0010) 2000; 88 Zhao, Zeng (b0290) 2008; 186 Karp (b0120) 1972 Alizadeh, Goldfarb (b0005) 2003; 95 Yan, Tang (b0265) 2008; 42 Google, 2018. Accessed 3 February 2018. https://www.google.com.hk/maps/place/Cross+Harbour+Tunnel/@22.3005982,114.1790163,17z/data=!4m7!3m6!1s0x340400e63fcd8ae5:0xf1d75f3ce114e89c!6m1!1v5!8m2!3d22.3030577!4d114.180923?hl=en. Liu, Yan, Qu, Zhang (b0130) 2013; 35 Meng, Qu (b0150) 2013; 36 Guihaire, Hao (b0090) 2008; 42 Konc, Janezic (b0125) 2007; 4 Ndambuki, J.M., Stoet, C.B.M., Veling, E.J.M., Terlaky, T., 2000. Robust groundwater management through second order cone programming (SOCP). Groundwater: Past Achievements and Future Challenges, pp.413–417. Ibarra-Rojas, Delgado, Giesen, Muñoz (b0105) 2015; 77 Gov HK, 2017. Accessed on October 2018. Mazzola (b0145) 1989; 35 Osman, Christofides (b0200) 1994; 1 Ceder, Wilson (b0025) 1986; 20 Chakroborty (b0030) 2003; 18 Meng, Yang (b0155) 2002; 36 Zhang, Meng, Kang, Li (b0285) 2018; 86 Bertsimas, Pachamanova, Sim (b0015) 2004; 32 Gkiotsalitis, Cats (b0075) 2018; 88 Varga, Tettamanti, Kulcsár (b0245) 2018; 92 Yan, Liu, Meng, Jiang (b0275) 2013; 139 Chu (b0045) 2018; 108 Saka (b0220) 2001; 127 Fouilhoux, Ibarra-Rojas, Kedad-Sidhoum, Rios-Solis (b0065) 2016; 251 Ibeas, dell’Olio, Alonso, Sainz (b0110) 2010; 46 Östergård (b0205) 2002; 120 Nikolić, Teodorović (b0180) 2014; 41 Chriqui, Robillard (b0040) 1975; 9 Yan, Chi, Tang (b0270) 2006; 40 Mittelmann (b0160) 2003; 95 Han, Wilson (b0095) 1982; 16 Oliker, Bekhor (b0190) 2018; 88 Frangioni, Gentile (b0070) 2009; 37 Kang, Chen, Meng (b0115) 2019; 101 Yan (10.1016/j.trc.2019.03.019_b0275) 2013; 139 10.1016/j.trc.2019.03.019_b0085 Liu (10.1016/j.trc.2019.03.019_b0130) 2013; 35 10.1016/j.trc.2019.03.019_b0080 Osman (10.1016/j.trc.2019.03.019_b0200) 1994; 1 Szeto (10.1016/j.trc.2019.03.019_b0230) 2014; 67 Farahani (10.1016/j.trc.2019.03.019_b0060) 2013; 229 Ibarra-Rojas (10.1016/j.trc.2019.03.019_b0105) 2015; 77 Niu (10.1016/j.trc.2019.03.019_b0185) 2015; 76 Mazzola (10.1016/j.trc.2019.03.019_b0145) 1989; 35 Zolfaghari (10.1016/j.trc.2019.03.019_b0295) 2004; 2 Zhang (10.1016/j.trc.2019.03.019_b0285) 2018; 86 Ceder (10.1016/j.trc.2019.03.019_b0025) 1986; 20 Chakroborty (10.1016/j.trc.2019.03.019_b0030) 2003; 18 Ibeas (10.1016/j.trc.2019.03.019_b0110) 2010; 46 Chu (10.1016/j.trc.2019.03.019_b0045) 2018; 108 Hook (10.1016/j.trc.2019.03.019_b0100) 2007 Meng (10.1016/j.trc.2019.03.019_b0155) 2002; 36 Kang (10.1016/j.trc.2019.03.019_b0115) 2019; 101 Tom (10.1016/j.trc.2019.03.019_b0240) 2003; 129 Varga (10.1016/j.trc.2019.03.019_b0245) 2018; 92 Konc (10.1016/j.trc.2019.03.019_b0125) 2007; 4 Guihaire (10.1016/j.trc.2019.03.019_b0090) 2008; 42 Östergård (10.1016/j.trc.2019.03.019_b0205) 2002; 120 10.1016/j.trc.2019.03.019_b0260 10.1016/j.trc.2019.03.019_b0020 Alizadeh (10.1016/j.trc.2019.03.019_b0005) 2003; 95 Öncan (10.1016/j.trc.2019.03.019_b0195) 2007; 45 Chriqui (10.1016/j.trc.2019.03.019_b0040) 1975; 9 Du (10.1016/j.trc.2019.03.019_b0055) 2011; 47 Saka (10.1016/j.trc.2019.03.019_b0220) 2001; 127 Bertsimas (10.1016/j.trc.2019.03.019_b0015) 2004; 32 Yan (10.1016/j.trc.2019.03.019_b0265) 2008; 42 Nikolić (10.1016/j.trc.2019.03.019_b0180) 2014; 41 10.1016/j.trc.2019.03.019_b0050 10.1016/j.trc.2019.03.019_b0170 Szeto (10.1016/j.trc.2019.03.019_b0235) 2011; 209 10.1016/j.trc.2019.03.019_b0175 Mittelmann (10.1016/j.trc.2019.03.019_b0160) 2003; 95 Sahni (10.1016/j.trc.2019.03.019_b0215) 1976; 23 Yan (10.1016/j.trc.2019.03.019_b0270) 2006; 40 Han (10.1016/j.trc.2019.03.019_b0095) 1982; 16 Ben-Tal (10.1016/j.trc.2019.03.019_b0010) 2000; 88 Karp (10.1016/j.trc.2019.03.019_b0120) 1972 Yu (10.1016/j.trc.2019.03.019_b0280) 2011; 19 Gkiotsalitis (10.1016/j.trc.2019.03.019_b0075) 2018; 88 Meng (10.1016/j.trc.2019.03.019_b0150) 2013; 36 Chen (10.1016/j.trc.2019.03.019_b0035) 2007; 55 Spiess (10.1016/j.trc.2019.03.019_b0225) 1989; 23 Zhao (10.1016/j.trc.2019.03.019_b0290) 2008; 186 Frangioni (10.1016/j.trc.2019.03.019_b0070) 2009; 37 10.1016/j.trc.2019.03.019_b0255 Fouilhoux (10.1016/j.trc.2019.03.019_b0065) 2016; 251 Lyu (10.1016/j.trc.2019.03.019_b0135) 2019; 101 Oliker (10.1016/j.trc.2019.03.019_b0190) 2018; 88 10.1016/j.trc.2019.03.019_b0210 Mulvey (10.1016/j.trc.2019.03.019_b0165) 1984; 18
References_xml	– volume: 67 start-page: 235 year: 2014 end-page: 263 ident: b0230 article-title: Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach publication-title: Transport. Res. B: Methodol. – volume: 47 start-page: 1021 year: 2011 end-page: 1037 ident: b0055 article-title: Berth allocation considering fuel consumption and vessel emissions publication-title: Transport. Res. E: Logist. Transport. Rev. – volume: 76 start-page: 117 year: 2015 end-page: 135 ident: b0185 article-title: Train scheduling for minimizing passenger waiting time with time-dependent demand and skip-stop patterns: nonlinear integer programming models with linear constraints publication-title: Transport. Res. B: Methodol. – volume: 19 start-page: 1157 year: 2011 end-page: 1170 ident: b0280 article-title: Bus arrival time prediction at destination with multiple routes publication-title: Transport. Res. C: Emerg. Technol. – reference: Yagiura, M., Ibaraki, T., 2007. Generalized Assignment Problem. In: Gonzale, T.F. (Ed.). Handbook of approximation algorithms and metaheuristics. Chapman and Hall/CRC in the Computer and Information Science Series, Chapter 48. – volume: 88 start-page: 187 year: 2018 end-page: 207 ident: b0075 article-title: Reliable frequency determination: incorporating information on service uncertainty when setting dispatching headways publication-title: Transport. Res. C: Emerg. Technol. – volume: 40 start-page: 572 year: 2006 end-page: 586 ident: b0270 article-title: Inter-city bus routing and timetable setting under stochastic demands publication-title: Transport. Res. A: Pol. Pract. – volume: 16 start-page: 221 year: 1982 end-page: 232 ident: b0095 article-title: The allocation of buses in heavily utilized networks with overlapping routes publication-title: Transport. Res. B: Methodol. – volume: 2 start-page: 99 year: 2004 end-page: 110 ident: b0295 article-title: A model for holding strategy in public transit systems with real-time information publication-title: Int. J. Transp. Manage. – reference: Gov HK, 2017. Accessed on October 2018. < – volume: 20 start-page: 331 year: 1986 end-page: 344 ident: b0025 article-title: Bus network design publication-title: Transport. Res. B: Methodol. – volume: 88 start-page: 411 year: 2000 end-page: 424 ident: b0010 article-title: Robust solutions of linear programming problems contaminated with uncertain data publication-title: Math. Program. – volume: 86 start-page: 220 year: 2018 end-page: 244 ident: b0285 article-title: Tailored Wakeby-type distribution for random bus headway adherence ratio publication-title: Transport. Res. C: Emerg. Technol. – volume: 120 start-page: 197 year: 2002 end-page: 207 ident: b0205 article-title: A fast algorithm for the maximum clique problem publication-title: Discrete Appl. Math. – volume: 55 start-page: 1058 year: 2007 end-page: 1071 ident: b0035 article-title: A robust optimization perspective on stochastic programming publication-title: Oper. Res. – volume: 35 start-page: 46 year: 2013 end-page: 56 ident: b0130 article-title: Destination-skipping scheme with random travel time publication-title: Transport. Res. C: Emerg. Technol. – volume: 88 start-page: 17 year: 2018 end-page: 30 ident: b0190 article-title: A frequency based transit assignment model that considers online information publication-title: Transport. Res. C: Emerg. Technol. – volume: 108 start-page: 188 year: 2018 end-page: 216 ident: b0045 article-title: Mixed-integer programming model and branch-and-price-and-cut algorithm for urban bus network design and timetabling publication-title: Transport. Res. B: Methodol. – year: 2007 ident: b0100 article-title: Bus Rapid Transit Planning Guide – volume: 18 start-page: 339 year: 1984 end-page: 348 ident: b0165 article-title: Solving capacitated clustering problems publication-title: Eur. J. Oper. Res. – volume: 129 start-page: 186 year: 2003 end-page: 195 ident: b0240 article-title: Transit route network design using frequency coded genetic algorithm publication-title: J. Transp. Eng. – reference: De La Vega, W.F., Karpinski, M., Kenyon, C., Rabani, Y., 2003. Approximation schemes for clustering problems. In: Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing, ACM, pp. 50–58. – volume: 23 start-page: 555 year: 1976 end-page: 565 ident: b0215 article-title: P-complete approximation problems publication-title: J. Assoc. Comput. Mach. – volume: 101 start-page: 145 year: 2019 end-page: 160 ident: b0115 article-title: Bus and driver scheduling with mealtime windows for a single public bus route publication-title: Transport. Res. C: Emerg. Technol. – volume: 186 start-page: 841 year: 2008 end-page: 855 ident: b0290 article-title: Optimization of transit route network, vehicle headways and timetables for large-scale transit networks publication-title: Eur. J. Oper. Res. – volume: 42 start-page: 318 year: 2008 end-page: 335 ident: b0265 article-title: An integrated framework for intercity bus scheduling under stochastic bus travel times publication-title: Transport. Sci. – volume: 95 start-page: 3 year: 2003 end-page: 51 ident: b0005 article-title: Second-order cone programming publication-title: Math. Program. – volume: 209 start-page: 141 year: 2011 end-page: 155 ident: b0235 article-title: A simultaneous bus route design and frequency setting problem for Tin Shui Wai, Hong Kong publication-title: Eur. J. Oper. Res. – volume: 92 start-page: 1 year: 2018 end-page: 26 ident: b0245 article-title: Optimally combined headway and timetable reliable public transport system publication-title: Transport. Res. C: Emerg. Technol. – volume: 251 start-page: 442 year: 2016 end-page: 450 ident: b0065 article-title: Valid inequalities for the synchronization bus timetabling problem publication-title: Eur. J. Oper. Res. – volume: 36 start-page: 19 year: 2002 end-page: 35 ident: b0155 article-title: Benefit distribution and equity in road network design publication-title: Transport. Res. B: Methodol. – volume: 95 start-page: 407 year: 2003 end-page: 430 ident: b0160 article-title: An independent benchmarking of SDP and SOCP solvers publication-title: Math. Program. – reference: Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M., 1999. The maximum clique problem. In: Handbook of Combinatorial Optimization, Springer, Boston, MA, pp.1–74. – reference: Google, 2018. Accessed 3 February 2018. https://www.google.com.hk/maps/place/Cross+Harbour+Tunnel/@22.3005982,114.1790163,17z/data=!4m7!3m6!1s0x340400e63fcd8ae5:0xf1d75f3ce114e89c!6m1!1v5!8m2!3d22.3030577!4d114.180923?hl=en. – reference: Peña, F.J., Jiménez, A., Mateos, A., 2013. A first approach to the optimization of Bogota’s TransMilenio BRT system. In: Society 40th Anniversary Workshop–FORS40, pp. 94. – reference: Yagiura, M., Ibaraki, T., 2004. Recent metaheuristic algorithms for the generalized assignment problem. In: Informatics Research for Development of Knowledge Society Infrastructure, 2004. ICKS 2004. International Conference on IEEE, pp. 229–237. – volume: 45 start-page: 123 year: 2007 end-page: 141 ident: b0195 article-title: A survey of the generalized assignment problem and its applications publication-title: Inform. Syst. Operat. Res. – volume: 139 start-page: 625 year: 2013 end-page: 634 ident: b0275 article-title: Robust optimization model of bus transit network design with stochastic travel time publication-title: J. Transp. Eng. – reference: New World First Bus Services Limited, 2016 (Accessed 3 February 2018) < – volume: 1 start-page: 317 year: 1994 end-page: 336 ident: b0200 article-title: Capacitated clustering problems by hybrid simulated annealing and tabu search publication-title: Int. Trans. Operat. Res. – volume: 32 start-page: 510 year: 2004 end-page: 516 ident: b0015 article-title: Robust linear optimization under general norms publication-title: Oper. Res. Lett. – volume: 77 start-page: 38 year: 2015 end-page: 75 ident: b0105 article-title: Planning, operation, and control of bus transport systems: a literature review publication-title: Transport. Res. B: Methodol. – volume: 46 start-page: 446 year: 2010 end-page: 458 ident: b0110 article-title: Optimizing destination spacing in urban areas publication-title: Transport. Res. E: Logist. Transport. Rev. – volume: 101 start-page: 233 year: 2019 end-page: 253 ident: b0135 article-title: CB-Planner: a bus line planning framework for customized bus systems publication-title: Transport. Res. C: Emerg. Technol. – volume: 18 start-page: 184 year: 2003 end-page: 200 ident: b0030 article-title: Genetic algorithms for optimal urban transit network design publication-title: Comput.-Aided Civ. Infrastruct. Eng. – start-page: 85 year: 1972 end-page: 103 ident: b0120 article-title: Reducibility among combinatorial problems publication-title: Complex. Comput. Computat. – reference: >. – volume: 35 start-page: 923 year: 1989 end-page: 941 ident: b0145 article-title: Generalized assignment with nonlinear capacity interaction publication-title: Manage. Sci. – volume: 229 start-page: 281 year: 2013 end-page: 302 ident: b0060 article-title: A review of urban transportation network design problems publication-title: Eur. J. Oper. Res. – volume: 4 year: 2007 ident: b0125 article-title: An improved branch and bound algorithm for the maximum clique problem publication-title: Proteins – volume: 41 start-page: 7200 year: 2014 end-page: 7209 ident: b0180 article-title: A simultaneous transit network design and frequency setting: computing with bees publication-title: Expert Syst. Appl. – volume: 23 start-page: 83 year: 1989 end-page: 102 ident: b0225 article-title: Optimal strategies: a new assignment model for transit networks publication-title: Transport. Res. B: Methodol. – volume: 9 start-page: 115 year: 1975 end-page: 121 ident: b0040 article-title: Common bus lines publication-title: Transport. Sci. – reference: Ndambuki, J.M., Stoet, C.B.M., Veling, E.J.M., Terlaky, T., 2000. Robust groundwater management through second order cone programming (SOCP). Groundwater: Past Achievements and Future Challenges, pp.413–417. – volume: 36 start-page: 61 year: 2013 end-page: 71 ident: b0150 article-title: Bus dwell time estimation at bus bays: a probabilistic approach publication-title: Transport. Res. C: Emerg. Technol. – volume: 127 start-page: 195 year: 2001 end-page: 199 ident: b0220 article-title: Model for determining optimum bus-stop spacing in urban areas publication-title: J. Transp. Eng. – volume: 37 start-page: 206 year: 2009 end-page: 210 ident: b0070 article-title: A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes publication-title: Operat. Res. Lett. – volume: 42 start-page: 1251 year: 2008 end-page: 1273 ident: b0090 article-title: Transit network design and scheduling: a global review publication-title: Transport. Res. A: Pol. Pract. – volume: 127 start-page: 195 issue: 3 year: 2001 ident: 10.1016/j.trc.2019.03.019_b0220 article-title: Model for determining optimum bus-stop spacing in urban areas publication-title: J. Transp. Eng. doi: 10.1061/(ASCE)0733-947X(2001)127:3(195) – ident: 10.1016/j.trc.2019.03.019_b0260 doi: 10.1201/9781420010749.ch48 – volume: 139 start-page: 625 issue: 6 year: 2013 ident: 10.1016/j.trc.2019.03.019_b0275 article-title: Robust optimization model of bus transit network design with stochastic travel time publication-title: J. Transp. Eng. doi: 10.1061/(ASCE)TE.1943-5436.0000536 – volume: 16 start-page: 221 issue: 3 year: 1982 ident: 10.1016/j.trc.2019.03.019_b0095 article-title: The allocation of buses in heavily utilized networks with overlapping routes publication-title: Transport. Res. B: Methodol. doi: 10.1016/0191-2615(82)90025-X – start-page: 85 year: 1972 ident: 10.1016/j.trc.2019.03.019_b0120 article-title: Reducibility among combinatorial problems publication-title: Complex. Comput. Computat. doi: 10.1007/978-1-4684-2001-2_9 – volume: 23 start-page: 555 year: 1976 ident: 10.1016/j.trc.2019.03.019_b0215 article-title: P-complete approximation problems publication-title: J. Assoc. Comput. Mach. doi: 10.1145/321958.321975 – volume: 47 start-page: 1021 issue: 6 year: 2011 ident: 10.1016/j.trc.2019.03.019_b0055 article-title: Berth allocation considering fuel consumption and vessel emissions publication-title: Transport. Res. E: Logist. Transport. Rev. doi: 10.1016/j.tre.2011.05.011 – volume: 4 issue: 5 year: 2007 ident: 10.1016/j.trc.2019.03.019_b0125 article-title: An improved branch and bound algorithm for the maximum clique problem publication-title: Proteins – volume: 18 start-page: 339 issue: 3 year: 1984 ident: 10.1016/j.trc.2019.03.019_b0165 article-title: Solving capacitated clustering problems publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(84)90155-3 – volume: 251 start-page: 442 issue: 2 year: 2016 ident: 10.1016/j.trc.2019.03.019_b0065 article-title: Valid inequalities for the synchronization bus timetabling problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2015.12.006 – ident: 10.1016/j.trc.2019.03.019_b0020 doi: 10.1007/978-1-4757-3023-4_1 – volume: 101 start-page: 233 year: 2019 ident: 10.1016/j.trc.2019.03.019_b0135 article-title: CB-Planner: a bus line planning framework for customized bus systems publication-title: Transport. Res. C: Emerg. Technol. doi: 10.1016/j.trc.2019.02.006 – ident: 10.1016/j.trc.2019.03.019_b0255 doi: 10.1109/ICKS.2004.1313429 – volume: 20 start-page: 331 issue: 4 year: 1986 ident: 10.1016/j.trc.2019.03.019_b0025 article-title: Bus network design publication-title: Transport. Res. B: Methodol. doi: 10.1016/0191-2615(86)90047-0 – volume: 92 start-page: 1 year: 2018 ident: 10.1016/j.trc.2019.03.019_b0245 article-title: Optimally combined headway and timetable reliable public transport system publication-title: Transport. Res. C: Emerg. Technol. doi: 10.1016/j.trc.2018.04.016 – volume: 2 start-page: 99 issue: 2 year: 2004 ident: 10.1016/j.trc.2019.03.019_b0295 article-title: A model for holding strategy in public transit systems with real-time information publication-title: Int. J. Transp. Manage. – volume: 18 start-page: 184 issue: 3 year: 2003 ident: 10.1016/j.trc.2019.03.019_b0030 article-title: Genetic algorithms for optimal urban transit network design publication-title: Comput.-Aided Civ. Infrastruct. Eng. doi: 10.1111/1467-8667.00309 – volume: 23 start-page: 83 issue: 2 year: 1989 ident: 10.1016/j.trc.2019.03.019_b0225 article-title: Optimal strategies: a new assignment model for transit networks publication-title: Transport. Res. B: Methodol. doi: 10.1016/0191-2615(89)90034-9 – volume: 36 start-page: 61 year: 2013 ident: 10.1016/j.trc.2019.03.019_b0150 article-title: Bus dwell time estimation at bus bays: a probabilistic approach publication-title: Transport. Res. C: Emerg. Technol. doi: 10.1016/j.trc.2013.08.007 – volume: 186 start-page: 841 issue: 2 year: 2008 ident: 10.1016/j.trc.2019.03.019_b0290 article-title: Optimization of transit route network, vehicle headways and timetables for large-scale transit networks publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2007.02.005 – volume: 108 start-page: 188 year: 2018 ident: 10.1016/j.trc.2019.03.019_b0045 article-title: Mixed-integer programming model and branch-and-price-and-cut algorithm for urban bus network design and timetabling publication-title: Transport. Res. B: Methodol. doi: 10.1016/j.trb.2017.12.013 – ident: 10.1016/j.trc.2019.03.019_b0170 – volume: 37 start-page: 206 issue: 3 year: 2009 ident: 10.1016/j.trc.2019.03.019_b0070 article-title: A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes publication-title: Operat. Res. Lett. doi: 10.1016/j.orl.2009.02.003 – volume: 45 start-page: 123 issue: 3 year: 2007 ident: 10.1016/j.trc.2019.03.019_b0195 article-title: A survey of the generalized assignment problem and its applications publication-title: Inform. Syst. Operat. Res. – volume: 77 start-page: 38 year: 2015 ident: 10.1016/j.trc.2019.03.019_b0105 article-title: Planning, operation, and control of bus transport systems: a literature review publication-title: Transport. Res. B: Methodol. doi: 10.1016/j.trb.2015.03.002 – ident: 10.1016/j.trc.2019.03.019_b0050 doi: 10.1145/780542.780550 – volume: 35 start-page: 923 issue: 8 year: 1989 ident: 10.1016/j.trc.2019.03.019_b0145 article-title: Generalized assignment with nonlinear capacity interaction publication-title: Manage. Sci. doi: 10.1287/mnsc.35.8.923 – ident: 10.1016/j.trc.2019.03.019_b0210 – volume: 129 start-page: 186 issue: 2 year: 2003 ident: 10.1016/j.trc.2019.03.019_b0240 article-title: Transit route network design using frequency coded genetic algorithm publication-title: J. Transp. Eng. doi: 10.1061/(ASCE)0733-947X(2003)129:2(186) – volume: 42 start-page: 318 issue: 3 year: 2008 ident: 10.1016/j.trc.2019.03.019_b0265 article-title: An integrated framework for intercity bus scheduling under stochastic bus travel times publication-title: Transport. Sci. doi: 10.1287/trsc.1070.0216 – volume: 88 start-page: 411 issue: 3 year: 2000 ident: 10.1016/j.trc.2019.03.019_b0010 article-title: Robust solutions of linear programming problems contaminated with uncertain data publication-title: Math. Program. doi: 10.1007/PL00011380 – volume: 229 start-page: 281 issue: 2 year: 2013 ident: 10.1016/j.trc.2019.03.019_b0060 article-title: A review of urban transportation network design problems publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2013.01.001 – volume: 36 start-page: 19 issue: 1 year: 2002 ident: 10.1016/j.trc.2019.03.019_b0155 article-title: Benefit distribution and equity in road network design publication-title: Transport. Res. B: Methodol. doi: 10.1016/S0191-2615(00)00036-9 – volume: 88 start-page: 17 year: 2018 ident: 10.1016/j.trc.2019.03.019_b0190 article-title: A frequency based transit assignment model that considers online information publication-title: Transport. Res. C: Emerg. Technol. doi: 10.1016/j.trc.2018.01.004 – volume: 101 start-page: 145 year: 2019 ident: 10.1016/j.trc.2019.03.019_b0115 article-title: Bus and driver scheduling with mealtime windows for a single public bus route publication-title: Transport. Res. C: Emerg. Technol. doi: 10.1016/j.trc.2019.02.005 – volume: 35 start-page: 46 year: 2013 ident: 10.1016/j.trc.2019.03.019_b0130 article-title: Destination-skipping scheme with random travel time publication-title: Transport. Res. C: Emerg. Technol. doi: 10.1016/j.trc.2013.06.004 – year: 2007 ident: 10.1016/j.trc.2019.03.019_b0100 – volume: 95 start-page: 407 issue: 2 year: 2003 ident: 10.1016/j.trc.2019.03.019_b0160 article-title: An independent benchmarking of SDP and SOCP solvers publication-title: Math. Program. doi: 10.1007/s10107-002-0355-5 – volume: 120 start-page: 197 issue: 1–3 year: 2002 ident: 10.1016/j.trc.2019.03.019_b0205 article-title: A fast algorithm for the maximum clique problem publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(01)00290-6 – volume: 76 start-page: 117 year: 2015 ident: 10.1016/j.trc.2019.03.019_b0185 article-title: Train scheduling for minimizing passenger waiting time with time-dependent demand and skip-stop patterns: nonlinear integer programming models with linear constraints publication-title: Transport. Res. B: Methodol. doi: 10.1016/j.trb.2015.03.004 – ident: 10.1016/j.trc.2019.03.019_b0175 – volume: 88 start-page: 187 year: 2018 ident: 10.1016/j.trc.2019.03.019_b0075 article-title: Reliable frequency determination: incorporating information on service uncertainty when setting dispatching headways publication-title: Transport. Res. C: Emerg. Technol. doi: 10.1016/j.trc.2018.01.026 – ident: 10.1016/j.trc.2019.03.019_b0085 – volume: 9 start-page: 115 issue: 2 year: 1975 ident: 10.1016/j.trc.2019.03.019_b0040 article-title: Common bus lines publication-title: Transport. Sci. doi: 10.1287/trsc.9.2.115 – volume: 32 start-page: 510 issue: 6 year: 2004 ident: 10.1016/j.trc.2019.03.019_b0015 article-title: Robust linear optimization under general norms publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2003.12.007 – volume: 67 start-page: 235 year: 2014 ident: 10.1016/j.trc.2019.03.019_b0230 article-title: Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach publication-title: Transport. Res. B: Methodol. doi: 10.1016/j.trb.2014.05.008 – volume: 40 start-page: 572 issue: 7 year: 2006 ident: 10.1016/j.trc.2019.03.019_b0270 article-title: Inter-city bus routing and timetable setting under stochastic demands publication-title: Transport. Res. A: Pol. Pract. – volume: 46 start-page: 446 issue: 3 year: 2010 ident: 10.1016/j.trc.2019.03.019_b0110 article-title: Optimizing destination spacing in urban areas publication-title: Transport. Res. E: Logist. Transport. Rev. doi: 10.1016/j.tre.2009.11.001 – volume: 41 start-page: 7200 issue: 16 year: 2014 ident: 10.1016/j.trc.2019.03.019_b0180 article-title: A simultaneous transit network design and frequency setting: computing with bees publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2014.05.034 – volume: 42 start-page: 1251 issue: 10 year: 2008 ident: 10.1016/j.trc.2019.03.019_b0090 article-title: Transit network design and scheduling: a global review publication-title: Transport. Res. A: Pol. Pract. – volume: 19 start-page: 1157 issue: 6 year: 2011 ident: 10.1016/j.trc.2019.03.019_b0280 article-title: Bus arrival time prediction at destination with multiple routes publication-title: Transport. Res. C: Emerg. Technol. doi: 10.1016/j.trc.2011.01.003 – volume: 86 start-page: 220 year: 2018 ident: 10.1016/j.trc.2019.03.019_b0285 article-title: Tailored Wakeby-type distribution for random bus headway adherence ratio publication-title: Transport. Res. C: Emerg. Technol. doi: 10.1016/j.trc.2017.11.013 – volume: 1 start-page: 317 issue: 3 year: 1994 ident: 10.1016/j.trc.2019.03.019_b0200 article-title: Capacitated clustering problems by hybrid simulated annealing and tabu search publication-title: Int. Trans. Operat. Res. doi: 10.1111/1475-3995.d01-43 – volume: 209 start-page: 141 issue: 2 year: 2011 ident: 10.1016/j.trc.2019.03.019_b0235 article-title: A simultaneous bus route design and frequency setting problem for Tin Shui Wai, Hong Kong publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2010.08.020 – volume: 55 start-page: 1058 issue: 6 year: 2007 ident: 10.1016/j.trc.2019.03.019_b0035 article-title: A robust optimization perspective on stochastic programming publication-title: Oper. Res. doi: 10.1287/opre.1070.0441 – volume: 95 start-page: 3 issue: 1 year: 2003 ident: 10.1016/j.trc.2019.03.019_b0005 article-title: Second-order cone programming publication-title: Math. Program. doi: 10.1007/s10107-002-0339-5 – ident: 10.1016/j.trc.2019.03.019_b0080
SSID	ssj0001957
Score	2.3685143
Snippet	•Propose a practical bus route clustering problem (BRCP).•Formulate a mixed-integer second-order cone programming (MISOCP) model.•Prove the problem is...
SourceID	crossref elsevier
SourceType	Enrichment Source Index Database Publisher
StartPage	351
SubjectTerms	Bus passenger Bus route cluster Mixed-integer second-order cone program
Title	Mixed-integer second-order cone programming model for bus route clustering problem
URI	https://dx.doi.org/10.1016/j.trc.2019.03.019
Volume	102
WOSCitedRecordID	wos000467516700020&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-2359 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001957 issn: 0968-090X databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF5FKRL0gKCAKC_tgRPVVrZ3sdfHqiriWSFU1HCyvI_QVCGtHKfKr-A3M7PrdTaBInrgYkVWduN4Ps_Ojr_5hpCXqswVbAMk4yZPmIBnkSmtORO1xV6MqZTaFQp_LI6P5WhUfh4MfoZamKtpMZvJ5bK8_K-mhnNgbCydvYG5-0nhBHwGo8MRzA7HfzL8p8nSGuZkIFCpGTe8hjmFTaSY28DI-oE5AtcHxzM2F_O95gJJA3q6QPEEX6Xuus3EAWwvhu6B02kFne1DKNq0e4fOtWJFp6vCCmn7iKh4GvLTZ4s6Qmaftz61k1Xe3iVbv2Hfse-b4z_UkzhhgTVSgR4YMo85Mi6S0ZoTTrLIjfJOhNavyNw3c_nN2fu8w_l-26AWZerVajsHvCasvbHg9TTEwHA7r2CKCqeoEl4lqCK7lRWvSzkkWwfvjkbv-7U9Lb12bPgL4T25YwxuXMefI50oejm5R-522w564OFynwzsbIfcDlXp8x2yHQlTPiBf1kBEYxBRBBGNQEQdiCiAiAKIqAMRXYGIdiB6SL6-OTo5fMu67htMizRtWaZ1asd6bLIMAyldGgg269oKmyrYM3OuC-w9CsaBFTIv0rGwea2EyqwohC4Uf0SGM7iix4QmBmX-rOKyyESuknpcSCMMPLTGpCaTuyQJd6rSnTQ9dkiZVtdaaJe86odcel2Wv31ZhNtfdYGlDxgrgNL1w57c5DeekjsrsD8jw7ZZ2Ofklr5qJ_PmRYejX-Rem9w
linkProvider	Elsevier
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=Mixed-integer+second-order+cone+programming+model+for+bus+route+clustering+problem&rft.jtitle=Transportation+research.+Part+C%2C+Emerging+technologies&rft.au=Wang%2C+Shuaian&rft.au=Zhang%2C+Wei&rft.au=Bie%2C+Yiming&rft.au=Wang%2C+Kai&rft.date=2019-05-01&rft.issn=0968-090X&rft.volume=102&rft.spage=351&rft.epage=369&rft_id=info:doi/10.1016%2Fj.trc.2019.03.019&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_trc_2019_03_019
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0968-090X&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0968-090X&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0968-090X&client=summon