Loading…
Data-Driven Flexible Vehicle Scheduling and Route Optimization
The flexible transit service reflects a trend of demand on the flexibility and convenience in urban public transport systems, within which the vehicle scheduling and passenger insertion are two challenging issues. Especially, finding the optimal solution for a flexible transit system can be viewed a...
Saved in:
Published in: | IEEE transactions on intelligent transportation systems 2022-12, Vol.23 (12), p.1-15 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c293t-654cb008904af513dc5981c6eae3c15c21f3a2c77496a7e16e890d7b9aab10423 |
---|---|
cites | cdi_FETCH-LOGICAL-c293t-654cb008904af513dc5981c6eae3c15c21f3a2c77496a7e16e890d7b9aab10423 |
container_end_page | 15 |
container_issue | 12 |
container_start_page | 1 |
container_title | IEEE transactions on intelligent transportation systems |
container_volume | 23 |
creator | Lai, Yongxuan Yang, Fan Meng, Ge Lu, Wei |
description | The flexible transit service reflects a trend of demand on the flexibility and convenience in urban public transport systems, within which the vehicle scheduling and passenger insertion are two challenging issues. Especially, finding the optimal solution for a flexible transit system can be viewed as an extension of the traveling salesman problem which is NP-complete. Yet most of the existing research mainly focuses on one aspect, i.e. route planning, stop selection or vehicle scheduling, where a combined integration and optimization of the whole system is largely neglected. In this paper, we propose a data-driven flexible transit system that integrates the origin-destination insertion algorithm and the milp-based (mixed-integer linear programming) scheduling scheme. Specifically, stops are mined from the historical datasets and some stops act as backbone stops that should be visited by the vehicles; and a heuristic backbone-based origin-destination insertion algorithm is proposed to schedule the routing path of vehicles, where the time loss caused by the optimal insertion positions is calculated for the vehicles to decide whether to accept the requests or not when constructing a path for the flexible routes. Moreover, a vehicle scheduling model based on milp is proposed to minimise the gap between the passenger flow and available seats. The proposed flexible transit systems are simulated in real-world taxi datasets, and experimental results show that the proposed flexible transit system can effectively increase the delivery ratio and decrease the passengers' waiting time compared with existing methods. |
doi_str_mv | 10.1109/TITS.2022.3204644 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TITS_2022_3204644</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9899369</ieee_id><sourcerecordid>2747611791</sourcerecordid><originalsourceid>FETCH-LOGICAL-c293t-654cb008904af513dc5981c6eae3c15c21f3a2c77496a7e16e890d7b9aab10423</originalsourceid><addsrcrecordid>eNo9kE1Lw0AQhhdRsFZ_gHgJeE7d2a9kL4JUq4VCwVavy2YzsVvSpG4SUX-9CS2e3mF43hl4CLkGOgGg-m49X68mjDI24YwKJcQJGYGUaUwpqNNhZiLWVNJzctE0234rJMCI3D_a1saPwX9hFc1K_PZZidE7brzrc-U2mHelrz4iW-XRa921GC33rd_5X9v6urokZ4UtG7w65pi8zZ7W05d4sXyeTx8WsWOat7GSwmWUppoKW0jguZM6BafQIncgHYOCW-aSRGhlEwSFPZonmbY2AyoYH5Pbw919qD87bFqzrbtQ9S8NS0SiABINPQUHyoW6aQIWZh_8zoYfA9QMmsygyQyazFFT37k5dDwi_vM61Zorzf8AGPFiZA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2747611791</pqid></control><display><type>article</type><title>Data-Driven Flexible Vehicle Scheduling and Route Optimization</title><source>IEEE Xplore (Online service)</source><creator>Lai, Yongxuan ; Yang, Fan ; Meng, Ge ; Lu, Wei</creator><creatorcontrib>Lai, Yongxuan ; Yang, Fan ; Meng, Ge ; Lu, Wei</creatorcontrib><description>The flexible transit service reflects a trend of demand on the flexibility and convenience in urban public transport systems, within which the vehicle scheduling and passenger insertion are two challenging issues. Especially, finding the optimal solution for a flexible transit system can be viewed as an extension of the traveling salesman problem which is NP-complete. Yet most of the existing research mainly focuses on one aspect, i.e. route planning, stop selection or vehicle scheduling, where a combined integration and optimization of the whole system is largely neglected. In this paper, we propose a data-driven flexible transit system that integrates the origin-destination insertion algorithm and the milp-based (mixed-integer linear programming) scheduling scheme. Specifically, stops are mined from the historical datasets and some stops act as <inline-formula> <tex-math notation="LaTeX">backbone</tex-math> </inline-formula> stops that should be visited by the vehicles; and a heuristic backbone-based origin-destination insertion algorithm is proposed to schedule the routing path of vehicles, where the time loss caused by the optimal insertion positions is calculated for the vehicles to decide whether to accept the requests or not when constructing a path for the flexible routes. Moreover, a vehicle scheduling model based on milp is proposed to minimise the gap between the passenger flow and available seats. The proposed flexible transit systems are simulated in real-world taxi datasets, and experimental results show that the proposed flexible transit system can effectively increase the delivery ratio and decrease the passengers' waiting time compared with existing methods.</description><identifier>ISSN: 1524-9050</identifier><identifier>EISSN: 1558-0016</identifier><identifier>DOI: 10.1109/TITS.2022.3204644</identifier><identifier>CODEN: ITISFG</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Costs ; Data models ; data-driven route scheduling ; Datasets ; Flexible transit system ; heuristic origin-destination insertion ; Insertion ; Integer programming ; Job shop scheduling ; Linear programming ; Mixed integer ; mixed-integer linear programming ; Optimization ; Passengers ; Public transportation ; Route optimization ; Route planning ; Route selection ; Routing ; Schedules ; Scheduling ; Seats ; Transportation planning ; Transportation systems ; Traveling salesman problem ; Vehicles</subject><ispartof>IEEE transactions on intelligent transportation systems, 2022-12, Vol.23 (12), p.1-15</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c293t-654cb008904af513dc5981c6eae3c15c21f3a2c77496a7e16e890d7b9aab10423</citedby><cites>FETCH-LOGICAL-c293t-654cb008904af513dc5981c6eae3c15c21f3a2c77496a7e16e890d7b9aab10423</cites><orcidid>0000-0002-3523-1138 ; 0000-0002-2883-0781 ; 0000-0001-6769-2695</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9899369$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Lai, Yongxuan</creatorcontrib><creatorcontrib>Yang, Fan</creatorcontrib><creatorcontrib>Meng, Ge</creatorcontrib><creatorcontrib>Lu, Wei</creatorcontrib><title>Data-Driven Flexible Vehicle Scheduling and Route Optimization</title><title>IEEE transactions on intelligent transportation systems</title><addtitle>TITS</addtitle><description>The flexible transit service reflects a trend of demand on the flexibility and convenience in urban public transport systems, within which the vehicle scheduling and passenger insertion are two challenging issues. Especially, finding the optimal solution for a flexible transit system can be viewed as an extension of the traveling salesman problem which is NP-complete. Yet most of the existing research mainly focuses on one aspect, i.e. route planning, stop selection or vehicle scheduling, where a combined integration and optimization of the whole system is largely neglected. In this paper, we propose a data-driven flexible transit system that integrates the origin-destination insertion algorithm and the milp-based (mixed-integer linear programming) scheduling scheme. Specifically, stops are mined from the historical datasets and some stops act as <inline-formula> <tex-math notation="LaTeX">backbone</tex-math> </inline-formula> stops that should be visited by the vehicles; and a heuristic backbone-based origin-destination insertion algorithm is proposed to schedule the routing path of vehicles, where the time loss caused by the optimal insertion positions is calculated for the vehicles to decide whether to accept the requests or not when constructing a path for the flexible routes. Moreover, a vehicle scheduling model based on milp is proposed to minimise the gap between the passenger flow and available seats. The proposed flexible transit systems are simulated in real-world taxi datasets, and experimental results show that the proposed flexible transit system can effectively increase the delivery ratio and decrease the passengers' waiting time compared with existing methods.</description><subject>Algorithms</subject><subject>Costs</subject><subject>Data models</subject><subject>data-driven route scheduling</subject><subject>Datasets</subject><subject>Flexible transit system</subject><subject>heuristic origin-destination insertion</subject><subject>Insertion</subject><subject>Integer programming</subject><subject>Job shop scheduling</subject><subject>Linear programming</subject><subject>Mixed integer</subject><subject>mixed-integer linear programming</subject><subject>Optimization</subject><subject>Passengers</subject><subject>Public transportation</subject><subject>Route optimization</subject><subject>Route planning</subject><subject>Route selection</subject><subject>Routing</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Seats</subject><subject>Transportation planning</subject><subject>Transportation systems</subject><subject>Traveling salesman problem</subject><subject>Vehicles</subject><issn>1524-9050</issn><issn>1558-0016</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNo9kE1Lw0AQhhdRsFZ_gHgJeE7d2a9kL4JUq4VCwVavy2YzsVvSpG4SUX-9CS2e3mF43hl4CLkGOgGg-m49X68mjDI24YwKJcQJGYGUaUwpqNNhZiLWVNJzctE0234rJMCI3D_a1saPwX9hFc1K_PZZidE7brzrc-U2mHelrz4iW-XRa921GC33rd_5X9v6urokZ4UtG7w65pi8zZ7W05d4sXyeTx8WsWOat7GSwmWUppoKW0jguZM6BafQIncgHYOCW-aSRGhlEwSFPZonmbY2AyoYH5Pbw919qD87bFqzrbtQ9S8NS0SiABINPQUHyoW6aQIWZh_8zoYfA9QMmsygyQyazFFT37k5dDwi_vM61Zorzf8AGPFiZA</recordid><startdate>20221201</startdate><enddate>20221201</enddate><creator>Lai, Yongxuan</creator><creator>Yang, Fan</creator><creator>Meng, Ge</creator><creator>Lu, Wei</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-3523-1138</orcidid><orcidid>https://orcid.org/0000-0002-2883-0781</orcidid><orcidid>https://orcid.org/0000-0001-6769-2695</orcidid></search><sort><creationdate>20221201</creationdate><title>Data-Driven Flexible Vehicle Scheduling and Route Optimization</title><author>Lai, Yongxuan ; Yang, Fan ; Meng, Ge ; Lu, Wei</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c293t-654cb008904af513dc5981c6eae3c15c21f3a2c77496a7e16e890d7b9aab10423</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Algorithms</topic><topic>Costs</topic><topic>Data models</topic><topic>data-driven route scheduling</topic><topic>Datasets</topic><topic>Flexible transit system</topic><topic>heuristic origin-destination insertion</topic><topic>Insertion</topic><topic>Integer programming</topic><topic>Job shop scheduling</topic><topic>Linear programming</topic><topic>Mixed integer</topic><topic>mixed-integer linear programming</topic><topic>Optimization</topic><topic>Passengers</topic><topic>Public transportation</topic><topic>Route optimization</topic><topic>Route planning</topic><topic>Route selection</topic><topic>Routing</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Seats</topic><topic>Transportation planning</topic><topic>Transportation systems</topic><topic>Traveling salesman problem</topic><topic>Vehicles</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lai, Yongxuan</creatorcontrib><creatorcontrib>Yang, Fan</creatorcontrib><creatorcontrib>Meng, Ge</creatorcontrib><creatorcontrib>Lu, Wei</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on intelligent transportation systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lai, Yongxuan</au><au>Yang, Fan</au><au>Meng, Ge</au><au>Lu, Wei</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Data-Driven Flexible Vehicle Scheduling and Route Optimization</atitle><jtitle>IEEE transactions on intelligent transportation systems</jtitle><stitle>TITS</stitle><date>2022-12-01</date><risdate>2022</risdate><volume>23</volume><issue>12</issue><spage>1</spage><epage>15</epage><pages>1-15</pages><issn>1524-9050</issn><eissn>1558-0016</eissn><coden>ITISFG</coden><abstract>The flexible transit service reflects a trend of demand on the flexibility and convenience in urban public transport systems, within which the vehicle scheduling and passenger insertion are two challenging issues. Especially, finding the optimal solution for a flexible transit system can be viewed as an extension of the traveling salesman problem which is NP-complete. Yet most of the existing research mainly focuses on one aspect, i.e. route planning, stop selection or vehicle scheduling, where a combined integration and optimization of the whole system is largely neglected. In this paper, we propose a data-driven flexible transit system that integrates the origin-destination insertion algorithm and the milp-based (mixed-integer linear programming) scheduling scheme. Specifically, stops are mined from the historical datasets and some stops act as <inline-formula> <tex-math notation="LaTeX">backbone</tex-math> </inline-formula> stops that should be visited by the vehicles; and a heuristic backbone-based origin-destination insertion algorithm is proposed to schedule the routing path of vehicles, where the time loss caused by the optimal insertion positions is calculated for the vehicles to decide whether to accept the requests or not when constructing a path for the flexible routes. Moreover, a vehicle scheduling model based on milp is proposed to minimise the gap between the passenger flow and available seats. The proposed flexible transit systems are simulated in real-world taxi datasets, and experimental results show that the proposed flexible transit system can effectively increase the delivery ratio and decrease the passengers' waiting time compared with existing methods.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TITS.2022.3204644</doi><tpages>15</tpages><orcidid>https://orcid.org/0000-0002-3523-1138</orcidid><orcidid>https://orcid.org/0000-0002-2883-0781</orcidid><orcidid>https://orcid.org/0000-0001-6769-2695</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1524-9050 |
ispartof | IEEE transactions on intelligent transportation systems, 2022-12, Vol.23 (12), p.1-15 |
issn | 1524-9050 1558-0016 |
language | eng |
recordid | cdi_crossref_primary_10_1109_TITS_2022_3204644 |
source | IEEE Xplore (Online service) |
subjects | Algorithms Costs Data models data-driven route scheduling Datasets Flexible transit system heuristic origin-destination insertion Insertion Integer programming Job shop scheduling Linear programming Mixed integer mixed-integer linear programming Optimization Passengers Public transportation Route optimization Route planning Route selection Routing Schedules Scheduling Seats Transportation planning Transportation systems Traveling salesman problem Vehicles |
title | Data-Driven Flexible Vehicle Scheduling and Route Optimization |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T00%3A07%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Data-Driven%20Flexible%20Vehicle%20Scheduling%20and%20Route%20Optimization&rft.jtitle=IEEE%20transactions%20on%20intelligent%20transportation%20systems&rft.au=Lai,%20Yongxuan&rft.date=2022-12-01&rft.volume=23&rft.issue=12&rft.spage=1&rft.epage=15&rft.pages=1-15&rft.issn=1524-9050&rft.eissn=1558-0016&rft.coden=ITISFG&rft_id=info:doi/10.1109/TITS.2022.3204644&rft_dat=%3Cproquest_cross%3E2747611791%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c293t-654cb008904af513dc5981c6eae3c15c21f3a2c77496a7e16e890d7b9aab10423%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2747611791&rft_id=info:pmid/&rft_ieee_id=9899369&rfr_iscdi=true |