Modelling and solving train scheduling problems under capacity constraints

Many large coal mining operations in Australia rely heavily on the rail network to transport coal from mines to coal terminals at ports for shipment. Over the last few years, due to the fast growing demand, the coal rail network is becoming one of the worst industrial bottlenecks in Australia. As a result, this provides great incentives for pursuing better optimisation and control strategies for the operation of the whole rail transportation system under network and terminal capacity constraints. This PhD research aims to achieve a significant efficiency improvement in a coal rail network on the basis of the development of standard modelling approaches and generic solution techniques. Generally, the train scheduling problem can be modelled as a Blocking Parallel- Machine Job-Shop Scheduling (BPMJSS) problem. In a BPMJSS model for train scheduling, trains and sections respectively are synonymous with jobs and machines and an operation is regarded as the movement/traversal of a train across a section. To begin, an improved shifting bottleneck procedure algorithm combined with metaheuristics has been developed to efficiently solve the Parallel-Machine Job- Shop Scheduling (PMJSS) problems without the blocking conditions. Due to the lack of buffer space, the real-life train scheduling should consider blocking or hold-while-wait constraints, which means that a track section cannot release and must hold a train until the next section on the routing becomes available. As a consequence, the problem has been considered as BPMJSS with the blocking conditions. To develop efficient solution techniques for BPMJSS, extensive studies on the nonclassical scheduling problems regarding the various buffer conditions (i.e. blocking, no-wait, limited-buffer, unlimited-buffer and combined-buffer) have been done. In this procedure, an alternative graph as an extension of the classical disjunctive graph is developed and specially designed for the non-classical scheduling problems such as the blocking flow-shop scheduling (BFSS), no-wait flow-shop scheduling (NWFSS), and blocking job-shop scheduling (BJSS) problems. By exploring the blocking characteristics based on the alternative graph, a new algorithm called the topological-sequence algorithm is developed for solving the non-classical scheduling problems. To indicate the preeminence of the proposed algorithm, we compare it with two known algorithms (i.e. Recursive Procedure and Directed Graph) in the literature. Moreover, we define a new type of non-classical scheduling problem, called combined-buffer flow-shop scheduling (CBFSS), which covers four extreme cases: the classical FSS (FSS) with infinite buffer, the blocking FSS (BFSS) with no buffer, the no-wait FSS (NWFSS) and the limited-buffer FSS (LBFSS). After exploring the structural properties of CBFSS, we propose an innovative constructive algorithm named the LK algorithm to construct the feasible CBFSS schedule. Detailed numerical illustrations for the various cases are presented and analysed. By adjusting only the attributes in the data input, the proposed LK algorithm is generic and enables the construction of the feasible schedules for many types of non-classical scheduling problems with different buffer constraints. Inspired by the shifting bottleneck procedure algorithm for PMJSS and characteristic analysis based on the alternative graph for non-classical scheduling problems, a new constructive algorithm called the Feasibility Satisfaction Procedure (FSP) is proposed to obtain the feasible BPMJSS solution. A real-world train scheduling case is used for illustrating and comparing the PMJSS and BPMJSS models. Some real-life applications including considering the train length, upgrading the track sections, accelerating a tardy train and changing the bottleneck sections are discussed. Furthermore, the BPMJSS model is generalised to be a No-Wait Blocking Parallel- Machine Job-Shop Scheduling (NWBPMJSS) problem for scheduling the trains with priorities, in which prioritised trains such as express passenger trains are considered simultaneously with non-prioritised trains such as freight trains. In this case, no-wait conditions, which are more restrictive constraints than blocking constraints, arise when considering the prioritised trains that should traverse continuously without any interruption or any unplanned pauses because of the high cost of waiting during travel. In comparison, non-prioritised trains are allowed to enter the next section immediately if possible or to remain in a section until the next section on the routing becomes available. Based on the FSP algorithm, a more generic algorithm called the SE algorithm is developed to solve a class of train scheduling problems in terms of different conditions in train scheduling environments. To construct the feasible train schedule, the proposed SE algorithm consists of many individual modules including the feasibility-satisfaction procedure, time-determination procedure, tune-up procedure and conflict-resolve procedure algorithms. To find a good train schedule, a two-stage hybrid heuristic algorithm called the SE-BIH algorithm is developed by combining the constructive heuristic (i.e. the SE algorithm) and the local-search heuristic (i.e. the Best-Insertion- Heuristic algorithm). To optimise the train schedule, a three-stage algorithm called the SE-BIH-TS algorithm is developed by combining the tabu search (TS) metaheuristic with the SE-BIH algorithm. Finally, a case study is performed for a complex real-world coal rail network under network and terminal capacity constraints. The computational results validate that the proposed methodology would be very promising because it can be applied as a fundamental tool for modelling and solving many real-world scheduling problems.

