Dissertations / Theses: 'Dynamic Routing Systems'

1

Woo, Siu-on. "Dynamic routing for automated material handling systems." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B35679207.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Woo, Siu-on, and 胡兆安. "Dynamic routing for automated material handling systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B35679207.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bartlett, Kelly K. "Congestion-aware dynamic routing in automated material handling systems." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/53013.

Full text

Abstract:

In semiconductor manufacturing, automated material handling systems (AMHSs) transport wafers through a complex re-entrant manufacturing process. In some systems, Overhead Hoist Transport (OHT) vehicles move throughout the facility on a ceiling-mounted track system, delivering wafers to machines and storage locations. To improve efficiency in such systems, this thesis proposes an adaptive dynamic routing approach that allows the system to self-regulate, reducing steady-state travel times by 4-6% and avoiding excessive congestion and deadlock. Our approach allows vehicles to be rerouted while in progress in response to changes in the location and severity of congestion as measured by edge traversal time estimates updated via exponential smoothing. Our proposed method is efficient enough to be used in a large system where several routing decisions are made each second. We also consider how the effectiveness of a AMHS layout differs between static and dynamic routing. We demonstrate that dynamic routing significantly reduces sensitivity to shortcut placement and allows an eight-fold increase in the number of shortcuts along the center loop. This reduces travel times by an additional 24%. To demonstrate the effectiveness of our proposed routing approach, we use a high-fidelity simulation of vehicle movement. To test the impact of routing methods on layout effectiveness, we developed an associated Excel-based automated layout generation tool that allows the efficient generation of thousands of candidate layouts. The user selects from among a set of modular templates to create a design and all simulation files are generated with the click of a button.

APA, Harvard, Vancouver, ISO, and other styles

4

Subramanian, Shivaram. "Routing Algorithms for Dynamic, Intelligent Transportation Networks." Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/37056.

Full text

Abstract:

Traffic congestion has been cited as the most conspicuous problem in traffic management. It has far-reaching economic,social and political effects. Intelligent Transportation Systems (ITS) research and development programs have been assigned the task of developing sophisticated techniques and counter-measures to reduce traffic congestion to manageable levels, and also achieve these objectives using area-wide traffic management methods. During times of traffic congestion, the traffic network in a transient, time-dynamic state, and resembles a dynamic network. In addition, in the context of ITS, the network can accurately detect such transient behavior using traffic sensors, and several other information gathering devices. In conjunction with Operations Research techniques, the time-varying traffic flows can be routed through the network in an optimal manner, based on the feedback from these information sources. Dynamic Traffic Assignment (DTA) methods have been proposed to perform this task. An important step in DTA is the calculation of user-optimal, system-optimal, and multiple optimal routes for assigning traffic. One would also require the calculation of user-optimal paths for vehicle scheduling and dispatching problems. The main objective of this research study is to analyze the effectiveness of time-dependent shortest path (TDSP) algorithms and k-shortest path (k-SP) algorithms as a practical routing tool in such intelligent transportation networks. Similar algorithms have been used to solve routing problems in computer networks. The similarities and differences between computer and ITS road networks are studied. An exhaustive review of TDSP and k-SP algorithms was conducted to classify and determine the best algorithms and implementation procedures available in the literature. A new (heuristic) algorithm (TD-kSP) that calculates multiple optimal paths for dynamic networks is proposed and developed. A complete object-oriented computer program in C++ was written using specialized network representations, node-renumbering schemes and efficient path processing data structures (classes) to implement this algorithm. A software environment where such optimization algorithms can be applied in practice was then developed using object-oriented design methodology. Extensive statistical and regression analysis tests for various random network sizes, densities and other parameters were conducted to determine the computational efficiency of the algorithm. Finally, the algorithm was incorporated within the GIS-based Wide-Area Incident Management Software System (WAIMSS) developed at the Center for Transportation Research, Virginia Tech. The results of these tests are used to obtain the empirical time-complexity of the algorithm. Results indicate that the performance of this algorithm is comparable to the best TDSP algorithms available in the literature, and strongly encourages its possible application in real-time applications. Complete testing of the algorithm requires the use of real-time link flow data. While the use of randomly generated data and delay functions in this study may not significantly affect its computational performance, other measures of effectiveness as a routing tool remains untested. This can be verified only if the algorithm itself becomes a part of the user-behavior feedback loop. A closed loop traffic simulation/ system-dynamics study would be required to perform this task. On the other hand, an open-loop simulation would suffice for vehicle scheduling/dispatching problems. Master of Science

APA, Harvard, Vancouver, ISO, and other styles

5

Chong, Kheng Huat. "Dynamic routing algorithms for distributed packet-switched data networks." Thesis, Imperial College London, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.391256.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Prudich, Philip. "Dynamic Routing using an Overlay Network of Relays." Ohio University / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1128723813.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bertsimas, Dimitris J., and Haiping Xu. "Optimization of Polling Systems and Dynamic Vehicle Routing Problems on Networks." Massachusetts Institute of Technology, Operations Research Center, 1993. http://hdl.handle.net/1721.1/5356.

Full text

Abstract:

We consider the problem of optimizing a polling system, i.e., of optimally sequencing a server in a multi-class queueing system with switch-over times in order to minimize a linear objective function of the waiting times. The problem has important applications in computer, communication, production and transportation networks. We propose nonlinear programming relaxations that provide strong lower bounds to the optimal cost for all static policies. We also obtain lower bounds for dynamic policies as well, which are primarily useful under light traffic conditions and/or small switch-over times. We conjecture that the lower bounds developed in this paper for the class of static policies are also valid for dynamic policies under heavy traffic conditions. We use the information from the lower bound and integer programming techniques to construct static policies that are very close (0-3%) to the lower bounds. We compare numerically our proposed policies with static policies proposed in the literature as well as with dynamic policies and find that the policies we propose outperform all static policies proposed in the literature and at least in heavier traffic outperform dynamic policies as well.

APA, Harvard, Vancouver, ISO, and other styles

8

Zhou, Ji Zhe. "Modeling and dynamic routing for traffic flow through multi-agent system." Thesis, University of Macau, 2018. http://umaclib3.umac.mo/record=b3950602.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Abdollahi, Farzaneh. "An H P[infinity] dynamic routing control of networked multi-agent systems /." Connect to online version, 2008. http://proquest.umi.com/pqdweb?did=1675132891&sid=1&Fmt=2&clientId=10306&RQT=309&VName=PQD.

Full text

Abstract:

Thesis (Ph.D.)--Dept. of Electrical and Computer Engineering, Concordia University, 2008. "September 2008" On t.p. "[infinity]" appears as the infinity symbol. Includes bibliographical references (leaves 179-195). Available also on the Internet.

APA, Harvard, Vancouver, ISO, and other styles

10

Zhu, Weihua. "Design and development of novel routing methodologies for dynamic roadway navigation systems." Diss., [Riverside, Calif.] : University of California, Riverside, 2009. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3350082.

Full text

Abstract:

Thesis (Ph. D.)--University of California, Riverside, 2009. Includes abstract. Available via ProQuest Digital Dissertations. Title from first page of PDF file (viewed March 12, 2010). Includes bibliographical references (p. ). Also issued in print.

APA, Harvard, Vancouver, ISO, and other styles

11

Grachek, Adam. "Individualized Pedestrian and Micromobility Routing Incorporating Static and Dynamic Parameters." Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-177784.

Full text

Abstract:

This project seeks to demonstrate routing optimization that would allow pedestrian and micromobility user groups to select and prioritize different route features according to their preferences. Through the creation of a routing demonstrator that considers both static and dynamic parameters in the form of pavement quality, elevation climb, travel time, and air quality, along with user-specified weights for their prioritization of each of these parameters, a number of routes were created and mapped to qualitatively compare against routes representing only a shortest path. Examensarbetet är utfört vid Institutionen för teknik och naturvetenskap (ITN) vid Tekniska fakulteten, Linköpings universitet

APA, Harvard, Vancouver, ISO, and other styles

12

Thiessen, Christian. "Resilient routing and spectrum assignment in Elastic Optical Networks under Dynamic Traffic." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-155684.

Full text

Abstract:

Transparent Elastic Optical Networks (EON) are seen as a promising solution for future optical transport networks to keep up with internet traffic growth, as they allow provisioning connections with different bandwidth requirements in an efficient way. To achieve high spectrum efficiency in these networks, making good Routing, Modulation and Spectrum Assignment (RMLSA) decisions is essential. Since fiber cuts are common, resiliency against single-link failures is another important topic. This can be provided efficiently through shared-path protection (SPP), which in turn complicates the RMLSA problem. Existing routing, modulation and spectrum assignment algorithms for SPP focus on the two-step approach, where primary paths are selected independently of their backup path options. However, selecting a different primary path can allow for a better backup path with higher shareability of backup resources if primary and backup path pairs are considered together. Previous studies on SPP in EONs mostly consider the static traffic scenario. Under a dynamic traffic scenario, where unpredictable connection re-quests arrive and terminate over time, fragmentation of spectral resources has a significant impact on the network performance. In this thesis, a new algorithm is proposed for SPP in EONs against single-link failures where primary and backup path pairs are selected jointly, thereby minimizing fragmentation and maximizing shareability which leads to better network performance in terms of blocking probability. Unlike existing algorithms, the primary and backup path and spectrum are decided simultaneously from a set of candidate path pairs and the spectrum assignment is done using a hybrid cost metric. The metric is a weighted combination of existing metrics that integrates fragmentation and shareability into a multi-objective function. Using network traffic simulations in two reference networks, the effect of the different cost functions on the algorithm’s behavior is explored and an optimal set of weights is determined. With this parameterization, traffic simulations in a scaled-down sample US network topology with load values of 190-240 Erlang, corresponding to blocking probabilities of 0.1% to 1%, show an average improvement over the reference algorithm of 79% in blocking probability, 6.9% in shareability and 5.9% in spectrum fragmentation. It is also shown that most of this improvement is caused by joint primary-backup path assignments. The hybrid cost function reduces blocking by a further 10%. Transparenta Elastiska Optiska Nätverk (EON) ses som en lovande lösning för framtida optiska transportnät för att hänga med Internettrafikens tillväxt, eftersom de möjliggör att tillhandahålla förbindelser med olika krav på bandbredd på ett effektivt sätt. För att uppnå hög spektrumeffektivitet i dessa nätverk är det viktigt att fatta bra beslut vad avser routing, modulering och spektrumtilldelning (Routing, Modulation Level and Spectrum Assignment, RMLSA). Eftersom fiberavbrott är vanliga, så är tåligheten mot enstaka länkfel et annat viktigt ämne. Detta kan ske effektivt genom att skydda gemensamma reservvägar (Shared Path Protection, SPP), vilket dock försvårar RMLSA-problemet. Befintliga routing, modulering och spektrumtilldelningsalgoritmer för SPP fokuserar på strategier i två steg, där först de primära vägarna väljs oberoende av deras backupalternativ. Att välja en annan primär väg, kan dock möjliggöra en bättre reservväg med bättre delning av backupresurser om i stället par av primära och sekundära vägar bedöms tillsammans. Tidigare studier på SPP i EONs anser främst statiska trafikscenarier. I ett dynamiskt trafikscenario, där oförutsägbara anslutningsbegäranden inkommer och avslutas över tiden, så kommer fragmenteringen av spektrala resurser ha en betydande inverkan på nätverkets prestanda. I denna avhandling föreslås en ny algoritm för SPP i EONs för hantering av enskilda länkfel, där par av primära och sekundära vägar väljs gemensamt, vilket minimerar fragmentering och maximerar delning vilket leder till bättre nätverksprestanda i form av minskat blockering. Till skillnad från befintliga algoritmer beslutas den primära och sekundära vägen och spektrum samtidigt från en uppsättning av par av kandidatvägar och spektrumtilldelningen görs med en hybrid-kostnadsfunktion. Funktionen är en viktad kombination av befintliga mått som integrerar fragmentering och delning till en multi-objektiv målfunktion. Med användning av nätverkstrafiksimuleringar i två referensnätverk studeras effekten av olika kostnadsfunktioner på algoritmens beteende och en optimal uppsättning av vikter bestäms. Med dessa parametrar, trafiksimuleringar i en reducerad US-nätverkstopologi med belastningsvärden på 190-240 Erlang, motsvarande blockeringssannolikheter på 0,1 - 1%, visar en genomsnittlig förbättring under referensalgoritmen på 79% i blockeringens sannolikhet, 6.9% i delning och 5,9% i fragmentering. Det visas också att det mesta av denna förbättring beror på det samtidiga tilldelning av primära och reservlänkar. Hybridkostnadsfunktionen minskar blockeringen med ytterligare 10%.

