A new three phase method (SDP method) for the multi-objective vehicle routing problem with simultaneous delvery and pickup (VRPSDP)

Transportation service operators are witnessing a growing demand for bi-directional movement of goods. Given this, the following thesis considers an extension to the vehicle routing problem (VRP) known as the delivery and pickup transportation problem (DPP), where delivery and pickup demands may occupy the same route. The problem is formulated here as the vehicle routing problem with simultaneous delivery and pickup (VRPSDP), which requires the concurrent service of the demands at the customer location. This formulation provides the greatest opportunity for cost savings for both the service provider and recipient. The aims of this research are to propose a new theoretical design to solve the multi-objective VRPSDP, provide software support for the suggested design and validate the method through a set of experiments. A new real-life based multi-objective VRPSDP is studied here, which requires the minimisation of the often conflicting objectives: operated vehicle fleet size, total routing distance and the maximum variation between route distances (workload variation). The former two objectives are commonly encountered in the domain and the latter is introduced here because it is essential for real-life routing problems. The VRPSDP is defined as a hard combinatorial optimisation problem, therefore an approximation method, Simultaneous Delivery and Pickup method (SDPmethod) is proposed to solve it. The SDPmethod consists of three phases. The first phase constructs a set of diverse partial solutions, where one is expected to form part of the near-optimal solution. The second phase determines assignment possibilities for each sub-problem. The third phase solves the sub-problems using a parallel genetic algorithm. The suggested genetic algorithm is improved by the introduction of a set of tools: genetic operator switching mechanism via diversity thresholds, accuracy analysis tool and a new fitness evaluation mechanism. This three phase method is proposed to address the shortcoming that exists in the domain, where an initial solution is built only then to be completely dismantled and redesigned in the optimisation phase. In addition, a new routing heuristic, RouteAlg, is proposed to solve the VRPSDP sub-problem, the travelling salesman problem with simultaneous delivery and pickup (TSPSDP). The experimental studies are conducted using the well known benchmark Salhi and Nagy (1999) test problems, where the SDPmethod and RouteAlg solutions are compared with the prominent works in the VRPSDP domain. The SDPmethod has demonstrated to be an effective method for solving the multi-objective VRPSDP and the RouteAlg for the TSPSDP.

Ad hoc network state aware routing protocol

The environment of a mobile ad hoc network may vary greatly depending on nodes' mobility, traffic load and resource conditions. In this paper we categorize the environment of an ad hoc network into three main states: an ideal state, wherein the network is relatively stable with sufficient resources; a congested state, wherein some nodes, regions or the network is experiencing congestion; and an energy critical state, wherein the energy capacity of nodes in the network is critically low. Each of these states requires unique routing schemes, but existing ad hoc routing protocols are only effective in one of these states. This implies that when the network enters into any other states, these protocols run into a sub optimal mode, degrading the performance of the network. We propose an Ad hoc Network State Aware Routing Protocol (ANSAR) which conditionally switches between earliest arrival scheme and a joint Load-Energy aware scheme depending on the current state of the network. Comparing to existing schemes, it yields higher efficiency and reliability as shown in our simulation results. © 2007 IEEE.

Adaptive Routing and Multi-Agent Control for Information Flows in IP-Networks

The principles of adaptive routing and multi-agent control for information flows in IP-networks.

Neural Approach in Multi-Agent Routing for Static Telecommunication Networks

The problem of multi-agent routing in static telecommunication networks with fixed configuration is considered. The problem is formulated in two ways: for centralized routing schema with the coordinator-agent (global routing) and for distributed routing schema with independent agents (local routing). For both schemas appropriate Hopfield neural networks (HNN) are constructed.

A comparison of the spectral properties of high temperature annealed long period gratings inscribed by fs laser, UV and fusion-arc

Long period gratings have been inscribed in standard single mode fibre using a fs laser system, a fusion arc and a UV laser and a comparative study carried out of their thermal behaviour. The fs laser induced gratings can survive temperatures in excess of 800°C, however the inscription process can induce considerable birefringence within the device. Annealing studies have been carried out showing that below 600°C, all three grating types show a blue shift in their room temperature resonance wavelengths following cyclic heating, while above 600°C, the UV and arc induced LPGs exhibit a red shift, with the fs LPG showing an even stronger blue shift. High temperature annealing is also shown to considerably reduce the birefringence induced by the fs inscription process.