Productions of space : civic participation of young people at university

Civic participation of young people around the world is routinely described in deficit terms, as they are labelled apathetic, devoid of political knowledge, disengaged from the community and self-absorbed (Andolina, 2002; Weller, 2006). This paper argues that the connectivity of time, space and social values (Lefebvre, 1991; Soja, 1996) are integral to understanding the performances of young people as civic subjects. Today’s youth negotiate unstable social, economic and environmental conditions, new technologies and new forms of community. Loyalty, citizenship and notions of belonging take on new meanings in these changing global conditions. Using the socio-spatial theories of Lefebvre and Foucault, and the tools of critical discourse analysis, this paper argues that the chronotope, or time/space relationship of universities, produces student citizens who, in resistance to a complex global society, create a cocooned space which focuses on moral and spiritual values that can be enacted on a personal level.

The Space Day at QUT

The Space Day has been running at QUT for about a decade. The Space Day started out as a single lecture on the stars delivered to a group of high school students from Brisbane State High School (BSHS), just across the river from QUT and therefore convenient for the school to visit. I was contacted by Victor James of St. Laurence’s College (SLC), Brisbane asking if he could bring a group of boys to QUT for a lecture similar to that delivered to BSHS. However, for SLC a hands-on laboratory session was added to the lecture and thus the Space Day was born. For the Space Day we have concentrated on year 7 – 10 students. Subsequently, many other schools from Brisbane and further afield in Queensland have attended a Space Day.

Analytical and numerical solutions for the time and space-symmetric fractional diffusion equation

We consider a time and space-symmetric fractional diffusion equation (TSS-FDE) under homogeneous Dirichlet conditions and homogeneous Neumann conditions. The TSS-FDE is obtained from the standard diffusion equation by replacing the first-order time derivative by a Caputo fractional derivative, and the second order space derivative by a symmetric fractional derivative. First, a method of separating variables expresses the analytical solution of the TSS-FDE in terms of the Mittag--Leffler function. Second, we propose two numerical methods to approximate the Caputo time fractional derivative: the finite difference method; and the Laplace transform method. The symmetric space fractional derivative is approximated using the matrix transform method. Finally, numerical results demonstrate the effectiveness of the numerical methods and to confirm the theoretical claims.

Computationally efficient numerical methods for time- and space-fractional Fokker–Planck equations

Fractional Fokker–Planck equations have been used to model several physical situations that present anomalous diffusion. In this paper, a class of time- and space-fractional Fokker–Planck equations (TSFFPE), which involve the Riemann–Liouville time-fractional derivative of order 1-α (α(0, 1)) and the Riesz space-fractional derivative (RSFD) of order μ(1, 2), are considered. The solution of TSFFPE is important for describing the competition between subdiffusion and Lévy flights. However, effective numerical methods for solving TSFFPE are still in their infancy. We present three computationally efficient numerical methods to deal with the RSFD, and approximate the Riemann–Liouville time-fractional derivative using the Grünwald method. The TSFFPE is then transformed into a system of ordinary differential equations (ODE), which is solved by the fractional implicit trapezoidal method (FITM). Finally, numerical results are given to demonstrate the effectiveness of these methods. These techniques can also be applied to solve other types of fractional partial differential equations.