APA, Harvard, Vancouver, ISO, and other styles

13

Chen, Jie. "Adaptive Scheduling and Tool Flow Control in Automated Manufacturing Systems." Diss., Virginia Tech, 2003. http://hdl.handle.net/10919/27159.

Full text

Abstract:

The recent manufacturing environment is characterized as having diverse products due to mass customization, short production lead-time, and unstable customer demand. Today, the need for flexibility, quick responsiveness, and robustness to system uncertainties in production scheduling decisions has increased significantly. In traditional job shops, tooling is usually assumed as a fixed resource. However, when tooling resource is shared among different machines, a greater product variety, routing flexibility with a smaller tool inventory can be realized. Such a strategy is usually enabled by an automatic tool changing mechanism and tool delivery system to reduce the time for tooling setup, hence allows parts to be processed in small batches. In this research, a dynamic scheduling problem under flexible tooling resource constraints is studied. An integrated approach is proposed to allow two levels of hierarchical, dynamic decision making for job scheduling and tool flow control in Automated Manufacturing Systems. It decomposes the overall problem into a series of static sub-problems for each scheduling window, handles random disruptions by updating job ready time, completion time, and machine status on a rolling horizon basis, and considers the machine availability explicitly in generating schedules. Two types of manufacturing system models are used in simulation studies to test the effectiveness of the proposed dynamic scheduling approach. First, hypothetical models are generated using some generic shop flow structures (e.g. flexible flow shops, job shops, and single-stage systems) and configurations. They are tested to provide the empirical evidence about how well the proposed approach performs for the general automated manufacturing systems where parts have alternative routings. Second, a model based on a real industrial flexible manufacturing system was used to test the effectiveness of the proposed approach when machine types, part routing, tooling, and other production parameters closely mimic to the real flexible manufacturing operations. The study results show that the proposed scheduling approach significantly outperforms other dispatching heuristics, including Cost Over Time (COVERT), Apparent Tardiness Cost (ATC), and Bottleneck Dynamics (BD), on due-date related performance measures under both types of manufacturing systems models. It is also found that the performance difference between the proposed scheduling approach and other heuristics tend to become more significant when the number of machines is increased. The more operation steps a system has, the better the proposed method performs, relative to the other heuristics. This research also investigates in what conditions (e.g. the number of machines, the number of operation steps, and shop load conditions) the proposed approach works the best, and how the performance of this proposed approach changes when these conditions change. When tooling resource is shared, parts can be routed to machines that do not have all the required tools. This may result in higher routing flexibility. However, research work to date in sharing of tooling resources often places more emphasis on the real-time control and manipulation of tools, and pays less attention to the loading of machines and initial tool allocation at the planning stage. In this research, a machine-loading model with shared tools is proposed to maximize routing flexibility while maintaining minimum resident tools. The performance of the proposed loading heuristic is compared to that of a random loading method using hypothetically generated single stage system models. The study result indicates that better system performances can be obtained by taking into account the resident tooling ratio in assigning part types and allocating tools to machines at the initial planning stage. Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

14

Stevens, Andrew John. "Experimental investigation of free-space optical routing systems using static and dynamic binary holographic elements." Thesis, University of Edinburgh, 1995. http://hdl.handle.net/1842/13014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Barragan, Dante E. "Optimal placement of sensors for network lifetime extension in wireless sensor networks with dynamic routing." To access this resource online via ProQuest Dissertations and Theses @ UTEP, 2008. http://0-proquest.umi.com.lib.utep.edu/login?COPT=REJTPTU0YmImSU5UPTAmVkVSPTI=&clientId=2515.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Ganapathy, Subhashini. "HUMAN-CENTERED TIME-PRESSURED DECISION MAKING IN DYNAMIC COMPLEX SYSTEMS." Wright State University / OhioLINK, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=wright1152229142.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Mungwattana, Anan. "Design of Cellular Manufacturing Systems for Dynamic and Uncertain Production Requirements with Presence of Routing Flexibility." Diss., Virginia Tech, 2000. http://hdl.handle.net/10919/28960.

Full text

Abstract:

Shorter product life-cycles, unpredictable demand, and customized products have forced manufacturing firms to operate more efficiently and effectively in order to adapt to changing requirements. Traditional manufacturing systems, such as job shops and flow lines, cannot handle such environments. Cellular manufacturing, which incorporates the flexibility of job shops and the high production rate of flow lines, has been seen as a promising alternative for such cases. Although cellular manufacturing provides great benefits, the design of cellular manufacturing systems is complex for real-life problems. Existing design methods employ simplifying assumptions which often deteriorate the validity of the models used for obtaining solutions. Two simplifying assumptions used in existing design methods are as follows. First, product mix and demand do not change over the planning horizon. Second, each operation can be performed by only one machine type, i.e., routing flexibility of parts is not considered. This research aimed to develop a model and a solution approach for designing cellular manufacturing systems that addresses these shortcomings by assuming dynamic and stochastic production requirements and employing routing flexibility. A mathematical model and an optimal solution procedure were developed for the design of cellular manufacturing under dynamic and stochastic production environment employing routing flexibility. Optimization techniques for solving such problems usually require a substantial amount of time and memory space, therefore, a simulated annealing based heuristic was developed to obtain good solutions within reasonable amounts of time. The heuristic was evaluated in two ways. First, different cellular manufacturing design problems were generated and solved using the heuristic. Then, solutions obtained from the heuristic were compared with lower bounds of solutions obtained from the optimal solution procedure. The lower bounds were used instead of optimal solutions because of the computational time required to obtain optimal solutions. The results show that the heuristic performs well under various circumstances, but routing flexibility has a major impact on the performance of the heuristic. The heuristic appears to perform well regardless of problem size. Second, known solutions of two CM design problems from literature were used to compare with those from the heuristic. The heuristic slightly outperforms one design approach, but substantially outperforms the other design approach. Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

18

Hari, Krishnan Prem Kumar. "Design and Analysis of a Dynamic SpaceWire Routing Protocol for Reconﬁgurable and Distributed On-Board Computing Systems". Thesis, Luleå tekniska universitet, Rymdteknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-76534.

Full text

Abstract:

Future spacecrafts will require more computational and processing power to keep up with the growing demand in requirements and complexity. ScOSA is the next generation on-board computer developed by the German Aerospace Centre (DLR). The main motivation behind ScOSA is to replace the conventional on-board computer with distributed and reconfigurable computing nodes which provides higher performance, reliability, availability and stability by using a combination of the COTS components and reliable computing processors that are space qualified. In the current ScOSA system reconfiguration and routing of data between nodes are based on a static decision graph. SpaceWire protocol is used to communicate between nodes to provide reliability. The focus of the thesis is to design and implement a dynamic routing protocol for ScOSA which can be used in future for not only communicating between the nodes but also for reconfiguration. SpaceWire IPC is a customized protocol developed by DLR to provide communication between the nodes in a distributed network and to support monitoring, management and reconfiguration services. The dynamic routing protocol proposed in this thesis is primarily derived from the monitoring mechanism used in the SpaceWire IPC. PULL type monitoring mechanism is modelled and simulated using OMNeT++. The results obtained provide a qualitative outlook of the dynamic routing protocol implemented.

APA, Harvard, Vancouver, ISO, and other styles

19

Jin, Huan. "Workforce planning in manufacturing and healthcare systems." Diss., University of Iowa, 2016. https://ir.uiowa.edu/etd/5784.

Full text

Abstract:

This dissertation explores workforce planning in manufacturing and healthcare systems. In manufacturing systems, the existing workforce planning models often lack fidelity with respect to the mechanism of learning. Learning refers to that employees’ productivity increases as they gain more experience. Workforce scheduling in the short term has a longer term impact on organizations’ capacity. The mathematical representations of learning are usually nonlinear. This nonlinearity complicates the planning models and provides opportunities to develop solution methodologies for realistically-sized instances. This research formulates the workforce planning problem as a mixed-integer nonlinear program (MINLP) and overcomes the limitations of cur- rent solution methods. Specifically, this research develops a reformulation technique that converts the MINLP to a mixed integer linear program (MILP) and proposes several techniques to speed up the solution time of solving the MILP. In organizations that use group work, workers learn not only by individual learning but also from knowledge transferred from team members. Managers face the decision of how to pair or team workers such that organizations benefit from this transfer of learning. Using a mathematical representation that incorporates both in- dividual learning and knowledge transfer between workers, this research considers the problem of grouping workers to teams and assigning teams to sets of jobs based on workers’ learning and knowledge transfer characteristics. This study builds a Mixed- integer nonlinear programs (MINP) for parallel systems with the objective of maximizing the system throughput and propose exact and heuristic solution approaches for solving the MINLP. In healthcare systems, we focus on managing medical technicians in medical laboratories, in particular, the phlebotomists. Phlebotomists draw specimens from patients based on doctors’ orders, which arrive randomly in a day. According to the literature, optimizing scheduling and routing in hospital laboratories has not been regarded as a necessity for laboratory management. This study is motivated by a real case at University of Iowa Hospital and Clinics, where there is a team of phlebotomists that cannot fulfill doctors requests in the morning shift. The goal of this research is routing these phlebotomists to patient units such that as many orders as possible are fulfilled during the shift. The problem is a team orienteering problem with stochastic rewards and service times. This research develops an a priori approach which applies a variable neighborhood search heuristic algorithm that improves the daily performance compared to the hospital practice.

APA, Harvard, Vancouver, ISO, and other styles

20

Özbay, Kaan. "A framework for dynamic traffic diversion during non-recurrent congestion: models and algorithms." Diss., Virginia Tech, 1996. http://hdl.handle.net/10919/39210.

Full text

Abstract:

Real-time control of traffic diversion during non-recurrent congestion continues to be a challenging topic. Especially, with the advent of Intelligent Transportation Systems (ITS), the need for models and algorithms that will control the diversion in real-time, responding to the current traffic conditions has become evident. Several researchers have tried to solve this on-line control problem by adopting different approaches such as, expert systems, feedback control, and mathematical programming. In order to ensure the effectiveness of real-time traffic diversion, an implementation framework capable of predicting the impact of the incident on the traffic flow, generating feasible alternate routes in real-time, and controlling traffic in order to achieve a pre-set goal based on a system optimal or a user equilibrium concept is required. In this dissertation, a framework that would satisfy these requirements is adopted consisting of a "diversion initiation module", a "diversion strategy planning module", and a "control and routing module" which determines the route guidance commands in real-time. The incident duration data collected by the Northern Virginia incident management agencies is analyzed to determine major factors that affect the incident clearance duration. Next, prediction/decision trees are developed for different types of incidents. Based on the validation of these trees using the data that is not employed for the development of the trees, it is found that they perform well for the majority of the incidents. A simple deterministic queuing approach is used to predict the delays that will be caused by the incident for which the clearance duration is predicted using the prediction/decision trees. The diversion strategy planning module, Network Generator, is developed as a knowledge based expert system that uses simple expert rules in conjunction with historical and realtime data to determine the incident impact zone, and to eliminate links that are not suitable for diversion. Finally, it generates alternate routes for diversion using this modified network. Network generator is tested using simulation on a small portion of the Fairfax network. Finally, feedback control models for dynamic traffic routing models, both in distributed and lumped parameter settings, are developed. Methods for developing controllers for these models are also discussed. Two heuristic and analytic feedback controllers for the space discretized lumped parameter models are developed and their effectiveness for realtime traffic control is shown by simulating several scenarios on a simple network. An analytic feedback controller is also designed using a feedback linearization technique for the space discretized model. This controller also performed very well during simulations of various scenarios and proved to be an effective solution to this feedback control problem. Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

