5,706 research outputs found
Recommended from our members
Models and methods for operational planning in freight railroads
textRailroads are facing increasing demand for freight transportation. Effective planning and scheduling are crucial to improve the utilization of expensive resources (such as crew and track), reduce operational costs, and provide on-time service. This dissertation focuses on problem modeling and solution method development for real planning problems faced by railroads. It consists of three chapters that study two important planning problems in the daily operations of U.S. freight railroads: crew assignment and train movement planning. Chapter 2 proposes an optimization model to decide crew-to-train assignments and deadheads for double-ended crew districts. We develop an effective solution approach, combining optimization and a standalone heuristic, that generates optimal solutions in minutes. The excellent performance of this solution approach makes it well-suited for implementation within a real-time decision support tool for crew dispatchers. Chapter 3 discusses crew repositioning given the uncertainty in trainsâ arrival and departure times. We propose models that minimize the expected crew holding, train delay, and deadheading cost, and develop both exact and heuristic solution methods to provide insights for crew planning under train schedule uncertainty. The last chapter studies the movement planning problem for trains traveling in a territory with multiple through tracks (mainlines) and various junctions. We explore a number of heuristic algorithms to obtain good solutions within a reasonable amount of time. The contributions of this dissertation include modeling enhancements, algorithmic development, implementation and computational testing, and validation using real data.Operations Research and Industrial Engineerin
The combinatorics of abstract container data types
The study of abstract machines such as Turing machines, push down automata and finite state machines has played an important role in the advancement of computer science. It has led to developments in the theory of general purpose computers, compilers and string manipulation as well as many other areas. The language associated with an abstract machine characterises an important aspect of the behaviour of that machine. It is therefore the principal object of interest when studying such a machine. In this thesis we consider abstract container data types to be abstract machines. We define the concept of a language associated with an abstract container data type and investigate this in the same spirit as for other abstract machines. We also consider a model which allows us to describe various abstract container data types. This model is studied in a similar manner. There is a rich selection of problems to investigate. For instance, the data items which the abstract container data types operate on can take many forms. The input stream could consist of distinct data items, say 1, 2,..., n, or it could be a word over the binary alphabet. Alternatively it could be a sequence formed from the data items in some arbitrary multiset. Another consideration is whether or not an abstract data type has a finite storage capacity. It is shown how to construct a regular grammar which generates (an encoded form of) the set of permutations which can be realised by moving tokens through a network. A one to one correspondence is given between ordered forests of bounded height and members of the language associated with a bounded capacity priority queue operating on binary data. A number of related results are also proved; in particular for networks operating on binary data, and priority queues of capacity 2
A fast algorithm for quadratic resource allocation problems with nested constraints
We study the quadratic resource allocation problem and its variant with lower
and upper constraints on nested sums of variables. This problem occurs in many
applications, in particular battery scheduling within decentralized energy
management (DEM) for smart grids. We present an algorithm for this problem that
runs in time and, in contrast to existing algorithms for this
problem, achieves this time complexity using relatively simple and
easy-to-implement subroutines and data structures. This makes our algorithm
very attractive for real-life adaptation and implementation. Numerical
comparisons of our algorithm with a subroutine for battery scheduling within an
existing tool for DEM research indicates that our algorithm significantly
reduces the overall execution time of the DEM system, especially when the
battery is expected to be completely full or empty multiple times in the
optimal schedule. Moreover, computational experiments with synthetic data show
that our algorithm outperforms the currently most efficient algorithm by more
than one order of magnitude. In particular, our algorithm is able to solves all
considered instances with up to one million variables in less than 17 seconds
on a personal computer
An Introduction to the RESearch Queueing Package for Modeling Computer Systems and Communication Networks
A queueing network is an important tool for modeling systems where performance is principally affected by contention for resources. Such systems include computer systems, communication networks and manufacturing lines. In order to effectively use queuing networks as performance models, appropriate software is necessary for definition ofthe networks to be solved, for solution ofthe networks and for examination of the performance measures obtained. The RESearch Queueing Package (RESQ) and the RESearch Queueing Package Modeling Environment (RESQME) form a system for constructing, solving and analyzing extended queueing network models. We refer to the class of RESQ networks as extended because of characteristics which allow effective representation of system detail. RESQ incorporates a high level language to concisely describe the structure of the model and to specify constraints on the solution. A main feature of the language is the capability to describe models in a hierarchical fashion, allowing an analyst to define submodels to be used analogously to use of macros in programming languages. RESQ also provides a variety of methods for estimating the accuracy of simulation results and for determining simulation run lengths. RESQME is a graphical interface for RESQ. In this introduction, we limit our examples to computer systems and communication networks.
Acknowledgement: The authors wish to thank their co-developers of RESQME: Jim Kurose and Kurt Gordon. We also want to thank Ben Antanaitis, Howard Jachter, Jack Servier, Daniel Souday and Peter Welch for their many suggestions which helped improve the RESQME package and Anil Aggarwal, Al Blum, Gary Burkland, Rocky Chang, Janet Chen, Diana Coles, Prakash Deka, Paul Lnewner, and Geoff Parker for their work in implementing RESQME. We would also like to thank our users for their ideas and feedback that we tried to incorporate in RESQ and RESQME. We remain indebted to Charlie Sauer for his design, guidance, inspiration, and development ofthe RESQ languag
Functional programming and graph algorithms
This thesis is an investigation of graph algorithms in the non-strict purely functional language Haskell. Emphasis is placed on the importance of achieving an asymptotic complexity as good as with conventional languages. This is achieved by using the monadic model for including actions on the state. Work on the monadic model was carried out at Glasgow University by Wadler, Peyton Jones, and Launchbury in the early nineties and has opened up many diverse application areas. One area is the ability to express data structures that require sharing. Although graphs are not presented in this style, data structures that graph algorithms use are expressed in this style. Several examples of stateful algorithms are given including union/find for disjoint sets, and the linear time sort binsort.
The graph algorithms presented are not new, but are traditional algorithms recast in a functional setting. Examples include strongly connected components, biconnected components, Kruskal's minimum cost spanning tree, and Dijkstra's shortest paths. The presentation is lucid giving more insight than usual. The functional setting allows for complete calculational style correctness proofs - which is demonstrated with many examples.
The benefits of using a functional language for expressing graph algorithms are quantified by looking at the issues of execution times, asymptotic complexity, correctness, and clarity, in comparison with traditional approaches. The intention is to be as objective as possible, pointing out both the weaknesses and the strengths of using a functional language
Smooth heaps and a dual view of self-adjusting data structures
We present a new connection between self-adjusting binary search trees (BSTs)
and heaps, two fundamental, extensively studied, and practically relevant
families of data structures. Roughly speaking, we map an arbitrary heap
algorithm within a natural model, to a corresponding BST algorithm with the
same cost on a dual sequence of operations (i.e. the same sequence with the
roles of time and key-space switched). This is the first general transformation
between the two families of data structures.
There is a rich theory of dynamic optimality for BSTs (i.e. the theory of
competitiveness between BST algorithms). The lack of an analogous theory for
heaps has been noted in the literature. Through our connection, we transfer all
instance-specific lower bounds known for BSTs to a general model of heaps,
initiating a theory of dynamic optimality for heaps.
On the algorithmic side, we obtain a new, simple and efficient heap
algorithm, which we call the smooth heap. We show the smooth heap to be the
heap-counterpart of Greedy, the BST algorithm with the strongest proven and
conjectured properties from the literature, widely believed to be
instance-optimal. Assuming the optimality of Greedy, the smooth heap is also
optimal within our model of heap algorithms. As corollaries of results known
for Greedy, we obtain instance-specific upper bounds for the smooth heap, with
applications in adaptive sorting.
Intriguingly, the smooth heap, although derived from a non-practical BST
algorithm, is simple and easy to implement (e.g. it stores no auxiliary data
besides the keys and tree pointers). It can be seen as a variation on the
popular pairing heap data structure, extending it with a "power-of-two-choices"
type of heuristic.Comment: Presented at STOC 2018, light revision, additional figure
EUROPEAN CONFERENCE ON QUEUEING THEORY 2016
International audienceThis booklet contains the proceedings of the second European Conference in Queueing Theory (ECQT) that was held from the 18th to the 20th of July 2016 at the engineering school ENSEEIHT, Toulouse, France. ECQT is a biannual event where scientists and technicians in queueing theory and related areas get together to promote research, encourage interaction and exchange ideas. The spirit of the conference is to be a queueing event organized from within Europe, but open to participants from all over the world. The technical program of the 2016 edition consisted of 112 presentations organized in 29 sessions covering all trends in queueing theory, including the development of the theory, methodology advances, computational aspects and applications. Another exciting feature of ECQT2016 was the institution of the TakĂĄcs Award for outstanding PhD thesis on "Queueing Theory and its Applications"
Data structures
We discuss data structures and their methods of analysis. In particular, we treat the unweighted and weighted dictionary problem, self-organizing data structures, persistent data structures, the union-find-split problem, priority queues, the nearest common ancestor problem, the selection and merging problem, and dynamization techniques. The methods of analysis are worst, average and amortized case
Statistical process control applied to rail freight terminal performance : a case study of CSX's Radnor yard
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 1994.Includes bibliographical references (leaves 88-93).by Michael A. Duffy, Jr.M.S
- âŠ