Analytical and numerical solutions for the time and space-symmetric fractional diffusion equation

We consider a time and space-symmetric fractional diffusion equation (TSS-FDE) under homogeneous Dirichlet conditions and homogeneous Neumann conditions. The TSS-FDE is obtained from the standard diffusion equation by replacing the first-order time derivative by the Caputo fractional derivative and the second order space derivative by the symmetric fractional derivative. Firstly, a method of separating variables is used to express the analytical solution of the tss-fde in terms of the Mittag–Leffler function. Secondly, we propose two numerical methods to approximate the Caputo time fractional derivative, namely, the finite difference method and the Laplace transform method. The symmetric space fractional derivative is approximated using the matrix transform method. Finally, numerical results are presented to demonstrate the effectiveness of the numerical methods and to confirm the theoretical claims.

Coast control for mass rapid transit railways with searching methods

With daily commercial and social activity in cities, regulation of train service in mass rapid transit railways is necessary to maintain service and passenger flow. Dwell-time adjustment at stations is one commonly used approach to regulation of train service, but its control space is very limited. Coasting control is a viable means of meeting the specific run-time in an inter-station run. The current practice is to start coasting at a fixed distance from the departed station. Hence, it is only optimal with respect to a nominal operational condition of the train schedule, but not the current service demand. The advantage of coasting can only be fully secured when coasting points are determined in real-time. However, identifying the necessary starting point(s) for coasting under the constraints of current service conditions is no simple task as train movement is governed by a large number of factors. The feasibility and performance of classical and heuristic searching measures in locating coasting point(s) is studied with the aid of a single train simulator, according to specified inter-station run times.

Pandemic (H1N1) 2009 Influenza Outbreak in Australia: Impact on Emergency Departments.