21

Lorenzo, Veiga B. (Beatriz). "New network paradigms for future multihop cellular systems." Doctoral thesis, Oulun yliopisto, 2012. http://urn.fi/urn:isbn:9789514298554.

Full text

Abstract:

Abstract The high increase in traffic and data rate for future generations of mobile communication systems, with simultaneous requirement for reduced power consumption, makes Multihop Cellular Networks (MCNs) an attractive technology. To exploit the potentials of MCNs a number of new network paradigms are proposed in this thesis. First, a new algorithm for efficient relaying topology control is presented to jointly optimize the relaying topology, routing and scheduling resulting in a two dimensional or space time routing protocol. The algorithm is aware of intercell interference (ICI), and requires coordinated action between the cells to jointly choose the relaying topology and scheduling to minimize the system performance degradation due to ICI. This framework is extended to include the optimization of power control. Both conventional and cooperative relaying schemes are considered. In addition, a novel sequential genetic algorithm (SGA) is proposed as a heuristic approximation to reconfigure the optimum relaying topology as the network traffic changes. Network coding is used to combine the uplink and downlink transmissions, and incorporate it into the optimum bidirectional relaying with ICI awareness. Seeking for a more tractable network model to effectively use context awareness and relying on the latest results on network information theory, we apply a hexagonal tessellation for inner partition of the cell into smaller subcells of radius r. By using only one single topology control parameter (r), we jointly optimize routing, scheduling and power control to obtain the optimum trade-off between throughput, delay and power consumption in multicast MCNs. This model enables high resolution optimization and motivates the further study of network protocols for MCNs. A new concept for route discovery protocols is developed and the trade-off between cooperative diversity and spatial reuse is analyzed by using this model. Finally, a new architecture for MCN is considered where multihop transmissions are performed by a Delay Tolerant Network, and new solutions to enhance the performance of multicast applications for multimedia content delivery are presented. Numerical results have shown that the algorithms suggested in this thesis provide significant improvement with respect to the existing results, and are expected to have significant impact in the analysis and design of future cellular networks Tiivistelmä Tiedonsiirron ja tiedonsiirtonopeuksien suuri kasvu sekä tehonkulutuksen pieneneminen tulevien sukupolvien matkapuhelinjärjestelmissä tekevät monihyppyiset matkapuhelinverkot houkutteleviksi vaihtoehdoiksi. Tässä työssä esitetään uusia tiedonsiirtoverkkojen paradigmoja monihyppyisten matkapuhelinverkkojen hyödyntämiseksi. Työssä esitellään uusi algoritmi tehokkaaseen releointitopologian hallintaan, joka optimoi yhtäaikaisesti topologian, reitityksen sekä lähetyshetkien ajoituksen ja mahdollistaa tila-aika-reititysprotokollan toteutuksen. Esitetty algoritmi huomioi solujen keskinäishäiriön ja vaaditulla solujen välisellä koordinoidulla hallinnalla saadaan yhdessä valittua topologia ja ajoitus, jotka minimoivat solujen keskinäisistä häiriöistä johtuvan suorituskyvyn heikentymisen. Myöhemmin tätä viitekehystä on laajennettu lisäämällä siihen tehonsäädön optimointi. Työssä on tutkittu sekä perinteisiä että kooperatiivisia releointimenetelmiä. Lisäksi työssä esitetään uusi geneettinen algoritmi heuristiseksi approksimaatioksi verkon liikenteen muutoksen vaatimaan releointitopologian uudelleen järjestelyyn. Työssä tarkastellaan lisäksi verkkokoodausta ylä- ja alasuuntaan tapahtuvan tiedonsiirron yhdistämiseksi sisällyttämällä se solujen keskinäishäiriön huomioivaan kahdensuuntaiseen releointiin. Etsittäessä paremmin mukautuvaa ja kontekstitietoisuutta hyödyntävää verkkomallia, joka käyttää hyväkseen viimeisimpiä verkkojen informaatioteoreettisia tuloksia, voidaan verkon solut pilkkoa pienempiin kuusikulmaisiin alisoluihin. Käyttämällä ainoastaan näiden alisolujen sädettä r voidaan puolestaan verkon reititys, ajoitus ja tehon säätö optimoida yhtäaikaisesti saavuttaen paras mahdollinen kompromissi verkon läpäisyn, viiveen ja tehonkulutuksen välillä. Kehitetty malli mahdollistaa korkean resoluution optimoinnin ja motivoi uusien verkkoprotokollien kehitystä monihyppyisissä matkapuhelinverkoissa. Tätä mallia käyttäen esitellään myös uusi konsepti reitinetsintäprotokollille sekä analysoidaan kooperatiivisen diversiteetin ja tila-avaruudessa tapahtuvan uudelleenkäytön välistä kompromissiratkaisua. Lopuksi työssä tarkastellaan monihyppyisen matkapuhelinverkon uutta arkkitehtuuria, jossa monihyppylähetykset suoritetaan viivesietoisella verkolla ja esitetään uusia ratkaisuja multimediasisällön monilähetysten tehokkuuden parantamiseksi. Työssä saadut tulokset osoittavat, että ehdotetut algoritmit parantavat järjestelmien suorituskykyä verrattuna aiemmin tiedossa olleisiin tuloksiin. Työn tuloksilla voidaan olettaa myös olevan suuri vaikutus tulevaisuuden matkapuhelinverkkojen analysointiin ja suunnitteluun

APA, Harvard, Vancouver, ISO, and other styles

22

Tajtehranifard, Hasti. "Incident duration modelling and system optimal traffic re-routing." Thesis, Queensland University of Technology, 2017. https://eprints.qut.edu.au/110525/1/Hasti_Tajtehranifard_Thesis.pdf.

Full text

Abstract:

Traffic incidents are among the most significant contributory factors to congestion, particularly in metropolitan areas. In this dissertation, we have developed state-of-the-art statistical models to provide in-depth insights into how various incident-specific characteristics and the associated temporal and spatial determinants impact freeway incident durations. Next, we have proposed, developed and tested two novel and computationally efficient System Optimal incident traffic re-routing algorithms that provide optimal traffic flow patterns, for minimized total system travel time. Specifically, a single-destination System Optimal Dynamic Traffic Assignment model and a multi-destination System Optimal Quasi-Dynamic Traffic Assignment model are proposed, developed and demonstrated to improve total system travel times, both under incident-free and incident scenarios.

APA, Harvard, Vancouver, ISO, and other styles

23

Majid, Hirsh. "Contribution à l'estimation et à la commande des systèmes de transport intelligents." Thesis, Artois, 2014. http://www.theses.fr/2014ARTO0203/document.

Full text

Abstract:

Les travaux présentés dans ce mémoire de thèse s’inscrivent dans le cadre des Systèmes de TransportIntelligents (STI). Bien que les premières études sur ces systèmes ont commencé dans les années 60, leurdéveloppement reposant sur les techniques de l’information et de la communication, a atteint sa maturitédans le début des années 80. Les STI, sont composés de différents systèmes et intègrent différents concepts(systèmes embarqués, capteurs intelligents, autoroutes intelligentes, . . .) afin d’optimiser le rendementdes infrastructures routières et répondre aux problèmes quotidiens des congestions. Ce mémoire présentequatre contributions dans le cadre du trafic routier et aborde les problèmes de l’estimation et de lacommande afin d’éliminer les problèmes de congestions « récurrentes ». Le premier point traite unproblème crucial dans le domaine des STI qui est celui de l’estimation. En effet, la mise en oeuvre delois de commande pour réguler le trafic impose de disposer de l’ensemble des informations concernantl’évolution de l’état du trafic. Dans ce contexte, deux algorithmes d’estimation sont proposés. Le premierrepose sur l’emploi du modèle METANET et les techniques de modes de glissement d’ordre supérieur. Lesecond est basé sur les CTM (Cell Transmission Models). Plusieurs études comparatives avec les filtresde Kalman sont proposées. La seconde contribution concerne la régulation du trafic. L’accent est mis surle contrôle d’accès isolé en utilisant les algorithmes issus du mode de glissement d’ordre supérieur. Cettecommande est enrichie en introduisant une commande intégrée combinant le contrôle d’accès et le routagedynamique. L’ensemble des résultats, validé par simulation, est ensuite comparé aux stratégies classiquesnotamment le contrôle d’accès avec l’algorithme ALINEA. La troisième contribution traite des problèmesde coordination. En effet, l’objectif est d’appliquer le principe de la commande prédictive pour contrôlerplusieurs rampes d’accès simultanément. L’ensemble des contributions ont été validées en utilisant desdonnées réelles issues en grande partie de mesures effectuées sur des autoroutes françaises. Les résultatsobtenus ont montré un gain substantiel en termes de performances tels que la diminution du trajet, dutemps d’attente, de la consommation énergétique, ainsi que l’augmentation de la vitesse moyenne. Cesrésultats permettent d’envisager plusieurs perspectives nouvelles de développement des recherches dansce domaine susceptibles d’apporter des solutions intéressantes The works presented in this PhD dissertation fit into the framework of Intelligent TransportationSystems. Although the beginnings of these systems have started since the 60s, their development, basedon information and communication technologies, has reached maturity during the early 80s. The ITS usesthe intelligence of different systems (embedded systems, intelligents sensors, intelligents highways, etc.)in order to optimize road infrastructures performances and respond to the daily problems of congestions.The dissertation presents four contributions into the framework of road traffic flow and tackles theestimation and control problems in order to eliminate or at least reduce the “recurrent" congestionsphenomena. The first point treats the problem of traffic state estimation which is of most importance inthe field of ITS. Indeed, the implementation and performance of any control strategy is closely relatedto the ability to have all needed information about the traffic state describing the dynamic behavior ofthe studied system. Two estimation algorithms are then proposed. The first one uses the “metanet"model and high order sliding mode techniques. The second is based on the so-called Cell TransmissionModels. Several comparative studies with the Kalman filters, which are the most used in road traffic flowengineering, are established in order to demonstrate the effectiveness of the proposed approaches. Thethree other contributions concern the problem of traffic flow control. At first, the focus is on the isolatedramp metering using an algorithm based on the high order sliding mode control. The second contributiondeals with the dynamic traffic routing problem based on the high order sliding mode control. Such controlstrategy is enriched by introducing the concept of integration, in the third contribution. Indeed, integratedcontrol consists of a combination of several traffic control algorithms. In this thesis the proposed approachcombines an algorithm of on-ramp control with a dynamic traffic routing control. The obtained results arevalidated via numerical simulations. The validated results of the proposed isolated ramp metering controlare compared with the most used ramp metering strategy : ALINEA. Finally, the last contributiontreats the coordination problems. The objective is to coordinate several ramps which cooperate andchange information in order to optimize the highway traffic flow and reduce the total travel time in theapplied area. All these contributions were validated using real data mostly from French freeways. Theobtained results show substantial gains in term of performances such as travel time, energetic consumptiondecreasing, as well as the increasing in the mean speed. These results allow to consider several furtherworks in order to provide more interesting and efficient solutions in the ITS field