A Necessary and Sufficient Condition for the Existence of an (n,r)-arc in PG(2,q) and Its Applications

ACM Computing Classification System (1998): E.4.

Efficient algorithm for routing optimization via statistical mechanics

Many practical routing algorithms are heuristic, adhoc and centralized, rendering generic and optimal path configurations difficult to obtain. Here we study a scenario whereby selected nodes in a given network communicate with fixed routers and employ statistical physics methods to obtain optimal routing solutions subject to a generic cost. A distributive message-passing algorithm capable of optimizing the path configuration in real instances is devised, based on the analytical derivation, and is greatly simplified by expanding the cost function around the optimized flow. Good algorithmic convergence is observed in most of the parameter regimes. By applying the algorithm, we study and compare the pros and cons of balanced traffic configurations to that of consolidated traffic, which provides important implications to practical communication and transportation networks. Interesting macroscopic phenomena are observed from the optimized states as an interplay between the communication density and the cost functions used. © 2013 IEEE.

Chain routing:a new routing framework for the Internet based on complete orders

A new framework to perform routing at the autonomous system (AS) level is proposed here. This mechanism, called chain routing framework (CRF), uses complete orders as its main topological unit. Since complete orders are acyclic digraphs that possess a known topology, it is possible to use these acyclic structures to route consistently packets between a group of ASs. The adoption of complete orders also allows easy identification and avoidance of persistent route oscillations, eliminates the possibility of developing transient loops in paths and provides a structure that facilitates the implementation of traffic engineering. Moreover, by combining CRF with other mechanisms that implement complete orders in time, the authors propose that it is possible to design a new routing protocol, which can be more reliable and stable than the border gateway protocol. © 2011 The Institution of Engineering and Technology.

Secure routing and trust computation in multihop infrastructureless networks

Today's wireless networks rely mostly on infrastructural support for their operation. With the concept of ubiquitous computing growing more popular, research on infrastructureless networks have been rapidly growing. However, such types of networks face serious security challenges when deployed. This dissertation focuses on designing a secure routing solution and trust modeling for these infrastructureless networks. ^ The dissertation presents a trusted routing protocol that is capable of finding a secure end-to-end route in the presence of malicious nodes acting either independently or in collusion, The solution protects the network from active internal attacks, known to be the most severe types of attacks in an ad hoc application. Route discovery is based on trust levels of the nodes, which need to be dynamically computed to reflect the malicious behavior in the network. As such, we have developed a trust computational model in conjunction with the secure routing protocol that analyzes the different malicious behavior and quantifies them in the model itself. Our work is the first step towards protecting an ad hoc network from colluding internal attack. To demonstrate the feasibility of the approach, extensive simulation has been carried out to evaluate the protocol efficiency and scalability with both network size and mobility. ^ This research has laid the foundation for developing a variety of techniques that will permit people to justifiably trust the use of ad hoc networks to perform critical functions, as well as to process sensitive information without depending on any infrastructural support and hence will enhance the use of ad hoc applications in both military and civilian domains. ^

Benthic foraminiferal record of the Pleistocene uplift of the sedimentary deposits of the Burica Peninsula (Costa Rica-Panama) as a result of Cocos Ridge subduction beneath the Central American Arc

This study used paleobathymetric interpretations from benthic foraminiferal assemblages to determine the timing of the initial subduction of the Cocos Ridge beneath the Costa Rica-Panama Arc and the associated amount of uplift. Forty-seven samples from four stratigraphic sections of the Burica and the Armuelles formations yielded 217 identified species. Foraminiferal paleoecology and cluster analyses indicated paleobathymetric differences within and between the sections. Maximum and minimum uplift rates were calculated from the biochronology, elevation, paleobathymetry and estimated eustatic changes. Large decreases in paleobathymetry were mainly due to the initial middle Pleistocene subduction of the Cocos Ridge in less than 0.5 Ma. Uplift rates were uneven across the Burica Peninsula, as follows: La Vaca 4.5–0.8 m/ky, Rabo de Puerco 2.8–0.7 m/ky, San Bartolo–Chiquito 2.7–0.8 m/ky, and eastern coast 8.0–1.5 m/ky. These differences probably resulted from Cocos Ridge asymmetry and differential uplift of tectonic blocks.