Executive summary Objective: The aims of this study were to identify the impact of Pandemic (H1N1) 2009 Influenza on Australian Emergency Departments (EDs) and their staff, and to inform planning, preparedness, and response management arrangements for future pandemics, as well as managing infectious patients presenting to EDs in everyday practice. Methods This study involved three elements: 1. The first element of the study was an examination of published material including published statistics. Standard literature research methods were used to identify relevant published articles. In addition, data about ED demand was obtained from Australian Government Department of Health and Ageing (DoHA) publications, with several state health departments providing more detailed data. 2. The second element of the study was a survey of Directors of Emergency Medicine identified with the assistance of the Australasian College for Emergency Medicine (ACEM). This survey retrieved data about demand for ED services and elicited qualitative comments on the impact of the pandemic on ED management. 3. The third element of the study was a survey of ED staff. A questionnaire was emailed to members of three professional colleges—the ACEM; the Australian College of Emergency Nursing (ACEN); and the College of Emergency Nursing Australasia (CENA). The overall response rate for the survey was 18.4%, with 618 usable responses from 3355 distributed questionnaires. Topics covered by the survey included ED conditions during the (H1N1) 2009 influenza pandemic; information received about Pandemic (H1N1) 2009 Influenza; pandemic plans; the impact of the pandemic on ED staff with respect to stress; illness prevention measures; support received from others in work role; staff and others’ illness during the pandemic; other factors causing ED staff to miss work during the pandemic; and vaccination against Pandemic (H1N1) 2009 Influenza. Both qualitative and quantitative data were collected and analysed. Results: The results obtained from Directors of Emergency Medicine quantifying the impact of the pandemic were too limited for interpretation. Data sourced from health departments and published sources demonstrated an increase in influenza-like illness (ILI) presentations of between one and a half and three times the normal level of presentations of ILIs. Directors of Emergency Medicine reported a reasonable level of preparation for the pandemic, with most reporting the use of pandemic plans that translated into relatively effective operational infection control responses. Directors reported a highly significant impact on EDs and their staff from the pandemic. Growth in demand and related ED congestion were highly significant factors causing distress within the departments. Most (64%) respondents established a ‘flu clinic’ either as part of Pandemic (H1N1) 2009 Influenza Outbreak in Australia: Impact on Emergency Departments. the ED operations or external to it. They did not note a significantly higher rate of sick leave than usual. Responses relating to the impact on staff were proportional to the size of the colleges. Most respondents felt strongly that Pandemic (H1N1) 2009 Influenza had a significant impact on demand in their ED, with most patients having low levels of clinical urgency. Most respondents felt that the pandemic had a negative impact on the care of other patients, and 94% revealed some increase in stress due to lack of space for patients, increased demand, and filling staff deficits. Levels of concern about themselves or their family members contracting the illness were less significant than expected. Nurses displayed significantly higher levels of stress overall, particularly in relation to skill-mix requirements, lack of supplies and equipment, and patient and patients’ family aggression. More than one-third of respondents became ill with an ILI. Whilst respondents themselves reported taking low levels of sick leave, respondents cited difficulties with replacing absent staff. Ranked from highest to lowest, respondents gained useful support from ED colleagues, ED administration, their hospital occupational health department, hospital administration, professional colleges, state health department, and their unions. Respondents were generally positive about the information they received overall; however, the volume of information was considered excessive and sometimes inconsistent. The media was criticised as scaremongering and sensationalist and as being the cause of many unnecessary presentations to EDs. Of concern to the investigators was that a large proportion (43%) of respondents did not know whether a pandemic plan existed for their department or hospital. A small number of staff reported being redeployed from their usual workplace for personal risk factors or operational reasons. As at the time of survey (29 October –18 December 2009), 26% of ED staff reported being vaccinated against Pandemic (H1N1) 2009 Influenza. Of those not vaccinated, half indicated they would ‘definitely’ or ‘probably’ not get vaccinated, with the main reasons being the vaccine was ‘rushed into production’, ‘not properly tested’, ‘came out too late’, or not needed due to prior infection or exposure, or due to the mildness of the disease. Conclusion: Pandemic (H1N1) 2009 Influenza had a significant impact on Australian Emergency Departments. The pandemic exposed problems in existing plans, particularly a lack of guidelines, general information overload, and confusion due to the lack of a single authoritative information source. Of concern was the high proportion of respondents who did not know if their hospital or department had a pandemic plan. Nationally, the pandemic communication strategy needs a detailed review, with more engagement with media networks to encourage responsible and consistent reporting. Also of concern was the low level of immunisation, and the low level of intention to accept vaccination. This is a problem seen in many previous studies relating to seasonal influenza and health care workers. The design of EDs needs to be addressed to better manage infectious patients. Significant workforce issues were confronted in this pandemic, including maintaining appropriate staffing levels; staff exposure to illness; access to, and appropriate use of, personal protective equipment (PPE); and the difficulties associated with working in PPE for prolonged periods. An administrative issue of note was the reporting requirement, which created considerable additional stress for staff within EDs. Peer and local support strategies helped ensure staff felt their needs were provided for, creating resilience, dependability, and stability in the ED workforce. Policies regarding the establishment of flu clinics need to be reviewed. The ability to create surge capacity within EDs by considering staffing, equipment, physical space, and stores is of primary importance for future pandemics.

Application of reliability-centred maintenance technology on electric trains

This paper demonstrates the application of the reliability-centred maintenance (RCM) process to analyse and develop preventive maintenance tasks for electric multiple units (EMU) in the East Rail of the Kowloon-Canton Railway Corporation (KCRC). Two systems, the 25 kV electrical power supply and the air-conditioning system of the EMU, have been chosen for the study. RCM approach on the two systems is delineated step by step in the paper. This study confirms the feasibility and effectiveness of RCM applications on the maintenance of electric trains.

A general-purpose simulator for train operations

