Quick solution to any problem
How an assignment problem is related with transportation model?
Table of Contents
- 1 How an assignment problem is related with transportation model?
- 2 Why transportation Model Cannot be used for solving the assignment problem?
- 3 What is transportation and assignment model?
- 4 What is an assignment model and how do you solve it?
- 5 How an assignment problem can be solved?
- 6 What do you understand by assignment problems discuss the steps solving assignment problems?
- 7 How do you solve the model assignment problem?
- 8 When is a transportation model applicable?
An assignment problem may be considered as a special type of transportation problem in which the number of sources and destinations are equal. In the case of an assignment problem, the given matrix must necessarily be a square matrix which is not the condition for a transportation problem.
What is assignment problem in transportation problem?
Assignment problems, which are special cases of transportation problems, pose difficulties for the transportation algorithm and require the development of an algorithm which takes advantage of the simpler nature of these problems. We begin with a typical example of a transportation problem.
Why transportation Model Cannot be used for solving the assignment problem?
For an assignment problem of order n x n there would be only n basic variables in the solution because here n assignments are required to be made. This degeneracy problem of solution makes the transportation method computationally inefficient for solving the assignment problem.
Why assignment problem is a special case of transportation problem?
Explanation : An assignment problem is a special case of transportation problem, where Number of rows equals number of columns, all rim conditions are 1and values of each decision variable is either 0 or 1.
What is transportation and assignment model?
The transportation model is concerned with selecting the routes between supply and demand points in order to minimize costs of transportation subject to constraints of supply at any supply point and demand at any demand point. …
What is the difference between transportation model and assignment model?
In a transportation model, sources and destinations are present; in an assignment model, there are facilities, and jobs which have to be assigned to those facilities. Unlike a transportation model, in an assignment model, number of facilities (sources) is equal to number of jobs (destinations).
What is an assignment model and how do you solve it?
Assignment models is one of topics of operations research. It consists of assigning a specific (person or worker) to a specific (task or job) assuming that there are the number of persons equal to the number of tasks available.
What is transportation and assignment models?
How an assignment problem can be solved?
An assignment problem can be solved by Simplex method and Transportation method. The simplex method is a method for solving problems in linear programming.
How assignment problem is different from transportation problem?
What is the difference between Assignment Problem and Transportation Problem?…Solution.
What do you understand by assignment problems discuss the steps solving assignment problems?
Meaning of Assignment Problem: An assignment problem is a particular case of transportation problem where the objective is to assign a number of resources to an equal number of activities so as to minimise total cost or maximize total profit of allocation.
Why assignment model is a special case of transportation model?
How do you solve the model assignment problem?
How to solve transportation problem using three methods of transportation model?
When is a transportation model applicable?
Copyright © 2003 by Robert Fourer, David M. Gay and Brian W. Kernighan
Transportation and Assignment Models..
Not what you're looking for?
Consider the application of transportation and assignment models in real life and discuss:
• Any two similarities and differences between both the models • Any two events where each of the two models can be used
Purchase this Solution
Lists similarities and differences between transportation and assignment models and lists events where each of the two models can be used.
Consider the application of transportation and assignment models in real life and discuss: • Any two similarities and differences between both the models
Similarities: 1) Transportation and assignment models are both examples of network problems where a product is shipped from a number of sources to a number of destinations at the minimum possible cost. 2) For both the transportation and assignment models, unit shipping costs from a source to a destination are constant.
Differences: 1) In the assignment model each source can provide at most one unit and each destination can accept at most one unit. In the transportation model each ...
Free BrainMass Quizzes
Measures of central tendency.
Tests knowledge of the three main measures of central tendency, including some simple calculation questions.
This quiz evaluates the students understanding of the measures of central tendency seen in statistics. This quiz is specifically designed to incorporate the measures of central tendency as they relate to psychological research.
Know Your Statistical Concepts
Each question is a choice-summary multiple choice question that presents you with a statistical concept and then 4 numbered statements. You must decide which (if any) of the numbered statements is/are true as they relate to the statistical concept.
Terms and Definitions for Statistics
This quiz covers basic terms and definitions of statistics.
Related BrainMass Solutions
Net Work Models: Quantitative analysis approach
Transportation Assignment Net Work Models are analyzed.
Transportation and Assignment Models
162809 Transportation and Assignment Models The management of the Executive Furniture Corporation decided to expand the production capacity at its Des Moines factory and to cut back production at its factories.
Sales, Probability, Forecasting Models, EOQ, Programming
(chapter 10 Transportation and Assignment Models , Quantitative Analysis for Management, 10th Edition, Barry Render). See the attached file.
162811 Transportation and Assignment Models Don Levine Corporation is considering adding an additional plant to its three existing facilities in Decatur, Minneapolis, and Carbondale. Both St.
Most efficient route calculation
190608 Transportation Network Assignment Models : Calculate the best route Question: Transworld Moving has been hired to move the office furniture and equipment of Cohen Properties to their new headquarters. What route do you recommend?
Transportation and Assignment Models in Expansion
162805 Transportation and Assignment Models The management of the Executive Furniture Corporation decided to expand the production capacity at its Des Moines factory and to cut back production at its factories.
Interpretation of output Management scientist
190781 Transportation Problem: Interpretation of output from Management scientist I have a study problem that I need help with. We're studying network models and linear programming models related to transshipment and transportation .
.each supply and demand value is 1 in the assignment problem. ...there are many differences between the transportation and assignment problems
Transportation Assignment Network Models: Hardrock Concrete Co
190587 Transportation Assignment Network Models : Hardrock Concrete Co Attached is the chart that corresponds to the question. 1.
FYBMS, SYBMS, TYBMS and beyond BMS
Compare transportation problem and Assignment problem
Like it? Share with your friends!
Posted by MT UVA BMS
114 comments, cancel reply.
You must be logged in to post a comment.
Ads hindering the accessibility of content of page
Would you be interested to buy a premier membership for an ad free version of this site?
This Website Is For Sale. Email us an offer we cannot refuse on [email protected] :)
All The Dots Are Connected / It's Not Rocket Science
Transportation and assignment problems with r.
In the previous post “ Linear Programming with R ” we examined the approach to solve general linear programming problems with “Rglpk” and “lpSolve” packages. Today, let’s explore “lpSolve” package in depth with two specific problems of linear programming: transportation and assignment.
1. Transportation problem
Code & Output:
The solution is shown as lptrans$solution and the total cost is 20500 as lptrans$objval.
2. Assignment problem
Similarly, the solution and the total cost are shown as lpassign$solution and lpassign$objval respectively.
This article was really helpful, but I am facing issue while solving unbalanced transportation problem when there is excess demand. Could you please guide me on what has to be done in this case.
Hello sir, this article was really helpful. But, I am facing issue while solving unbalanced transportation problem when there is excess demand, it gives solution as no feasible solution. works perfectly fine for balanced and excess supply problems. Could you please guide me on why this issue is occurring and a possible solution for the same. Thank you.
MBA Knowledge Base
Business • Management • Technology
Home » Management Science » Transportation and Assignment Models in Operations Research
Transportation and Assignment Models in Operations Research
Transportation and assignment models are special purpose algorithms of the linear programming. The simplex method of Linear Programming Problems(LPP) proves to be inefficient is certain situations like determining optimum assignment of jobs to persons, supply of materials from several supply points to several destinations and the like. More effective solution models have been evolved and these are called assignment and transportation models.
The transportation model is concerned with selecting the routes between supply and demand points in order to minimize costs of transportation subject to constraints of supply at any supply point and demand at any demand point. Assume a company has 4 manufacturing plants with different capacity levels, and 5 regional distribution centres. 4 x 5 = 20 routes are possible. Given the transportation costs per load of each of 20 routes between the manufacturing (supply) plants and the regional distribution (demand) centres, and supply and demand constraints, how many loads can be transported through different routes so as to minimize transportation costs? The answer to this question is obtained easily through the transportation algorithm.
Similarly, how are we to assign different jobs to different persons/machines, given cost of job completion for each pair of job machine/person? The objective is minimizing total cost. This is best solved through assignment algorithm.
Uses of Transportation and Assignment Models in Decision Making
The broad purposes of Transportation and Assignment models in LPP are just mentioned above. Now we have just enumerated the different situations where we can make use of these models.
Transportation model is used in the following:
- To decide the transportation of new materials from various centres to different manufacturing plants. In the case of multi-plant company this is highly useful.
- To decide the transportation of finished goods from different manufacturing plants to the different distribution centres. For a multi-plant-multi-market company this is useful.
- To decide the transportation of finished goods from different manufacturing plants to the different distribution centres. For a multi-plant-multi-market company this is useful. These two are the uses of transportation model. The objective is minimizing transportation cost.
Assignment model is used in the following:
- To decide the assignment of jobs to persons/machines, the assignment model is used.
- To decide the route a traveling executive has to adopt (dealing with the order inn which he/she has to visit different places).
- To decide the order in which different activities performed on one and the same facility be taken up.
In the case of transportation model, the supply quantity may be less or more than the demand. Similarly the assignment model, the number of jobs may be equal to, less or more than the number of machines/persons available. In all these cases the simplex method of LPP can be adopted, but transportation and assignment models are more effective, less time consuming and easier than the LPP.
- Waiting Lines and Queuing System in Management Science
- Introduction to Linear Programming (L.P)
- Introduction to Transportation Problem
- Model of Quantitative Analysis
- Introduction to Decision Models
- Introduction to Crtical Path Analysis
- Economic interpretation of linear programming duality
- Procedure for finding an optimum solution for transportation problem
- Operations Research approach of problem solving
- Modeling Techniques in Management Science
One thought on “ Transportation and Assignment Models in Operations Research ”
Exclussive dff. And easy understude
Leave a Reply Cancel reply
Your email address will not be published. Required fields are marked *
This site uses Akismet to reduce spam. Learn how your comment data is processed .
(Stanford users can avoid this Captcha by logging in.)
- Send to text email RefWorks EndNote printer
The traffic assignment problem : models and methods
Available online, at the library.
SAL3 (off-campus storage)
- Find it at other libraries via WorldCat
- Part 1 Models: urban traffic planning - the transportation planning process, organization and goal definition, base-year inventory, model analysis, travel forecast, network evaluation, discussion
- the basic equilibrium model and extensions - the Wardrop conditions, the mathematical program for user equilibrium, properties of equilibrium solutions, user equilibrium versus system optimum, non-separable costs and multiclass-user transportation networks, related network problems, discussion, some extentions
- general traffic equilibrium models - traffic equilibrium models, properties of equilibrium solutions. Part 2 Methods: algorithms for the basic model and its extensions - the Frank-Wolfe algorithm and its extensions, algorithm concepts, algorithms for the basic model, algorithms for elastic demand problems, algorithms for stochastic assignment models, algorithms for side-constrained assignment models, discussion
- algorithms for general traffic equilibria - algorithm concepts, algorithms for general traffic equilibria, discussion.
- (source: Nielsen Book Data)
Browse related items.
- Stanford Home
- Maps & Directions
- Search Stanford
- Emergency Info
© Stanford University , Stanford , California 94305 .
Find answers to all questions with us
What is the difference between transportation and assignment model?
Table of Contents
- 1 What is the difference between transportation and assignment model?
- 2 How do you relate transportation problem with assignment problem?
- 3 What is called transportation problem?
- 4 What is the aim of transportation problem?
- 5 What are transportation, assignment and Transshipment problems?
In a transportation model, sources and destinations are present; in an assignment model, there are facilities, and jobs which have to be assigned to those facilities. Unlike a transportation model, in an assignment model, number of facilities (sources) is equal to number of jobs (destinations).
What do you mean by assignment problem and transportation problem explain?
Meaning. An Assignment Problem is a particular case of. transportation problem where the objective is to. assign a number of resources to an equal number of activities so as to minimise total cost or maximise total profit of allocation.
What is the main difference between assignment problem and Travelling salesman problem?
The ‘Travelling salesman problem’ is very similar to the assignment problem except that in the former, there are additional restrictions that a salesman starts from his city, visits each city once and returns to his home city, so that the total distance (cost or time) is minimum.
How do you relate transportation problem with assignment problem?
The assignment problem is a special case of the transportation problem where the supply from every source and the demand at every sink are equal to 1. Such a situation arises naturally in the setting of assigning workers to jobs, or of assigning workers to a time schedule.
Which method is used to solve assignment problem?
Hungarian method The method used for solving an assignment problem is called Hungarian method. The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal-dual methods.
What is assignment problem and its application?
Assignment problem arises in diverse situations, where one needs to determine an optimal way to assign subjects to subjects in the best possible way. With that, this paper classified assignment problems into two, which are timetabling problem and allocation problem.
What is called transportation problem?
The transportation problem is a special type of linear programming problem where the objetive consists in minimizing transportation cost of a given commodity from a number of sources or origins (e.g. factory, manufacturing facility) to a number of destinations (e.g. warehouse, store).
How do you solve an assignment problem in operational research?
Solution of assignment problems (Hungarian Method)
- Solve the following assignment problem.
- Step 1: Select a smallest element in each row and subtract this from all the elements in its row.
- Step 2: Select the smallest element in each column and subtract this from all the elements in its column.
What is Travelling salesman problem in operation research?
The Travelling Salesman Problem (TSP) is the challenge of finding the shortest yet most efficient route for a person to take given a list of specific destinations. It is a well-known algorithmic problem in the fields of computer science and operations research.
What is the aim of transportation problem?
A transportation problem basically deals with the problem which aims to minimize the total transportation cost or maximize the total transportation profit of distributing a product from a number of sources or origins to a number of destinations.
Which method is used to solve the assignment problem?
What’s the difference between assignment and transportation models?
What are transportation, assignment and Transshipment problems?
What’s the difference between a transportation problem and a programming problem?
Can a transportation algorithm be used for assignment?
Share this post
- Research Article
- Published: 03 May 2023
Traffic assignment in urban transportation network problem with emission constraints in China: a cooperative game theory
- Shuqin Zhao ORCID: orcid.org/0000-0002-6629-0878 1 , 2 ,
- Linzhong Liu 1 &
- Ping Zhao 3
Environmental Science and Pollution Research volume 30 , pages 69274–69288 ( 2023 ) Cite this article
Traffic assignment in urban transport planning is the process of allocating traffic flows in a network. Traditionally, traffic assignment can reduce travel time or travel costs. As the number of vehicles increases and congestion causes increased emissions, environmental issues in transportation are gaining more and more attention. The main objective of this study is to address the issue of traffic assignment in urban transport networks under an abatement rate constraint. A traffic assignment model based on cooperative game theory is proposed. The influence of vehicle emissions is incorporated into the model. The framework consists of two parts. First, the performance model predicts travel time based on the Wardrop traffic equilibrium principle, which reflects the system travel time. No travelers can experience a lower travel time by unilaterally changing their path. Second, the cooperative game model gives link importance ranking based on the Shapley value, which measures the average marginal utility contribution of links of the network to all possible link coalitions that include the link, and assigns traffic flow based on the average marginal utility contribution of a link with system vehicle emission reduction constraints. The proposed model shows that traffic assignment with emission reduction constraints allows more vehicles in the network with an emission reduction rate of 20% than traditional models.
This is a preview of subscription content, access via your institution .
Buy single article.
Instant access to the full article PDF.
Price includes VAT (Russian Federation)
Rent this article via DeepDyve.
Ahuja RK, Orlin JB, SPallottino, Scutella MG (2003) Dynamic shortest paths minimizing travel times and costs. Networks: An International Journal 41(4): 197-205
Aziz HA, Vukkusuri S (2012) Integration of environmental objectives in a system optimal dynamic traffic assignment model. Computer-Aided Civil Infrastructure Engineering 27(7):494–511
Article Google Scholar
Baykasoğlu A, Özbel BK (2021) Explicit flow-risk allocation for cooperative maximum flow problems under interval uncertainty. Oper Res 21(3):2149–2179
Beckmann M, McGuire CB, Winsten CB (1956) Studies in the Economics of Transportation. New Haven, CT: Yale University Press
Chen J, Feng Q, Guo Q (2021) Multi-class freeway congestion and emission based on robust dynamic multi-objective optimization. Algorithms 14(9):266
Chen L, Yang H (2012) Managing congestion and emissions in road networks with tolls and rebates. Transp Res Pt B-Methodol 46(8):933–948
Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269–271
Dreyfus SE (1969) An appraisal of some shortest-path algorithms. Oper Res 17(3):395–412
Ferguson EM, Duthie J, Travis WS (2012) Comparing delay minimization and emissions minimization in the network design problem. Comput-Aided Civ Inf 27(4):288–302
Floyd RW (1962) Algorithm 97: shortest path. Communications of the ACM 5(6):345
Frank M, Wolfe P (1956) An algorithm for quadratic programming. Nav Res Logis Q 3:95–110
Friesz TL, Han K, Liu H, Yao T (2013) Dynamic congestion and tolls with mobile source emission. Procedia Soc Behav Sci 80:818–836
Fukushima M (1984) A modified Frank-Wolfe algorithm for solving the traffic assignment problem. Transp Res Pt B-Methodol 18(2):169–177
Gopalakrishnan S, Granot D, Granot F, Sošić G, Cui H (2021) Incentives and emission responsibility allocation in supply chains. Manag Sci 67(7):4172–4190
Gusev VV (2020) The vertex cover game: application to transport networks. Omega 97:102102
Hadas Y, Gnecco G, Sanguineti M (2017) An approach to transportation network analysis via transferable utility games. Transp Res Pt B-Methodol 105:120–143
Hao J, Hatzopoulou M, Miller E (2010) Integrating an activity-based travel demand model with dynamic traffic assignment and emission models: implementation in the Greater Toronto, Canada, area. Transp Res Rec 2176(1):1–13
Heinold A (2020) Comparing emission estimation models for rail freight transportation. Transp Res Part D-Transport Environ 86:102468
Hissel D, Candusso D, Harel F (2007) Fuzzy-clustering durability diagnosis of polymer electrolyte fuel cells dedicated to transportation applications. IEEE Transactions on Vehicular Technology 56(5):2414–2420
Joulin A, Tang K, Li F (2014) Efficient image and video co-localization with frank-wolfe algorithm. Springer, European Conference on Computer Vision
Book Google Scholar
Kabadurmuş Ö, Erdoğan MS, Özkan Y, Köseoğlu M (2019) A multi-objective solution of green vehicle routing problem. Logistics, Supply Chain, Sustainability Global Challenges 10(1):31–44
Kimms A, Kozeletskyi L (2016) Shapley value-based cost allocation in the cooperative traveling salesman problem under rolling horizon planning. EURO J Transp Logist 5(4):371–392
Kitthamkesorn S, Chen A, Xu X, Ryu S (2016) Modeling mode and route similarities in network equilibrium problem with go-green modes. Netw Spat Econ 16(1):33–60
Kolak O, Feyzioğlu O, Birbil Şİ, Noyan N, Yalçındağ S (2013) Using emission functions in modeling environmentally sustainable traffic assignment policies. J Ind Manag Optim 9(2):341–363
Leblanc LJ (1975) An algorithm for the discrete network design problem. Transplant Sci 9(3):183–199
Li W, Pu Z, Li Y, Tu M (2021) How does ridesplitting reduce emissions from ridesourcing? A spatiotemporal analysis in Chengdu China. Transp Res Part D-Transport Environ 95:102885
Li Z, Lam W, Wong SC, Sumalee A (2012) Environmentally sustainable toll design for congested road networks with uncertain demand. Int J Sustain Transp 6(3):127–155
Li Z, Wang Y, Lam W, Sumalee A, Choi K (2014) Design of sustainable cordon toll pricing schemes in a monocentric city. Netw Spat Econ 14(2):133–158
Article CAS Google Scholar
Lissovoi A, Witt C (2013) Runtime analysis of ant colony optimization on dynamic shortest path problems. In: Proceedings of the 15th annual conference on Genetic and evolutionary computation. 1605–1612. https://doi.org/10.1145/2463372.2463567
Lozano S, Moreno P, Adenso-Díaz B, Algaba E (2013) Cooperative game theory approach to allocating benefits of horizontal cooperation. Eur J Oper Res 229(2):444–452
Ma R, Ban XJ, Szeto WY (2017) Emission modeling and pricing on single-destination dynamic traffic networks. Transp Res Pt B-Methodol 100:255–283
MEEPRC (2014) Technical guide for compilation of emission inventory of air pollutants from road motor vehicles (trial). Ministry of Ecology and Environment of the People’s Republic of China (MEEPRC). https://www.mee.gov.cn/gkml/hbb/bgg/201501/t20150107_293955.htm
MEEPRC (2019) The second biennial update report on climate change of the People’s Republic of China. Ministry of Ecology and Environment of the People’s Republic of China (MEEPRC). https://www.mee.gov.cn/ywgz/ydqhbh/wsqtkz/index_4.shtml
MEEPRC (2021) China mobile source environmental management annual report (2021). Ministry of Ecology and Environment of the People’s Republic of China (MEEPRC). https://www.mee.gov.cn/hjzl/sthjzk/ydyhjgl/202109/t20210910_920787.shtml
Mishra S, Welch TF (2012) Joint travel demand and environmental model to incorporate emission pricing for large transportation networks. Transp Res Rec 2302(1):29–41
Molina JC, Eguia L, Racero J, Guerrero F (2014) Multi-objective vehicle routing problem with cost and emission functions. Procedia Soc Behav Sci 160:254–263
Nagurney A (2000a) Congested urban transportation networks and emission paradoxes. Transp Res Part D-Transport Environ 5(2):145–151
Nagurney A (2000b) Alternative pollution permit systems for transportation networks based on origin/destination pairs and paths. Transp Res Part D-Transport Environ 5(1):37–58
Nagurney A, Zhang D (2001) Dynamics of a transportation pollution permit system with stability analysis and computations. Transp Res Part D-Transport Environ 6(4):243–268
Von Neumann J, Morgenstern O (1944) The theory of games and economic behavior. Princeton, Princeton University Press
Patil GR (2016) Emission-based static traffic assignment models. Environ Model Assess 21(5):629–642
Pu Z, Cui Z, Tang J, Wang S, Wang Y (2021) Multi-modal traffic speed monitoring: a real-time system based on passive Wi-Fi and bluetooth sensing technology. IEEE Internet Things J 9(14):12413–12424
Ren J, Gao B, Zhang J, Chen C (2020) Measuring the energy and carbon emission efficiency of regional transportation systems in China: chance-constrained DEA models. Math Probl Eng 2020:1–12
Rodriguez-Rey D, Guevara M, Linares MP, Casanovas J, Salmerón J, Soret A, Jorba O, Tena C, García-Pando CP (2021) A coupled macroscopic traffic and pollutant emission modelling system for Barcelona. Transp Res Part D-Transport Environ 92:102725
Rosenthal EC (2017) A cooperative game approach to cost allocation in a rapid-transit network. Transp Res Pt B-Methodol 97:64–77
Shapley LS (1953) A value for n-person games. Contributions to the Theory of Games 2: 307–324
Sharma S, Ukkusuri SV, Mathew TV (2009) Pareto optimal multiobjective optimization for robust transportation network design problem. Transp Res Rec 2090(1):95–104
Sharma S, Mishra S (2011) Optimal emission pricing models for containing carbon footprints due to vehicular pollution in a city network. In Proceedings of the 90th Transportation Research Board Annual Meeting, Washington, DC
Sharma S, Mathew TV (2011) Multiobjective network design for emission and travel-time trade-off for a sustainable large urban transportation network. Environ Plann B Plann Des 38(3):520–538
Sharma S (2013) A study on effect on GHG emissions by addition of transit mode in existing road network and optimal emission pricing models for reducing carbon footprints. In Proceedings of the 90th Transportation Research Board (TRB) Annual Meeting, Washington, DC
Sharma S, Mishra S (2013) Intelligent transportation systems-enabled optimal emission pricing models for reducing carbon footprints in a bimodal network. J Intell Transport Syst 17(1):54–64
Szeto WY, Jaber X, Wong SC (2012) Road network equilibrium approaches to environmental sustainability. Transport Rev 32(4):491–518
Thapa R, Shrestha JK (2019) Optimal route computation for public transport with minimum travelling time & travel cost: a case study of Pokhara City. Tech J 1(1):79–86
Wang Y, Szeto WY, Han K, Friesz TL (2018) Dynamic traffic assignment: a review of the methodological advances for environmentally sustainable road transportation applications. Transp Res Pt B-Methodol 111:370–394
Wardrop JG (1952) Road paper. Some theoretical aspects of road traffic research. Proceedings of the institution of civil engineers 1(3):325–362
Yang H, Xu W, He B, Meng Q (2010) Road pricing for congestion control with unknown demand and cost functions. Transp Res Part C-Emerg Technol 18(2):157–175
Yin Y, Lawphongpanich S (2006) Internalizing emission externality on road networks. Transp Res Part D-Transport Environ 11(4):292–301
Zhang L, Long R, Chen H, Yang T (2018) Analysis of an optimal public transport structure under a carbon emission constraint: a case study in Shanghai. China Environ Sci Pollut R 25(4):3348–3359
Zhang S, Zhang Y (2018) A hybrid genetic and ant colony algorithm for finding the shortest path in dynamic traffic networks. Autom Control Comput Sci 52(1):67–76
Zhang X, Liu P, Li Z, Yu H (2013) Modeling the effects of low-carbon emission constraints on mode and route choices in transportation networks. Procedia Soc Behav Sci 96:329–338
Zheng B, Zhang Q, Borken-Kleefeld J, Huo H, Guan D, Klimont Z, Peters GP, He K (2015) How will greenhouse gas emissions from motor vehicles be constrained in China around 2030? Appl Energy 156:230–240
The authors would like to extend special thanks to the editor and the anonymous reviewers for their constructive comments and suggestions for improving the quality of this study.
This work was supported by National Natural Science Foundation of China (grant numbers 71671079 and 71361018).
Authors and affiliations.
School of Traffic & Transportation, Lanzhou Jiaotong University, 88 Anning Rd, Lanzhou, 730070, China
Shuqin Zhao & Linzhong Liu
School of Business Administration, Henan University of Animal Husbandry and Economy, 146 Yingcai St., Huiji District, Zhengzhou, 450053, China
Key Laboratory of Deep Underground Science and Engineering (Ministry of Education), School of Architecture and Environment, Sichuan University, 24 First Ring Rd, Chengdu, 610065, China
You can also search for this author in PubMed Google Scholar
Conceptualization: Shuqin Zhao and Linzhong Liu; methodology: Shuqin Zhao; data curation: Shuqin Zhao and Ping Zhao; writing—original draft preparation: Shuqin Zhao; writing—review and editing: Linzhong Liu and Ping Zhao; supervision: Linzhong Liu.
Correspondence to Shuqin Zhao .
Consent to participate
Consent for publication
The authors declare no competing interests.
Responsible Editor: Marcus Schulz
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
Reprints and Permissions
About this article
Cite this article.
Zhao, S., Liu, L. & Zhao, P. Traffic assignment in urban transportation network problem with emission constraints in China: a cooperative game theory. Environ Sci Pollut Res 30 , 69274–69288 (2023). https://doi.org/10.1007/s11356-023-27108-9
Received : 06 November 2022
Accepted : 15 April 2023
Published : 03 May 2023
Issue Date : June 2023
DOI : https://doi.org/10.1007/s11356-023-27108-9
Share this article
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative
- Urban traffic
- Traffic assignment
- Cooperative game theory
- Shapley value
- Vehicle emissions
- Emission constraints
- Find a journal
- Publish with us