Location management and routing in urban vehicular ad hoc networks

In recent years, urban vehicular ad hoc networks (VANETs) are gaining importance for inter-vehicle communication, because they allow for the local communication between vehicles without any infrastructure, configuration effort, and without expensive cellular networks. But such architecture may increase the complexity of routing since there is no central control system in urban VANETs. Therefore, a challenging research task is to improve urban VANETs' routing efficiency. ^ Hence, in this dissertation we propose two location-based routing protocols and a location management protocol to facilitate location-based routing in urban VANETs. The Multi-hop Routing Protocol (MURU) is proposed to make use of predicted mobility and geometry map in urban VANETs to estimate a path's life time and set up robust end-to-end routing paths. The Light-weight Routing Protocol (LIRU) is proposed to take advantage of the node diversity under dynamic channel condition to exploit opportunistic forwarding to achieve efficient data delivery. A scalable location management protocol (MALM) is also proposed to support location-based routing protocols in urban VANETs. MALM uses high mobility in VANETs to help disseminate vehicles' historical location information, and a vehicle is able to implement Kalman-filter based predicted to predict another vehicle's current location based on its historical location information. ^

Arc crust-magma interaction in the Andean Southern Volcanic Zone from thermobarometry, mineral composition, radiogenic isotope and rare earth element systematics of the Azufre-Planchon-Peteroa volcanic complex, Chile

The Andean Southern Volcanic Zone (SVZ) is a vast and complex continental arc that has been studied extensively to provide an understanding of arc-magma genesis, the origin and chemical evolution of the continental crust, and geochemical compositions of volcanic products. The present study focuses on distinguishing the magma/sub-arc crustal interaction of eruptive products from the Azufre-Planchon-Peteroa (APP 35°15'S) volcanic center and other major centers in the Central SVZ (CSVZ 37°S–42°S), Transitional SVZ (TSVZ 34.3–37.0°S), and Northern SVZ (NSVZ 33°S–34°30'S). New Hf and Nd isotopic and trace element data for SVZ centers are consistent with former studies that these magmas experienced variable depths of crystal fractionation, and that crustal assimilation is restricted to the lower crustal depths with an apparent role of garnet. Thermobarometric calculations applied to magma compositions constrain the depth of magma separation from mantle sources in all segments of the SVZ to(70-90 km). Magmatic separation at the APP complex occurs at an average depth of ~50 km which is confined to the mantle lithosphere and the base of the crust suggesting localized thermal abrasion both reservoirs. Thermobarometric calculations indicate that CSVZ primary magmas arise from a similar average depth of (~54 km) which confines magma separation to the asthenospheric mantle. The northwards along-arc Sr-Nd-Hf isotopic data and LREE enrichment accompanied with HREE depletion of SVZ mafic magmas correlates well with northward increasing crustal thickness and decreasing primary melt separation from mantle source regions indicating an increased involvement of lower crustal components in SVZ magma petrogenesis. ^ The study concludes that the development of mature subduction zones over millions of years of continuous magmatism requires that mafic arc derived melts stagnate at lower crustal levels due to density similarities and emplace at lower crustal depths. Basaltic underplating creates localized hot zone environments below major magmatic centers. These regions of high temperature/partial melting, and equilibration with underplated mafic rocks provides the mechanism that controls trace element and isotopic variability of primary magmas of the TSVZ and NSVZ from their baseline CSVZ-like precursors.^

Context-Based Customization of Routing Functions for Web GIS Applications

This poster presentation features three route planning applications developed by the Florida International University GIS Center and the Geomatics program at the University of Florida, and outlines their context based differences. The first route planner has been developed for cyclists in three Florida counties, i.e. Miami Dade County, Broward County, and Palm Beach County. The second route planner computes safe pedestrian routes to schools and has been developed for Miami Dade County. The third route planner combines pre-compiled cultural/eco routes and point-to-point route planning for the City of Coral Gables. This poster highlights the differences in design (user interface) and implementation (routing options) between the three route planners as a result of a different application context and target audience.