Computer simulation has been widely accepted as an essential tool for the analysis of many engineering systems. It is nowadays perceived to be the most readily available and feasible means of evaluating operations in real railway systems. Based on practical experience and theoretical models developed in various applications, this paper describes the design of a general-purpose simulation system for train operations. Its prime objective is to provide a single comprehensive computer-aided engineering tool for most studies on railway operations so that various aspects of the railway systems with different operation characteristics can be investigated and analysed in depth. This system consists of three levels of simulation. The first is a single-train simulator calculating the running time of a train between specific points under different track geometry and traction conditions. The second is a dual-train simulator which is to find the minimum headway between two trains under different movement constraints, such as signalling systems. The third is a whole-system multi-train simulator which carries out process simulation of the real operation of a railway system according to a practical or planned train schedule or headway; and produces an overall evaluation of system performance.

Making space and place for the knowledge economy : knowledge-based development of Australian cities

The impact of what has been broadly labelled the knowledge economy has been such that, even in the absence of precise measurement, it is the undoubted dynamo of today’s global market, and an essential part of any global city. The socio-economic importance of knowledge production in a knowledge economy is clear, and it is an emerging social phenomenon and research agenda in geographical studies. Knowledge production, and where, how and by whom it is produced, is an urban phenomenon that is poorly understood in an era of strong urbanisation. This paper focuses on knowledge community precincts as the catalytic magnet infrastructures impacting on knowledge production in cities. The paper discusses the increasing importance of knowledge-based urban development within the paradigm of the knowledge economy, and the role of knowledge community precincts as instruments to seed the foundation of knowledge production in cities. This paper explores the knowledge based urban development, and particularly knowledge community precinct development, potentials of Sydney, Melbourne and Brisbane, and benchmarks this against that of Boston, Massachusetts.

Making space and place for knowledge production : socio-spatial development of knowledge community precincts

In the knowledge era the importance of making space and place for knowledge production is clearly understood worldwide by many city administrations that are keen on restructuring their cities as highly competitive and creative places. Consequently, knowledge-based urban development and socio-spatial development of knowledge community precincts have taken their places among the emerging agendas of the urban planning and development practice. This chapter explores these emerging issues and scrutinizes the development of knowledge community precincts that have important economic, social and cultural dimensions on the formation of competitive and creative urban regions. The chapter also sheds light on the new challenges for planning discipline, and discusses the need for and some specifics of a new planning paradigm suitable for dealing with 21st Century’s socio-economic development and urbanization problems.

Distributed orthogonal space-time block codes with adaptive diversity gain

In this paper we present a novel distributed coding protocol for multi-user cooperative networks. The proposed distributed coding protocol exploits the existing orthogonal space-time block codes to achieve higher diversity gain by repeating the code across time and space (available relay nodes). The achievable diversity gain depends on the number of relay nodes that can fully decode the signal from the source. These relay nodes then form space-time codes to cooperatively relay to the destination using number of time slots. However, the improved diversity gain is archived at the expense of the transmission rate. The design principles of the proposed space-time distributed code and the issues related to transmission rate and diversity trade off is discussed in detail. We show that the proposed distributed space-time coding protocol out performs existing distributed codes with a variable transmission rate.

The embodied hybrid space : designing ubiquitous computing towards an amplification of situated real world experiences

The emergence of mobile and ubiquitous computing technology has created what is often referred to as the hybrid space – a virtual layer of digital information and interaction opportunities that sit on top of and augment the physical environment. Embodied media materialise digital information as observable and sometimes interactive parts of the physical environment. The aim of this work is to explore ways to enhance people’s situated real world experience, and to find out what the role and impact of embodied media in achieving this goal can be. The Edge, an initiative of the State Library of Queensland in Brisbane, Australia, and case study of this thesis, envisions to be a physical place for people to meet, explore, experience, learn and teach each other creative practices in various areas related to digital technology and arts. Guided by an Action Research approach, this work applies Lefebvre’s triad of space (1991) to investigate the Edge as a social space from a conceived, perceived and lived point of view. Based on its creators’ vision and goals on the conceived level, different embodied media are iteratively designed, implemented and evaluated towards shaping and amplifying the Edge’s visitor experience on the perceived and lived level.

Strengthening and formally verifying privacy in identity management systems

In a digital world, users’ Personally Identifiable Information (PII) is normally managed with a system called an Identity Management System (IMS). There are many types of IMSs. There are situations when two or more IMSs need to communicate with each other (such as when a service provider needs to obtain some identity information about a user from a trusted identity provider). There could be interoperability issues when communicating parties use different types of IMS. To facilitate interoperability between different IMSs, an Identity Meta System (IMetS) is normally used. An IMetS can, at least theoretically, join various types of IMSs to make them interoperable and give users the illusion that they are interacting with just one IMS. However, due to the complexity of an IMS, attempting to join various types of IMSs is a technically challenging task, let alone assessing how well an IMetS manages to integrate these IMSs. The first contribution of this thesis is the development of a generic IMS model called the Layered Identity Infrastructure Model (LIIM). Using this model, we develop a set of properties that an ideal IMetS should provide. This idealized form is then used as a benchmark to evaluate existing IMetSs. Different types of IMS provide varying levels of privacy protection support. Unfortunately, as observed by Jøsang et al (2007), there is insufficient privacy protection in many of the existing IMSs. In this thesis, we study and extend a type of privacy enhancing technology known as an Anonymous Credential System (ACS). In particular, we extend the ACS which is built on the cryptographic primitives proposed by Camenisch, Lysyanskaya, and Shoup. We call this system the Camenisch, Lysyanskaya, Shoup - Anonymous Credential System (CLS-ACS). The goal of CLS-ACS is to let users be as anonymous as possible. Unfortunately, CLS-ACS has problems, including (1) the concentration of power to a single entity - known as the Anonymity Revocation Manager (ARM) - who, if malicious, can trivially reveal a user’s PII (resulting in an illegal revocation of the user’s anonymity), and (2) poor performance due to the resource-intensive cryptographic operations required. The second and third contributions of this thesis are the proposal of two protocols that reduce the trust dependencies on the ARM during users’ anonymity revocation. Both protocols distribute trust from the ARM to a set of n referees (n > 1), resulting in a significant reduction of the probability of an anonymity revocation being performed illegally. The first protocol, called the User Centric Anonymity Revocation Protocol (UCARP), allows a user’s anonymity to be revoked in a user-centric manner (that is, the user is aware that his/her anonymity is about to be revoked). The second protocol, called the Anonymity Revocation Protocol with Re-encryption (ARPR), allows a user’s anonymity to be revoked by a service provider in an accountable manner (that is, there is a clear mechanism to determine which entity who can eventually learn - and possibly misuse - the identity of the user). The fourth contribution of this thesis is the proposal of a protocol called the Private Information Escrow bound to Multiple Conditions Protocol (PIEMCP). This protocol is designed to address the performance issue of CLS-ACS by applying the CLS-ACS in a federated single sign-on (FSSO) environment. Our analysis shows that PIEMCP can both reduce the amount of expensive modular exponentiation operations required and lower the risk of illegal revocation of users’ anonymity. Finally, the protocols proposed in this thesis are complex and need to be formally evaluated to ensure that their required security properties are satisfied. In this thesis, we use Coloured Petri nets (CPNs) and its corresponding state space analysis techniques. All of the protocols proposed in this thesis have been formally modeled and verified using these formal techniques. Therefore, the fifth contribution of this thesis is a demonstration of the applicability of CPN and its corresponding analysis techniques in modeling and verifying privacy enhancing protocols. To our knowledge, this is the first time that CPN has been comprehensively applied to model and verify privacy enhancing protocols. From our experience, we also propose several CPN modeling approaches, including complex cryptographic primitives (such as zero-knowledge proof protocol) modeling, attack parameterization, and others. The proposed approaches can be applied to other security protocols, not just privacy enhancing protocols.