To see the other types of publications on this topic, follow the link: Tim Winton.
Dissertations / Theses on the topic 'Tim Winton'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Tim Winton.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Ben-Messahel, Salhia. "Les romans de Tim Winton." Toulouse 2, 1996. http://www.theses.fr/1996TOU20047.
Full textAbstract:
Cette these a pour but de definir les grands axes de la fiction de tim winton, ecrivain contemporain d'australie occidentale. Nous avons choisi pour orientation la problematique du regionalisme en ce sens que nous attachons une importance majeure a l'etude des paysages dans la fiction d'un ecrivain qui est tres ancre dans sa region natale. Ainsi, il est necessaire d'evoquer le fait que l'australie est divisee entre six etats et un territoire, que c'est un pays a la fois marque par un passe colonial lourd de consequences a la fois du point de vue social et politique, et que c'est une nation qui est l'objet de tensions internes tant ses differents etats se disputent une place politique alors qu'ils demeurent en marge du pouvoir central et federal de canberra. Notre etude se divise entre trois grandes parties, elles font toutes resurgir la problematique du regionalisme en mettant l'accent sur les notions d'unite et de fragmentation. L'analyse des themes illustre les rapports intrinseques entre divers poles sociologiques, elle est en rapport avec l'isolement geographique de l'australie occidentale - etat qui occupe plus d'un tiers de la superficie totale du pays. La seconde partie consacree a l'etude des procedes narratifs, utilise les grandes categories de l'espace. La topographie, la typographie et la temporalite sont des concepts qui illustrent une ecriture existentielle; celle-ci met en exergue la place de l'etre dans une societe en mouvement ou il est question de se definir ou de se redefinir par rapport a un centre colonialTim winton is a twentieth century australian writer who writes from a post-colonial perspective. This thesis aims at analysing his fiction, it does put a stress on the use of landscape and shows how important writing from the home-place is relevant to the question of regionalism in australia. We have endeavoured to show that far from being politically and geographically divided into six states and one territory, australia is always talked of in terms of internal divisions as the various local governments remain on the margins of a federal government which is to be compared to a political centre. Our study of tim winton's fiction lays emphasis on region and place through the common idea of unity and multiplicity or separation. An analysis of the themes is conducted as an illustration for the relation between various sociological phenomena. As a matter of fact, the themes reflect the west australian isolation. Our second part which is devoted to the narrative techniques, uses the notion of space and shows how various aspects like topography, typography and time space, are in tune with the philosophy of existentialism which tries to define or redefine the position of man in a post-colonial country. The chapter which deals with symbolism reveals how important is aboriginality in a white australian writing which is highly spiritual and which insists on man belonging to the land
2
Mills, David. "The sense of self and place in Tim Winton's Cloudstreet /." Title page and introduction only, 1994. http://web4.library.adelaide.edu.au/theses/09AR/09arm6568.pdf.
Full text
3
Found, Joel. "Geophysical fictions traversing the works of Tim Winton and Cormac McCarthy." Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/411872/.
Full textAbstract:
This thesis responds to Ocean Studies’ dissatisfaction with how literary geography is read metaphorically. Positioned in relation to geocritical, geopoetic and ecocritical endeavours, the present study brings this concern back to land, and builds a method of reading literary geographies that treads a patient and geophysically informed path to comprehending their metaphorical value. To achieve this, the thesis proposes reading literary geographies as forms of heterotopia: fictional and inaccessible, yet tethered to real-world geography and its geophysical dynamics. To realise the potential of this proposal, the core of the thesis is a comparative reading of Tim Winton and Cormac McCarthy, two writers praised for their attention to place. Prompted by geophysical, environmental, anthropological, historical and philosophical ways of understanding geography, the thesis traverses the rivers, paths, deserts, and cities that emerge in Winton and McCarthy’s fiction. Reading these spaces geophysically reveals connections between the two writers that have not yet been enabled by transpacific or transnational frames, appreciating the host of materialities beyond the Pacific that connect them and their thinking. Studying the presence of the fluvial cycle, lines, dust, and concrete in these locations prompts a diversity of metaphorical, symbolic, and literal ways of reading that develop ideas of national identity, gender, community, and crisis within their fiction. Comparing both writers geographically enables a communication that expands our understanding of their individual literary works, oeuvres, and networks. It also shows the potential of geophysical reading to develop understanding about the concerns of literary inheritance, influence and epochs, helping to place both writers in a broader literary context: as inheritors of a nineteenth-century tradition, as key figures in late-twentieth and twenty-first century fiction, and as writers contesting ‘modernity.’
4
Cantero, Hervé. "Représentation de l'innocence dans les romans de Robert Drewe et Tim Winton." Rouen, 2014. http://www.theses.fr/2014ROUEL014.
Full textAbstract:
La présente étude a pour but de montrer en quoi la notion d’innocence, dynamique et indissociable de ses contraires, joue un rôle central dans la démarche littéraire de deux romanciers australiens contemporains, Robert Drewe et Tim Winton, dont les romans ont l’Australie-Occidentale comme principal arrière-plan géographique, historique et culturel. À travers ces deux exemples, seront plus globalement envisagées les mutations de la notion judéo-chrétienne d’innocence originelle, et de ses corollaires de chute / responsabilité / maturité / corruption / culpabilité / salut / rédemption / grâce, importées d’Europe dans ces terres australes, puis progressivement adaptées à l’altérité environnementale et humaine de territoires se trouvant ainsi spirituellement réinvestis au détriment de la cosmogonie indigène préexistante. On verra comment les deux auteurs témoignent de cette appropriation, tant symbolique que matérielle de la réalité, au moyen de symboles classiques progressivement acclimatés aux caractères de l’expérience coloniale et postcoloniale de cet environnement antipodal : perfection édénique suivie du péché originel et de la déchéance expiatoire, reformulation de ce rêve des origines en âge d’or bucolique et géorgique dans l’histoire culturelle de l’Antiquité et de la Renaissance, sortie volontaire d’une condition passive par le biais d’une révolte prométhéenne, premiers âges reconceptualisés par Hobbes et Rousseau. L’étude des romans de Drewe et Winton permet de définir la singularité de parcours individuels et collectifs, de l’innocence perdue à la possibilité d’un retour en grâce psychologique et spirituelThe present study aims to demonstrate how the notion of innocence, which is articulated in a fundamentally dynamic way and inseparably linked with its opposites, plays a crucial role in the literary works of two contemporary Australian novelists, Robert Drewe and Tim Winton, who have mostly used Western Australia as the geographic, historical and cultural backdrop for their novels. These two examples will allow more generally to study the mutations of the Judeo-Christian notion of original innocence and the correlated notions –of Fall / responsibility / maturity / corruption / guilt / salvation / redemption / grace– which were imported from Europe in these Southern lands and gradually adapted to the environmental and human otherness of these territories, thus spiritually reinvested at the expense of the existing indigenous cosmogony. The study shall show how both authors depict this symbolic as well as concrete appropriation of the local reality through classical symbols gradually acclimated to the character of the colonial and postcolonial experience of this antipodal environment: Edenic perfection followed by the original sin and a limbo of atonement, reformulation of the dream of the origins as a bucolic and Georgic golden age in the cultural history of the Antiquity and the Renaissance, voluntary escape from a passive condition through a Promethean revolt, the first ages of mankind reconceptualized by Hobbes and Rousseau). The analysis of Drewe’s and Winton’s novels will underline the uniqueness of individual and collective journeys, from lost innocence to the possibility of a psychological and spiritual return to grace
5
White, Barbara A., and mikewood@deakin edu au. "'Beyond God the father' : The metaphysical in a physical world." Deakin University. School of Literary and Communication Studies, 2002. http://tux.lib.deakin.edu.au./adt-VDU/public/adt-VDU20050825.154051.
Full text
6
FIALLOS, HUETE ANTONIO JOSE. "Adative correlation time window." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-121290.
Full textAbstract:
Event correlation plays a key role in network management. It is the ability in networkmanagement systems to co-relate events by reading into event attributes and extractingmeaningful information that has value to network operators. It is a conceptual interpretation ofmultiple events such that a new meaning is assigned to these events. This interpretation is usedto pinpoint the events that are behind a root cause incident. The root cause could be a faultynode or an underperforming link. Understanding correlation patterns can potentially helpidentify and localize the root cause of a problem in a network so that network operators takenecessary actions to issue restoration operations. An important technique used by event correlators is temporal correlation of events,whereby events closely related in time with each other are correlated. This technique uses acorrelation time window as an interval in time to capture and correlate events. Traditionally,event correlators have used a fixed-sized correlation time window to perform event correlationin which the size of the correlation time window is fixed. However, this does not scale properlyin modern networks where dynamic relationships are commonplace. To address this issue, thisthesis presents and discusses the idea of an adaptive correlation time window, whereby thewindow size is dynamically calculated based on observable network conditions and processingtimes. The aim of the investigation is to explore the performance of an adaptive window inseveral network scenarios and, more importantly, to compare both types of windows in termsof their performance. To do this, several experiments were designed and performed on avirtualized network test bed. The results of such experiments demonstrate that the adaptivecorrelation time window adequately adapts to varying network conditions. The investigationalso shows the conditions that need to be fulfilled in order to observe a better performance ofeither type of window.
7
Kruschke, Tim [Verfasser]. "Winter wind storms : Identifcation, verifcation of decadal predictions, and regionalization / Tim Kruschke." Berlin : Freie Universität Berlin, 2015. http://d-nb.info/107549334X/34.
Full text
8
Chang, Chia-We. "Continuous Shortest Path Problems with Time Window Constraints." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/mq24104.pdf.
Full text
9
Haddara, A. A. "MUITS : a multi-window for Time-sharing Systems." Thesis, University of Nottingham, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305351.
Full text
10
Li, Chuhe. "A sliding window BIRCH algorithm with performance evaluations." Thesis, Mittuniversitetet, Avdelningen för informationssystem och -teknologi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-32397.
Full textAbstract:
An increasing number of applications covered various fields generate transactional data or other time-stamped data which all belongs to time series data. Time series data mining is a popular topic in the data mining field, it introduces some challenges to improve accuracy and efficiency of algorithms for time series data. Time series data are dynamical, large-scale and high complexity, which makes it difficult to discover patterns among time series data with common methods suitable for static data. One of hierarchical-based clustering methods called BIRCH was proposed and employed for addressing the problems of large datasets. It minimizes the costs of I/O and time. A CF tree is generated during its working process and clusters are generated after four phases of the whole BIRCH procedure. A drawback of BIRCH is that it is not very scalable. This thesis is devoted to improve accuracy and efficiency of BIRCH algorithm. A sliding window BIRCH algorithm is implemented on the basis of BIRCH algorithm. At the end of thesis, the accuracy and efficiency of sliding window BIRCH are evaluated. A performance comparison among SW BIRCH, BIRCH and K-means are also presented with Silhouette Coefficient index and Calinski-Harabaz Index. The preliminary results indicate that the SW BIRCH may achieve a better performance than BIRCH in some cases.
11
Chee, Chong Hin. "Totally-self-checking balance checkers and window comparators." Thesis, University of Hull, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.389293.
Full text
12
Aleu, Bonaut Aitziber. "Stentriever thrombectomy for stroke within and beyond the time window." Doctoral thesis, Universitat Autònoma de Barcelona, 2016. http://hdl.handle.net/10803/393973.
Full textAbstract:
Recientemente se ha aprobado el tratamiento endovascular(TEV) para el ictus por oclusión de gran vaso, lo cual ha cambiado radicalmente el pronóstico infausto de estos pacientes. Una de las contraindicaciones para el TEV es que el paciente llegue más alá de la ventana terapéutica (VT), que tradicionalmente era de 8 horas y actualmente es de 6 horas. La VT se define como el tiempo transcurrido desde el inicio de los síntomas hasta la punción femoral. En pacientes en quienes el inicio del ictus es desconocido, bien porque ocurrió durante el sueño o bien porque el paciente no puede decirlo y no había testigos, la hora de inicio se considera la última vez que el paciente fue visto bien. Estos pacientes caen fuera de VT porque llegan demasiado tarde para ser tratados. Otros pacientes que quedan fuera de VT, son aquellos que tienen una hora de inicio conocida pero que llegan tarde al hospital. Sin embargo, existen evidencias crecientes que la velocidad a la que progresa la isquemia tras una oclusión arterial, varia notablemente entre individuos. Así, mientras que en unos pacientes el territorio arterial está infartado en 6 horas, en otro puede que el infarto no esté establecido hasta las 10 horas. Este concepto choca con el enfoque actual de tratamiento basado en el tiempo, que establece que un paciente se trate en función del tiempo desde el inicio siempre que no haya un gran área infartada. En enfoque basado en la viabilidad del tejido ignora la hora de inicio del ictus. Así para tratar o no a un paciente, se realiza una neuroimagen para confirmar que hay tejido viable, si es así, se realiza el TEV independientemente del tiempo transcurrido. Hay estudios randomizados en marcha para demostrar esta hipótesis, y se han publicado estudios concluyendo que la seguridad y el buen pronostico es similar en pacientes fuera y dentro de ventana. Sin embargo, la mayoría de dichos estudios fueron realizados con dispositivos de primera generación, y algunos reportan pacientes de circulación anterior y posterior. Los stentrievers(ST), dispositivos de nueva generación han demostrado mayores tasas de recanalización y buen pronostico, de hecho las guías actuales recomiendan el TEV con ST. El objetivo primario de esta tesis fue comparar la seguridad y pronóstico de pacientes con ictus de circulación anterior fuera de ventana, tratados mediante TEV con ST, con los pacientes dentro de ventana(WTW). De un total de 468 pacientes 292(63.4%) estaban fuera de ventana(OTW) y 176(37.6%) dentro de ventana. El grupo fuera de ventana, se dividió en dos subgrupos de acuerdo a la hora de inicio: desconocida (UKO) in 113 (24.1%)pacientes y conocida con presentación tardía (KO-LP) en 63(13.5%) pacientes. Estos subgrupos no se pudieron agrupar en el grupo OTW porque un análisis estadístico previo mostró que no eran comparables. Por tanto, los resultados de estos pacientes se presentan de modo separado y comparados con pacientes dentro de ventana. No se encontraron diferencias significativas en buen pronóstico a 3 meses, con 49% en WTW, 42.2%% en UKO y 37.3% en KO-LP. Respecto a la seguridad, tampoco se encontraron diferencias en hemorragia intracraneal sintomática (6.2%WTW, 2.7%UKO y 9.5%KO-LP). Estos hallazgos apoyan el enfoque de viabilidad tisular en vez del basado en tiempo, en pacientes con ictus de circulación anterior tratados con EVT y ST, y seleccionados por neuroimagen, hasta que estén disponibles los resultados de los estudios randomizados. De ser positivos, uno de cada 3 pacientes que normalmente no se tratan por estar fuera de la VT podría ser tratado según nuestro estudio.Endovascular therapy (EVT) for stroke due to large vessel occlusion has been recently approved, changing dramatically the outcome of these patients, who otherwise would have a dismal outcome. However, there are patients automatically excluded from EVT because they arrive beyond the therapeutic time window. Traditionally, the time window (TW) for EVT has been 8 hours but the recent guidelines shortened the window to 6 hours. The TW is defined as the time from symptom onset to the time of groin puncture. In patients in whom the stroke onset is unclear either because the stroke occurred while sleeping or because the patient is unable to tell the onset because is aphasic on unconscious, and no witness is available, the onset is considered the last time the patient was seen normal. These patients often fall outside the window (OTW), because are too late to be treated. Other patients that are too late to be treated are those who, despite having a clear time of onset, arrive OTW. However, there is growing evidence showing that the speed at which the ischemia evolves after an arterial occlusion, varies significantly among individuals. Thus, while in some patients the arterial territory is infarcted in 6 hours, in other, the infarct might not be established after 10 hours. This concept radically challenges the current time-based approach, which establishes whether a patient should be treated or not based on the time from onset provided there is not a large area of infarcted tissue. Interestingly, the tissue-based approach disregards the time from onset. Consequently, the criteria to decide whether to treat a patient or not, would be to image the brain to find out if there is viable tissue, if so, treatment should be carried forward irrespective of the time since stroke onset. There are ongoing trials to prove this hypothesis, and non-controlled studies have been published showing that patients treated OTW have comparable safety and favorable outcomes than those treated within the window. However, those studies were performed with first generation devices and some refer to anterior and posterior circulation strokes. Regarding new generation strategies, stentrievers (ST) have demonstrated higher rates of recanalization and better outcomes. Current guidelines recommend the use of ST. The primary aim of this work was to compare the outcomes and safety of patients OTW with stroke due to anterior circulation (AC) occlusion treated with EVT with ST and selected by neuroimaging with the safety and outcomes of patients WTW. From a total of 468 patients, 292(63.4%) were patients WTW and 176 (37.6%)OTW. The group OTW was divided in two subgroups according to onset: unknown time of onset (UKO) in 113 (24.1%) patients and known onset but late presenters (KO-LP) in 63 (13.5%) patients. These subgroups could not be merged because p statistical analysis showed that they were not comparable, thus, the results had to be presented separately and compared with the WTW group. Regarding outcome, there were no significant differences good outcome at 3 months, with rates of 49% in WTW, 42.2%% in UKO and 37.3% in KO-LP. Regarding safety, there were no significant differences in symptomatic intracranial hemorrhage across groups (6.2%WTW, 2.7%UKO y 9.5%KO-LP). These findings support the tissue- based approach in patients with stroke due to AC occlusion treated with EVT using ST, and selected by neuroimaging, until the results of the randomized trials arrive. According to our study, a positive result would have a great impact on at least, one out of three patients that arrive OTW and are currently left untreated.
13
Wild, Simon. "North Atlantic winter wind storm variability across different time scales." Thesis, University of Birmingham, 2018. http://etheses.bham.ac.uk//id/eprint/8466/.
Full textAbstract:
In this thesis atmospheric and oceanic conditions important for the development of wind storms on different time scales are analysed. The potential usefulness and limitations of seasonal prediction models and long-term reanalyses with respect to wind storm frequency is investigated and sources of potential seasonal predictability of wind storm frequency are discussed. On the synoptic scale tropospheric growth conditions such as baroclinicity, latent heat and upper level divergence show greater magnitudes of one standard deviation on average compared to all extra-tropical cyclones. Mid-latitude Rossby waves show generally greater amplitudes for different wave numbers during wind storm events. Greater amplitudes are also found in wave numbers not typically associated with storm track activity. The analysis of extra-tropical cyclones and wind storms on the seasonal scale reveal positive, significant skill for some European regions in state-of-the-art seasonal prediction models. North Atlantic sea surface temperatures (SST) are shown to be a source of seasonal predictability and a potential reason for the achieved skill for wind storm frequency predictions in reanalysis and AMIP-type sensitivity experiments. The role of tropical Pacific and Atlantic SST for the record number of wind storms over the UK in winter 2013/14 is discussed.
14
Kodukula, Surya Ravikiran. "An Adaptive Time Window Algorithm for Large Scale Network Emulation." Thesis, Virginia Tech, 2002. http://hdl.handle.net/10919/31160.
Full textAbstract:
With the continuing growth of the Internet and network protocols, there is a need for Protocol Development Environments. Simulation environments like ns and OPNET require protocol code to be rewritten in a discrete event model. Direct Code Execution Environments (DCEE) solve the Verification and Validation problems by supporting the execution of unmodified protocol code in a controlled environment. Open Network Emulator (ONE) is a system supporting Direct Code Execution in a parallel environment - allowing unmodified protocol code to run on top of a parallel simulation layer, capable of simulating complex network topologies. Traditional approaches to the problem of Parallel Discrete Event Simulation (PDES) broadly fall into two categories. Conservative approaches allow processing of events only after it has been asserted that the event handling would not result in a causality error. Optimistic approaches allow for causality errors and support means of restoring state â i.e., rollback. All standard approaches to the problem of PDES are either flawed by their assumption of existing event patterns in the system or cannot be applied to ONE due to their restricted analysis on simplified models like queues and Petri-nets.
The Adaptive Time Window algorithm is a bounded optimistic parallel simulation algorithm with the capability to change the degree of optimism with changes in the degree of causality in the network. The optimism at any instant is bounded by the amount of virtual time called the time window. The algorithm assumes efficient rollback capabilities supported by the â Weavesâ framework. The algorithm is reactive and responds to changes in the degree of causality in the system by adjusting the length of its time window. With sufficient history gathered the algorithm adjusts to the increasing causality in the system with a small time window (conservative approach) and increases to a higher value (optimistic approach) during idle periods.
The problem of splitting the entire simulation run into time windows of arbitrary length, whereby the total number of rollbacks in the system is minimal, is NP-complete. The Adaptive Time Window algorithm is compared against offline greedy approaches to the NP-complete problem called Oracle Computations. The total number of rollbacks in the system and the total execution time for the Adaptive Time Window algorithm were comparable to the ones for Oracle Computations.Master of Science
15
Ali, Abukar. "Time window of TNF-a in innate immunity against staphylococcal infection." Thesis, Högskolan i Skövde, Institutionen för vård och natur, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-4897.
Full textAbstract:
Staphylococcus aureus (S. aureus) is responsible for many human diseases including septic arthritis and sepsis shock. Tumor necrosis factor alpha (TNF-α) is a pro-inflammatory cytokine involved in inflammation and produced mainly by macrophages and monocytes. It is believed to be involved in pathogenesis of septic arthritis. Time window of TNF-a in innate immunity against staphylococcal infection was studied in this project. Two experiments were carried out: In the first experiment mice were infected with a low dose (8x106cfu/mouse) of S. aureus to induce septic arthritis whereas in the second experiment the mice were infected with a higher dose (8x107cfu/mouse) of S. aureus to induce sepsis shock. All mice were divided into three groups. The first group was treated with anti-TNF-α 20 minutes after infection. The second group was treated with the anti-TNF-α three days after infection. The third group served as control and was injected with PBS instead of anti-TNF-α. The mice were regularly weighed and signs of arthritis and mortality were recorded. Two weeks after inoculation bacteria viable counts in different organs was done, as well as histopathological assessment of joints and measurement of cytokines in blood. We have observed that mice treated with anti-TNF-α had less severe arthritis and also less mortality. However, they had more bacteria accumulated in the kidneys and lost more weight compared to the control group. The results were mostly seen in the group early treated with TNF-α, compared to the late treated group. We conclude that anti-TNF-α might be potentially used as a therapy against septic arthritis and sepsis shock. This should be combined with antibiotics to eliminate the bacteria while the anti-TNF-α reduces the severity of the inflammation and thus reduce the risk of permanent joint destruction and mortality. We can conclude that blocking TNF-α early on is essential in order to get the best results.
16
Pollmann, Tim Oliver [Verfasser], and Rolf [Akademischer Betreuer] Winter. "Organkultivierung von tief stromal lamellierten Hornhäuten / Tim Oliver Pollmann. Rolf Winter. Abteilung Augenheilkunde der Medizinischen Hochschule Hannover." Hannover : Bibliothek der Medizinischen Hochschule Hannover, 2010. http://d-nb.info/1002367573/34.
Full text
17
Shipp, Abbie J. Edwards Jeffrey R. "The moving window of fit extending person-environment fit research with time /." Chapel Hill, N.C. : University of North Carolina at Chapel Hill, 2006. http://dc.lib.unc.edu/u?/etd,370.
Full textAbstract:
Thesis (Ph. D.)--University of North Carolina at Chapel Hill, 2006.Title from electronic title page (viewed Oct. 10, 2007). "... in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Kenan- Flagler Business School (Organizational Behavior and Strategy)." Discipline: Business Administration; Department/School: Business School, Kenan-Flagler.
18
Saito, Kazuyuki 1967. "Linkages between Eurasian snow cover and Northern Hemisphere winter-time climate variability." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/57861.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Earth, Atmospheric, and Planetary Sciences, 2000.Includes bibliographical references (p. 107-112).
Recently it has been shown that the Eurasian snow cover in the prior autumn (ESCSON) and the leading mode variability in the wintertime extratropical Northern Hemisphere (NH) atmospheric circulation have significant correlation. In this study, a linkage between the ESCSON and the following wintertime NH climate variability was investigated. Satellite data from the NOAA is used for snow cover, and NCEP/NCAR Reanalysis data are used for climate variables. The high latitudes sea-level pressure is quality-controlled by use of the IABP sea-level pressure dataset, which is derived from the buoy observations. Interannual variability of and association between ESCSON and winter climate variables were surveyed by use of linear statistical analysis techniques; Empirical Orthogonal Function (EOF) analysis, and correlation/regression analysis. The gravity current by the expansion of the cold, dense air over Siberia north- and westward remained one among the several possible mechanisms. The upper air mechanism may be active to connect the ESCSON and the leading mode of DJF surface pressure variability. It is also suggested that the DJF sea-level pressure variations associated with the ESCSON is considerably confined to the Atlantic side, and has only limited association with the linear trend and the Pacific side variations. Future work may include reexamination of the results using the possible, longer data of the observation. The mechanism connecting the ESCSON anomalies and the upper level circulation anomaly should be investigated further, for which one possible approach is analysis of the wave activity and energy propagation in the troposphere and stratosphere.
by Kazuyuki Saito.
S.M.
19
Dudeck, Tim [Verfasser], and Christian [Akademischer Betreuer] Möllmann. "Zooplankton dynamics in winter : A bottom-up analysis of a new zooplankton time series from the English Channel and the Southern Bight of the North Sea / Tim Dudeck ; Betreuer: Christian Möllmann." Hamburg : Staats- und Universitätsbibliothek Hamburg, 2018. http://d-nb.info/1162275324/34.
Full text
20
El-Nashar, Ahmed. "Multi-Vehicle Dispatching and Routing with Time Window Constraints and Limited Dock Capacity." Doctoral diss., University of Central Florida, 2012. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/5197.
Full textAbstract:
The Vehicle Routing Problem with Time Windows (VRPTW) is an important and computationally hard optimization problem frequently encountered in Scheduling and logistics. The Vehicle Routing Problem (VRP) can be described as the problem of designing the most efficient and economical routes from one depot to a set of customers using a limited number of vehicles. This research addresses the VRPTW under the following additional complicating features that are often encountered in practical problems: 1. Customers have strict time windows for receiving a vehicle, i.e., vehicles are not allowed to arrive at the customer's location earlier than the lower limit of the specified time window, which is relaxed in previous research work. 2. There is a limited number of loading/unloading docks for dispatching/receiving the vehicles at the depot The main goal of this research is to propose a framework for solving the VRPTW with the constraints stated above by generating near-optimal routes for the vehicles so as to minimize the total traveling distance. First, the proposed framework clusters customers into groups based on their proximity to each other. Second, a Probabilistic Route Generation (PRG) algorithm is applied to each cluster to find the best route for visiting customers by each vehicle; multiple routes per vehicle are generated and each route is associated with a set of feasible dispatching times from the depot. Third, an assignment problem formulation determines the best dispatching time and route for each vehicle that minimizes the total traveling distance. iii The proposed algorithm is tested on a set of benchmark problems that were originally developed by Marius M. Solomon and the results indicate that the algorithm works well with about 1.14% average deviation from the best-known solutions. The benchmark problems are then modified by adjusting some of the customer time window limits, and adding the staggered vehicle dispatching constraint. For demonstration purposes, the proposed clustering and PRG algorithms are then applied to the modified benchmark problems.Ph.D.
Doctorate
Industrial Engineering and Management Systems
Engineering and Computer Science
Industrial Engineering
21
Júnior, José Messias Magalhães. "Flight scheduling problem, with time window, applied to a fractional jet ownership company." Instituto Tecnológico de Aeronáutica, 2013. http://www.bd.bibl.ita.br/tde_busca/arquivo.php?codArquivo=2875.
Full textAbstract:
The present research addresses the problem of optimizing the flight schedule with time window applied to a fractional ownership jet company. The use of time window is intended to represent the situation in which the client is flexible to adjustment de departure time. This relaxation of time by the customer requesting air transport service enables the company to minimize the operational costs of the aircraft. In addition to the time window, the mathematical model includes the option to shared flight, in which the customers agree to make stops before reaching their final destination. In this work, different scenarios were analyzed, varying the time window 0-45 minutes in problems involving 09 to 30 clients. For the analysis of these scenarios, a tool was developed in AIMMS environment, called IOS (Icoaraci Optimization System). This tool has proved to be extremely useful in the development of this work. It has a user-friendly interface and is integrated into MS-EXCEL, where customer data are loaded. The Cplex12.4 is the solver responsible to reach the optimal flight schedule. For problems involving more than 10 clients, an heuristic was developed to provide a good and feasible solution. The use of time window and shared flight resulted in a reduction of up to 51.36% in total cost.
22
Mohammadi-Aragh, Mahnas Jean. "Characterizing Student Attention in Technology-Infused Classrooms Using Real-time Active Window Data." Diss., Virginia Tech, 2013. http://hdl.handle.net/10919/50945.
Full textAbstract:
As computers become more prevalent (and required) in engineering classrooms, it becomes increasingly important to address the dichotomy in our current understanding of their impact on student attention and learning. While some researchers report increased student learning, others report computers as a distraction to learning. To address this conflict, the research community must gain a fundamental understanding of how students use their computers in-class and how student attention is connected to learning and pedagogical practice. By gaining such an understanding, instructors\' design of classroom interventions aimed at increasing positive computer usage will be better informed. The purpose of this quantitative research study is to answer the overarching question "How do students use computers in technology-infused classrooms?" through an investigation of student attention. Based on the premise that one\'s senses must be oriented towards a stimulus to receive the stimulus, it is hypothesized that attention in a technology-infused classroom can be measured by monitoring a students\' top-most, active window (the Active Window Method). This novel approach mitigates issues with prior data collection methods, and allows researchers the opportunity to capture real-time student computer usage. This research serves the dual purpose of validating the Active Window Method and investigating applications of the method. The Active Window Method is validated by comparing real-time active window data with in-class observations of attention in engineering courses with large enrollments. The bootstrap resampling technique is used to estimate mean error rate. Post-tests are used to establish convergent validity by relating learning to active window data. Polytomous logistic regression is used to examine the probability of post-test score (response) over the range of attention levels (factor). Subsequent to validation, two applications of the Active Window Method were pursued. First, student computer use is characterized in multiple large lecture sections. Second, in answering calls to link student computer usage to pedagogical practices, an investigation into the relationship between pedagogy and attention is conducted by aligning time stamps of the active window record with technology-infused pedagogical activities identified in video recordings of lectures. An intervention time series analysis is employed to quantify the change in average attention due to pedagogical activities. Results demonstrate strong construct validity when directly comparing active window and attention. Convergent validity was weak when relating active window to learning. Results from the two applications illustrate that instructors\' use of technology and their pedagogical practices impact student computer use. Specifically, collecting student-generated content and polling question activities encourage on-task behavior. However, activities that include a website link encourage off-task behavior.Ph. D.
23
Zhao, Yanxing. "Parametric inference from window censored renewal process data." Columbus, Ohio : Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1164678679.
Full text
24
Selverstone, Jane Elizabeth. "Pressure-temperature-time constraints of metamorphism and tectonism in the Tauern Window, Eastern Alps." Thesis, Massachusetts Institute of Technology, 1985. http://hdl.handle.net/1721.1/59036.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Earth, Atmospheric, and Planetary Sciences, 1985.Microfiche copy available in Archives and Science.
Bibliography: leaves 266-279.
by Jane Elizabeth Selverstone.
Ph.D.
25
Saisi, Donna Lynn. "The use of model-based window display interfaces in real time supervisory control systems." Thesis, Georgia Institute of Technology, 1986. http://hdl.handle.net/1853/25203.
Full text
26
Cournoyer, Daniel. "Risk time-window specification and its impact on the assessment of medication-related adverse events." Thesis, McGill University, 2006. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=101713.
Full textAbstract:
Post-marketing studies using medical administrative databases are often conducted to assess medication-related adverse events (AE). The determination of the risk time-window, defined as the period of time during which a medication-related AE could occur, is a crucial and challenging step toward the correct assessment of these AEs. In general, the unknown risk time-window consists of the number of days supplied, TS, for the medication and of a time-window. TW, that starts after TS and during which the medication could still produce AEs. Arguments have been made in favor of both short and long TW, durations. The aim of this thesis is to determine the impact of varying TW values on the assessment of the rate of cardiovascular AEs, using simulated data, and in a real-life example using administrative databases from Quebec. Results indicated that longer TW values tended to bias results toward the null.
27
Thomas, Roie. "Theistic Existentialism in the Fiction of Tim Winton." 2007. http://eprints.utas.edu.au/7745.
Full textAbstract:
This survey of Winton's fiction will claim that religious (or theistic) existentialism is the foundational weltanschuuang of his work. I intend to investigate the extent to which the ideas of Soren Kierkegaard shadow characters in their move towards an ideal; that is, a personal connectedness with their concept of God. This thesis attempts to demonstrate that Winton's fiction reflects aspects of Kierkegaard's existential continuum, his Stages on Life's Way (1845), in its call to existential ‘authenticity’. Both authors reject the conventional rigidity practised by much institutionalised religion and endorse a personalised connectedness between individuals and God.
28
Atherfold, Joanna. "Watermark: a short story cycle." Thesis, 2015. http://hdl.handle.net/1959.13/1309822.
Full textAbstract:
Research Doctorate - Doctor of Philosophy (PhD)Watermark is a short story cycle exploring intergenerational and personal relationships in coastal communities. The stories observe the complexity of characters drawn together, but also separated, by family, topography and circumstance. Written to reflect experiences from the 1960s through to present times, the stories reveal individuals responding to the uncertainty and disorder of life-changing events and unexpected revelations. Located in a quintessentially Australian landscape, the characters transgress physical and metaphorical boundaries and experience pivotal moments of transformation, even if – and, as it will be argued, because – those times are fleeting or unsustainable. The stories oscillate between their autonomous status and their interconnection within the broader narrative framework of the short story cycle. This structural aesthetic enables continuity through recurring characters, settings and themes. Paradoxically, these elements combine to reflect fractured relationships and unstable characters against a backdrop that is constantly changing. The exegesis draws on the notion of liminality to explore the generic and thematic concerns that emerged during the composition of the stories, particularly in relation to the oppositions and paradoxes evinced above. It looks at the complexities and challenges of the short story cycle with close reference to three short story cycles with coastal settings – The Bodysurfers by Robert Drewe, The Turning by Tim Winton and Having Cried Wolf by Gretchen Shirm. These texts reveal that Australian short story writers regard the coastline as more than simply a setting; it is a place of transition and a viable site to explore character development and transformation.
29
Cullen, Patrick. "What came between: short story cycle and critical exegesis." Thesis, 2013. http://hdl.handle.net/1959.13/1040214.
Full textAbstract:
Research Doctorate - Doctor of Philosophy (PhD)This thesis includes a creative component, What Came Between, and an accompanying critical exegesis. What Came Between is a collection of twelve realist short stories about residents of adjoining terraces in inner-city Newcastle. The collection opens on the 28th of December 1989, the day of the Newcastle Earthquake, and ends a decade later on New Year’s Eve as the BHP steelworks closes and the city’s history of steelmaking comes to an end. This kind of collection, which gains unity from its consistent setting and recurring characters, belongs to the short story cycle genre. The exegesis discusses the two contexts most relevant to What Came Between, that is the realist mode and the short story cycle genre, and notes the relative influences of Raymond Carver and Tim Winton in both instances.
30
Hsiao, Li-Jen, and 蕭立人. "Time Analysis in a Time Window Network." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/69295384624239847177.
Full textAbstract:
博士國立中央大學
資訊管理研究所
92
Time window has been a common form of time constraint extensively considered in the literature. Basically, a time window is a time period, defined by the earliest and latest times, when a node is ready for traveling through. Although many variants of transportation problem in time-window networks have been proposed, none of them considers the possibility that time windows may be associated with the moving travelers or vehicles who travel only in these time periods. In this dissertation, a new variant of time-window constraint, we call it body clock constraint, is proposed at first. We assume that each vehicle has its own body clock and a capacity limitation on carrying goods, and we are trying to determine a minimal time schedule for sending a certain amount of goods from source to destination in a time-window network. The problem is studied by two cases, the first case considers single vehicle scheduling while the second one discusses multiple vehicles. Two different algorithms are presented to find the optimum schedule for each of the two cases. Secondly, to plan and select a path under a constraint on the latest entering time at the destination node, we propose a systematic method to generate time information of the paths and nodes on a time-window network. Algorithms are proposed to generate various time characteristics of the nodes, including the earliest and latest times of arriving at, entering, and departing from each node on the network. Using the basic time characteristics, we identify inaccessible nodes that cannot be included in a feasible path. Concurrently, we evaluate the flexibilities of accessible nodes in the waiting time and staying time. We also propose a method to measure adverse effects when including an arc. Based on the time characteristics and the proposed analysis schemes, we develop an algorithm for finding the most flexible path in a time-window network. We then extend the time window network to include body clock with traveler. Time characteristics of nodes and arcs are generated similarly. The flexibility and inaccessibility analyses of nodes and arcs are also discussed. Similarly, we provide an algorithm to find the most flexible path in this time-window network with traveler’s body clock.
31
Bayram, Metin. "Multiple window time-frequency analysis." Thesis, 1996. http://hdl.handle.net/1911/14057.
Full textAbstract:
The bias-variance trade-off is an important issue is spectrum estimation. In 1982, Thomson introduced a powerful multiple window method for stationary signals that deals with the bias-variance trade-off in an optimal fashion. In this thesis, we extend Thomson's method to the time-frequency and time-scale planes, and propose a new method to estimate the time-varying spectrum of non-stationary random processes. Unlike previous extensions of Thomson's method, we identify and utilize optimally concentrated window and wavelet functions, and develop a statistical test for detecting chirping line components. The optimal windows are the Hermite functions for time-frequency analysis, and the Morse wavelets for time-scale analysis.
32
Shen, Sheng-Yuan, and 申生元. "Time Window Constrained Vehicle Routing Problems." Thesis, 1999. http://ndltd.ncl.edu.tw/handle/09780822489787552720.
Full textAbstract:
博士國立交通大學
工業工程與管理系
87
This research involves developing heuristic solution methods for three types of time window constrained vehicle routing problems. They are the Vehicle Routing Problem with Time Windows (VRPTW), the Vehicle Routing Problem with Time Windows and Backhauls (VRPTWB), and the Vehicle Routing Problem with Time Windows and Multiple Vehicle Types (VRPTWMVT). The time windows considered in this study constitute hard constraints. Extensively computational results are reported. Benchmark problems for VRPTW and VRPTWB are taken from the literature. A total of 168 sample problems for VRPTWMVT have been newly created to evaluate the performance of our heuristics. Furthermore, we also compare our results for VRP, VRPB, and VRPMVT with the best-known solutions found in the literature. In overall, computational studies show that our heuristics in terms of both solution quality and computation time are superior to or at least competitive with all other heuristics published. The primary contributions of this dissertation are summarized as follows. (1) A new neighborhood structure is introduced in dealing with VRPs. Instead of the traditional way in constructing neighborhoods using a node(s)-to-node(s) relationship, we generate a set of route-neighborhoods by focusing on a node(s)-to route(s) relationship. Through the adjustment of the size of route-neighborhoods, one might obtain near optimal solutions due to a thorough exploitation of solution space. (2) An operational framework for minimizing the number of vehicles used is proposed. A key component in the framework is the introduction of an end-effect-handling procedure. When only a small number of customers is left with no feasible positions with respect to the existing set of routes, a specially designed procedure is applied on them such that feasible positions can possibly be found among the current routes instead of immediately constructing a new route for them. Information extracted from previous construction history is used in defining the end-effect-threshold for justifying what is a small number of customers. In addition, we present a scheme for constructing routes in a nested parallel manner. (3) Several insertion-based savings heuristics that generalize the traditional combining-based savings approach are first addressed to solve the VRPTWMVT. The introduction of a parameter referring to the degree of sequential route construction has substantially improved the solution quality.
33
Lee, Wei-Hung, and 李韋宏. "Parallel-Machine Scheduling with Time Window." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/99542058259082280045.
Full textAbstract:
碩士中原大學
工業與系統工程研究所
105
Through the improvement of science and technology industry, the demand of IC increases and effects the whole semi-conductor process lane. The design of IC has become more and more diversification and the packing technic has also improved since the great compete between IC testing and packing company, decrease the due date and increase process rate is an important task. This research investigate on order scheduling and parallel machine assignment problem in single factory, in semiconductor wafer packing process, the out decide the usage of the bottleneck wiring and what effects the usage is the frequency of changing machine progress, once the frequency more often, the less its able to process and effect the output. This research focuses on wiring as target to find the best input order in order to decrease the frequency to the maximum machine usage. What we consider : scheduling and parallel-machine assignment is a NP-hard problem, first we propose mathematical model of mixed integer programming using auto transform order information into what is needed and use genetic algorithm in Matlab to solve, once we get similar optimal solution, the optimal program will automatically calculate the daily usage from wafer milling to wiring. This makes the consultation of the order of arranging.
34
Hsu, Tung-Yeh, and 徐東業. "On multi-objective job shop scheduling problem with time window – Dynamic time window selection ant colony optimization." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/51566062731613459510.
Full textAbstract:
碩士輔仁大學
管理學研究所
97
Job shop scheduling problem (JSP) is the most complex situation among all, and JSP is also the most common situation in practical situation. Generally, JSP can be solved by integer programming (IP) for optimal solution, but the time consumed rises rapidly as the problem size grows. Therefore, heuristic methods are applied to greatly reduce the time consumed. Among all heuristic methods, ant colony optimization(ACO) is the most widely used in recent years; however, in facing problems with time window constrains, ACO is not yet endowed with a effective algorithm. Thus, based upon ACO, this paper presents new algorithm to solve JSP with TW, and the approach is named “dynamic time window selection ant colony optimization(DWSACO)”. This paper studies on JSP with TW, and there is a given ready time for every job; the purpose is to minimize weighted average of the sum of total earliness and total tardiness. Then the problem is solved by IP, ACO, and DWSACO respectively, and at the end the effectiveness and robustness of each method are analyzed, expecting to contribute both practically and academically. The result shows that both ACO and DWSACO are able to obtain approximate optimal solution in a short time, and although in different sizes of problem, DWSACO consumes a bit more time than ACO does, the solutions obtained by DWSACO are closer to optimal solution than ACO’s. Near the end of this paper, the improve rates of effectiveness and robustness show that DWSACO is superior to ACO.
35
Lin, Chien-Yu, and 林建佑. "Improvement Vehicle Routing Problem with Time Window." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/78904662441903156753.
Full textAbstract:
碩士東吳大學
資訊管理學系
99
Vehicle routing problem with time window has been the focus of many researchers recently and also proved to be NP-hard. In this thesis, a variety of heuristics are introduced and Solomon problems are used as basis for research. Through the detailed analysis of the customers’ geographical and time windows information, computations are made to generate dynamic parameters. Moreover, this research imported these parameters into a sequential tour-building algorithm for solutions. The results are further transformed to map the problem data. Finally, through the graphical display and chart analysis, the visualized solutions are presented to the users.
36
Lin, Yen-Po, and 林彥伯. "Launch Time Window Determination for Missile Interceptor." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/62899332894810223587.
Full textAbstract:
碩士國立交通大學
電控工程研究所
99
When an attacking missile is detected, the missile defense system must decide when to launch the missile interceptor. The choice of a proper launch time is important because given the physical constraints on the interceptor, a poor choice of launch time alone may cause the interception to fail. This thesis discusses the determination of launch time window for a missile interceptor, which is formulated as constrained optimization problems. The earliest and the latest allowable launch times are determined by numerically solve the corresponding minimization and maximization problems. Three incoming threats are considered. Numerical results show good agreement with results obtained via six degree of freedom simulations employing midcourse guidance.
37
Winter, Thomas [Verfasser]. "Online and real-time dispatching problems / Thomas Winter." 1999. http://d-nb.info/958326584/34.
Full text
38
Hsiao, Ho-Yuan, and 蕭賀元. "The Traveling Salesman Problem with Time Window Constraints." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/10971137226081629414.
Full textAbstract:
碩士東海大學
資訊管理學系
99
The traveling salesman problem with time window constraints is an extension research of the traveling salesman problem. It also joined the process control issues and the customer-oriented concept. To provide the service within a specific service time window that suits the needs of customers. Because of considering the time window constraints, the traveling salesman problem would be more practical in the daily life. There are two research topics in this study. The first one is the traveling salesman problem that considers sleep within hard time window constraints. The other one is the traveling salesman problem that considers time-dependent paths within soft time window constraints. We use the simulated annealing and the genetic algorithm respectively to solve the two research issues. For each research issue, the approaches will be illustrated by an example. After all, the solution quality and effectiveness of our approaches in the study will be proved by examples and random experiments sequentially. Therefore, our approaches would be a reference for a right decision-making related to the traveling salesman problem with time window constraints.
39
Shing-Chen, Wen, and 陳文興. "On job shop scheduling with time window problem." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/67466988537657545685.
Full textAbstract:
碩士輔仁大學
管理學研究所
93
Scheduling is a very important field in production management. And job shop is a most complex production system on the field. Scheduling operations expect to bring into full play the minimum stock level, wastes, the least idle time and deliver the goods on time, so derive the time window problem. Previous literature regarding job shop scheduling problem (JSP) rarely concerns the machine set-up time, and measure regular is minimizing the tardiness. Here the due date is discussed one point. The study will confer the JSP, and let the due date for an interval. Focusing on scheduling with time window of JSP and expect to get the solution close to the time window. Minimize the total penalty due to the earliness and tardiness. The property of our study is NP-hard. So we construct the mathematics model for JSP with time window first, and then test the simulate data. The solution got by ant colony optimum (ACO) programs that written by C-language and compare with the best solution gotten by LINGO 7.0 to test the efficiency and robust. The result was pointed out the ACO has good efficiency on the test. And the solving time is less than LINGO. So ACO had both effectiveness and efficiency that stressed on business management.
40
lee, jenhon, and 李健弘. "Linear fractional shortest path problem with time window." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/45079685657297779081.
Full text
41
Liu, Chien-Hung, and 劉建宏. "Truck and Trailer Routing Problem with Time Window." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/18239047623478269935.
Full textAbstract:
碩士國立中央大學
土木工程研究所
93
The Truck and Trailer Routing Problem (TTRP) is a variant of the Vehicle Routing Problem (VRP). The problem extends the basic VRP to take a real-life application into account. In the TTRP, customers can be serviced by a truck alone or a vehicle (a truck pulling a trailer), therefore there are three types of routes in a solution to the TTRP: a pure truck route, a pure vehicle route, and a complete vehicle route which includes the vehicle route and the sub-tours serviced by a truck alone. This research extends TTRP to consider time window constraint, and defines the Truck and Trailer Routing Problem with Time Window (TTRPTW). This research also applies a heuristic to solve the TTRPTW and test on 17 problems which were designed based on Solomon’s standard VRPTW problems.
42
Woodlief, John Ashley. "Paratransit customer satisfaction with real-time information the Winston-Salem Trans-AID case /." 2003. http://www.lib.ncsu.edu/theses/available/etd-10282003-154144/unrestricted/etd.pdf.
Full text
43
Jen-Hao, Huang. "The Probabilistic Traveling Salesman Problem with Real-time Requests and Time Window Constraints." 2006. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0016-0109200613413707.
Full text
44
Huang, Jen-Hao, and 黃仁豪. "The Probabilistic Traveling Salesman Problem with Real-time Requests and Time Window Constraints." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/00462895620319658923.
Full textAbstract:
碩士國立清華大學
工業工程與工程管理學系
94
Nowadays, in order to keeping competitive advantages, overnight carriers are searching for more stable orders. On the other hand, carriers also concentrate on developing abilities to deal with real-time demands continuously. The common goal of overnight carriers is satisfying needs of customers as possible while keeping operating costs competitive. The purpose of this thesis is to construct a Probabilistic Traveling Salesman Problem model with Time Window constraints (PTSPTW) to cope with probabilistic demands. Meanwhile, the idea of Double Horizon is incorporated into the model to maintain the flexibility of the a priori route for future possible immediate requests. A two stage heuristic algorithm is proposed to solve the PTSPTW. The conclusion is that the flexibility of the a priori route is helpful not only to satisfy more demands but also to reduce total traveling time of the vehicle in the problem with real-time demands, especially the cases which the weight of real-time demands is high. Besides, in the problems with narrow time window or high request probabilities, the a priori route with more flexibility has more advantages.
45
Liao, Kuo-Chun, and 廖國均. "The Recommendation of Visiting Route under the Time Window." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/nnzknu.
Full textAbstract:
碩士國立臺北科技大學
工業工程與管理系碩士班
100
Nowadays, people have concerned their life qualities more than before. And the trend of visiting exhibitions when on weekends has come to a big growth. Therefore, it very crowed on weekends in Taiwan because people would like to go outside, this reason, people stuck in traffic jams very easily. People would waste too much time on waiting or out of control of schedule interrupt their good mood. Furthermore, most of travel spots are getting together in a particular area, so it’s also important. Tourists are required to buy tickets to get into spots. Hence, the contribution of this paper is to enable people to make good use of their visiting or playing routine in a limited time. This paper uses MOTSP model to develop Modified-NSGA-II multi-objective algorithm, path system with RFID system imports in-time system concept, to control well of tourists who it are playing or waiting. Also divides time zone to calculate and update the number of tourist and the density each spot. The goal are making tourist play all the facilities with time and by improving shortcuts of the spot, them attracting more tourists to come.
46
Chen, Chi-Shen, and 陳契伸. "Vehicle Routing Problem with Hard/Soft Time Window Constraints." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/26746509312112443878.
Full textAbstract:
碩士中原大學
工業工程研究所
89
This research proposes a heuristic, Tabu-Threshold Algorithm (TTA), to efficiently and effectively solve Vehicle Routing Problem with Hard/Soft Time Window Constraints (VRPHTW / VRPSTW). TTA integrates Tabu Search (TS) and Threshold Accepting (TA), two of the most popular generic heuristics in solving VRPHTW in recent years. The first objective is to determine the route that minimizes the total vehicle travel distances. This, in turn, leads to quick response to customer demands. The second objective is to find the minimum required number of vehicles. This, in turn, results in low transportation cost. Solomon’s 56 benchmark instances were tested for TTA. TTA consists of three phases: initial solution construction, local search improvement, and generic search improvement. In the initial solution construction phase, Enhanced Savings Method and Nearest Neighbor Method are used. In the local search improvement phase, vehicles reduction and neighborhood search modules are proposed. In the generic search improvement phase, a hybrid algorithm of TS and TA is used to improve the initial solution. TTA is coded in Visual Basic 6.0 and evaluated at a PentiumⅢ550 PC. TTA results in good solution quality and efficiency. The average deviation of distance is less than 5% and the average deviation of vehicle numbers is about 8%, compared to the known “best” solutions. The average computation time is approximately 5 minutes to solve all the instances.
47
Ho, Meng-Chieh, and 何孟潔. "Time Dependent Vehicle Routing Problems with Time Window and Split Delivery in City Logistics." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/r76mq7.
Full textAbstract:
碩士國立東華大學
運籌管理研究所
100
Traditional wholesalers have to deal with many different kinds of retailers every day. Wholesalers, in order to improve service quality, usually provide distribution services. There are, however, many different kinds of retailers, each of with different business hours, and wholesalers must deliver goods in different time windows. This presents a typical VRPTW problem. On the other hand, vehicles deliver goods at different times, meaning traffic flow will be different, and this affects delivery times. In order to meet the actual demand, we add the time dependent constraint distribution time with the traffic flow change in the distribution process. In the traditional VRP, each customer can be served by exactly one vehicle. In order to make the service efficient, we relax this constraint, so that each customer can be served by more than one vehicle. We construct mathematical models that provide optimal solutions for the above situations. We use the optimization software CPLEX to solve small case problems. And we use a basic genetic algorithm to solve the large problem with Matlab. Finally, we use the example of Solomon Instances to explore the difference between distribution by split delivery and without split delivery, and use practical examples of tests.
48
Wei, Zong-Che, and 魏宗徹. "The Vehicle Routing Problem With Backhaul and Time Window Constraints." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/35707804237946650508.
Full textAbstract:
碩士元智大學
工業工程研究所
89
The transportation cost accounts for a large amount in logistics system, hence how to design a useful vehicle routing rule can reduce the transportation cost and increase the profit is the primary issues for the company. Ordinary Vehicle Routing Problem with Backhaul（VRPB）assumes that the pickup operations are followed by delivery. The operations are either simple delivery or pickup, and single vehicle type is assumed. The purpose of this study was to allow the priority flexibility of pickup and delivery via pickup allowance rate. Where the delivery goods was over the specified percents of carrying capacity, this vehicle could break the priority of delivery and then made both delivery and pickup operation at the customer station. However, both delivery and pickup operation could not exceed the vehicle capacity constraint. Customers were classified by 3 subgroups, one for delivery（or linehaul）, one for pickup（or backhaul）and the other is the mix of linehaul and backhaul. We also study the imparts of both single type and mixed type vehicle on the solution. A genetic algorithm was applied to the problem and parameters were determined by Taguchi Method for optimal design. The test problem by Solomon were tested to check the feasibility of the approach. The results show that the minimize total cost occurred at the level of pickup customers is 50% and percent of pickup allowance is 10%. The mix vehicle consideration performs better is total cost（-19.5%）and average utilization（+14.4%）.
49
Chun, Bock Jin, and Sang Heon Lee. "Algorithms and heuristics for time-window-constrained traveling salesman problems." Thesis, 1985. http://hdl.handle.net/10945/21133.
Full text
50
LIN, FENG-LONG, and 林豐隆. "A design of refined window protocol for time-constrained communication." Thesis, 1992. http://ndltd.ncl.edu.tw/handle/33164021423012437876.
Full text