Giulio Erberto CANTARELLA | ANALYSIS OF TRANSPORTATION SYSTEMS
Giulio Erberto CANTARELLA ANALYSIS OF TRANSPORTATION SYSTEMS
cod. 0622100032
ANALYSIS OF TRANSPORTATION SYSTEMS
| 0622100032 | |
| DIPARTIMENTO DI INGEGNERIA CIVILE | |
| EQF7 | |
| CIVIL ENGINEERING | |
| 2018/2019 |
| OBBLIGATORIO | |
| YEAR OF COURSE 2 | |
| YEAR OF DIDACTIC SYSTEM 2017 | |
| PRIMO SEMESTRE |
| SSD | CFU | HOURS | ACTIVITY | |
|---|---|---|---|---|
| ICAR/05 | 6 | 60 | LESSONS |
| Objectives | |
|---|---|
| 1. EXPECTED LEARNING RESULTS THIS COURSE DEALS WITH THE THEORETICAL AND APPLICATION FEATURES OF THE TOOLS ADOPTED BY THE MODERN STEADY-STATE TRANSPORT SYSTEMS ANALYSIS, BASED ON MATHEMATICAL MODELS OF TRANSPORTATION SUPPLY, TRAVEL DEMAND, AND THEIR INTERACTION, BY DEEPENING THE BASIC METHODS FOR STEADY-STATE EQUILIBRIUM ASSIGNMENT AND THE EXTENSIONS TO MULTI-CLASS MULTI-MODE EQUILIBRIUM ASSIGNMENT WITH VARIABLE DEMAND AND PRE-TRIP/EN-ROUTE CHOICE BEHAVIOR. 1.1 KNOWLEDGE AND UNDERSTANDING: UNDERSTANDING THE PROPERTIES OF THE VARIOUS METHODS FOR TRAVEL DEMAND ASSIGNMENT TO A TRANSPORTATION NETWORK; KNOWLEDGE OF FIXED-POINT MODELS. 1.2 APPLYING KNOWLEDGE AND UNDERSTANDING: ABILITY TO ANALYZE THE EFFECTS OF INTERVENTIONS ON A TRANSPORT SYSTEM BY APPLYING EQUILIBRIUM ASSIGNMENT MODELS IMPLEMENTED IN COMMERCIAL SW. 1.3 MAKING JUDGEMENTS: TO FIND THE MOST APPROPRIATE ASSIGNMENT METHODS WITH RESPECT TO THE TRANSPORTATION SYSTEM TO BE ANALYZED 1.4 COMMUNICATION SKILLS: KNOW HOW TO WORK IN A GROUP, WRITE DOWN A TECHNICAL REPORT, AND PRESENT THEM ORALLY. |
| Prerequisites | |
|---|---|
| THE COURSE OF TRANSPORTATION SYSTEM THEORY IS PROPAEDEUTIC TO THIS COURSE. |
| Contents | |
|---|---|
| 0.1 INTRODUCTION, PRELIMINARY ANALYSIS. THEORETIC LESSONS: 6 HOURS, ANALYSIS LAB: 4 HOURS. 1.1 STEADY-STATE TRAFFIC FLOW THEORY: RUNNING LINKS THEORETIC LESSONS: 3 HOURS. 1.2 STEADY-STATE TRAFFIC FLOW THEORY: QUEUING LINKS THEORETIC LESSONS: 2 HOURS 2.1 BASIC MODELS AND ALGORITHMS FOR STEADY-STATE DEMAND ASSIGNMENT TO A NETWORK: STOCHASTIC OR DETERMINISTIC ASSIGNMENT TO AN UNCONGESTED NETWORK. THEORETIC LESSONS: 6 HOURS, ANALYSIS LAB: 4 HOURS. 2.2 BASIC MODELS AND ALGORITHMS FOR STEADY-STATE DEMAND ASSIGNMENT TO A NETWORK: STOCHASTIC OR DETERMINISTIC EQUILIBRIUM ASSIGNMENT TO A CONGESTED NETWORK. THEORETIC LESSONS: 3 HOURS, ANALYSIS LAB: 2 HOURS. 3.1 EXTENDED MODELS AND ALGORITHMS FOR STEADY-STATE DEMAND ASSIGNMENT TO A NETWORK: STOCHASTIC MULTI-CLASS ASSIGNMENT. THEORETIC LESSONS: 3 HOURS, ANALYSIS LAB: 2 HOURS. 3.2EXTENDD MODELS AND ALGORITHMS FOR STEADY-STATE DEMAND ASSIGNMENT TO A NETWORK: STOCHASTIC ASSIGNMENT WITH PRE-TRIP – EN-ROUTE PATH CHOICE BEHAVIOUR. THEORETIC LESSONS: 6 HOURS, ANALYSIS LAB: 2 HOURS. 3.3 EXTENDED MODELS AND ALGORITHMS FOR STEADY-STATE DEMAND ASSIGNMENT TO A NETWORK: VARIABLE DEMAND STOCHASTIC ASSIGNMENT THEORETIC LESSONS: 3 HOURS, ANALYSIS LAB: 2 HOURS. 4.1 UPDATE OF AN OD MATRIX WITH COUNTS THEORETIC LESSONS: 3 HOURS, ANALYSIS LAB: 2 HOURS. 5.1 AGGREGATE CALIBRATION AND APPLICATION OF ASSIGNMENT DEI METHODS THEORETIC LESSONS: 5 HOURS. |
| Teaching Methods | |
|---|---|
| THE COURSE, 6 CFU, CONSISTS OF 40 HOURS OF THEORETIC LESSONS AND 20 HOURS OF ANALYSIS LAB, DURING WHICH TECHNIQUES FOR APPLYING METHODS LEARNED DURING THE THEORETIC LESSONS TO REAL CASE ARE PRESENTED. ACCORDING TO UNIVERSITY RULES ATTENDANCE IS NOT MANDATORY. |
| Verification of learning | |
|---|---|
| THE EXAMINATION INVOLVES AN SINGLE ORAL TEST, LASTING ABOUT 30 MINUTES, AFTER THE END OF THE COURSE; THE ORAL TEST CONSISTS OF A DISCUSSION CONCERNING THE THEORETICAL AND METHODOLOGICAL CONTENTS OF THE PROGRAM A PRELIMINARY AND A POSSIBLE PRESENTATION OF THE WORK DONE DURING THE COURSE; IT IS AIMED AT VERIFYING THE LEVEL AND QUALITY OF KNOWLEDGE AND UNDERSTANDING ACQUIRED BY THE STUDENT, THE EXPOSING SKILL USING THE APPROPRIATE TERMINOLOGY AND THE ABILITY TO PERSONALLY ORGANIZE THE DISCUSSION. THE ACHIEVEMENT IS EXPRESSED BY A SCORE IN THE RANGE [0-30]; THE MINIMUM FOR PASSING THE EXAM IS 18, FOR SUFFICIENT LEVEL AND QUALITY, THE MAXIMUM IS 30, FOR VERY GOOD LEVEL AND QUALITY; THE SCORE 30 "WITH HONORS" IS ATTRIBUTED TO STUDENTS, REACHING THE MAXIMUM VOTE OF 30, WHO SHOW EXCELLENT LEVEL AND QUALITY AND SHOW THAT THEY ARE ABLE TO APPLY THEIR KNOWLEDGE AND SKILLS BEYOND THE CONTEXTS OF LESSONS. |
| Texts | |
|---|---|
| CASCETTA E. (2009 HARDBACK, 2012 PAPERBACK) TRANSPORTATION SYSTEMS ANALYSIS: MODELS AND APPLICATIONS. SPRINGER. ADDITIONAL MATERIAL: CANTARELLA, G. E. E VELONÀ, P. (2010) ASSEGNAZIONE A RETI DI TRASPORTO. MODELLI DI PUNTO FISSO FRANCO ANGELI EDITORE MATERIAL FOR FURTHER NUMERICAL EXERCISES: VITETTA, A. (2003) IL DEFLUSSO NEI SISTEMI DI TRASPORTO - ESERCIZI ED APPLICAZIONI FRANCO ANGELI EDITORE DI GANGI, M., POSTORINO, M. N. (2005) MODELLI E PROCEDURE PER L’ANALISI DEI SISTEMI DI TRASPORTO- ESERCIZI ED APPLICAZIONI FRANCO ANGELI EDITORE |
| More Information | |
|---|---|
| NONE |
BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2019-10-21]
