Algorithms for the Pareto solution of the multicriteria traffic equilibrium problem with capacity constraints of arcs Article Swipe
We focus on the multicriteria traffic equilibrium problem with capacity constraints of arcs. First, we generalize Beckmann's formula to deal with multicriteria traffic equilibrium problems with capacity constraints of arcs and prove that the solution of the mathematical programming problem is a Pareto traffic equilibrium flow with capacity constraints of arcs. Furthermore, we present a restricted algorithm for computing the Pareto traffic equilibrium flow with capacity constraints of arcs. Using the restricted algorithm, one does not need to know the set of available paths joining origin-destination pairs. This proves very helpful for complex traffic networks. Finally, for the algorithms of the Pareto traffic equilibrium flow, we give two examples to exemplify calculation processes.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.3934/jimo.2022104
- https://www.aimsciences.org/data/article/export-pdf?id=62b2ea1a2d80b73f6ef10091
- OA Status
- diamond
- References
- 17
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4285135847
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4285135847Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.3934/jimo.2022104Digital Object Identifier
- Title
-
Algorithms for the Pareto solution of the multicriteria traffic equilibrium problem with capacity constraints of arcsWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2022Year of publication
- Publication date
-
2022-06-30Full publication date if available
- Authors
-
Zhi Lin, Zai-Yun PengList of authors in order
- Landing page
-
https://doi.org/10.3934/jimo.2022104Publisher landing page
- PDF URL
-
https://www.aimsciences.org/data/article/export-pdf?id=62b2ea1a2d80b73f6ef10091Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
diamondOpen access status per OpenAlex
- OA URL
-
https://www.aimsciences.org/data/article/export-pdf?id=62b2ea1a2d80b73f6ef10091Direct OA link when available
- Concepts
-
Mathematical optimization, Pareto principle, Computer science, Traffic flow (computer networking), Set (abstract data type), Pareto optimal, Focus (optics), Multi-objective optimization, Mathematics, Programming language, Physics, Computer security, OpticsTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- References (count)
-
17Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4285135847 |
|---|---|
| doi | https://doi.org/10.3934/jimo.2022104 |
| ids.doi | https://doi.org/10.3934/jimo.2022104 |
| ids.openalex | https://openalex.org/W4285135847 |
| fwci | 0.0 |
| type | article |
| title | Algorithms for the Pareto solution of the multicriteria traffic equilibrium problem with capacity constraints of arcs |
| biblio.issue | 5 |
| biblio.volume | 19 |
| biblio.last_page | 3705 |
| biblio.first_page | 3694 |
| 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.9980999827384949 |
| 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.9858999848365784 |
| 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/T10567 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9704999923706055 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2209 |
| topics[2].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[2].display_name | Vehicle Routing Optimization Methods |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C126255220 |
| concepts[0].level | 1 |
| concepts[0].score | 0.7644146680831909 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[0].display_name | Mathematical optimization |
| concepts[1].id | https://openalex.org/C137635306 |
| concepts[1].level | 2 |
| concepts[1].score | 0.7349934577941895 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q182667 |
| concepts[1].display_name | Pareto principle |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.5662848949432373 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C207512268 |
| concepts[3].level | 2 |
| concepts[3].score | 0.517663300037384 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q3074551 |
| concepts[3].display_name | Traffic flow (computer networking) |
| concepts[4].id | https://openalex.org/C177264268 |
| concepts[4].level | 2 |
| concepts[4].score | 0.5153457522392273 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q1514741 |
| concepts[4].display_name | Set (abstract data type) |
| concepts[5].id | https://openalex.org/C2986314615 |
| concepts[5].level | 3 |
| concepts[5].score | 0.43679285049438477 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q36829 |
| concepts[5].display_name | Pareto optimal |
| concepts[6].id | https://openalex.org/C192209626 |
| concepts[6].level | 2 |
| concepts[6].score | 0.43090981245040894 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q190909 |
| concepts[6].display_name | Focus (optics) |
| concepts[7].id | https://openalex.org/C68781425 |
| concepts[7].level | 2 |
| concepts[7].score | 0.3329601287841797 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q2052203 |
| concepts[7].display_name | Multi-objective optimization |
| concepts[8].id | https://openalex.org/C33923547 |
| concepts[8].level | 0 |
| concepts[8].score | 0.2819401025772095 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[8].display_name | Mathematics |
| concepts[9].id | https://openalex.org/C199360897 |
| concepts[9].level | 1 |
| concepts[9].score | 0.0 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[9].display_name | Programming language |
| concepts[10].id | https://openalex.org/C121332964 |
| concepts[10].level | 0 |
| concepts[10].score | 0.0 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q413 |
| concepts[10].display_name | Physics |
| concepts[11].id | https://openalex.org/C38652104 |
| concepts[11].level | 1 |
| concepts[11].score | 0.0 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q3510521 |
| concepts[11].display_name | Computer security |
| concepts[12].id | https://openalex.org/C120665830 |
| concepts[12].level | 1 |
| concepts[12].score | 0.0 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q14620 |
| concepts[12].display_name | Optics |
| keywords[0].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[0].score | 0.7644146680831909 |
| keywords[0].display_name | Mathematical optimization |
| keywords[1].id | https://openalex.org/keywords/pareto-principle |
| keywords[1].score | 0.7349934577941895 |
| keywords[1].display_name | Pareto principle |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.5662848949432373 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/traffic-flow |
| keywords[3].score | 0.517663300037384 |
| keywords[3].display_name | Traffic flow (computer networking) |
| keywords[4].id | https://openalex.org/keywords/set |
| keywords[4].score | 0.5153457522392273 |
| keywords[4].display_name | Set (abstract data type) |
| keywords[5].id | https://openalex.org/keywords/pareto-optimal |
| keywords[5].score | 0.43679285049438477 |
| keywords[5].display_name | Pareto optimal |
| keywords[6].id | https://openalex.org/keywords/focus |
| keywords[6].score | 0.43090981245040894 |
| keywords[6].display_name | Focus (optics) |
| keywords[7].id | https://openalex.org/keywords/multi-objective-optimization |
| keywords[7].score | 0.3329601287841797 |
| keywords[7].display_name | Multi-objective optimization |
| keywords[8].id | https://openalex.org/keywords/mathematics |
| keywords[8].score | 0.2819401025772095 |
| keywords[8].display_name | Mathematics |
| language | en |
| locations[0].id | doi:10.3934/jimo.2022104 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S114365116 |
| locations[0].source.issn | 1547-5816, 1553-166X |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 1547-5816 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Journal of Industrial and Management Optimization |
| locations[0].source.host_organization | https://openalex.org/P4310315844 |
| locations[0].source.host_organization_name | American Institute of Mathematical Sciences |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310315844 |
| locations[0].source.host_organization_lineage_names | American Institute of Mathematical Sciences |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://www.aimsciences.org/data/article/export-pdf?id=62b2ea1a2d80b73f6ef10091 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Journal of Industrial and Management Optimization |
| locations[0].landing_page_url | https://doi.org/10.3934/jimo.2022104 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5100760215 |
| authorships[0].author.orcid | https://orcid.org/0009-0004-1894-3055 |
| authorships[0].author.display_name | Zhi Lin |
| authorships[0].countries | CN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I63371133 |
| authorships[0].affiliations[0].raw_affiliation_string | Chongqing Jiaotong University, Chongqing 400074 China |
| authorships[0].affiliations[1].raw_affiliation_string | College of Mathematics and Statistics |
| authorships[0].institutions[0].id | https://openalex.org/I63371133 |
| authorships[0].institutions[0].ror | https://ror.org/01t001k65 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I63371133 |
| authorships[0].institutions[0].country_code | CN |
| authorships[0].institutions[0].display_name | Chongqing Jiaotong University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Zhi Lin |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Chongqing Jiaotong University, Chongqing 400074 China, College of Mathematics and Statistics |
| authorships[1].author.id | https://openalex.org/A5102442153 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Zai-Yun Peng |
| authorships[1].countries | CN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I63371133 |
| authorships[1].affiliations[0].raw_affiliation_string | Chongqing Jiaotong University, Chongqing 400074 China |
| authorships[1].affiliations[1].raw_affiliation_string | College of Mathematics and Statistics |
| authorships[1].institutions[0].id | https://openalex.org/I63371133 |
| authorships[1].institutions[0].ror | https://ror.org/01t001k65 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I63371133 |
| authorships[1].institutions[0].country_code | CN |
| authorships[1].institutions[0].display_name | Chongqing Jiaotong University |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Zaiyun Peng |
| authorships[1].is_corresponding | True |
| authorships[1].raw_affiliation_strings | Chongqing Jiaotong University, Chongqing 400074 China, College of Mathematics and Statistics |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://www.aimsciences.org/data/article/export-pdf?id=62b2ea1a2d80b73f6ef10091 |
| open_access.oa_status | diamond |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Algorithms for the Pareto solution of the multicriteria traffic equilibrium problem with capacity constraints of arcs |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| 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.9980999827384949 |
| 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/W2073298047, https://openalex.org/W1963790170, https://openalex.org/W2090178682, https://openalex.org/W2586328217, https://openalex.org/W2033790662, https://openalex.org/W2049264236, https://openalex.org/W4241467429, https://openalex.org/W2073147994, https://openalex.org/W2001591765, https://openalex.org/W317165722 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.3934/jimo.2022104 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S114365116 |
| best_oa_location.source.issn | 1547-5816, 1553-166X |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 1547-5816 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Journal of Industrial and Management Optimization |
| best_oa_location.source.host_organization | https://openalex.org/P4310315844 |
| best_oa_location.source.host_organization_name | American Institute of Mathematical Sciences |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310315844 |
| best_oa_location.source.host_organization_lineage_names | American Institute of Mathematical Sciences |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://www.aimsciences.org/data/article/export-pdf?id=62b2ea1a2d80b73f6ef10091 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Journal of Industrial and Management Optimization |
| best_oa_location.landing_page_url | https://doi.org/10.3934/jimo.2022104 |
| primary_location.id | doi:10.3934/jimo.2022104 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S114365116 |
| primary_location.source.issn | 1547-5816, 1553-166X |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 1547-5816 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Journal of Industrial and Management Optimization |
| primary_location.source.host_organization | https://openalex.org/P4310315844 |
| primary_location.source.host_organization_name | American Institute of Mathematical Sciences |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310315844 |
| primary_location.source.host_organization_lineage_names | American Institute of Mathematical Sciences |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://www.aimsciences.org/data/article/export-pdf?id=62b2ea1a2d80b73f6ef10091 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Journal of Industrial and Management Optimization |
| primary_location.landing_page_url | https://doi.org/10.3934/jimo.2022104 |
| publication_date | 2022-06-30 |
| publication_year | 2022 |
| referenced_works | https://openalex.org/W6635741336, https://openalex.org/W6601365666, https://openalex.org/W2089089306, https://openalex.org/W3125634883, https://openalex.org/W2891385823, https://openalex.org/W1965555004, https://openalex.org/W2235269566, https://openalex.org/W3035650220, https://openalex.org/W2152642686, https://openalex.org/W1766478788, https://openalex.org/W2082848291, https://openalex.org/W3184766665, https://openalex.org/W2169528473, https://openalex.org/W2788950797, https://openalex.org/W3021440715, https://openalex.org/W2791757471, https://openalex.org/W2036854646 |
| referenced_works_count | 17 |
| abstract_inverted_index.a | 41, 54 |
| abstract_inverted_index.We | 0 |
| abstract_inverted_index.is | 40 |
| abstract_inverted_index.of | 11, 28, 35, 49, 67, 81, 99 |
| abstract_inverted_index.on | 2 |
| abstract_inverted_index.to | 18, 77, 109 |
| abstract_inverted_index.we | 14, 52, 105 |
| abstract_inverted_index.and | 30 |
| abstract_inverted_index.for | 57, 91, 96 |
| abstract_inverted_index.not | 75 |
| abstract_inverted_index.one | 73 |
| abstract_inverted_index.set | 80 |
| abstract_inverted_index.the | 3, 33, 36, 59, 70, 79, 97, 100 |
| abstract_inverted_index.two | 107 |
| abstract_inverted_index.This | 87 |
| abstract_inverted_index.arcs | 29 |
| abstract_inverted_index.deal | 19 |
| abstract_inverted_index.does | 74 |
| abstract_inverted_index.flow | 45, 63 |
| abstract_inverted_index.give | 106 |
| abstract_inverted_index.know | 78 |
| abstract_inverted_index.need | 76 |
| abstract_inverted_index.that | 32 |
| abstract_inverted_index.very | 89 |
| abstract_inverted_index.with | 8, 20, 25, 46, 64 |
| abstract_inverted_index.Using | 69 |
| abstract_inverted_index.arcs. | 12, 50, 68 |
| abstract_inverted_index.flow, | 104 |
| abstract_inverted_index.focus | 1 |
| abstract_inverted_index.paths | 83 |
| abstract_inverted_index.prove | 31 |
| abstract_inverted_index.First, | 13 |
| abstract_inverted_index.Pareto | 42, 60, 101 |
| abstract_inverted_index.pairs. | 86 |
| abstract_inverted_index.proves | 88 |
| abstract_inverted_index.complex | 92 |
| abstract_inverted_index.formula | 17 |
| abstract_inverted_index.helpful | 90 |
| abstract_inverted_index.joining | 84 |
| abstract_inverted_index.present | 53 |
| abstract_inverted_index.problem | 7, 39 |
| abstract_inverted_index.traffic | 5, 22, 43, 61, 93, 102 |
| abstract_inverted_index.Finally, | 95 |
| abstract_inverted_index.capacity | 9, 26, 47, 65 |
| abstract_inverted_index.examples | 108 |
| abstract_inverted_index.problems | 24 |
| abstract_inverted_index.solution | 34 |
| abstract_inverted_index.algorithm | 56 |
| abstract_inverted_index.available | 82 |
| abstract_inverted_index.computing | 58 |
| abstract_inverted_index.exemplify | 110 |
| abstract_inverted_index.networks. | 94 |
| abstract_inverted_index.Beckmann's | 16 |
| abstract_inverted_index.algorithm, | 72 |
| abstract_inverted_index.algorithms | 98 |
| abstract_inverted_index.generalize | 15 |
| abstract_inverted_index.processes. | 112 |
| abstract_inverted_index.restricted | 55, 71 |
| abstract_inverted_index.calculation | 111 |
| abstract_inverted_index.constraints | 10, 27, 48, 66 |
| abstract_inverted_index.equilibrium | 6, 23, 44, 62, 103 |
| abstract_inverted_index.programming | 38 |
| abstract_inverted_index.Furthermore, | 51 |
| abstract_inverted_index.mathematical | 37 |
| abstract_inverted_index.multicriteria | 4, 21 |
| abstract_inverted_index.origin-destination | 85 |
| cited_by_percentile_year | |
| corresponding_author_ids | https://openalex.org/A5102442153 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 2 |
| corresponding_institution_ids | https://openalex.org/I63371133 |
| citation_normalized_percentile.value | 0.05448033 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |