代做program、代写Java/C++编程设计

日期：2025-07-13 05:10

Faculty of Transport and Traffic Sciences „Friedrich List“ Institute of Transport and Economics

Chair of Transport Services and Logistics

Project Work - Task

Campus Shuttle in Dresden

7th April 2025

The Dresdner Verkehrsbetriebe (DVB) operate the bus and tram network in the city

of Dresden. Thereby, they also serve the strongly demanded routes between the

different locations of the Technische Universität. Overcrowded and delayed buses

and trams are common due to the high number of students.

Therefore, the TU Dresden considers the establishment of a campus shuttle, in coop eration with the DVB, which connects the main campus in the region of Südvorstadt/

Plauen, the location in Johannstadt, the Faculty of Medicine, the Botanical Garden

and the student residences of the Studentenwerk Dresden. As this shuttle is only in tended for members (students as well as employees) of the TU Dresden, the existing

public transport can thereby be relieved.

For enabling a fast establishment of the campus shuttle, the route and line networks

need to be planned considering the following framework.

The campus shuttle, which is to be operated by buses, uses the existing tram and bus

stops from the DVB. Thereby, 30 stops at the single locations of the TU as well as at

least one stop in the area of the student residences are served in total.

The following table 1 provides the stops.

Table 1: Stops of the campus shuttle

No. Stop No. Stop

1 Bamberger Straße 16 Rosa-Luxemburg-Platz

2 Blasewitzer-/Fetscherstraße 17 Sächsische Staats- und Universitäts bibliothek (SLUB)

3 Caspar-David-Friedrich-Straße 18 Schweizer Straße

4 Dürerstraße 19 Spenerstraße

5 Gerokstraße 20 St.-Benno-Gymnasium

6 Gutenbergstraße 21 Straßburger Platz

7 Hauptbahnhof (Hbf) 22 Strehlener Platz

8 Helmholtzstraße 23 Südvorstadt

9 Hermann-Seidel-Straße 24 Technische Universität

10 Lennéplatz 25 Tharandter Straße

11 Mommsenstraße 26 Uhlandstraße

12 Münchner Platz 27 Uniklinikum

13 Nürnberger Platz 28 Walpurgisstraße

14 Plauen/Nöthnitzer Straße 29 Weberplatz

15 Reichenbachstraße 30 Zellescher Weg

31 Postplatz 32 Zwinglistraße

2

The Studentenwerk Dresden currently evaluates the construction of student resi dences at Postplatz and Zwinglistraße. The realisation of one or both measures re sults in using the DVB-stops Postplatz (node 31) and/or Zwinglistraße (node 32).

Figure 1 depicts the location of those stops in the urban area of Dresden. Thereby,

the existing 30 stops are marked in green and the two planned stops (nodes 31 and

32) in red. Figure 2 schematically shows the potential route network (the edges are

accessible in both directions). The planned stops (nodes 31 and 32) including the as sociated edges are depicted in red as well. The sheet “Edges” of the file “Data.xlsx”

contains all potential edges of the route network. The file “Route_network.pptx” in cludes the schematic route network for further editing.

Figure 1: Stops in the urban area (cf. DVB 2017)

Figure 2: Potential route network

The DVB provides three different bus types for operating the campus shuttle:

• Type 1: Small bus with a capacity of 31,000 passengers per day and direction

• Type 2: Medium bus with a capacity of 45,000 passengers per day and direction

• Type 3: Large bus with a capacity of 63,000 passengers per day and direction

In case an edge from the potential network is included in the future campus shut tle network, fixed costs (construction costs, in e) accrue once a year for operation

preparations. Depending on the use of an edge, additional costs (in e) accrue for

each passenger transported along an arrow.

Various student works already determined the data just described, as well as the daily

demand. The demand, the (variable) passenger-related usage costs and the (fixed)

construction costs are shown in the Excel table “Data.xlsx” in the sheets “Demand”,

“Usage_costs” and “Construction_costs”.

4

The following potential lines can be set up in the course of planning the line network

(see table 2). Those are also included in the file “Data.xlsx” in the sheet “Lines”.

Table 2: Potential lines

Line Stops Line Stops

1 1-23 31 7-26-10-29

2 1-23-18-31 32 7-26-10-29-32

3 1-23-18-31-16 33 7-26-10-29-32-9

4 1-23-18-31-16-6-27 34 8-14

5 1-23-18-31-28-7-15-13-12-14 35 8-14-12-13

6 1-23-18-31-28-7-15-13-12-14-8 36 8-14-12-13-15

7 1-23-25 37 8-14-12-13-15-7-28-31-16

8 2-19-32 38 9-32

9 2-21-7 39 9-32-29

10 2-21-7-15-13-12-14 40 9-32-19-2-27

11 2-21-7-15-13-12-14-8 41 9-32-19-2-27-6-16

12 3-29-10 42 11-24

13 3-29-10-21-20-5-4 43 11-24-13-15-7-28-31

14 3-29-10-21-20-5-6 44 11-24-13-23-25

15 3-29-32-9 45 11-24-17-26-10-21-20

16 3-30-17-24-11 46 13-12-14

17 3-30-17-24-13-23-25 47 14-12-13-15

18 4-5 48 14-12-13-15-7-21-2-27

19 4-5-6 49 15-7-28

20 4-5-20-21 50 16-6-27

21 4-5-20-21-7-15-13-12-14-8 51 16-6-27-2-19-32

22 4-5-20-21-10-22-30 52 16-31-18

23 4-5-20-21-10-26-17 53 16-31-25

24 6-5-20-21 54 17-26-7-28-31

25 6-5-20-21-7-15-13-12-14-8 55 18-31-28

26 6-5-20-21-10-22-30 56 20-21-10-22-30

27 6-5-20-21-10-26-17 57 22-26-7-28-31

28 7-15-13-12-14 58 25-23-13-15-7-28

29 7-21-2-27 59 27-2-19-32

30 7-26-22 60 28-31

The daily operative costs per line arise from the sum of passenger-related usage costs

(see file “Data.xlsx”, sheet “Usage_costs”) of all edges in the line course (see table 2)

multiplied by 1,000 e.

The travel times (in min) are shown in the Excel table in the sheet “Travel_times”. As sume a time requirement of 2+X minutes per transfer process. Thereby, X is equiva lent to the penultimate digit of your matriculation number.

5

Which of the existing edges should be included in the newly planned campus shuttle

network? Create the optimized network for the campus shuttle. For this purpose,

use the model for planning a new route network.

(Note: The stops 1 to 30 are always part of the route network.)

a) Determine a route network for each bus type.

b) Additionally consider the stop Postplatz (node 31) as well as the associated

edges. Determine a route network for each bus type.

c) Additionally consider the stops Postplatz (node 31) and Zwinglistraße (node 32)

as well as the associated edges. Determine a route network for each bus type.

Create a figure with the determined route network when employing the large

buses and insert the edge loading for both directions.

Create a further figure with the origin-related traffic flows for the stop Reichen bachstraße (node 15) when employing the large buses. Use arcs to show in

which direction the people are traveling.

Summarize the following information for all subtasks (a to c) in at least one table:

• Total costs

• Variable costs

• Fixed costs

• Number of considered edges in the route network

(Note: There are nine cases that have to be examined.)

Describe, compare and analyze the obtained results of each task. Include the

above-mentioned tables and figures in your explanations.

6

❙✉❜t❛s❦ ✶✳✷✿ ▼♦❞✐❢②✐♥❣ t❤❡ ❘♦✉t❡ ◆❡t✇♦r❦

Assume that all 32 stops are included in the route network.

a) As there is high demand on the edges starting and ending at the stop Haupt bahnhof (node 7), examine whether a new edge between Hauptbahnhof (node 7)

and Lennéplatz (node 10) should be included in the set of edges.

The edge ❬✼✱ ✶✵❪ has usage costs (in e per passenger) of c✼✱✶✵ = c✶✵✱✼ = ✷✳✼ and

fixed costs (in e) of f✼✱✶✵ = ✺✽✵✵.

Determine the optimal route network for all three bus types.

(Note: Do not fix the edge ❬✼✱ ✶✵❪ in GAMS.)

Compare the cases with and without the edge ❬✼✱ ✶✵❪ in the set of edges for all

three bus types in a table regarding the following questions:

• How does the route network change?

• How do the individual cost components change?

• How do the edge loads change?

Analyze your results!

b) In the upcoming year, the city of Dresden introduces a city center toll to reduce

traffic congestion. Therefore, the passenger-related usage costs for all edges

starting and ending at the stops

• Hauptbahnhof (node 7)

• Lennéplatz (node 10)

• Straßburger Platz (node 21)

