liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Framework for Within Day Rescheduling due to UnexpectedIncidents in Transportation Networks
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
2012 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

In activity based modelling the concept of rescheduling is very important in order to gain dynamic scheduling of activities and to adjust the effect of unexpected incidents in individual agendas to keep them realistic and valid. This report describes a new framework to investigate algorithms for rescheduling on a large scale. This framework models the information of traffic demand and results of micro simulation of traffic on a loaded network; it enables agents to adapt their schedules by providing them with information about the traffic flow. A perception filter for each agent is included in this framework. It models the concept that some agents can notice the broadcast traffic information about the incident and get their own prediction of the expected delay, while other agents who do not notice the information can become aware only by experiencing traffic jam. Initial agendas are created by means of the FEATHERS activity based schedule generator for mutually independent agents. FEATHERS has no knowledge about the actual transportation network but makes use of an impedance matrix that specifies the minimal travel time between traffic analysis zones. The matrix specifies a free-flow value for the uncongested case and correction values for the loaded network. In this new framework the network state can be changed by agent behaviour and external incidents; the effect of this change in network state is perceived differently by each agent through a perception filter, and according to the perceived value individual adaption is calculated by a ReScheduler. The modified behaviour again creates new traffic demand hence creating a new traffic state; this phenomenon continues for the complete day. Each activity in the agenda is assumed to generate some utility. Each individual is assumed to maximize the total utility over the day. The ReScheduler is implemented using a marginal utility function that monotonically decreases with activity duration. This results in a monotonically converging relaxation algorithm to efficiently determine the new activity timing when less time is available for activities due to increased travel time caused by the incident.

Place, publisher, year, edition, pages
2012. , 66 p.
Keyword [en]
Transportation, Rescheduling, utility, simulation framework
National Category
Other Engineering and Technologies not elsewhere specified
URN: urn:nbn:se:liu:diva-84924ISRN: LIU-IDA/LITH-EX-A--12/053--SEOAI: diva2:562986
External cooperation
Transportation Research Institute (IMOB) Hasselt University
Subject / course
Computer and information science at the Institute of Technology
2012-09-25, Donald Knuth, Linköping, 15:15 (English)
Available from: 2012-10-27 Created: 2012-10-26 Last updated: 2012-10-29Bibliographically approved

Open Access in DiVA

fulltext(2610 kB)157 downloads
File information
File name FULLTEXT01.pdfFile size 2610 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Usman, Muhammad
By organisation
Software and SystemsThe Institute of Technology
Other Engineering and Technologies not elsewhere specified

Search outside of DiVA

GoogleGoogle Scholar
Total: 157 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 1378 hits
ReferencesLink to record
Permanent link

Direct link