Cooperative routing for collision minimization in wireless sensor networks

Cooperative communication has gained much interest due to its ability to exploit the broadcasting nature of the wireless medium to mitigate multipath fading. There has been considerable amount of research on how cooperative transmission can improve the performance of the network by focusing on the physical layer issues. During the past few years, the researchers have started to take into consideration cooperative transmission in routing and there has been a growing interest in designing and evaluating cooperative routing protocols. Most of the existing cooperative routing algorithms are designed to reduce the energy consumption; however, packet collision minimization using cooperative routing has not been addressed yet. This dissertation presents an optimization framework to minimize collision probability using cooperative routing in wireless sensor networks. More specifically, we develop a mathematical model and formulate the problem as a large-scale Mixed Integer Non-Linear Programming problem. We also propose a solution based on the branch and bound algorithm augmented with reducing the search space (branch and bound space reduction). The proposed strategy builds up the optimal routes from each source to the sink node by providing the best set of hops in each route, the best set of relays, and the optimal power allocation for the cooperative transmission links. To reduce the computational complexity, we propose two near optimal cooperative routing algorithms. In the first near optimal algorithm, we solve the problem by decoupling the optimal power allocation scheme from optimal route selection. Therefore, the problem is formulated by an Integer Non-Linear Programming, which is solved using a branch and bound space reduced method. In the second near optimal algorithm, the cooperative routing problem is solved by decoupling the transmission power and the relay node se- lection from the route selection. After solving the routing problems, the power allocation is applied in the selected route. Simulation results show the algorithms can significantly reduce the collision probability compared with existing cooperative routing schemes.

Valutazione dosimetrica e aspetti tecnici di trattamenti VMAT (Volumetric Modulated Arc Therapy) in radioterapia oncologica

La VMAT (Volumetric Modulated Arc Therapy) è una delle più recenti tecniche radioterapiche, in cui, oltre alla modulazione geometrica della fluenza del campo di radiazione come avviene nell’IMRT (Intensity Modulated Radiotherapy), sono variati durante il trattamento anche la velocità del gantry e il rateo di dose. La radiazione è erogata senza interruzioni lungo uno o più archi continui della testata dell’acceleratore, così da ridurre i tempi di trattamento in modo sostanziale rispetto all’IMRT. Nelle tecniche ad intensità modulata, ed in particolare nella VMAT, il lettino porta paziente modifica la distribuzione di dose durante gli irraggiamenti posteriori, riducendo quella al target e aumentando quella superficiale. Il presente lavoro di tesi, che ha proprio l’obiettivo di valutare questi aspetti dosimetrici in un’ottica pre-clinica, è stato svolto presso il Servizio di Fisica Sanitaria del Policlinico S.Orsola–Malpighi, Azienda Ospedaliero-Universitaria di Bologna. Le misure sono state effettuate presso le U.O. Radioterapia-Morganti e Radioterapia-Frezza f.f. della medesima Azienda Sanitaria, al fine di caratterizzare dal punto di vista dosimetrico il lettino di trattamento iBEAM evo dell’acceleratore lineare Synergy Elekta. L’attenuazione misurata in caso di incidenza perpendicolare del fascio sul lettino, in buon accordo con gli articoli di riferimento, è stata: (2.81±0.06)% per fotoni di energia di 6 MV, (1.81±0.10)% a 10 MV e (1.38±0.05)% a 15 MV. L’attenuazione massima misurata con fotoni di energia di 6 MV si è avvicinata al 4% negli irraggiamenti obliqui. Infine, è stato analizzato il confronto con statistica gamma fra distribuzione di dose pianificata e misurata prima e dopo aver modellizzato le caratteristiche del lettino nel software per l’elaborazione del piano di trattamento. Solo dopo tale operazione, i due casi VMAT analizzati (tumore dell’orofaringe e prostatico) superano i criteri più restrittivi e affidabili utilizzati nella pratica clinica.