• Walpurgisstraße (node 28)

• Postplatz (node 31)

will increase by factor 8.

Calculate the passenger-related usage costs for all affected edges and provide

them in a table in your paper.

Determine the route network for all three bus types.

Compare the cases with and without the city center toll for all three bus types

in a table regarding the following questions:

• How does the route network change?

• How do the individual cost components change?

• How do the edge loads change?

Analyze your results!

Figure 3: Initial route network for line network planning

The route network in figure 3 serves as basis for line network planning.

Use the model to minimize travel times for the subsequent tasks.

Determine the optimal line network without a budget constraint. Summarize the

following information for this network:

• Overall travel time,

• Necessary budget (= arising costs),

• Number of implemented lines.

This line network serves as a reference for the following tasks.

8

a) Expand your model from subtask 2.1 by a budget constraint.

Determine 10 % of the costs from the budget of the reference line network from

subtask 2.1. Now, reduce the budget of the reference line network by the cal culated 10 % of the costs and insert this value into the budget constraint. Solve

the model.

Then, reduce the last calculated available budget by the initially calculated 10 %

of the costs of the reference line network and solve the model with this bud get. Repeat this procedure as long as no solution is generated anymore. (Note:

Specify a maximum runtime of the model of 60 minutes. Stop your calculations if

you cannot find a solution any more.)

Summarize the following information for each model run in a table:

• Available budget

• Overall travel time

• Actually used budget (= arising costs)

• Number of implemented lines

Create a scatter plot, which depicts the dependence of the travel time and the

number of implemented lines from the available budget. (Note: Pay attention to

a suitable scale of the axes.)

Draw a line network for the last possible solution (i. e. for the smallest actually

used budget).

Explain, analyze and compare your results considering the table and fig ures from above!

b) In the upcoming year, road constructions on the edge will take place.

All lines that used the edge ❪ have to take a diversion via node 24 (stop:

Technische Universität).

Which lines are affected? Replace the edge ❬with the edges ❬ and

❬ (and vice versa) in all affected lines. (Note: 13 lines are affected.)

What is the budget when all lines are set up?

Create line networks using the model from subtask 2.2a (budget constraint).

Use the same approach for calculating the budget values as described in sub task 2.2a. (Note: Instead of the reference line network budget use the budget re quired for installing all lines of this subtask.)

9

Summarize the following information for each model run in a table:

• Available budget

• Overall travel time

• Actually used budget (= arising costs)

• Number of implemented lines

Create a scatter plot, which depicts the dependence of the travel time and the

number of implemented lines from the available budget. (Note: Pay attention to

a suitable scale of the axes.)

Draw a line network for the last possible solution (i. e. for the smallest actually

used budget).

Explain, analyze and compare your results considering the table and fig ures from above as well as the results of subtask 2.2a!

c) For organizational reasons the number of lines should be limited. Use the model

from subtask 2.1 and insert a constraint that ensures the limitation of lines.

Start with a limit of 12 lines and reduce the number of lines in steps of 1 until

your model no longer provides a solution. (Note: Specify a maximum runtime of

the model of 60 minutes.)

Summarize the following information for each case in a table:

• Overall travel time

• Actually used budget (= arising costs)

Create a scatter plot, which depicts the dependence of the travel time and the

actually used budget from the number of lines. (Note: Pay attention to a suitable

scale of the axes.)

Draw the line network for the last possible solution (i. e. solution with the

lowest number of lines).

Explain, analyze and compare your results considering the table and fig ures from above!

Make a recommendation regarding the number of lines that is appropri ate for practical implementation and give reasons for your decision.

10

❖r❣❛♥✐s❛t✐♦♥

Week Date Content

15 Wed, 09 Apr 2025 Exercise 1: Introduction

16 Wed, 16 Apr 2025 Exercise 2: Repetition: Mathematical Models

17 Wed, 23 Apr 2025 Exercise 3: Network Design and Infrastructure Planning

18 Wed, 30 Apr 2025 Exercise 4: Network Design and Infrastructure Planning

19 Wed, 07 May 2025 Exercise 5: Network Design and Infrastructure Planning

19 Fri, 09 May 2025 Submission Milestone 1: Models & Results of Task 1.1

Deadline: 11.59 pm (via OPAL) - OBLIGATORY

20 Wed, 14 May 2025 Exercise 6: Line Network Planning

