A fast semi-analytic algorithm for computing solutions associated with\n multiple moving or fixed bottlenecks: Application to joint scheduling and\n signal timing Article Swipe
Michele D. Simoni
,
Christian Claudel
·
YOU?
·
· 2017
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.1701.01026
YOU?
·
· 2017
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.1701.01026
Moving and fixed bottlenecks are moving or fixed capacity restrictions that\naffect the propagation of traffic flow. They are a very important modeling\napproach to describe the effects of slow vehicles and traffic signals in\ntransportation networks. However, the computation of solutions associated with\nthe presence of fixed and moving bottlenecks is complex, since they both\ninfluence and are influenced by traffic. In this study, we propose a fast\nnumerical scheme that can efficiently compute the solutions to an arbitrary\nnumber of fixed and moving bottlenecks, for a stretch of road modeled by the\nLighthill-Whitham-Richards (LWR) model with triangular fundamental diagram. The\nnumerical scheme is based on a semi-analytic Lax-Hopf formula that requires a\nvery low number of operations compared with existing schemes. We illustrate the\nperformance of the numerical scheme on scenarios involving multiple slow\nvehicles and traffic signals, and demonstrate that this scheme can be part of\nan optimization loop to simultaneously optimize the schedule of several\nheavy-duty vehicles and traffic signals in a city for alleviating traffic\ncongestion\n
Related Topics
Concepts
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/1701.01026
- https://arxiv.org/pdf/1701.01026
- OA Status
- green
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4298325500
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4298325500Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.1701.01026Digital Object Identifier
- Title
-
A fast semi-analytic algorithm for computing solutions associated with\n multiple moving or fixed bottlenecks: Application to joint scheduling and\n signal timingWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2017Year of publication
- Publication date
-
2017-01-04Full publication date if available
- Authors
-
Michele D. Simoni, Christian ClaudelList of authors in order
- Landing page
-
https://arxiv.org/abs/1701.01026Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/1701.01026Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/1701.01026Direct OA link when available
- Concepts
-
Computer science, Scheduling (production processes), Computation, Scheme (mathematics), Schedule, Mathematical optimization, Traffic signal, Traffic flow (computer networking), Diagram, Traffic model, Real-time computing, Algorithm, Mathematics, Computer network, Database, Operating system, Mathematical analysisTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4298325500 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.1701.01026 |
| ids.openalex | https://openalex.org/W4298325500 |
| fwci | 0.0 |
| type | preprint |
| title | A fast semi-analytic algorithm for computing solutions associated with\n multiple moving or fixed bottlenecks: Application to joint scheduling and\n signal timing |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10698 |
| topics[0].field.id | https://openalex.org/fields/33 |
| topics[0].field.display_name | Social Sciences |
| topics[0].score | 0.9998999834060669 |
| topics[0].domain.id | https://openalex.org/domains/2 |
| topics[0].domain.display_name | Social Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/3313 |
| topics[0].subfield.display_name | Transportation |
| topics[0].display_name | Transportation Planning and Optimization |
| topics[1].id | https://openalex.org/T10524 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9991999864578247 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2207 |
| topics[1].subfield.display_name | Control and Systems Engineering |
| topics[1].display_name | Traffic control and management |
| topics[2].id | https://openalex.org/T11344 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9970999956130981 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2215 |
| topics[2].subfield.display_name | Building and Construction |
| topics[2].display_name | Traffic Prediction and Management Techniques |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.6153431534767151 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C206729178 |
| concepts[1].level | 2 |
| concepts[1].score | 0.606452465057373 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q2271896 |
| concepts[1].display_name | Scheduling (production processes) |
| concepts[2].id | https://openalex.org/C45374587 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5753265619277954 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q12525525 |
| concepts[2].display_name | Computation |
| concepts[3].id | https://openalex.org/C77618280 |
| concepts[3].level | 2 |
| concepts[3].score | 0.5440369248390198 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q1155772 |
| concepts[3].display_name | Scheme (mathematics) |
| concepts[4].id | https://openalex.org/C68387754 |
| concepts[4].level | 2 |
| concepts[4].score | 0.5057187080383301 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q7271585 |
| concepts[4].display_name | Schedule |
| concepts[5].id | https://openalex.org/C126255220 |
| concepts[5].level | 1 |
| concepts[5].score | 0.49741271138191223 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[5].display_name | Mathematical optimization |
| concepts[6].id | https://openalex.org/C2987419075 |
| concepts[6].level | 2 |
| concepts[6].score | 0.43000873923301697 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q8004 |
| concepts[6].display_name | Traffic signal |
| concepts[7].id | https://openalex.org/C207512268 |
| concepts[7].level | 2 |
| concepts[7].score | 0.41825827956199646 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q3074551 |
| concepts[7].display_name | Traffic flow (computer networking) |
| concepts[8].id | https://openalex.org/C186399060 |
| concepts[8].level | 2 |
| concepts[8].score | 0.41782093048095703 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q959962 |
| concepts[8].display_name | Diagram |
| concepts[9].id | https://openalex.org/C2775847900 |
| concepts[9].level | 2 |
| concepts[9].score | 0.4122436046600342 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q28455493 |
| concepts[9].display_name | Traffic model |
| concepts[10].id | https://openalex.org/C79403827 |
| concepts[10].level | 1 |
| concepts[10].score | 0.3786076307296753 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q3988 |
| concepts[10].display_name | Real-time computing |
| concepts[11].id | https://openalex.org/C11413529 |
| concepts[11].level | 1 |
| concepts[11].score | 0.34841346740722656 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[11].display_name | Algorithm |
| concepts[12].id | https://openalex.org/C33923547 |
| concepts[12].level | 0 |
| concepts[12].score | 0.22001922130584717 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[12].display_name | Mathematics |
| concepts[13].id | https://openalex.org/C31258907 |
| concepts[13].level | 1 |
| concepts[13].score | 0.1414903700351715 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[13].display_name | Computer network |
| concepts[14].id | https://openalex.org/C77088390 |
| concepts[14].level | 1 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q8513 |
| concepts[14].display_name | Database |
| concepts[15].id | https://openalex.org/C111919701 |
| concepts[15].level | 1 |
| concepts[15].score | 0.0 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q9135 |
| concepts[15].display_name | Operating system |
| concepts[16].id | https://openalex.org/C134306372 |
| concepts[16].level | 1 |
| concepts[16].score | 0.0 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q7754 |
| concepts[16].display_name | Mathematical analysis |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.6153431534767151 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/scheduling |
| keywords[1].score | 0.606452465057373 |
| keywords[1].display_name | Scheduling (production processes) |
| keywords[2].id | https://openalex.org/keywords/computation |
| keywords[2].score | 0.5753265619277954 |
| keywords[2].display_name | Computation |
| keywords[3].id | https://openalex.org/keywords/scheme |
| keywords[3].score | 0.5440369248390198 |
| keywords[3].display_name | Scheme (mathematics) |
| keywords[4].id | https://openalex.org/keywords/schedule |
| keywords[4].score | 0.5057187080383301 |
| keywords[4].display_name | Schedule |
| keywords[5].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[5].score | 0.49741271138191223 |
| keywords[5].display_name | Mathematical optimization |
| keywords[6].id | https://openalex.org/keywords/traffic-signal |
| keywords[6].score | 0.43000873923301697 |
| keywords[6].display_name | Traffic signal |
| keywords[7].id | https://openalex.org/keywords/traffic-flow |
| keywords[7].score | 0.41825827956199646 |
| keywords[7].display_name | Traffic flow (computer networking) |
| keywords[8].id | https://openalex.org/keywords/diagram |
| keywords[8].score | 0.41782093048095703 |
| keywords[8].display_name | Diagram |
| keywords[9].id | https://openalex.org/keywords/traffic-model |
| keywords[9].score | 0.4122436046600342 |
| keywords[9].display_name | Traffic model |
| keywords[10].id | https://openalex.org/keywords/real-time-computing |
| keywords[10].score | 0.3786076307296753 |
| keywords[10].display_name | Real-time computing |
| keywords[11].id | https://openalex.org/keywords/algorithm |
| keywords[11].score | 0.34841346740722656 |
| keywords[11].display_name | Algorithm |
| keywords[12].id | https://openalex.org/keywords/mathematics |
| keywords[12].score | 0.22001922130584717 |
| keywords[12].display_name | Mathematics |
| keywords[13].id | https://openalex.org/keywords/computer-network |
| keywords[13].score | 0.1414903700351715 |
| keywords[13].display_name | Computer network |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:1701.01026 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/1701.01026 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/1701.01026 |
| indexed_in | arxiv |
| authorships[0].author.id | https://openalex.org/A5011237705 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-5613-1769 |
| authorships[0].author.display_name | Michele D. Simoni |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Simoni, Michele D. |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5082935103 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-3783-4928 |
| authorships[1].author.display_name | Christian Claudel |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Claudel, Christian G. |
| authorships[1].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/1701.01026 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | A fast semi-analytic algorithm for computing solutions associated with\n multiple moving or fixed bottlenecks: Application to joint scheduling and\n signal timing |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-10-10T17:16:08.811792 |
| primary_topic.id | https://openalex.org/T10698 |
| primary_topic.field.id | https://openalex.org/fields/33 |
| primary_topic.field.display_name | Social Sciences |
| primary_topic.score | 0.9998999834060669 |
| primary_topic.domain.id | https://openalex.org/domains/2 |
| primary_topic.domain.display_name | Social Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/3313 |
| primary_topic.subfield.display_name | Transportation |
| primary_topic.display_name | Transportation Planning and Optimization |
| related_works | https://openalex.org/W2313399832, https://openalex.org/W2064048194, https://openalex.org/W1977257625, https://openalex.org/W2289957799, https://openalex.org/W2363678953, https://openalex.org/W3140303263, https://openalex.org/W2180488157, https://openalex.org/W2371689170, https://openalex.org/W1522909389, https://openalex.org/W2359125580 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | pmh:oai:arXiv.org:1701.01026 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/1701.01026 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/1701.01026 |
| primary_location.id | pmh:oai:arXiv.org:1701.01026 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/1701.01026 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/1701.01026 |
| publication_date | 2017-01-04 |
| publication_year | 2017 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 18, 62, 80, 98, 151 |
| abstract_inverted_index.In | 57 |
| abstract_inverted_index.We | 113 |
| abstract_inverted_index.an | 72 |
| abstract_inverted_index.be | 134 |
| abstract_inverted_index.by | 55, 85 |
| abstract_inverted_index.in | 150 |
| abstract_inverted_index.is | 47, 95 |
| abstract_inverted_index.of | 13, 26, 37, 42, 74, 82, 107, 116, 144 |
| abstract_inverted_index.on | 97, 120 |
| abstract_inverted_index.or | 6 |
| abstract_inverted_index.to | 22, 71, 139 |
| abstract_inverted_index.we | 60 |
| abstract_inverted_index.and | 1, 29, 44, 52, 76, 125, 128, 147 |
| abstract_inverted_index.are | 4, 17, 53 |
| abstract_inverted_index.can | 66, 133 |
| abstract_inverted_index.for | 79, 153 |
| abstract_inverted_index.low | 105 |
| abstract_inverted_index.the | 11, 24, 35, 69, 117, 142 |
| abstract_inverted_index.They | 16 |
| abstract_inverted_index.city | 152 |
| abstract_inverted_index.loop | 138 |
| abstract_inverted_index.part | 135 |
| abstract_inverted_index.road | 83 |
| abstract_inverted_index.slow | 27 |
| abstract_inverted_index.that | 65, 102, 130 |
| abstract_inverted_index.they | 50 |
| abstract_inverted_index.this | 58, 131 |
| abstract_inverted_index.very | 19 |
| abstract_inverted_index.with | 89, 110 |
| abstract_inverted_index.(LWR) | 87 |
| abstract_inverted_index.based | 96 |
| abstract_inverted_index.fixed | 2, 7, 43, 75 |
| abstract_inverted_index.flow. | 15 |
| abstract_inverted_index.model | 88 |
| abstract_inverted_index.since | 49 |
| abstract_inverted_index.Moving | 0 |
| abstract_inverted_index.moving | 5, 45, 77 |
| abstract_inverted_index.number | 106 |
| abstract_inverted_index.of\nan | 136 |
| abstract_inverted_index.scheme | 64, 94, 119, 132 |
| abstract_inverted_index.study, | 59 |
| abstract_inverted_index.a\nvery | 104 |
| abstract_inverted_index.compute | 68 |
| abstract_inverted_index.effects | 25 |
| abstract_inverted_index.formula | 101 |
| abstract_inverted_index.modeled | 84 |
| abstract_inverted_index.propose | 61 |
| abstract_inverted_index.signals | 31, 149 |
| abstract_inverted_index.stretch | 81 |
| abstract_inverted_index.traffic | 14, 30, 126, 148 |
| abstract_inverted_index.However, | 34 |
| abstract_inverted_index.Lax-Hopf | 100 |
| abstract_inverted_index.capacity | 8 |
| abstract_inverted_index.compared | 109 |
| abstract_inverted_index.complex, | 48 |
| abstract_inverted_index.describe | 23 |
| abstract_inverted_index.diagram. | 92 |
| abstract_inverted_index.existing | 111 |
| abstract_inverted_index.multiple | 123 |
| abstract_inverted_index.optimize | 141 |
| abstract_inverted_index.presence | 41 |
| abstract_inverted_index.requires | 103 |
| abstract_inverted_index.schedule | 143 |
| abstract_inverted_index.schemes. | 112 |
| abstract_inverted_index.signals, | 127 |
| abstract_inverted_index.traffic. | 56 |
| abstract_inverted_index.vehicles | 28, 146 |
| abstract_inverted_index.important | 20 |
| abstract_inverted_index.involving | 122 |
| abstract_inverted_index.networks. | 33 |
| abstract_inverted_index.numerical | 118 |
| abstract_inverted_index.scenarios | 121 |
| abstract_inverted_index.solutions | 38, 70 |
| abstract_inverted_index.with\nthe | 40 |
| abstract_inverted_index.associated | 39 |
| abstract_inverted_index.illustrate | 114 |
| abstract_inverted_index.influenced | 54 |
| abstract_inverted_index.operations | 108 |
| abstract_inverted_index.triangular | 90 |
| abstract_inverted_index.alleviating | 154 |
| abstract_inverted_index.bottlenecks | 3, 46 |
| abstract_inverted_index.computation | 36 |
| abstract_inverted_index.demonstrate | 129 |
| abstract_inverted_index.efficiently | 67 |
| abstract_inverted_index.fundamental | 91 |
| abstract_inverted_index.propagation | 12 |
| abstract_inverted_index.bottlenecks, | 78 |
| abstract_inverted_index.optimization | 137 |
| abstract_inverted_index.restrictions | 9 |
| abstract_inverted_index.that\naffect | 10 |
| abstract_inverted_index.semi-analytic | 99 |
| abstract_inverted_index.The\nnumerical | 93 |
| abstract_inverted_index.simultaneously | 140 |
| abstract_inverted_index.slow\nvehicles | 124 |
| abstract_inverted_index.both\ninfluence | 51 |
| abstract_inverted_index.fast\nnumerical | 63 |
| abstract_inverted_index.the\nperformance | 115 |
| abstract_inverted_index.arbitrary\nnumber | 73 |
| abstract_inverted_index.in\ntransportation | 32 |
| abstract_inverted_index.modeling\napproach | 21 |
| abstract_inverted_index.several\nheavy-duty | 145 |
| abstract_inverted_index.traffic\ncongestion\n | 155 |
| abstract_inverted_index.the\nLighthill-Whitham-Richards | 86 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 2 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/11 |
| sustainable_development_goals[0].score | 0.7099999785423279 |
| sustainable_development_goals[0].display_name | Sustainable cities and communities |
| citation_normalized_percentile.value | 0.30045381 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |