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.
Ben-Messahel, Salhia. "Les romans de Tim Winton." Toulouse 2, 1996. http://www.theses.fr/1996TOU20047.
Full textTim 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
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 textFound, Joel. "Geophysical fictions traversing the works of Tim Winton and Cormac McCarthy." Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/411872/.
Full textCantero, Hervé. "Représentation de l'innocence dans les romans de Robert Drewe et Tim Winton." Rouen, 2014. http://www.theses.fr/2014ROUEL014.
Full textThe 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
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 textFIALLOS, 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 textKruschke, 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 textChang, 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 textHaddara, 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 textLi, 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 textChee, 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 textAleu, 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 textEndovascular 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.
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 textKodukula, Surya Ravikiran. "An Adaptive Time Window Algorithm for Large Scale Network Emulation." Thesis, Virginia Tech, 2002. http://hdl.handle.net/10919/31160.
Full textMaster of Science
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 textPollmann, 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 textShipp, 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 textTitle 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.
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 textIncludes 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.
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 textEl-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 textPh.D.
Doctorate
Industrial Engineering and Management Systems
Engineering and Computer Science
Industrial Engineering
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 textMohammadi-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 textPh. D.
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 textSelverstone, 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 textMicrofiche copy available in Archives and Science.
Bibliography: leaves 266-279.
by Jane Elizabeth Selverstone.
Ph.D.
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 textCournoyer, 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 textThomas, Roie. "Theistic Existentialism in the Fiction of Tim Winton." 2007. http://eprints.utas.edu.au/7745.
Full textAtherfold, Joanna. "Watermark: a short story cycle." Thesis, 2015. http://hdl.handle.net/1959.13/1309822.
Full textWatermark 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.
Cullen, Patrick. "What came between: short story cycle and critical exegesis." Thesis, 2013. http://hdl.handle.net/1959.13/1040214.
Full textThis 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.
Hsiao, Li-Jen, and 蕭立人. "Time Analysis in a Time Window Network." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/69295384624239847177.
Full text國立中央大學
資訊管理研究所
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.
Bayram, Metin. "Multiple window time-frequency analysis." Thesis, 1996. http://hdl.handle.net/1911/14057.
Full textShen, Sheng-Yuan, and 申生元. "Time Window Constrained Vehicle Routing Problems." Thesis, 1999. http://ndltd.ncl.edu.tw/handle/09780822489787552720.
Full text國立交通大學
工業工程與管理系
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.
Lee, Wei-Hung, and 李韋宏. "Parallel-Machine Scheduling with Time Window." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/99542058259082280045.
Full text中原大學
工業與系統工程研究所
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.
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 text輔仁大學
管理學研究所
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.
Lin, Chien-Yu, and 林建佑. "Improvement Vehicle Routing Problem with Time Window." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/78904662441903156753.
Full text東吳大學
資訊管理學系
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.
Lin, Yen-Po, and 林彥伯. "Launch Time Window Determination for Missile Interceptor." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/62899332894810223587.
Full text國立交通大學
電控工程研究所
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.
Winter, Thomas [Verfasser]. "Online and real-time dispatching problems / Thomas Winter." 1999. http://d-nb.info/958326584/34.
Full textHsiao, Ho-Yuan, and 蕭賀元. "The Traveling Salesman Problem with Time Window Constraints." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/10971137226081629414.
Full text東海大學
資訊管理學系
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.
Shing-Chen, Wen, and 陳文興. "On job shop scheduling with time window problem." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/67466988537657545685.
Full text輔仁大學
管理學研究所
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.
lee, jenhon, and 李健弘. "Linear fractional shortest path problem with time window." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/45079685657297779081.
Full textLiu, Chien-Hung, and 劉建宏. "Truck and Trailer Routing Problem with Time Window." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/18239047623478269935.
Full text國立中央大學
土木工程研究所
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.
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 textJen-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 textHuang, 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 text國立清華大學
工業工程與工程管理學系
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.
Liao, Kuo-Chun, and 廖國均. "The Recommendation of Visiting Route under the Time Window." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/nnzknu.
Full text國立臺北科技大學
工業工程與管理系碩士班
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.
Chen, Chi-Shen, and 陳契伸. "Vehicle Routing Problem with Hard/Soft Time Window Constraints." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/26746509312112443878.
Full text中原大學
工業工程研究所
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.
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 text國立東華大學
運籌管理研究所
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.
Wei, Zong-Che, and 魏宗徹. "The Vehicle Routing Problem With Backhaul and Time Window Constraints." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/35707804237946650508.
Full text元智大學
工業工程研究所
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%).
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 textLIN, FENG-LONG, and 林豐隆. "A design of refined window protocol for time-constrained communication." Thesis, 1992. http://ndltd.ncl.edu.tw/handle/33164021423012437876.
Full text