21 Wed, 21 May 2025 Dies Academicus - No sessions!

22 Wed, 28 May 2025 Exercise 7: Line Network Planning

23 Wed, 04 Jun 2025 Exercise 8: Line Network Planning

23 Fri, 06 Jun 2025 Submission Milestone 2: Model & Results of Task 2.1

Deadline: 11.59 pm (via OPAL) - OPTIONAL

24 Pentecost Holidays

25 Wed, 18 Jun 2025 Exercise 9: Q & A or Individual Working & Consultation Time

26 Individual Working Time & Consultation Time

27 Individual Working Time & Consultation Time

28 Individual Working Time & Consultation Time

29 Individual Working Time & Consultation Time

29 Fri, 18 Jul 2025 Submission Project Work

Deadline: 11.59 pm (via OPAL) - OBLIGATORY

The registration for the exam takes place in the early enroll ment period. The early enrollment starts on 14 April 2025

and it ends on 30 April 2025.

11

The project work has to be written using LaTeX using the template from the chair

(Link)! Further supporting information can be found in OPAL.

During the semester, two milestones (M1/M2) are defined, where the models and the

results for the route network planning (M1) and line network planning (M2) can be

submitted. Those submissions are done via OPAL in the folders “Submission Mile stone 1” and “Submission Milestone 2”.

Milestone 1 is obligatory for all students and it is a requirement for passing the

exam!

Please hand in Task 1.1 including models, required tables and figures for Milestone 1

and Task 2.1 for Milestone 2.

The submissions only serve the purpose to evaluate the work progress and to receive

feedback from the lecturer. Hence, it is necessary that the data sets needed for com piling are uploaded besides the models. The models have to be transparent, which

means it has to be specified clearly for all symbols in GAMS to which set, parameter,

etc. they belong. The results have to be assigned to the respective task clearly. In case

there are ambiguities within the model or the results that arise from not respecting

the notes above, you will not receive any feedback. The preliminary results are not

graded and do not influence the assessment of your final project work.

The final submission of the project work takes place on 18 July 2025 until 11.59

pm via OPAL in the folder “Submission Project Work”. An extension of the pro cess time is not possible (exception: illness when submitting a medical certificate

showing a physical incapability of writing the project work ("Prüfungsunfähigkeits bescheinigung")).

The project work is to be submitted as a pdf file; the source codes as well as the read

data are to be submitted as a zip file.

All necessary documents can be found in OPAL in the course “Management of Public

Transport Systems and Services” in the folder “Documents”. This folder contains:

• This task

• Excel file “Data” with the necessary data tables

• PowerPoint file “Route_network” with a depiction of the route network

• Excel file “Coordinates”

Information about GAMS can be found in OPAL as well, in the course “Management

of Public Transport Systems and Services” in the folder “GAMS Documents”. In Work shop 4 it is explained how you can read data from Excel files or text files.

12

Each participant has to submit a self-created document with at least 15 and at most

25 text pages including tables and figures in the text. The participants can coop erate when conducting the experiments, but everyone has to write the project work

individually. (ATTENTION: individual solutions for the tasks are expected due to the

problem data, which depend on the matriculation number.)

It is expected that the created texts, tables and figures are of high quality. This means

especially that the texts are correct in form and content. Elements, such as tables and

figures, are to be formatted consistently. Depicted contents must be well recogniz able, also when printed.

The project work has the following structure:

• Title page (including name, matriculation number, email)

• Lists (contents, abbreviations, symbols, etc.)

• Introduction

• Route network planning

• Problem description

• Draft the given problems (verbal problem description)

• Present the used decision models including objective function, con straints, value ranges and required extensions (formal problem de scription); make sure that all symbols used are clearly defined before

the model is presented (Note: Summation operators etc. do not need to

be defined.)

• Results (Note: Use the correct units of measurement for presenting your re sults.)

• Line network planning

• Problem description

• Draft the given problems (verbal problem description)

• Present the used decision models including objective function, con straints, value ranges and required extensions (formal problem de scription); make sure that all symbols used are clearly defined before

the model is presented (Note: Summation operators etc. do not need to

be defined.)

• Results (Note: Use the correct units of measurement for presenting your re sults.)

• Conclusion (including summary and outlook)

• Bibliography

• If needed: appendix (including list of appendices)

• Statement of authorship with your signature

The project work can be processed and solved with the previously imparted expert

knowledge without restrictions.