APA, Harvard, Vancouver, ISO, and other styles

24

Lamontagne, Luc D. "Investigation of packet loss reduction methods and decentralization for dynamic routing in packet-switching networks." Thesis, University of Ottawa (Canada), 1990. http://hdl.handle.net/10393/5683.

Full text

Abstract:

In this thesis, we slightly modify a known routing model in packet-switching networks. Those modifications give priority to messages transiting in the network (internal) over external arrivals (users) incoming to each node while reducing the number of lost packets. Mathematical programs are developed for the multiple and single buffer node models. Those take into account line capacities, finite buffers and channel errors during transmission. We investigate a simple decentralized routing policy, based on the proposed centralized model with multiple buffers, where partial information is available from neighboring nodes only. Integer linear programming is used to optimally solve the routing problem for each of the models studied. Simulation, conducted on a 5-node network, illustrates the impact of these modifications.

APA, Harvard, Vancouver, ISO, and other styles

25

Ghosal, Subhabrata. "Object Oriented Simulation of Agent Based Flexible Manufacturing System with Dynamic Routing and Scheduling." Ohio University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1438812428.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Coral, Daniel Bustos. "A cartographic approach to the dynamic vehicle routing problem with time windows and stochastic customers." Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-29102018-160027/.

Full text

Abstract:

This dissertation presents a cartographic approach to the dynamic vehicle routing problem with time windows and stochastic customers (DVRPTWSC). The objectives are to minimize the total travel time and maximize the number of new requests served. Addressing the DVRPTWSC requires solving the vehicle routing problem with time windows (VRPTW). A memetic algorithm (MA) for the VRPTW is proposed. The MA prunes the search space using the information gathered by a clustering procedure, which is applied to customers spatial data. The cartographic approach to the DVRPTWSC is incorporated into a multiagent system where a dispatcher agent plans the routes for vehicle agents. Before creating the initial routing plan, a cartographic processing is applied. This procedure uses hierarchical clustering to divide the region where customers are located into a hierarchy of nested regions. The initial routing plan considers known requests and potential requests sampled from known probability distributions. It is created using the search operators of the MA, which in turn use the information obtained from the hierarchical clustering to perform the search. Over the planning horizon, the dispatcher updates the routing plan: Potential requests that were included in the initial routing plan and do not materialize are removed and new requests are processed using the assignation of requests based on nested regions (ARNR). The ARNR procedure is aimed at reducing the number of vehicles considered for serving new requests. It tries to assign the requests among the vehicles that can serve them at low detour costs. The nested regions created in the cartographic processing are used to identify such vehicles. Experimental results show that the proposed MA performs competitively with state-of-the-art heuristics for the VRPTW. The proposed approach to the DVRPTWSC outperforms approaches that do not include potential requests in the initial routing plan. The use of the ARNR procedure significantly reduces the number of vehicles considered for serving new requests, and it yields solutions similar to those obtained when considering all vehicles in operation. The proposed approach performs consistently under three levels of dynamism: low, medium, and high. Esta dissertação apresenta uma abordagem cartográfica para o problema de roteamento de veículos dinâmico com janelas de tempo e clientes estocásticos (DVRPTWSC, por sua sigla em inglês). Os objetivos considerados são minimizar o tempo total de viagem e maximizar o número de pedidos novos atendidos. Para abordar o DVRPTWSC é necessário resolver o problema de roteamento de veículos com janelas de tempo (VRPTW, por sua sigla em inglês). Assim, para tratar o VRPTW propõe-se um algoritmo memético (MA, por sua sigla em inglês). O MA reduz o espaço de busca usando informação obtida por meio de um procedimento de clusterização, o qual é aplicado aos dados espaciais dos clientes. Para o DVRPTWSC, a abordagem cartográfica é incorporada em um sistema multiagente, no qual um agente roteirizador planeja as rotas para os agentes veículos. O processamento cartográfico é aplicado antes de criar o plano de rotas inicial para o DVRPTWSC. Este procedimento usa clusterização hierárquica para dividir a região onde estão os clientes em uma hierarquia de regiões encaixadas. O plano de rotas inicial considera pedidos conhecidos e pedidos potenciais amostrados de distribuições de probabilidade conhecidas. Para obter o plano de rotas inicial, usam-se os operadores de busca do MA, os quais utilizam a informação obtida da clusterização hierárquica para fazer a busca. Ao longo do horizonte de planejamento, o roteirizador atualiza o plano de rotas: Pedidos potenciais que foram considerados no plano de rotas inicial e que não foram consolidados são removidos e novos pedidos são incluídos usando o procedimento assignation of requests based on nested regions (ARNR). O procedimento ARNR visa reduzir o número de veículos considerados para atender novos pedidos. Para isso, tenta designar os novos pedidos aos veículos disponíveis para o atendimento que possuem os menores custos de desvio da rota pré-determinada. As regiões encaixadas criadas no processamento cartográfico são utilizadas para identificar esses veículos. Para o VRPTW, resultados experimentais mostram que o MA proposto é competitivo com métodos do estado da arte. A abordagem proposta para o DVRPTWSC supera abordagens que não incluem pedidos potenciais no plano de rotas inicial. O uso do procedimento ARNR reduz significativamente o número de veículos considerados para atender novos pedidos, e produz soluções similares às produzidas quando se consideram todos os veículos em operação. A abordagem desenvolvida para o DVRPTWSC tem um desempenho consistente para três níveis de dinamismo: baixo, médio e alto.

APA, Harvard, Vancouver, ISO, and other styles

27

Mariotte, Guilhem. "Dynamic Modeling of Large-Scale Urban Transportation Systems." Thesis, Lyon, 2018. http://www.theses.fr/2018LYSET010/document.

Full text

Abstract:

La congestion en milieu urbain est un enjeu majeur que ce soit d’un point vue économique, social ou environnemental. À court et moyen terme, l’utilisation de la simulation dynamique du trafic routier peut permettre d’analyser et de guider des politiques d’optimisation des infrastructures existantes. Aujourd’hui, du fait de la complexité des systèmes de transport, les outils de modélisation classiques sont limités à des échelles géographiques peu étendues (de l’ordre du quartier). À grande échelle, le temps de calcul devient rapidement un facteur limitant tout comme le calibrage et la scénarisation. Néanmoins les dernières décennies ont vu l’apparition d’une nouvelle génération de modèles bien adaptés aux métropoles urbaines. Ceux-ci sont basés sur une relation phénoménologique entre la production de déplacements et le nombre de véhicules dans une zone spatiale d’un réseau routier, appelée Diagramme Fondamental de Zone (Macroscopic Fundamental Diagram, MFD). Cette relation, validée empiriquement sur de nombreuses villes, a permis d’étudier différentes méthodes de contrôle du trafic pour une ville entière, mais a été peu utilisée à des fins de prévision de la congestion. L’objectif de cette thèse est de proposer un premier outil opérationnel de simulation et d’analyse des grands réseaux de métropoles, en utilisant et développant les modèles de trafic basés sur la relation MFD. Cet outil doit posséder un cadre théorique cohérent qui puisse convenir à des applications telles que la prévision d’états de trafic, le développement de nouvelles politiques de contrôle, l’estimation de pollutions liées au trafic, etc. Les contributions de la thèse portent sur deux aspects. Le premier est l’analyse des propriétés mathématiques et physiques des modèles existants, en incluant une formalisation complète de la gestion de plusieurs longueurs de parcours au sein d’une même zone urbaine. En particulier, cette formalisation traite de la distinction des trajets internes à la zone et des problèmes de flux convergents et divergents pour les trajets traversant la zone lorsque la congestion se propage d’une zone à l’autre. Le deuxième aspect est la proposition d’un nouveau modèle basé sur la distance individuelle parcourue à l’intérieur d’une zone urbaine (trip-based). Cette approche permet d’individualiser les usagers (auparavant représentés sous forme de flux continus) et donc de définir plus finement leurs caractéristiques, en vue de coupler leurs déplacements à des modèles d’affectations sur différentes routes. Enfin, des exemples d’application illustrant diverses collaborations sont donnés en dernière partie de la thèse. La simulation du trafic sur l’aire urbaine du Grand Lyon (France) y est présentée, ainsi que de nouveaux modules de modélisation de la recherche de parking ou de contrôle périphérique. Cette thèse est partie intégrante d’un projet européen ERC intitulé MAGnUM : Approche multi-échelle et multimodale de la modélisation du trafic pour une gestion durable de la mobilité urbaine Congestion in urban areas has become a major issue in terms of economic, social or environmental impact. For short or mid term, using dynamic road traffic simulation can help analyzing and providing guidelines to optimization policies of existing infrastructures. Today, because of the complexity of transport systems, classical modeling tools are limited to small geographical areas (of a district size). Computational time, together with simulation calibration, are notably very constraining at large scales. However, a new generation of models designed for metropolitan areas has arisen over the past decades. These models are based on a phenomenological relationship between travel production and the number of vehicles in a given spatial area of a road network, known as the Macroscopic Fundamental Diagram (MFD). This relationship, supported by empirical evidences from several cities around the world, has allowed the study of different traffic control schemes at a whole city scale, but was rarely used for traffic state forecasting. The aim of this PhD is to propose an efficient modeling tool, based upon the concept of MFD, to simulate and analyze traffic states in large metropolitan areas. The theoretical framework of this tool must be consistent and applicable for traffic state forecasting, development of new control policies, traffic emission estimation, etc. There are two major contributions in this PhD. The first one is analyzing the mathematical and physical properties of existing models, and formalizing the dynamics of several trip lengths inside the same urban zone. In particular, this formalization distinguishes between internal trips and trips crossing the zone. Flow merging and diverging issues are also addressed when congestion propagates from one zone to another. The second contribution is proposing a new trip-based model based on individual traveled distance. This approach allows to treat users independently (previously represented with continuous flows), and thus to define their characteristics more precisely to couple their trips with assignment models on different paths. Finally, examples of application from various collaborations are given in the last part of this thesis. It includes a simulation study of the Grand Lyon urban area (France), as well as new modules to simulate search-for-parking or perimeter control. This PhD is part of a European ERC project entitled MAGnUM: Multiscale and Multimodal Traffic Modeling Approach for Sustainable Management of Urban Mobility

APA, Harvard, Vancouver, ISO, and other styles

28

Nguyen, Ho Si Hung. "Développement d'une stratégie de regroupement dynamique d'actions de maintenance pour un système de production géographiquement dispersé." Thesis, Université de Lorraine, 2019. http://www.theses.fr/2019LORR0131/document.

Full text

Abstract:

Ces dernières années, un nouveau type de système de production nommé système de production géographiquement dispersé (GDPS) est prôné par de nombreuses entreprises manufacturières internationales. Par cette vision « dispersée », il présente un certain nombre d'avantages tels que l'économie des coûts du produit livré (puisque proche des clients), l'amélioration de la qualité des services (délais de livraison courts, services après-vente de haute qualité) favorisant la pérennité et la compétitivité des entreprises dans un contexte de compétition mondiale. Cependant l’exploitation multi-sites d’un GPDS est confronté à de nombreux défis concernant les normes, les réglementations, la maîtrise des flux de production, et en particulier la planification et l'optimisation de la maintenance en raison de la dispersion géographique des sites de production. Sur ce dernier point et plus globalement la définition d’une stratégie de maintenance adaptée au GDPS, peu d'études ont été menées compte tenu de la jeunesse du sujet et de la complexité des GDPSs (ex. multi-sites, multi-composants). Cette thèse se positionne donc sur ce sujet émergeant avec comme objectif de développer une stratégie de maintenance de regroupement dynamique pour un GDPS en tenant compte de dépendances à la fois aux niveaux composants et sites de production (dépendances économique et géographique) et des impacts des contextes dynamiques (à savoir, taux de détérioration variable des composants, modification des itinéraires de maintenance, possibilités de maintenance, etc.) auxquels il est soumis. Dans cette stratégie, les itinéraires de maintenance et l'ordonnancement sont considérés conjointement dans un modèle global. Le modèle vise à trouver un plan optimal de maintenance et de routage des ressources de maintenance. A cette fin, une structure de coûts et un modèle de dépendance qui prend en compte conjointement la dépendance économique et géographique sont formulés. Ils servent de base à l'élaboration du modèle global de planification et d'ordonnancement de la maintenance et du routage. De plus, pour la recherche de la solution optimale, des algorithmes d’optimisation basés sur l'algorithme génétique et l'algorithme Branch and Bound sont proposés. Enfin, une étude numérique est investiguée pour évaluer la performance, les avantages et aussi les limites de la stratégie proposée In the recent years, the Geographically Dispersed Production System (GDPS) with a number of advantages such as saving the product delivered costs (closed to the clients), improving quality of services (short delivery time, high quality after-sales services) has been extensively developed by many manufacturing companies to ensure their competitiveness. In operation, the GPDS faces many challenges concerning standards, regulation, production management, and especially maintenance planning and optimization due to the geographical dispersion of production sites. However, few studies have been developed for maintenance strategies of GDPSs. To face this challenge, the main objective of this thesis is to develop a dynamic grouping maintenance strategy for a GDPS with consideration of dependencies between at both component and site level (economic, geographical dependencies) and impacts of dynamic contexts (i.e. varying deterioration rate of components, change of maintenance routes, maintenance opportunities, etc.). In this strategy, maintenance routing and scheduling are jointly considered in a global model. The model aims at finding an optimal maintenance and routing plan. For this purpose, a cost structure and a dependence model jointly considering economic and geographical dependence are formulated. They are used as a basis for the development of the global model of maintenance routing and scheduling. In addition, to find a joint optimal maintenance and routing plan, advanced algorithms using jointly Genetic Algorithm and Branch and Bound are proposed. Finally, a numerical study is investigated to evaluate the performance and the advantage as well as limits of the proposed maintenance strategy

APA, Harvard, Vancouver, ISO, and other styles

29

Horne, Kyle. "Parallezation of Performance Limiting Routines in the Computational Fluid Dynamics General Notation System Library." DigitalCommons@USU, 2009. https://digitalcommons.usu.edu/etd/522.

Full text

Abstract:

The Computational Fluid Dynamics General Notation System provides a unified way in which computational fluid dynamics data can be stored, but does not support the parallel I/O capabilities now available from version five of the Hierarchical Data Format library which serves as a back end for he standard. To resolve this deficiency, a new parallel extension library has been written and benchmarked for this work which can write files compliant with the standard using parallel file access modes. When using this new library, the write performance shows an increase of four-fold in some cases when compared to the same hardware operating in serial. Additionally, the use of parallel I/O allows much larger cases to be written since the problem is scattered across many nodes of a cluster, whose aggregate memory is much greater than that found on a single machine. These developments will allow computational fluid dynamics simulations to execute faster, since less time will be spent waiting for each time step to finish writing, as well prevent the need for lengthy reconstruction of data after the completion of a simulation.

APA, Harvard, Vancouver, ISO, and other styles

30

Diao, Xunxing. "A resource-aware embedded commucation system for highly dynamic networks." Phd thesis, Université Blaise Pascal - Clermont-Ferrand II, 2011. http://tel.archives-ouvertes.fr/tel-00715649.

Full text

Abstract:

Chaque année en Europe, 1.300.000 accidents de la route ont comme conséquence 1.700.000 blessés. Le coût financier d'accidents de la route est évalué à 160 milliards d'euros (approximativement le même coût aux Etats-Unis). VANET (Vehicular Ad-hoc NETwork) est une des technologies clés qui peut permettre de réduire d'une façon significative le nombre d'accidents de la route (e.g. message d'urgence signalant la présence d'un obstacle ou d'un véhicule en cas de brouillard). En plus de l'amélioration de la sécurité et du confort des conducteurs et des passagers, VANET peut contribuer à beaucoup d'applications potentielles telles que la prévision et la détection d'embouteillages, la gestion d'infrastructure de système de transport urbain (e.g. système de transport intelligent multimodal) etc. Dans cette thèse, je présenterai un système embarqué dédié à la communication inter-véhicule particulièrement pour les applications sécuritaires de passagers et de conducteurs. Nos efforts de recherche et de développement sont centrés sur deux principaux objectifs : minimiser le temps de latence intra-noeud et le délai de communication inter-véhicule en prenant en compte le changement dynamique du VANET. De ce fait pour atteindre ces objectifs, des nouvelles approches (e.g. inter-couche 'Cross-layering') ont été explorées pour respecter les contraintes de ressource (QoS, mémoire, CPU et énergie de la communication inter-véhicule) d'un système embarqué à faible coût. Le système de communication embarqué proposé comporte deux composants logiciels principaux : un protocole de communication dénommé CIVIC (Communication Inter Véhicule Intelligente et Coopérative) et un système d'exploitation temps réel appelé HEROS (Hybrid Event-driven and Real-time multitasking Operating System). CIVIC est un protocole de communication géographique à faible consommation énergétique et à faible temps de latence (délai de communication). HEROS gère contextuellement l'ensemble du système (matériel et logiciel) en minimisant le temps de latence et la consommation des ressources (CPU et mémoire). En outre, le protocole de communication CIVIC est équipé d'un système de localisation LCD-GPS (Low Cost Differential GPS). Pour tester et valider les différentes techniques et théories, la plateforme matérielle LiveNode (LImos Versatile Embedded wireless sensor NODE) a été utilisée. En effet, la plateforme LiveNode permet de développer et de prototyper rapidement des applications dans différents domaines. Le protocole de communication CIVIC est basé sur la technique de 'broadcast' à un saut ; de ce fait il est indépendant de la spécificité du réseau. Pour les expérimentations, seule la norme d'IEEE 802.15.4 (ZigBee) a été choisie comme médium d'accès sans fil. Il est à noter que le médium d'accès sans fil ZigBee a été adopté comme le médium standard pour les réseaux de capteurs sans fil (RCSFs) et le standard 6LoWPAN ; car il est peu coûteux et peu gourmand en énergie. Bien que le protocole de communication à l'origine soit conçu pour répondre aux exigences de VANET, ses domaines d'application ne sont pas limités à VANET. Par exemple il a été utilisé dans différents projets tels que MOBI+ (système de transport urbain intelligent) et NeT-ADDED (projet européen FP6 : agriculture de précision). Les VANETs et les RCSFs sont les réseaux fortement dynamiques, mais les causes de changement topologique de réseau sont différentes : dans le réseau VANET, il est dû à la mobilité des véhicules, et dans le RCSF, il est dû aux pannes des noeuds sans fil. Il est à noter que le VANET et le RCSF sont généralement considérés comme un sous-ensemble du réseau MANET (réseau ad-hoc mobile). Cependant, ils sont réellement tout à fait différents du MANET classique, et leurs similitudes et différences seront expliquées en détail dans la thèse. La contribution principale de mes travaux est le protocole CIVIC, qui échange des messages en basant sur l'information géographique des noeuds (position). Les travaux relatifs de la thèse se concentreront sur les techniques, les problèmes et les solutions de routage géographique, mais d'autres techniques de routage seront également adressées. Quelques projets relatifs au protocole de communication ont été étudiés mais leur implémentation et les aspects d'expérimentation n'ont pas été détaillés. Enfin la thèse ne présente pas simplement les techniques et concepts adoptés, et les résultats de simulation, mais en outre, elle expliquera les aspects techniques importants pour la réalisation et l'expérimentation des différentes applications ainsi que les résultats concrets obtenus.

APA, Harvard, Vancouver, ISO, and other styles

31

Gavigan, Kevin Charles. "The design, development and application of a combined connectionist expert system and 'Pocket' Boltzmann machine approach to the dynamic customer assignment and vehicle routing problem." Thesis, University of Warwick, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.245939.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Nguyen, Ho Si Hung. "Développement d'une stratégie de regroupement dynamique d'actions de maintenance pour un système de production géographiquement dispersé." Electronic Thesis or Diss., Université de Lorraine, 2019. http://www.theses.fr/2019LORR0131.

Full text

Abstract:

Ces dernières années, un nouveau type de système de production nommé système de production géographiquement dispersé (GDPS) est prôné par de nombreuses entreprises manufacturières internationales. Par cette vision « dispersée », il présente un certain nombre d'avantages tels que l'économie des coûts du produit livré (puisque proche des clients), l'amélioration de la qualité des services (délais de livraison courts, services après-vente de haute qualité) favorisant la pérennité et la compétitivité des entreprises dans un contexte de compétition mondiale. Cependant l’exploitation multi-sites d’un GPDS est confronté à de nombreux défis concernant les normes, les réglementations, la maîtrise des flux de production, et en particulier la planification et l'optimisation de la maintenance en raison de la dispersion géographique des sites de production. Sur ce dernier point et plus globalement la définition d’une stratégie de maintenance adaptée au GDPS, peu d'études ont été menées compte tenu de la jeunesse du sujet et de la complexité des GDPSs (ex. multi-sites, multi-composants). Cette thèse se positionne donc sur ce sujet émergeant avec comme objectif de développer une stratégie de maintenance de regroupement dynamique pour un GDPS en tenant compte de dépendances à la fois aux niveaux composants et sites de production (dépendances économique et géographique) et des impacts des contextes dynamiques (à savoir, taux de détérioration variable des composants, modification des itinéraires de maintenance, possibilités de maintenance, etc.) auxquels il est soumis. Dans cette stratégie, les itinéraires de maintenance et l'ordonnancement sont considérés conjointement dans un modèle global. Le modèle vise à trouver un plan optimal de maintenance et de routage des ressources de maintenance. A cette fin, une structure de coûts et un modèle de dépendance qui prend en compte conjointement la dépendance économique et géographique sont formulés. Ils servent de base à l'élaboration du modèle global de planification et d'ordonnancement de la maintenance et du routage. De plus, pour la recherche de la solution optimale, des algorithmes d’optimisation basés sur l'algorithme génétique et l'algorithme Branch and Bound sont proposés. Enfin, une étude numérique est investiguée pour évaluer la performance, les avantages et aussi les limites de la stratégie proposée In the recent years, the Geographically Dispersed Production System (GDPS) with a number of advantages such as saving the product delivered costs (closed to the clients), improving quality of services (short delivery time, high quality after-sales services) has been extensively developed by many manufacturing companies to ensure their competitiveness. In operation, the GPDS faces many challenges concerning standards, regulation, production management, and especially maintenance planning and optimization due to the geographical dispersion of production sites. However, few studies have been developed for maintenance strategies of GDPSs. To face this challenge, the main objective of this thesis is to develop a dynamic grouping maintenance strategy for a GDPS with consideration of dependencies between at both component and site level (economic, geographical dependencies) and impacts of dynamic contexts (i.e. varying deterioration rate of components, change of maintenance routes, maintenance opportunities, etc.). In this strategy, maintenance routing and scheduling are jointly considered in a global model. The model aims at finding an optimal maintenance and routing plan. For this purpose, a cost structure and a dependence model jointly considering economic and geographical dependence are formulated. They are used as a basis for the development of the global model of maintenance routing and scheduling. In addition, to find a joint optimal maintenance and routing plan, advanced algorithms using jointly Genetic Algorithm and Branch and Bound are proposed. Finally, a numerical study is investigated to evaluate the performance and the advantage as well as limits of the proposed maintenance strategy

APA, Harvard, Vancouver, ISO, and other styles

33

Kuo, Dao-Cheng. "Design of a dynamic management capability for the Server and Agent Based Active Network Management (SAAM) system to support requests for guaranteed quality of service traffic routing and recovery." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2000. http://handle.dtic.mil/100.2/ADA383447.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Nguyen, Le-Duy-Lai. "Contrôle distribué multi-couche des systèmes complexes avec contraintes de communication : application aux systèmes d'irrigation." Thesis, Université Grenoble Alpes (ComUE), 2017. http://www.theses.fr/2017GREAT108/document.

Full text

Abstract:

Cette thèse présente une contribution sur les problèmes de contrôle de réseaux d'irrigations en tenant compte des contraintes de communication grâce à une approche multicouches d’intelligence distribuée. Les analyses détaillées de chaque couche avec les résultats analytiques et les simulations seront décrites dans les différents chapitres. Ils mettent l'accent sur l'intérêt de l'approche multicouches, plus précisément sur son efficacité et sa fiabilité pour la supervision, l'optimisation multi-objectifs et le contrôle coopératif distribué sur des systèmes complexes de transport d'eau.La première couche analysé est le réseau hydraulique composé de canaux d’écoulements à surface libre, de sous-réseaux maillés de tuyaux sous pression et des structures hydrauliques (pompes vannes, ..). En intégrant les équations de Saint-Venant pour décrire l’écoulement physique des fluides en surface libre et la méthode Lattice Boltzmann pour la simulation du fluide, nous obtenons un modèle non linéaire discret pour les canaux à surface libre. Les structures hydrauliques sont généralement traitées comme des limites internes des biefs (tronçons) et modélisées par des relations entre les variables de flux et de pression.Permettant l'échange d'informations entre les éléments du système de contrôle, le réseau de communication sera considéré comme la deuxième couche. La résolution des problèmes d’hétérogénéités des systèmes et des communications (par exemple les retards de diffusion dans le réseau, la perte de paquets, la consommation d'énergie) sera étudié en introduisant une architecture de réseau hybride avec un routage dynamique basé sur les exigences de Qualité de Service (QoS) des applications de contrôle. Pour le routage dynamique dans le réseau, une composition pondérée de certaines métriques standards est proposée afin que le protocole de routage utilisant cette métrique composite converge sans boucle avec une « route » optimum. Grâce à différents scénarios de simulation, plusieurs critères de performance du réseau ont été évalués. La comparaison des résultats de simulation permet de valider l'intérêt de cette approche de composition pour le routage dynamique.Une troisième couche propose un système de contrôle réactif optimal développé pour la régulation du réseau d'irrigation dans un modèle étendue à grande échelle : Distributed Cooperative Model Predictive Control (DCMPC). Cette partie aborde la mise en œuvre de différentes stratégies de contrôle (centralisées, décentralisées et distribuées) et intègre la communication coopérative entre les contrôleurs MPC locaux afin d’améliorer les performances global es du système. La gestion de la divergence dans l'échange d'informations entre les contrôleurs est considérée comme un problème de consensus et résolue en utilisant un protocole de consensus asynchrone. Cette approche du contrôle distribué basée sur le paradigme des systèmes multi-agents, fournit une solution garantissant que tous les contrôleurs aient une vue cohérente de certaines valeurs des données nécessaires pour le calcul de décision. Un cas d’application sur un canal d'irrigation est étudié dans les simulations. La comparaison des résultats de simulations valide les avantages de l'approche du contrôle distribué coopératif par rapport aux autres stratégies de contrôle This thesis presents control problems of irrigation network with communication constraints and a multi-layer approach to solve these problems in a distributed manner. Detailed discussions of each layer with analytical and simulation results are described throughout several chapters. They emphasize the potential interest of the multi-layer approach, more precisely its efficiency and reliability for supervision, multi-objective optimization and distributed cooperative control of complex water transport systems. Conventionally, the first layer to be considered is the hydraulic network composed of free-surface channels, hydraulic structures and mesh subnetwork of pressurized pipes. By coupling the Saint-Venant equations for describing the physics of free-surface ﬂuid and the Lattice Boltzmann method for the ﬂuid simulation, a discrete-time nonlinear model is obtained for channel reaches. The hydraulic structures are usually treated as internal boundaries of reaches and modeled by algebraic relationships between the ﬂow and pressure variables. To enable the exchange of information among the control system’s components, a communication network is considered in the second layer. Solving challenging problems of heterogeneous devices and communication issues (e.g., network delay, packet loss, energy consumption) is investigated in this thesis by introducing a hybrid network architecture and a dynamic routing design based on Quality of Service (QoS) requirements of control applications. For network routing, a weighted composition of some standard metrics is proposed so that the routing protocol using the composite metric achieves convergence, loop-freeness and path-optimality properties. Through extensive simulation scenarios, different network performance criteria are evaluated. The comparison of simulation results can validate the interest of this composition approach for dynamic routing. Finally, the third layer introduces an optimal reactive control system developed for the regulatory control of large-scale irrigation network under a Distributed Cooperative Model Predictive Control (DCMPC) framework. This part discusses the implementation of different control strategies (e.g., centralized, decentralized, and distributed strategies) and how the cooperative communication among local MPC controllers can be included to improve the performance of the overall system. Managing divergent (or outdated) information exchange among controllers is considered in this thesis as a consensus problem and solved by an asynchronous consensus protocol. This approach based on the multi-agent system paradigm to distributed control requires each controller to agree with its neighbors on some data values needed during action computation. For simulations, a particular benchmark of an irrigation channel is considered. The comparison of simulation results validate the benefits of the distributed cooperative control approach over other control strategies

APA, Harvard, Vancouver, ISO, and other styles

35

Mnassri, Radhia. "Réseaux de Petri Lots Triangulaires pour la modélisation mésoscopique et l'étude de la congestion dans le trafic routier." Thesis, Aix-Marseille, 2015. http://www.theses.fr/2015AIXM4376.

Full text

Abstract:

L'usage excessif des routes peut entraîner de nombreux inconvénients dont la pollution, les accidents et la congestion. Une solution accessible à court terme consiste à mettre en œuvre des systèmes de gestion de trafic. Dans ce cadre, nous proposons un formalisme, appelé Réseaux de Petri Lots Triangulaire, qui permet la modélisation et la simulation du trafic routier au niveau mésoscopique comme un système à événements discrets. Le RdPLots Triangulaire permet ainsi de décrire les caractéristiques globales du trafic routier: flux, densité et vitesse à travers la proposition d'une relation flux-densité triangulaire. Cette relation implique une modification de la dynamique des lots. Cette dynamique permet maintenant de représenter les deux états du trafic routier à savoir fluide et congestionné ainsi que les trois régimes dédiés au comportement libre, congestion et décongestion. Le calcul des flux instantanés des transitions est à présent réalisé par une méthode basée sur la technique de programmation linéaire en ajoutant une contrainte qui prend en compte l'état et le régime des lots. Pour modéliser des stratégies de contrôle telles que la variation de la vitesse limite (VSL), nous avons intégré au RdPLots Triangulaire des événements contrôlés qui permettent le changement de la vitesse maximale d'une place lot et le flux maximal d'une transition continue ou lot. Tous ces apports théoriques sont implémentés dans un logiciel que nous avons appelé SimuleauTri, sous lequel nous avons étudié des portions d'autoroute à partir des données réelles. Les résultats de simulation sont proches des mesures effectuées sur le terrain, et montrent la pertinence de RdPLots Triangulaire The excessive use of roads can cause many adverse effects including pollution, insecurity and congestion. The available short-term solution is the implementation of traffic management systems which optimize the flow and reduce congestion without needing additional infrastructures. In this context, we proposed a new formalism, called Triangular Batches Petri Nets (Triangular BPN), which combines modeling and simulation of traffic in mesoscopic level as a discrete event system. The Triangular BPN describing the overall characteristics of the road traffic such as flow, density, speed by representing a new triangular relation flow-density. This relation implies the modification of batches dynamic, which is now used to represent the two road traffic states : fluid and congested, as well as the three behaviors :free, congestion and decongestion. The calculation of the instantaneous firing flows is achieved by adding a constraint that takes into account the state and behavior of batches. A set of controlled events integrated to the Triangular BPN, that allow the variation of the maximum speed of batch place and the maximum flow of batch and continuous transition. These controlled events used to model the control strategies, such as variable speed limit (VSL). All these theoretical contributions implemented in a software that is called SimuleauTri and used to study a motorway portions from real data. The simulation results are close to the measurements on the ground and show the pertinence of Triangular BPN

APA, Harvard, Vancouver, ISO, and other styles

36

Salazar, Rosales Leandro Julian. "Analysing uncertainty and delays in aircraft heavy maintenance." Thesis, University of Manchester, 2016. https://www.research.manchester.ac.uk/portal/en/theses/analysing-uncertainty-and-delays-in-aircraft-heavy-maintenance(6a64acb7-6780-4dc4-acc5-1497bcf8654b).html.

Full text

Abstract:

This study investigates the influence of unscheduled maintenance activities on delays and disruptions during the execution of aircraft heavy maintenance services by developing a simulation model based on Systems Dynamics (SD) and supported by an Evidential Reasoning (ER) rule model. The SD model studies the complex interrelationship between scheduled and unscheduled tasks and its impact on delays during a maintenance service execution. It was found that the uncertain nature of the unscheduled maintenance tasks hinders the planning, control and allocation of resources, increasing the chances to miss deadlines and incur in cost overruns. Utilising causal loop diagrams and SD simulation the research explored the relevance that the resource allocation management, the precise estimation of the unscheduled tasks and their prompt identification have on the maintenance check duration. The influence that delays and attitudes in the decision-making process have on project performance was also investigated. The ER rule model investigates the uncertainty present during the execution of a maintenance check by providing a belief distribution of the expected unscheduled maintenance tasks. Through a non-parametric discretisation process, it was found that the size and array of distribution intervals play a key role in the model estimation accuracy. Additionally, a sensitivity analysis allowed the examination of the significance that the weight, reliability and dependence of the different pieces of evidence have on model performance. By analysing and combining historical data, the ER rule model provides a more realistic and accurate prediction to analyse variability and ambiguity. This research extends SD capabilities by incorporating the ER rule for analysing system uncertainty. By using the belief distributions provided by the ER model, the SD model can simulate the variability of the process given certain pieces of evidence. This study contributes to the existing knowledge in aircraft maintenance management by analysing, from a different perspective, the impact of uncertain unscheduled maintenance activities on delays and disruptions through an integrated approach using SD and the ER rule. Despite the fact that this research focuses on studying a particular problem in the airline industry, the findings and conclusions obtained could be used to understand and address problems embodying similar characteristics. Therefore, it can be argued that, due to the close similarities between the heavy maintenance process and complex projects, these contributions can be extended to the Project Management field.

APA, Harvard, Vancouver, ISO, and other styles

37

Andersson, Oscar, and Genefra Pamin. "FROM ABRUPT CHANGE TO DAILY ROUTINES : The organizational effect of one year with COVID-19." Thesis, Umeå universitet, Institutionen för informatik, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-185664.

Full text

Abstract:

The way we work has changed rapidly since the COVID-19 pandemic turned the world upside down. Remote work and telecommuting have become the new norm, a trend many of us have not asked or wished for. In this sense, this research is a reassessment of how IT companies in Sweden approached and managed the sudden transition to working remotely. With the support of previous literature on the topics of crisis management, organizational routine dynamics, and telecommuting, a set of seven semi-structured interviews were conducted to better understand the long-term challenges companies face during a crisis-induced shift into remote work. Our research reveals that organizations manage to quickly adapt the core business routines and operations, while social interactions and communication issues seem to be the biggest bottleneck when moving entirely remote. This leads to a perceived loss in overall productivity and the suffering of the work-life balance among all our respondents and their teams.

APA, Harvard, Vancouver, ISO, and other styles

38

Tchappi, haman Igor. "Dynamic Multilevel and Holonic Model for the Simulation of a Large-Scale Complex System with Spatial Environment : Application to Road Traffic Simulation." Thesis, Bourgogne Franche-Comté, 2020. http://www.theses.fr/2020UBFCA004.

Full text

Abstract:

De nos jours, avec l’émergence d’objets et de voitures connectés, les systèmes de trafic routier deviennent de plus en plus complexes et présentent des comportements hiérarchiques à plusieurs niveaux de détail. L'approche de modélisation multiniveaux est une approche appropriée pour représenter le trafic sous plusieurs perspectives. Les modèles multiniveaux constituent également une approche appropriée pour modéliser des systèmes complexes à grande échelle comme le trafic routier. Cependant, la plupart des modèles multiniveaux de trafic proposés dans la littérature sont statiques car ils utilisent un ensemble de niveaux de détail prédéfinis et ces représentations ne peuvent pas commuter pendant la simulation. De plus ces modèles multiniveaux considèrent généralement seulement deux niveaux de détail. Très peu de travaux se sont intéressés à la modélisation dynamique multiniveau de trafic.Cette thèse propose un modèle holonique multiniveau et dynamique du trafic à grande échelle.La commutation dynamique des niveaux de détail lors de l’exécution de la simulation permet d’adapter le modèle aux contraintes liées à la qualité des résultats ou aux ressources de calcul disponibles.La proposition étend l'algorithme DBSCAN dans le contexte des systèmes multi-agents holoniques. De plus, une méthodologie permettant la commutation dynamique entre les différents niveaux de détail est proposée. Des indicateurs multiniveaux basés sur l'écart type sont aussi proposés afin d'évaluer la cohérence des résultats de la simulation Nowadays, with the emergence of connected objects and cars, road traffic systems become more and more complex and exhibit hierarchical behaviours at several levels of detail. The multilevel modeling approach is an appropriate approach to represent traffic from several perspectives. Multilevel models are also an appropriate approach to model large-scale complex systems such as road traffic. However, most of the multilevel models of traffic proposed in the literature are static because they use a set of predefined levels of detail and these representations cannot change during simulation. Moreover, these multilevel models generally consider only two levels of detail. Few works have been interested on the dynamic multilevel traffic modeling.This thesis proposes a holonic multilevel and dynamic traffic model for large scale traffic systems. The dynamic switching of the levels of detail during the execution of the simulation allows to adapt the model to the constraints related to the quality of the results or to the available computing resources.The proposal extends the DBSCAN algorithm in the context of holonic multi-agent systems. In addition, a methodology allowing a dynamic transition between the different levels of detail is proposed. Multilevel indicators based on standard deviation are also proposed in order to assess the consistency of the simulation results

APA, Harvard, Vancouver, ISO, and other styles

39

Mercier, Magali. "Étude de différents aspects des EDP hyperboliques : persistance d’onde de choc dans la dynamique des fluides compressibles, modélisation du trafic routier, stabilité des lois de conservation scalaires." Thesis, Lyon 1, 2009. http://www.theses.fr/2009LYO10246/document.

Full text

Abstract:

On étudie dans ce travail des systèmes de lois de conservation hyperboliques. La première partie étudie le temps d'existence des solutions régulières et régulières par morceaux de la dynamique des fluides compressibles. Après avoir présenté l'état de l'art en matière de solutions régulières, on montre une extension d'un théorème de Grassin à des gaz de Van der Waals. On étudie ensuite les solutions ondes de chocs : on poursuit l'approche de T. T. Li pour estimer leur temps d'existence dans le cas isentropique à symétrie sphérique, et l'approche de Whitham afin d'obtenir une équation approchée vérifiée par la surface de discontinuité. Dans une deuxième partie, motivée par la modélisation d'un rond-point en trafic routier, on étudie une extension multi-classe du modèle macroscopique de Lighthill-Whitham-Richards sur une route infinie avec des jonctions. On différencie les véhicules selon leur origine et leur destination et on introduit des conditions aux bords adaptées au niveau des jonctions. On obtient existence et unicité d'une solution au problème de Riemann pour ce modèle. Des simulations numériques attestent que les solutions obtenues existent en temps long. On aborde enfin le problème de Cauchy par la méthode de front tracking. La dernière partie concerne les lois de conservation scalaires. La première question abordée est le contrôle de la variation totale de la solution et la stabilité des solutions faibles entropiques par rapport au flux et à la source. Ce résultat nous permet d'étudier des équations avec flux non-local. Une fois établi leur caractère bien posé, on montre la Gâteaux-différentiabilité du semi-groupe obtenu par rapport aux conditions initiales In this work, we study hyperbolic systems of balance laws. The first part is devoted to compressible fluid dynamics, and particularly to the lifespan of smooth or piecewise smooth solutions. After presenting the state of art, we show an extension to more general gases of a theorem by Grassin.We also study shock waves solutions: first, we extend T. T. Li's approach to estimate the time of existence in the isentropic spherical case; second, we develop Whitham's ideas to obtain an approximated equation satisfied by the discontinuity surface. In the second part, we set up a new model for a roundabout. This leads us to study a multi-class extension of the macroscopic Lighthill-Whitham-Richards' model. We study the traffic on an infinite road, with some points of junction. We distinguish vehicles according to their origin and destination and add some boundary conditions at the junctions. We obtain existence and uniqueness of a weak entropy solution for the Riemann problem. As a complement, we provide numerical simulations that exhibit solutions with a long time of existence. Finally, the Cauchy problem is tackled by the front tracking method. In the last part, we are interested in scalar hyperbolic balance laws. The first question addressed is the control of the total variation and the stability of entropy solutions with respect to flow and source. With this result, we can study equations with non-local flow, which do not fit into the framework of classical theorems. We show here that these kinds of equations are well posed and we show the Gâteaux-differentiability with respect to initial conditions, which is important to characterize maxima or minima of a given cost functional

APA, Harvard, Vancouver, ISO, and other styles

40

Tiendrebeogo, Telesphore. "Système dynamique et réparti de nommage à indirections multiples pour les communications dans l'Internet." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00841591.

Full text

Abstract:

Le routage dans Internet est basé sur des tables dites de routage, formées de blocs d'adresses IP. Cependant, la construction et la maintenance de telles tables de routage nécessitent l'utilisation de protocoles complexes qui ne passent pas à l'échelle en termes de mémoire et d'utilisation CPU. De plus, l'expérience montre que le plan d'adressage IP est insuffisant, car la sémantique d'une adresse IP est à la fois un identificateur et un localisateur. Dans nos travaux, nous proposons un système de réseau recouvrant pair-à-pair libre de toute contrainte topologique et utilisant des coordonnées virtuelles prises dans le plan hyperbolique nommé CLOAK (Covering Layer Of Abstract Knowledge en anglais). Les schémas de routages locaux basés sur des coordonnées virtuelles extraites du plan hyperbolique ont suscité un intérêt considérable ces dernières années. Dans cette thèse, nous proposons une nouvelle approche pour saisir le potentiel de la géométrie hyperbolique. L'objectif est de construire un système extensible et fiable pour créer et gérer des réseaux recouvrants dans Internet. Le système est implémenté comme une infrastructure pair-à-pair structuré basé sur les protocoles de la couche transport entre les pairs. Quant à l'organisation des données dans l'espace virtuel, nous employons la réplication pour améliorer la disponibilité et l'accessibilité des objets de l'overlay potentiellement instable. Nous avons implémenté et évalué différentes méthodes de réplication (réplication radiale, réplication circulaire).A l'aide de simulations, nous évaluons notre proposition à travers un certain nombre de métriques et nous montrons que les réseaux recouvrants pair-à-pair basés sur la géométrie hyperbolique ont de bonnes performances par rapport aux autres DHT existantes tout en introduisant flexibilité et robustesse dans les réseaux recouvrants dynamiques.

APA, Harvard, Vancouver, ISO, and other styles

41

Moukir, Sara. "High performance analysis for road traffic control." Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASG039.

Full text

Abstract:

La réduction des temps de trajet et de la consommation d'énergie dans les réseaux routiers urbains est cruciale pour le bien-être collectif et la durabilité environnementale. Depuis les années 1950, la modélisation du trafic a été un axe central de la recherche. Avec l'évolution des capacités informatiques, des simulations sophistiquées représentant fidèlement les complexités du trafic routier ont émergé, essentielles pour évaluer les technologies sans perturber le trafic réel.Les systèmes de transport deviennent plus complexes avec des informations en temps réel, nécessitant des modèles de simulation adaptés. Les simulations multi-agents, analysant les comportements individuels dans un environnement dynamique, sont particulièrement efficaces pour cette tâche, permettant de comprendre et de gérer le trafic urbain en représentant les interactions entre les voyageurs et leur environnement.Simuler de grandes populations de voyageurs dans les villes a longtemps été une tâche exigeante en termes de ressources informatiques. Les technologies avancées permettant la distribution des calculs sur plusieurs ordinateurs ont ouvert de nouvelles possibilités. Cependant, de nombreux simulateurs de mobilité urbaine n'exploitent pas pleinement ces architectures distribuées, limitant leur capacité à modéliser des scénarios complexes.L'objectif principal de cette recherche est d'améliorer la performance algorithmique et computationnelle des simulateurs de mobilité. Nous développons et validons des modèles de distribution génériques et reproductibles pouvant être adoptés par divers simulateurs de mobilité multi-agents, surmontant ainsi les barrières techniques pour analyser les systèmes de transport complexes dans des environnements urbains dynamiques.Nous utilisons le simulateur de trafic MATSim, reconnu pour la simulation de trafic multi-agents, pour tester nos méthodes génériques. Notre première contribution applique l'approche "Unite and Conquer" (UC) à MATSim. Cette méthode accélère les simulations en exploitant les architectures informatiques modernes. L'approche multiMATSim réplique plusieurs instances de MATSim sur plusieurs nœuds de calcul avec des communications périodiques, chaque instance fonctionnant sur un nœud séparé, utilisant les capacités de multithreading de MATSim pour améliorer le parallélisme. La synchronisation périodique assure la cohérence des données, tandis que les mécanismes de tolérance aux pannes permettent à la simulation de se poursuivre même en cas d'échec de certaines instances. Cette approche optimise l'utilisation des ressources informatiques selon les capacités spécifiques de chaque nœud.La deuxième contribution explore les techniques d'intelligence artificielle pour accélérer la simulation. Nous utilisons des réseaux de neurones profonds pour prédire les résultats des simulations MATSim. Initialement mise en œuvre sur un seul nœud, cette approche de preuve de concept utilise efficacement les ressources CPU disponibles. Les réseaux de neurones sont entraînés sur des données de simulations précédentes pour prédire des indicateurs tels que les temps de trajet et les niveaux de congestion. Les résultats sont comparés à ceux de MATSim pour évaluer leur précision. Cette approche est conçue pour évoluer avec des plans futurs pour une formation distribuée sur plusieurs nœuds.En résumé, nos contributions fournissent de nouvelles variantes algorithmiques et explorent l'intégration du calcul haute performance et de l'IA dans les simulateurs de trafic multi-agents. Nous démontrons l'impact de ces modèles et technologies sur la simulation de trafic, en abordant les défis et les limites de leur mise en œuvre. Notre travail met en évidence les avantages des architectures émergentes et des nouveaux concepts algorithmiques pour améliorer la robustesse et la performance des simulateurs de trafic, avec des résultats prometteurs The need to reduce travel times and energy consumption in urban road networks is critical for improving collective well-being and environmental sustainability. Since the 1950s, traffic modeling has been a central research focus. With the rapid evolution of computing capabilities in the 21st century, sophisticated digital simulations have emerged, accurately depicting road traffic complexities. Mobility simulations are essential for assessing emerging technologies like cooperative systems and dynamic GPS navigation without disrupting real traffic.As transport systems become more complex with real-time information, simulation models must adapt. Multi-agent simulations, which analyze individual behaviors within a dynamic environment, are particularly suited for this task. These simulations help understand and manage urban traffic by representing interactions between travelers and their environment.Simulating large populations of travelers in cities, potentially millions of individuals, has historically been computationally demanding. Advanced computer technologies allowing distributed calculations across multiple computers have opened new possibilities. However, many urban mobility simulators do not fully exploit these distributed architectures, limiting their ability to model complex scenarios involving many travelers and extensive networks.The main objective of this research is to improve the algorithmic and computational performance of mobility simulators. We aim to develop and validate generic and reproducible distribution models that can be adopted by various multi-agent mobility simulators. This approach seeks to overcome technical barriers and provide a solid foundation for analyzing complex transport systems in dynamic urban environments.Our research leverages the MATSim traffic simulator due to its flexibility and open structure. MATSim is widely recognized in the literature for multi-agent traffic simulation, making it an ideal candidate to test our generic methods.Our first contribution applies the "Unite and Conquer" (UC) approach to MATSim. This method accelerates simulation speed by leveraging modern computing architectures. The multiMATSim approach involves replicating several MATSim instances across multiple computing nodes with periodic communications. Each instance runs on a separate node, utilizing MATSim's native multithreading capabilities to enhance parallelism. Periodic synchronization ensures data consistency, while fault tolerance mechanisms allow the simulation to continue smoothly even if some instances fail. This approach efficiently uses diverse computational resources based on each node's specific capabilities.The second contribution explores artificial intelligence techniques to expedite the simulation process. Specifically, we use deep neural networks to predict MATSim simulation outcomes. Initially implemented on a single node, this proof-of-concept approach efficiently uses available CPU resources. Neural networks are trained on data from previous simulations to predict key metrics like travel times and congestion levels. The outputs are compared to MATSim results to assess accuracy. This approach is designed to scale, with future plans for distributed neural network training across multiple nodes.In summary, our contributions provide new algorithmic variants and explore integrating high-performance computing and AI into multi-agent traffic simulators. We aim to demonstrate the impact of these models and technologies on traffic simulation, addressing the challenges and limitations of their implementation. Our work highlights the benefits of emerging architectures and new algorithmic concepts for enhancing the robustness and performance of traffic simulators, presenting promising results

APA, Harvard, Vancouver, ISO, and other styles

42

Al-Hasani, Firas Ali Jawad. "Multiple Constant Multiplication Optimization Using Common Subexpression Elimination and Redundant Numbers." Thesis, University of Canterbury. Electrical and Computer Engineering, 2014. http://hdl.handle.net/10092/9054.

Full text

Abstract:

The multiple constant multiplication (MCM) operation is a fundamental operation in digital signal processing (DSP) and digital image processing (DIP). Examples of the MCM are in finite impulse response (FIR) and infinite impulse response (IIR) filters, matrix multiplication, and transforms. The aim of this work is minimizing the complexity of the MCM operation using common subexpression elimination (CSE) technique and redundant number representations. The CSE technique searches and eliminates common digit patterns (subexpressions) among MCM coefficients. More common subexpressions can be found by representing the MCM coefficients using redundant number representations. A CSE algorithm is proposed that works on a type of redundant numbers called the zero-dominant set (ZDS). The ZDS is an extension over the representations of minimum number of non-zero digits called minimum Hamming weight (MHW). Using the ZDS improves CSE algorithms' performance as compared with using the MHW representations. The disadvantage of using the ZDS is it increases the possibility of overlapping patterns (digit collisions). In this case, one or more digits are shared between a number of patterns. Eliminating a pattern results in losing other patterns because of eliminating the common digits. A pattern preservation algorithm (PPA) is developed to resolve the overlapping patterns in the representations. A tree and graph encoders are proposed to generate a larger space of number representations. The algorithms generate redundant representations of a value for a given digit set, radix, and wordlength. The tree encoder is modified to search for common subexpressions simultaneously with generating of the representation tree. A complexity measure is proposed to compare between the subexpressions at each node. The algorithm terminates generating the rest of the representation tree when it finds subexpressions with maximum sharing. This reduces the search space while minimizes the hardware complexity. A combinatoric model of the MCM problem is proposed in this work. The model is obtained by enumerating all the possible solutions of the MCM that resemble a graph called the demand graph. Arc routing on this graph gives the solutions of the MCM problem. A similar arc routing is found in the capacitated arc routing such as the winter salting problem. Ant colony optimization (ACO) meta-heuristics is proposed to traverse the demand graph. The ACO is simulated on a PC using Python programming language. This is to verify the model correctness and the work of the ACO. A parallel simulation of the ACO is carried out on a multi-core super computer using C++ boost graph library.

APA, Harvard, Vancouver, ISO, and other styles

43

Noordhuis-Fairfax, Sarina. "Field | Guide: John Berger and the diagrammatic exploration of place." Phd thesis, Canberra, ACT : The Australian National University, 2018. http://hdl.handle.net/1885/154278.

Full text

Abstract:

Positioned between writing and drawing, the diagram is proposed by John Berger as an alternative strategy for articulating encounters with landscape. A diagrammatic approach offers a schematic vocabulary that can compress time and offer a spatial reading of information. Situated within the contemporary field of direct data visualisation, my practice-led research interprets Berger’s ‘Field’ essay as a guide to producing four field | studies within a suburban park in Canberra. My seasonal investigations demonstrate how applying the conventions of the pictorial list, dot-distribution map, routing diagram and colour-wheel reveals subtle ecological and biographical narratives.

APA, Harvard, Vancouver, ISO, and other styles

44

Gomes, Rui Jorge Reis. "Dynamic Vehicle Routing for Demand Responsive Transportation Systems." Doctoral thesis, 2013. https://repositorio-aberto.up.pt/handle/10216/74040.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Gomes, Rui Jorge Reis. "Dynamic Vehicle Routing for Demand Responsive Transportation Systems." Tese, 2013. https://repositorio-aberto.up.pt/handle/10216/74040.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Su, Xun. "Flow-based dynamic routing in uncertain network environments." Thesis, 2002. http://wwwlib.umi.com/cr/utexas/fullcit?p3110590.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Yang, Tzu-Chi, and 楊子其. "Vehicle Routing Unit for Web-Based Dynamic Fleet Management Systems." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/48559279317289666950.

Full text

Abstract:

碩士 國立臺灣海洋大學 電機工程學系 98 Activities in the global economy, transport plays an important role. Also because of its thriving business around. Therefore, high-tech talent developed Fleet Management System to sell to the transport industry, and improve the efficiency of transport management and implementation. Fleet Management System currently only available interface for the majority of managers control the vehicle and dispatch vehicles. If the path planning function will automatically join the fleet management systems, then transport the goods can be more convenient for distribution and dispatch of vehicles. Technology industry can create more business opportunities and enhance the huge need for fleet management system. In recent years, scholars have proposed a series of vehicle transportation route optimization related research, among the most popular vehicle routing problem. In order to optimize vehicle routing and distribution of goods vehicles, VRP made many restrictionsand through the algorithm for solving the minimum total travel cost of the optimal path. After several years of development, delivery industry needs more and more work. Therefore, many scholars have raised the deformation model of VRP. Range of applications and improve the efficiency of VRP. In this study, delivery companies will be an example and the actual situation of its premise, through heuristic algorithms for solving Dynamic pickup delivery VRP with time window. We design a path planning module. This module will be used in Web-Based System, and make this module compatible with the market for fleet management system.

APA, Harvard, Vancouver, ISO, and other styles

48

Goel, Asvin, and Volker Gruhn. "Solving a Dynamic Real-Life Vehicle Routing Problem." 2006. https://ul.qucosa.de/id/qucosa%3A32736.

Full text

Abstract:

Real-life vehicle routing problems encounter a number of complexities that are not considered by the classical models found in the vehicle routing literature. In this paper we consider a dynamic real-life vehicle routing problem which is a combined load acceptance and generalised vehicle routing problem incorporating a diversity of practical complexities. Among those are time window restrictions, a heterogeneous vehicle fleet with different travel times, travel costs and capacity, multi-dimensional capacity constraints, order/vehicle compatibility constraints, orders with multiple pickup, delivery and service locations, different start and end locations for vehicles, route restrictions associated to orders and vehicles, and drivers’ working hours. We propose iterative improvement approaches based on Large Neighborhood Search. Our algorithms are characterised by very fast response times and thus, can be used within dynamic routing systems where input data can change at any time.

APA, Harvard, Vancouver, ISO, and other styles

49

Abdollahi, Farzaneh. "An H {592}[infinity] dynamic routing control of networked multi-agent systems." Thesis, 2008. http://spectrum.library.concordia.ca/976031/1/NR45644.pdf.

Full text

Abstract:

This research aims to introduce an analytical solution to the routing problem of Networked Multi-Agent Systems (NMAS) by taking advantage of control theory machinery. Routing problem can be defined as that of finding a route for messages among networked agents by adjusting the output flow of each link according to the traffic information of the network, such that some objective functions are minimized. In this research, a new objective function, namely worst-case queueing length is introduced based on which a novel routing methodology is presented. The propagating, transmitting and processing delays are inevitable characteristics of the queueing dynamics which is considered in the model of the network. The proposed dynamic optimization problem is formulated as a feedback control problem. First, a centralized [Special characters omitted.] optimal control scheme is proposed which can maintain a robust performance of the routing strategy in the presence of multiple and unknown time-varying delays for a fixed network topology. The routing problem is formulated as an [Special characters omitted.] optimal control problem for a time-delayed system. The resulting optimization problem is then recast as a minimization problem involving Linear Matrix Inequality (LMI) constraints. The physical constraints are also formulated as LMI feasibility conditions. The proposed centralized routing scheme is then reformulated in a decentralized framework. This modification yields an algorithm that, obtains the "fastest route", provides robustness against multiple unknown time-varying delays, and enhances the scalability of the algorithm to large scale traffic networks. By stochastically changing the network topology due to the nodes' mobility the overall network model is described by a Markovian jump process. The proposed Markovian jump dynamics can also support changing number of nodes due to adding new nodes to the network or deleting them because of their low energy or faults/failures. The resulting problem which involves Markovian jump dynamics due to the time-varying delays appearing in control is more challenging to solve. The problem is further complicated by the fact that the interconnected terms also change at each switching mode. To stabilize this system, an [Special characters omitted.] controller is presented for the Markovian jump system for mode-dependent interconnected terms. Finally, the LMIs corresponding to the associated physical constrains are properly modified for the mobile networks.

APA, Harvard, Vancouver, ISO, and other styles

50

Sun, Min-tsung, and 孫旻聰. "Dynamic Part Routing for Flexible Manufacturing Systems Using Petri Nets and Genetic Algorithm." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/12328393437792016550.

Full text

Abstract:

碩士 雲林科技大學 工業工程與管理研究所碩士班 96 Flexible manufacturing systems with flexible equipments provide each part with multiple processing routes. It is important to immediately and dynamically decide part route and properly assign other processing routes when machines are breakdown. In this research a combined Genetic Algorithm (GA) and Colored Time Petri Nets (CTPN) to construct a dynamic dispatching model for a flexible manufacturing system with flexible part routes is present. The matrix of part OR graph and its updated matrix at each processing step are derived and defined as the attributes of CTPN to provide the route information for part routing. Based on the shortest remaining processing time, the GA searches the best processing routes of parts. A flexible manufacturing system with flexible part routes is given as an example to demonstrate the performance of proposed approach. The simulation shows that the proposed combined GA and CTPN with the dispatching rule of shortest remaining processing time can dynamically and efficiently assign the part routes.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Dynamic Routing Systems'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles