• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 92
  • 36
  • 8
  • 5
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 158
  • 158
  • 43
  • 37
  • 37
  • 32
  • 29
  • 28
  • 27
  • 25
  • 19
  • 19
  • 18
  • 17
  • 16
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Research into a method of crew scheduling for suburban rail transport using heuristic and linear programming techniques

Comrie, Andrew Neville 14 January 2015 (has links)
Crew schedules on the South African Transport Services are done by roster compilers at depots. A method that uses heuristic and mathematical programming algorithms was developed to replace existing hand methods. It is a two stage method that will use a microcomputer to assist roster compilers to draw up crew schedules. Initially timetables are subdivided into shifts and then they are combined into crew schedules. The solution, which produces a significant improvement compared with an existing crew schedule and an existing method, has been accepted in principle and computer programming has begun. In Appendix E another heuristic for the scheduling of league matches is described.

On efficient ordered binary decision diagram minimization heuristics based on two-level logic.

January 1999 (has links)
by Chun Gu. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1999. / Includes bibliographical references (leaves 69-71). / Abstract also in Chinese. / Chapter 1 --- Introduction --- p.3 / Chapter 2 --- Definitions --- p.7 / Chapter 3 --- Some Previous Work on OBDD --- p.13 / Chapter 3.1 --- The Work of Bryant --- p.13 / Chapter 3.2 --- Some Variations of the OBDD --- p.14 / Chapter 3.3 --- Previous Work on Variable Ordering of OBDD --- p.16 / Chapter 3.3.1 --- The FIH Heuristic --- p.16 / Chapter 3.3.2 --- The Dynamic Variable Ordering --- p.17 / Chapter 3.3.3 --- The Interleaving method --- p.19 / Chapter 4 --- Two Level Logic Function and OBDD --- p.21 / Chapter 5 --- DSCF Algorithm --- p.25 / Chapter 6 --- Thin Boolean Function --- p.33 / Chapter 6.1 --- The Structure and Properties of thin Boolean functions --- p.33 / Chapter 6.1.1 --- The construction of Thin OBDDs --- p.33 / Chapter 6.1.2 --- Properties of Thin Boolean Functions --- p.38 / Chapter 6.1.3 --- Thin Factored Functions --- p.49 / Chapter 6.2 --- The Revised DSCF Algorithm --- p.52 / Chapter 6.3 --- Experimental Results --- p.54 / Chapter 7 --- A Pattern Merging Algorithm --- p.59 / Chapter 7.1 --- Merging of Patterns --- p.60 / Chapter 7.2 --- The Algorithm --- p.62 / Chapter 7.3 --- Experiments and Conclusion --- p.65 / Chapter 8 --- Conclusions --- p.67

A heuristic method for a rostering problem with the objective of equal accumulated flying time

Ye, Xugang. Blumsack, Steve. January 2003 (has links)
Thesis (M.S.)--Florida State University, 2003. / Advisor: Dr. Steve Blumsack, Florida State University, College of Arts and Sciences, Dept. of Mathemtics. Title and description from dissertation home page (viewed Mar. 3, 2004). Includes bibliographical references.

Parallel machine scheduling with time windows

Rojanasoonthon, Siwate 28 August 2008 (has links)
Not available / text

Optimal transit route network design problem : algorithms, implementations, and numerical results

Fan, Wei, 1974- 02 August 2011 (has links)
Not available / text

Topics in airline operations

Rosenberger, Jay Michael 12 1900 (has links)
No description available.

Set partitioning based heuristics for interactive routing

Cullen, Frank Haywood 05 1900 (has links)
No description available.

On the performance of optimisation networks / by Brenton S. Cooper.

Cooper, Brenton S. January 1996 (has links)
Bibliography: leaves 125-131. / xi, 131 leaves : ill. ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / This thesis examines the performace of optimisation networks. The main objectives are to determine if there exist any factors which limit the solution quality that may be achieved with optimisation networks, to determine the reasons for any such limitations and to suggest remedies for them. / Thesis (Ph.D.)--University of Adelaide, Dept. of Electrical and Electronic Engineering, 1996

Effectively capturing user sessions on the Web using Web server logs

Caldera, Amithalal, University of Western Sydney, College of Science, Technology and Environment, School of Computing and Information Technology January 2005 (has links)
The usage of Web sites has been of interest to Web administrators and researchers ever since the Web started. Analysis of Web site usage data helps to understand the behaviour of its users, which is very important, as many important decisions can be made based on it. The user behaviour may be deduced by knowing all the activities each user does from the time s/he starts a session on the Web site until s/he leaves it, which is collectively called a user session. As Web server logs explicitly record the browsing behaviour of site users and are readily and economically available, this thesis explores the use of Web server logs in capturing user sessions on Web. In order to protect users’ privacy, the standard Web server logs in general do not record the user identities or similar measures to uniquely identify the users. This thesis concentrates on heuristic strategies to infer user sessions. The heuristics exploit the background knowledge of user navigational behaviour recorded in the standard Web server logs without requiring additional information through cookies, logins and session ids. They identify relationships that may exist among the log data and make use of them to assess whether requests registered by the Web server can belong to the same individual and whether these requests were performed during the same visit. Researchers have proposed several heuristics, which were adversely affected by proxy servers, caching and undefined referrers. The thesis proposes new heuristics, which effectively address all the limitations, thus extending the work in this field. It also introduces a set of measures to quantify the performance of the heuristics and uses them to investigate their efficiency based on logs from three Web sites and makes recommendations for the Web sites to devise their own heuristics. The investigation has shown satisfactory results and the new heuristics are applicable to wider range of Web sites. / Doctor of Philosophy (PhD)

Heuristics for laying out information graphs

Lavinus, Joseph W. 30 December 2008 (has links)
The representation of information in modern database systems is complicated by the need to represent relationships among pieces of information. A natural representation for such databases is the information graph that associates the pieces of information with vertices in the graph and the relationships with edges. Five characteristics of this representation are noteworthy. First, each vertex has a size (in bytes) sufficient to store its corresponding piece of information. Second, retrieval in an information graph may follow a number of patterns; in particular, retrieval of adjacent vertices via edge traversals must be efficient. Third, in many applications such as a dictionary or bibliographic archive, the information graph may be considered static. Fourth, the ultimate home for an information graph is likely to be a roughly linear medium such as a magnetic disk or CD-ROM. Finally, information graphs are quite large-hundreds of thousands of vertices and tens of megabytes in size. / Master of Science

Page generated in 0.1199 seconds