WorldWideScience

Sample records for time constrained routing

  1. Exact methods for time constrained routing and related scheduling problems

    DEFF Research Database (Denmark)

    Kohl, Niklas

    1995-01-01

    of customers. In the VRPTW customers must be serviced within a given time period - a so called time window. The objective can be to minimize operating costs (e.g. distance travelled), fixed costs (e.g. the number of vehicles needed) or a combination of these component costs. During the last decade optimization......This dissertation presents a number of optimization methods for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW is a generalization of the well known capacity constrained Vehicle Routing Problem (VRP), where a fleet of vehicles based at a central depot must service a set...... of J?rnsten, Madsen and S?rensen (1986), which has been tested computationally by Halse (1992). Both methods decompose the problem into a series of time and capacity constrained shotest path problems. This yields a tight lower bound on the optimal objective, and the dual gap can often be closed...

  2. Capacity Constrained Routing Algorithms for Evacuation Route Planning

    National Research Council Canada - National Science Library

    Lu, Qingsong; George, Betsy; Shekhar, Shashi

    2006-01-01

    .... In this paper, we propose a new approach, namely a capacity constrained routing planner which models capacity as a time series and generalizes shortest path algorithms to incorporate capacity constraints...

  3. Integrating job scheduling and constrained network routing

    DEFF Research Database (Denmark)

    Gamst, Mette

    2010-01-01

    This paper examines the NP-hard problem of scheduling jobs on resources such that the overall profit of executed jobs is maximized. Job demand must be sent through a constrained network to the resource before execution can begin. The problem has application in grid computing, where a number...

  4. Route around real time

    International Nuclear Information System (INIS)

    Terrier, Francois

    1996-01-01

    The greater and greater autonomy and complexity asked to the control and command systems lead to work on introducing techniques such as Artificial Intelligence or concurrent object programming in industrial applications. However, while the critical feature of these systems impose to control the dynamics of the proposed solutions, their complexity often imposes a high adaptability to a partially modelled environment. The studies presented start from low level control and command systems to more complex applications at higher levels, such as 'supervision systems'. Techniques such as temporal reasoning and uncertainty management are proposed for the first studies, while the second are tackled with programming techniques based on the real time object paradigm. The outcomes of this itinerary crystallize on the ACCORD project which targets to manage - on the whole life cycle of a real time application - these two problematics, sometimes antagonistic: control of the dynamics and adaptivity. (author) [fr

  5. Time and timing in vehicle routing problems

    NARCIS (Netherlands)

    Jabali, O.

    2010-01-01

    The distribution of goods to a set of geographically dispersed customers is a common problem faced by carrier companies, well-known as the Vehicle Routing Problem (VRP). The VRP consists of finding an optimal set of routes that minimizes total travel times for a given number of vehicles with a fixed

  6. A chance-constrained stochastic approach to intermodal container routing problems.

    Science.gov (United States)

    Zhao, Yi; Liu, Ronghui; Zhang, Xi; Whiteing, Anthony

    2018-01-01

    We consider a container routing problem with stochastic time variables in a sea-rail intermodal transportation system. The problem is formulated as a binary integer chance-constrained programming model including stochastic travel times and stochastic transfer time, with the objective of minimising the expected total cost. Two chance constraints are proposed to ensure that the container service satisfies ship fulfilment and cargo on-time delivery with pre-specified probabilities. A hybrid heuristic algorithm is employed to solve the binary integer chance-constrained programming model. Two case studies are conducted to demonstrate the feasibility of the proposed model and to analyse the impact of stochastic variables and chance-constraints on the optimal solution and total cost.

  7. Exact and heuristic solution approaches for the Integrated Job Scheduling and Constrained Network Routing Problem

    DEFF Research Database (Denmark)

    Gamst, M.

    2014-01-01

    problem. The methods are computationally evaluated on test instances arising from telecommunications with up to 500 jobs and 500 machines. Results show that solving the integrated job scheduling and constrained network routing problem to optimality is very difficult. The exact solution approach performs......This paper examines the problem of scheduling a number of jobs on a finite set of machines such that the overall profit of executed jobs is maximized. Each job has a certain demand, which must be sent to the executing machine via constrained paths. A job cannot start before all its demands have...... arrived at the machine. Furthermore, two resource demand transmissions cannot use the same edge in the same time period. The problem has application in grid computing, where a number of geographically distributed machines work together for solving large problems. The machines are connected through...

  8. On the Integrated Job Scheduling and Constrained Network Routing Problem

    DEFF Research Database (Denmark)

    Gamst, Mette

    This paper examines the NP-hard problem of scheduling a number of jobs on a finite set of machines such that the overall profit of executed jobs is maximized. Each job demands a number of resources, which must be sent to the executing machine via constrained paths. Furthermore, two resource demand...

  9. Quality-constrained routing in publish/subscribe systems

    NARCIS (Netherlands)

    Zieba, Bogumil; van Sinderen, Marten J.; Wegdam, M.

    2005-01-01

    Routing in publish/subscribe (pub/sub) features a communication model where messages are not given explicit destination addresses, but destinations are determined by matching the subscription declared by subscribers. For a dynamic computing environment with applications that have quality demands,

  10. Optimizing departure times in vehicle routes

    NARCIS (Netherlands)

    Kok, A.L.; Hans, Elias W.; Schutten, Johannes M.J.

    2008-01-01

    Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. However, in practice, temporal traffic congestions make that such solutions are not optimal with respect to minimizing the total duty time. Furthermore, VRPTW

  11. Optimizing Departure Times in Vehicle Routes

    NARCIS (Netherlands)

    Kok, A.L.; Hans, Elias W.; Schutten, Johannes M.J.

    2011-01-01

    Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporary traffic congestion make such solutions non-optimal with respect to minimizing the total duty time. Furthermore, the VRPTW does not

  12. A constrained multinomial Probit route choice model in the metro network: Formulation, estimation and application

    Science.gov (United States)

    Zhang, Yongsheng; Wei, Heng; Zheng, Kangning

    2017-01-01

    Considering that metro network expansion brings us with more alternative routes, it is attractive to integrate the impacts of routes set and the interdependency among alternative routes on route choice probability into route choice modeling. Therefore, the formulation, estimation and application of a constrained multinomial probit (CMNP) route choice model in the metro network are carried out in this paper. The utility function is formulated as three components: the compensatory component is a function of influencing factors; the non-compensatory component measures the impacts of routes set on utility; following a multivariate normal distribution, the covariance of error component is structured into three parts, representing the correlation among routes, the transfer variance of route, and the unobserved variance respectively. Considering multidimensional integrals of the multivariate normal probability density function, the CMNP model is rewritten as Hierarchical Bayes formula and M-H sampling algorithm based Monte Carlo Markov Chain approach is constructed to estimate all parameters. Based on Guangzhou Metro data, reliable estimation results are gained. Furthermore, the proposed CMNP model also shows a good forecasting performance for the route choice probabilities calculation and a good application performance for transfer flow volume prediction. PMID:28591188

  13. The Time Window Vehicle Routing Problem Considering Closed Route

    Science.gov (United States)

    Irsa Syahputri, Nenna; Mawengkang, Herman

    2017-12-01

    The Vehicle Routing Problem (VRP) determines the optimal set of routes used by a fleet of vehicles to serve a given set of customers on a predefined graph; the objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we study a variant of the predefined graph: given a weighted graph G and vertices a and b, and given a set X of closed paths in G, find the minimum total travel cost of a-b path P such that no path in X is a subpath of P. Path P is allowed to repeat vertices and edges. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model

  14. An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems

    DEFF Research Database (Denmark)

    Helsgaun, Keld

    This report describes the implementation of an extension of the Lin-Kernighan-Helsgaun TSP solver for solving constrained traveling salesman and vehicle routing problems. The extension, which is called LKH-3, is able to solve a variety of well-known problems, including the sequential ordering...... problem (SOP), the traveling repairman problem (TRP), variants of the multiple travel-ing salesman problem (mTSP), as well as vehicle routing problems (VRPs) with capacity, time windows, pickup-and-delivery and distance constraints. The implementation of LKH-3 builds on the idea of transforming...... the problems into standard symmetric traveling salesman problems and handling constraints by means of penalty functions. Extensive testing on benchmark instances from the literature has shown that LKH-3 is effective. Best known solutions are often obtained, and in some cases, new best solutions are found...

  15. Vehicle routing problem with time windows using natural inspired algorithms

    Science.gov (United States)

    Pratiwi, A. B.; Pratama, A.; Sa’diyah, I.; Suprajitno, H.

    2018-03-01

    Process of distribution of goods needs a strategy to make the total cost spent for operational activities minimized. But there are several constrains have to be satisfied which are the capacity of the vehicles and the service time of the customers. This Vehicle Routing Problem with Time Windows (VRPTW) gives complex constrains problem. This paper proposes natural inspired algorithms for dealing with constrains of VRPTW which involves Bat Algorithm and Cat Swarm Optimization. Bat Algorithm is being hybrid with Simulated Annealing, the worst solution of Bat Algorithm is replaced by the solution from Simulated Annealing. Algorithm which is based on behavior of cats, Cat Swarm Optimization, is improved using Crow Search Algorithm to make simplier and faster convergence. From the computational result, these algorithms give good performances in finding the minimized total distance. Higher number of population causes better computational performance. The improved Cat Swarm Optimization with Crow Search gives better performance than the hybridization of Bat Algorithm and Simulated Annealing in dealing with big data.

  16. Software architecture for time-constrained machine vision applications

    Science.gov (United States)

    Usamentiaga, Rubén; Molleda, Julio; García, Daniel F.; Bulnes, Francisco G.

    2013-01-01

    Real-time image and video processing applications require skilled architects, and recent trends in the hardware platform make the design and implementation of these applications increasingly complex. Many frameworks and libraries have been proposed or commercialized to simplify the design and tuning of real-time image processing applications. However, they tend to lack flexibility, because they are normally oriented toward particular types of applications, or they impose specific data processing models such as the pipeline. Other issues include large memory footprints, difficulty for reuse, and inefficient execution on multicore processors. We present a novel software architecture for time-constrained machine vision applications that addresses these issues. The architecture is divided into three layers. The platform abstraction layer provides a high-level application programming interface for the rest of the architecture. The messaging layer provides a message-passing interface based on a dynamic publish/subscribe pattern. A topic-based filtering in which messages are published to topics is used to route the messages from the publishers to the subscribers interested in a particular type of message. The application layer provides a repository for reusable application modules designed for machine vision applications. These modules, which include acquisition, visualization, communication, user interface, and data processing, take advantage of the power of well-known libraries such as OpenCV, Intel IPP, or CUDA. Finally, the proposed architecture is applied to a real machine vision application: a jam detector for steel pickling lines.

  17. Vehicle routing with stochastic time-dependent travel times

    NARCIS (Netherlands)

    Lecluyse, C.; Woensel, van T.; Peremans, H.

    2009-01-01

    Assigning and scheduling vehicle routes in a stochastic time-dependent environment is a crucial management problem. The assumption that in a real-life environment everything goes according to an a priori determined static schedule is unrealistic. Our methodology builds on earlier work in which the

  18. Vehicle routing with stochastic time-dependent travel times

    NARCIS (Netherlands)

    Lecluyse, C.; Woensel, van T.; Peremans, H.

    2007-01-01

    Assigning and scheduling vehicle routes in a stochastic time-dependent environment is a crucial management problem. The assumption that in a real-life environment everything goes according to an a priori determined static schedule is unrealistic. Our methodology builds on earlier work in which the

  19. Time constrained liner shipping network design

    DEFF Research Database (Denmark)

    Karsten, Christian Vad; Brouer, Berit Dangaard; Desaulniers, Guy

    2017-01-01

    We present a mathematical model and a solution method for the liner shipping network design problem. The model takes into account coordination between vessels and transit time restrictions on the cargo flow. The solution method is an improvement heuristic, where an integer program is solved...... iteratively to perform moves in a large neighborhood search. Our improvement heuristic is applicable as a real-time decision support tool for a liner shipping company. It can be used to find improvements to the network when evaluating changes in operating conditions or testing different scenarios...

  20. Evolutionary algorithms for the Vehicle Routing Problem with Time Windows

    NARCIS (Netherlands)

    Bräysy, Olli; Dullaert, Wout; Gendreau, Michel

    2004-01-01

    This paper surveys the research on evolutionary algorithms for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes from a single depot to a set of geographically scattered points. The routes must be designed in such a way

  1. Influence of queue propagation and dissipation on route travel times

    DEFF Research Database (Denmark)

    Raovic, Nevena

    into account (Bliemer, 2008). Yperman (2007) indicates that there is a significant difference in queue-propagation and queue-dissipation between the LTM and DQM. This results in different route travel times, and can further affect route choice. In this paper, different approaches to represent queue propagation...... and dissipation through the CTM, LTM and DQM are studied. A simple network allows to show how these approaches influence route travel time. Furthermore, the possibility of changing the existing DQM is considered in order to more realistically represent queue propagation and dissipation, which would lead to more...... accurate route travel times....

  2. On the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Kallehauge, Brian

    2006-01-01

    . The fourth and final paper ‘Vehicle routing problem with time windows’ (Kallehauge, Larsen, Madsen, and Solomon. In Desaulniers, Desrosiers, and Solomon, editors, Column generation, pages 67-98, Springer, New York, 2005) is a contribution to a book on column generation edited by G. Desaulniers, J. Desrosiers......The vehicle routing problem with time windows is concerned with the optimal routing of a fleet of vehicles between a depot and a number of customers that must be visited within a specified time interval, called a time window. The purpose of this thesis is to develop new and efficient solution...... techniques for solving the vehicle routing problem with time windows (VRPTW). The thesis consists of a section of introductory remarks and four independent papers. The first paper ‘Formulations and exact approaches for the vehicle routing problem with time windows’ (Kallehauge, 2005, unpublished) is a review...

  3. Invariant set computation for constrained uncertain discrete-time systems

    NARCIS (Netherlands)

    Athanasopoulos, N.; Bitsoris, G.

    2010-01-01

    In this article a novel approach to the determination of polytopic invariant sets for constrained discrete-time linear uncertain systems is presented. First, the problem of stabilizing a prespecified initial condition set in the presence of input and state constraints is addressed. Second, the

  4. Time-constrained project scheduling with adjacent resources

    NARCIS (Netherlands)

    Hurink, Johann L.; Kok, A.L.; Paulus, J.J.; Schutten, Johannes M.J.

    We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with adjacent resources. For adjacent resources the resource units are ordered and the units assigned to a job have to be adjacent. On top of that, adjacent resources are not required by single jobs, but by

  5. Time-constrained project scheduling with adjacent resources

    NARCIS (Netherlands)

    Hurink, Johann L.; Kok, A.L.; Paulus, J.J.; Schutten, Johannes M.J.

    2008-01-01

    We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with Adjacent Resources. For adjacent resources the resource units are ordered and the units assigned to a job have to be adjacent. On top of that, adjacent resources are not required by single jobs, but by

  6. Physics constrained nonlinear regression models for time series

    International Nuclear Information System (INIS)

    Majda, Andrew J; Harlim, John

    2013-01-01

    A central issue in contemporary science is the development of data driven statistical nonlinear dynamical models for time series of partial observations of nature or a complex physical model. It has been established recently that ad hoc quadratic multi-level regression (MLR) models can have finite-time blow up of statistical solutions and/or pathological behaviour of their invariant measure. Here a new class of physics constrained multi-level quadratic regression models are introduced, analysed and applied to build reduced stochastic models from data of nonlinear systems. These models have the advantages of incorporating memory effects in time as well as the nonlinear noise from energy conserving nonlinear interactions. The mathematical guidelines for the performance and behaviour of these physics constrained MLR models as well as filtering algorithms for their implementation are developed here. Data driven applications of these new multi-level nonlinear regression models are developed for test models involving a nonlinear oscillator with memory effects and the difficult test case of the truncated Burgers–Hopf model. These new physics constrained quadratic MLR models are proposed here as process models for Bayesian estimation through Markov chain Monte Carlo algorithms of low frequency behaviour in complex physical data. (paper)

  7. A Dynamic Optimization Method of Indoor Fire Evacuation Route Based on Real-time Situation Awareness

    Directory of Open Access Journals (Sweden)

    DING Yulin

    2016-12-01

    Full Text Available How to provide safe and effective evacuation routes is an important safeguard to correctly guide evacuation and reduce the casualties during the fire situation rapidly evolving in complex indoor environment. The traditional static path finding method is difficult to adjust the path adaptively according to the changing fire situation, which lead to the evacuation decision-making blindness and hysteresis. This paper proposes a dynamic method which can dynamically optimize the indoor evacuation routes based on the real-time situation awareness. According to the real-time perception of fire situation parameters and the changing indoor environment information, the evacuation route is optimized dynamically. The integrated representation of multisource indoor fire monitoring sensor observations oriented fire emergency evacuation is presented at first, real-time fire threat situation information inside building is then extracted from the observation data of multi-source sensors, which is used to constrain the dynamical optimization of the topology of the evacuation route. Finally, the simulation experiments prove that this method can improve the accuracy and efficiency of indoor evacuation routing.

  8. Constraining Alternative Theories of Gravity Using Pulsar Timing Arrays

    Science.gov (United States)

    Cornish, Neil J.; O'Beirne, Logan; Taylor, Stephen R.; Yunes, Nicolás

    2018-05-01

    The opening of the gravitational wave window by ground-based laser interferometers has made possible many new tests of gravity, including the first constraints on polarization. It is hoped that, within the next decade, pulsar timing will extend the window by making the first detections in the nanohertz frequency regime. Pulsar timing offers several advantages over ground-based interferometers for constraining the polarization of gravitational waves due to the many projections of the polarization pattern provided by the different lines of sight to the pulsars, and the enhanced response to longitudinal polarizations. Here, we show that existing results from pulsar timing arrays can be used to place stringent limits on the energy density of longitudinal stochastic gravitational waves. However, unambiguously distinguishing these modes from noise will be very difficult due to the large variances in the pulsar-pulsar correlation patterns. Existing upper limits on the power spectrum of pulsar timing residuals imply that the amplitude of vector longitudinal (VL) and scalar longitudinal (SL) modes at frequencies of 1/year are constrained, AVL<4 ×10-16 and ASL<4 ×10-17, while the bounds on the energy density for a scale invariant cosmological background are ΩVLh2<4 ×10-11 and ΩSLh2<3 ×10-13.

  9. Stochastic skyline route planning under time-varying uncertainty

    DEFF Research Database (Denmark)

    Yang, Bin; Guo, Chenjuan; Jensen, Christian S.

    2014-01-01

    Different uses of a road network call for the consideration of different travel costs: in route planning, travel time and distance are typically considered, and green house gas (GHG) emissions are increasingly being considered. Further, travel costs such as travel time and GHG emissions are time...

  10. Lagrangian duality applied to the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Kallehauge, Brian; Larsen, Jesper; Madsen, Oli B.G.

    2006-01-01

    This paper considers the vehicle routing problem with time windows, where the service of each customer must start within a specified time interval. We consider the Lagrangian relaxation of the constraint set requiring that each customer must be served by exactly one vehicle yielding a constrained...... respectively, which to date are the largest problems ever solved to optimality. We have implemented the LBCP algorithm using the ABACUS open-source framework for solving mixed-integer linear-programs by branch, cut, and price....

  11. Reachability cuts for the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Lysgaard, Jens

    2004-01-01

    This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing Problem with Time Windows (VRPTW). Reachability cuts are closely related to cuts derived from precedence constraints in the Asymmetric Traveling Salesman Problem with Time Windows and to k-path cuts...

  12. Path inequalities for the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Kallehauge, Brian; Boland, Natashia; Madsen, Oli B.G.

    2007-01-01

    In this paper we introduce a new formulation of the vehicle routing problem with time windows (VRPTW) involving only binary variables. The new formulation is based on the formulation of the asymmetric traveling salesman problem with time windows by Ascheuer et al. (Networks 36 (2000) 69-79) and has...

  13. Late time CMB anisotropies constrain mini-charged particles

    Energy Technology Data Exchange (ETDEWEB)

    Burrage, C.; Redondo, J.; Ringwald, A. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Jaeckel, J. [Univ. of Durham, Inst. for Particle Physics Phenomenology (United Kingdom)

    2009-09-15

    Observations of the temperature anisotropies induced as light from the CMB passes through large scale structures in the late universe are a sensitive probe of the interactions of photons in such environments. In extensions of the Standard Model which give rise to mini-charged particles, photons propagating through transverse magnetic fields can be lost to pair production of such particles. Such a decrement in the photon flux would occur as photons from the CMB traverse the magnetic fields of galaxy clusters. Therefore late time CMB anisotropies can be used to constrain the properties of mini- charged particles. We outline how this test is constructed, and present new constraints on mini-charged particles from observations of the Sunyaev-Zel'dovich effect in the Coma cluster. (orig.)

  14. The Vehicle Routing Problem with Time Windows and Temporal Dependencies

    DEFF Research Database (Denmark)

    Rasmussen, Matias Sevel; Dohn, Anders Høeg; Larsen, Jesper

    to be scheduled with a certain slack between them. They refer to the vehicle problem as having interdependent time windows. Temporal dependencies have been modeled for a home care routing problem in a mixed integer programming model (MIP) which was solved with a standard MIP solver. An application with general...

  15. A Linear Programming Approach to Routing Control in Networks of Constrained Nonlinear Positive Systems with Concave Flow Rates

    Science.gov (United States)

    Arneson, Heather M.; Dousse, Nicholas; Langbort, Cedric

    2014-01-01

    We consider control design for positive compartmental systems in which each compartment's outflow rate is described by a concave function of the amount of material in the compartment.We address the problem of determining the routing of material between compartments to satisfy time-varying state constraints while ensuring that material reaches its intended destination over a finite time horizon. We give sufficient conditions for the existence of a time-varying state-dependent routing strategy which ensures that the closed-loop system satisfies basic network properties of positivity, conservation and interconnection while ensuring that capacity constraints are satisfied, when possible, or adjusted if a solution cannot be found. These conditions are formulated as a linear programming problem. Instances of this linear programming problem can be solved iteratively to generate a solution to the finite horizon routing problem. Results are given for the application of this control design method to an example problem. Key words: linear programming; control of networks; positive systems; controller constraints and structure.

  16. Identification of Constrained Cancer Driver Genes Based on Mutation Timing

    Science.gov (United States)

    Sakoparnig, Thomas; Fried, Patrick; Beerenwinkel, Niko

    2015-01-01

    Cancer drivers are genomic alterations that provide cells containing them with a selective advantage over their local competitors, whereas neutral passengers do not change the somatic fitness of cells. Cancer-driving mutations are usually discriminated from passenger mutations by their higher degree of recurrence in tumor samples. However, there is increasing evidence that many additional driver mutations may exist that occur at very low frequencies among tumors. This observation has prompted alternative methods for driver detection, including finding groups of mutually exclusive mutations and incorporating prior biological knowledge about gene function or network structure. Dependencies among drivers due to epistatic interactions can also result in low mutation frequencies, but this effect has been ignored in driver detection so far. Here, we present a new computational approach for identifying genomic alterations that occur at low frequencies because they depend on other events. Unlike passengers, these constrained mutations display punctuated patterns of occurrence in time. We test this driver–passenger discrimination approach based on mutation timing in extensive simulation studies, and we apply it to cross-sectional copy number alteration (CNA) data from ovarian cancer, CNA and single-nucleotide variant (SNV) data from breast tumors and SNV data from colorectal cancer. Among the top ranked predicted drivers, we find low-frequency genes that have already been shown to be involved in carcinogenesis, as well as many new candidate drivers. The mutation timing approach is orthogonal and complementary to existing driver prediction methods. It will help identifying from cancer genome data the alterations that drive tumor progression. PMID:25569148

  17. The time-dependent prize-collecting arc routing problem

    DEFF Research Database (Denmark)

    Black, Dan; Eglese, Richard; Wøhlk, Sanne

    2013-01-01

    with the time of day. Two metaheuristic algorithms, one based on Variable Neighborhood Search and one based on Tabu Search, are proposed and tested for a set of benchmark problems, generated from real road networks and travel time information. Both algorithms are capable of finding good solutions, though......A new problem is introduced named the Time-Dependent Prize-Collecting Arc Routing Problem (TD-PARP). It is particularly relevant to situations where a transport manager has to choose between a number of full truck load pick-ups and deliveries on a road network where travel times change...

  18. Enabling Routes of Road Network Constrained Movements as Mobile Service Context

    DEFF Research Database (Denmark)

    Jensen, Christian Søndergaard

    2007-01-01

    With the continuing advances in wireless communications, geo-positioning, and portable electronics, an infrastructure is emerging that enables the delivery of on-line, location-enabled services to very large numbers of mobile users. A typical usage situation for mobile services is one characteriz...... vehicles traveling within a real road network are reported...... by a small screen and no keyboard, and by the service being only a secondary focus of the user. Under such circumstances, it is particularly important to deliver the "right" information and service at the right time, with as little user interaction as possible. This may be achieved by making services context...

  19. A queueing framework for routing problems with time-dependent travel times

    NARCIS (Netherlands)

    Woensel, van T.; Kerbache, L.; Peremans, H.; Vandaele, N.J.

    2007-01-01

    Assigning and scheduling vehicle routes in a dynamic environment is a crucial management problem. Despite numerous publications dealing with efficient scheduling methods for vehicle routing, very few addressed the inherent stochastic and dynamic nature of travel times. In this paper, a vehicle

  20. Multidepot UAV Routing Problem with Weapon Configuration and Time Window

    Directory of Open Access Journals (Sweden)

    Tianren Zhou

    2018-01-01

    Full Text Available In recent wars, there is an increasing trend that unmanned aerial vehicles (UAVs are utilized to conduct military attacking missions. In this paper, we investigate a novel multidepot UAV routing problem with consideration of weapon configuration in the UAV and the attacking time window of the target. A mixed-integer linear programming model is developed to jointly optimize three kinds of decisions: the weapon configuration strategy in the UAV, the routing strategy of target, and the allocation strategy of weapons to targets. An adaptive large neighborhood search (ALNS algorithm is proposed for solving the problem, which is tested by randomly generated instances covering the small, medium, and large sizes. Experimental results confirm the effectiveness and robustness of the proposed ALNS algorithm.

  1. A Time-constrained Network Voronoi Construction and Accessibility Analysis in Location-based Service Technology

    Science.gov (United States)

    Yu, W.; Ai, T.

    2014-11-01

    Accessibility analysis usually requires special models of spatial location analysis based on some geometric constructions, such as Voronoi diagram (abbreviated to VD). There are many achievements in classic Voronoi model research, however suffering from the following limitations for location-based services (LBS) applications. (1) It is difficult to objectively reflect the actual service areas of facilities by using traditional planar VDs, because human activities in LBS are usually constrained only to the network portion of the planar space. (2) Although some researchers have adopted network distance to construct VDs, their approaches are used in a static environment, where unrealistic measures of shortest path distance based on assumptions about constant travel speeds through the network were often used. (3) Due to the computational complexity of the shortest-path distance calculating, previous researches tend to be very time consuming, especially for large datasets and if multiple runs are required. To solve the above problems, a novel algorithm is developed in this paper. We apply network-based quadrat system and 1-D sequential expansion to find the corresponding subnetwork for each focus. The idea is inspired by the natural phenomenon that water flow extends along certain linear channels until meets others or arrives at the end of route. In order to accommodate the changes in traffic conditions, the length of network-quadrat is set upon the traffic condition of the corresponding street. The method has the advantage over Dijkstra's algorithm in that the time cost is avoided, and replaced with a linear time operation.

  2. Location-routing Problem with Fuzzy time windows and Traffic time

    Directory of Open Access Journals (Sweden)

    Shima Teimoori

    2014-05-01

    Full Text Available The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard is the existence of congested times during the service time and distributing goods to the customer. This caused a delay in providing service for customer and imposed additional costs to distribution system. Thus we have provided a mathematical model for designing optimal distributing system. Since the vehicle location-routing problem is Np-hard, thus a solution method using genetic meta-heuristic algorithm was developed and the optimal sequence of servicing for the vehicle and optimal location for the warehouses were determined through an example.

  3. Search route decision of environmental monitoring at emergency time

    International Nuclear Information System (INIS)

    Aoyama, Isao

    1979-01-01

    The search route decision method is reviewed, especially the adequate arrangement of monitors in view of time in the information-gathering activity by transferring the monitors on the horizontal space after the confirmation of the abnormal release of radioactive material. As for the field of the theory of search, the developmental history is explained, namely the experiences of the naval anti submarine operation in WW-2, the salvage activities and the search problem on the sea. The kinematics for search, the probability theory for detection and the optimum distribution for search are the most important contents of the application of theory of search relating to the environmental monitoring at emergency condition. The combination of a search model consists of the peculiarity of targets, the peculiarity of observers and the standard of optimality. The peculiarity of targets is divided into the space of search, the number of targets, the way of appearance of targets and the motion of targets. The peculiarity of observers is divided into the number of observers, the divisibility of efforts for search, the credibility of search information and the search process. The standard of optimality is divided into the maximum probability of detection, the minimum risk expected and the others. Each item written above of search model is explained. Concerning the formulation of the search model, the theoretical equations for detection probability, discovery potential and instantaneous detection probability, density are derived, and these equations are evaluated and explained. The future plan is to advance the search technology so as to evaluate the detection potential to decide the route of running a monitoring car for a nuclear power plant at accidental condition. (Nakai, Y.)

  4. Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks

    DEFF Research Database (Denmark)

    Pretolani, Daniele; Nielsen, Lars Relund; Andersen, Kim Allan

    2009-01-01

    We compare two different models for multicriterion routing in stochastic time-dependent networks: the classic "time-adaptive'' model and the more flexible "history-adaptive'' one. We point out several properties of the sets of efficient solutions found under the two models. We also devise a method...

  5. Vehicle routing with dynamic travel times : a queueing approach

    NARCIS (Netherlands)

    Woensel, van T.; Kerbache, L.; Peremans, H.; Vandaele, N.J.

    2008-01-01

    Transportation is an important component of supply chain competitiveness since it plays a major role in the inbound, inter-facility, and outbound logistics. In this context, assigning and scheduling vehicle routes is a crucial management problem. In this paper, a vehicle routing problem with dynamic

  6. Pithy Review on Routing Protocols in Wireless Sensor Networks and Least Routing Time Opportunistic Technique in WSN

    Science.gov (United States)

    Salman Arafath, Mohammed; Rahman Khan, Khaleel Ur; Sunitha, K. V. N.

    2018-01-01

    Nowadays due to most of the telecommunication standard development organizations focusing on using device-to-device communication so that they can provide proximity-based services and add-on services on top of the available cellular infrastructure. An Oppnets and wireless sensor network play a prominent role here. Routing in these networks plays a significant role in fields such as traffic management, packet delivery etc. Routing is a prodigious research area with diverse unresolved issues. This paper firstly focuses on the importance of Opportunistic routing and its concept then focus is shifted to prime aspect i.e. on packet reception ratio which is one of the highest QoS Awareness parameters. This paper discusses the two important functions of routing in wireless sensor networks (WSN) namely route selection using least routing time algorithm (LRTA) and data forwarding using clustering technique. Finally, the simulation result reveals that LRTA performs relatively better than the existing system in terms of average packet reception ratio and connectivity.

  7. An Evolutionary Real-Time 3D Route Planner for Aircraft

    Institute of Scientific and Technical Information of China (English)

    郑昌文; 丁明跃; 周成平

    2003-01-01

    A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By using problem-specific chromosome structure and genetic operators, the routes are generated in real time,with different mission constraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving angle and route distance constraint taken into account.

  8. Noise-constrained switching times for heteroclinic computing

    Science.gov (United States)

    Neves, Fabio Schittler; Voit, Maximilian; Timme, Marc

    2017-03-01

    Heteroclinic computing offers a novel paradigm for universal computation by collective system dynamics. In such a paradigm, input signals are encoded as complex periodic orbits approaching specific sequences of saddle states. Without inputs, the relevant states together with the heteroclinic connections between them form a network of states—the heteroclinic network. Systems of pulse-coupled oscillators or spiking neurons naturally exhibit such heteroclinic networks of saddles, thereby providing a substrate for general analog computations. Several challenges need to be resolved before it becomes possible to effectively realize heteroclinic computing in hardware. The time scales on which computations are performed crucially depend on the switching times between saddles, which in turn are jointly controlled by the system's intrinsic dynamics and the level of external and measurement noise. The nonlinear dynamics of pulse-coupled systems often strongly deviate from that of time-continuously coupled (e.g., phase-coupled) systems. The factors impacting switching times in pulse-coupled systems are still not well understood. Here we systematically investigate switching times in dependence of the levels of noise and intrinsic dissipation in the system. We specifically reveal how local responses to pulses coact with external noise. Our findings confirm that, like in time-continuous phase-coupled systems, piecewise-continuous pulse-coupled systems exhibit switching times that transiently increase exponentially with the number of switches up to some order of magnitude set by the noise level. Complementarily, we show that switching times may constitute a good predictor for the computation reliability, indicating how often an input signal must be reiterated. By characterizing switching times between two saddles in conjunction with the reliability of a computation, our results provide a first step beyond the coding of input signal identities toward a complementary coding for

  9. Enhanced DSR Routing Protocol for the Short Time Disconnected MANET

    Directory of Open Access Journals (Sweden)

    PAPAJ Ján

    2013-05-01

    Full Text Available Data delivery in Mobile Ad-Hoc network (MANET is a very difficult task due to the fact the sporadic connections between mobile nodes. For this reason, we introduce the new modified routing protocol that enables the data delivery in the case that the connections are disconnected. A key aspect of the protocol is a process of finding connections between source and destination nodes that can provide low end-to-end delay and better delivery performance in a disconnected MANET. The protocol provides the concepts of opportunistic routing of the routing packets in disconnected MANETs. In this paper we present a modification of the DSR routing protocol and also some results of a simulation.

  10. Sequential and Biomechanical Factors Constrain Timing and Motion in Tapping

    NARCIS (Netherlands)

    Loehr, J.D.; Palmer, C.

    2009-01-01

    The authors examined how timing accuracy in tapping sequences is influenced by sequential effects of preceding finger movements and biomechanical interdependencies among fingers. Skilled pianists tapped Sequences at 3 rates; in each sequence, a finger whose motion was more or less independent of

  11. A two-hop based adaptive routing protocol for real-time wireless sensor networks.

    Science.gov (United States)

    Rachamalla, Sandhya; Kancherla, Anitha Sheela

    2016-01-01

    One of the most important and challenging issues in wireless sensor networks (WSNs) is to optimally manage the limited energy of nodes without degrading the routing efficiency. In this paper, we propose an energy-efficient adaptive routing mechanism for WSNs, which saves energy of nodes by removing the much delayed packets without degrading the real-time performance of the used routing protocol. It uses the adaptive transmission power algorithm which is based on the attenuation of the wireless link to improve the energy efficiency. The proposed routing mechanism can be associated with any geographic routing protocol and its performance is evaluated by integrating with the well known two-hop based real-time routing protocol, PATH and the resulting protocol is energy-efficient adaptive routing protocol (EE-ARP). The EE-ARP performs well in terms of energy consumption, deadline miss ratio, packet drop and end-to-end delay.

  12. Waiting Time Distributions for Pattern Occurrence in a Constrained Sequence

    Directory of Open Access Journals (Sweden)

    Valeri Stefanov

    2007-01-01

    Full Text Available A binary sequence of zeros and ones is called a (d,k-sequence if it does not contain runs of zeros of length either less than d or greater than k, where d and k are arbitrary, but fixed, non-negative integers and d < k. Such sequences find an abundance of applications in communications, in particular for magnetic and optical recording. Occasionally, one requires that (d,k-sequences do not contain a specific pattern w. Therefore, distribution results concerning pattern occurrence in (d,k-sequences are of interest. In this paper we study the distribution of the waiting time until the r th occurrence of a pattern w in a random (d,k-sequence generated by a Markov source. Numerical examples are also provided.

  13. Reliable Rescue Routing Optimization for Urban Emergency Logistics under Travel Time Uncertainty

    Directory of Open Access Journals (Sweden)

    Qiuping Li

    2018-02-01

    Full Text Available The reliability of rescue routes is critical for urban emergency logistics during disasters. However, studies on reliable rescue routing under stochastic networks are still rare. This paper proposes a multiobjective rescue routing model for urban emergency logistics under travel time reliability. A hybrid metaheuristic integrating ant colony optimization (ACO and tabu search (TS was designed to solve the model. An experiment optimizing rescue routing plans under a real urban storm event, was carried out to validate the proposed model. The experimental results showed how our approach can improve rescue efficiency with high travel time reliability.

  14. Maximizing time from the constraining European Working Time Directive (EWTD): The Heidelberg New Working Time Model.

    Science.gov (United States)

    Schimmack, Simon; Hinz, Ulf; Wagner, Andreas; Schmidt, Thomas; Strothmann, Hendrik; Büchler, Markus W; Schmitz-Winnenthal, Hubertus

    2014-01-01

    The introduction of the European Working Time Directive (EWTD) has greatly reduced training hours of surgical residents, which translates into 30% less surgical and clinical experience. Such a dramatic drop in attendance has serious implications such compromised quality of medical care. As the surgical department of the University of Heidelberg, our goal was to establish a model that was compliant with the EWTD while avoiding reduction in quality of patient care and surgical training. We first performed workload analyses and performance statistics for all working areas of our department (operation theater, emergency room, specialized consultations, surgical wards and on-call duties) using personal interviews, time cards, medical documentation software as well as data of the financial- and personnel-controlling sector of our administration. Using that information, we specifically designed an EWTD-compatible work model and implemented it. Surgical wards and operating rooms (ORs) were not compliant with the EWTD. Between 5 pm and 8 pm, three ORs were still operating two-thirds of the time. By creating an extended work shift (7:30 am-7:30 pm), we effectively reduced the workload to less than 49% from 4 pm and 8 am, allowing the combination of an eight-hour working day with a 16-hour on call duty; thus, maximizing surgical resident training and ensuring patient continuity of care while maintaining EDTW guidelines. A precise workload analysis is the key to success. The Heidelberg New Working Time Model provides a legal model, which, by avoiding rotating work shifts, assures quality of patient care and surgical training.

  15. Cross-training workers in dual resource constrained systems with heterogeneous processing times

    NARCIS (Netherlands)

    Bokhorst, J. A. C.; Gaalman, G. J. C.

    2009-01-01

    In this paper, we explore the effect of cross-training workers in Dual Resource Constrained (DRC) systems with machines having different mean processing times. By means of queuing and simulation analysis, we show that the detrimental effects of pooling (cross-training) previously found in single

  16. Dynamic call center routing policies using call waiting and agent idle times

    NARCIS (Netherlands)

    Chan, W.; Koole, G.M.; L'Ecuyer, P.

    2014-01-01

    We study call routing policies for call centers with multiple call types and multiple agent groups. We introduce new weight-based routing policies where each pair (call type, agent group) is given a matching priority defined as an affine combination of the longest waiting time for that call type and

  17. The waste collection vehicle routing problem with time windows in a city logistics context

    DEFF Research Database (Denmark)

    Buhrkal, Katja Frederik; Larsen, Allan; Røpke, Stefan

    2012-01-01

    Collection of waste is an important logistic activity within any city. In this paper we study how to collect waste in an efficient way. We study the Waste Collection Vehicle Routing Problem with Time Window which is concerned with finding cost optimal routes for garbage trucks such that all garbage...

  18. Real-Time QoS Routing Protocols in Wireless Multimedia Sensor Networks: Study and Analysis.

    Science.gov (United States)

    Alanazi, Adwan; Elleithy, Khaled

    2015-09-02

    Many routing protocols have been proposed for wireless sensor networks. These routing protocols are almost always based on energy efficiency. However, recent advances in complementary metal-oxide semiconductor (CMOS) cameras and small microphones have led to the development of Wireless Multimedia Sensor Networks (WMSN) as a class of wireless sensor networks which pose additional challenges. The transmission of imaging and video data needs routing protocols with both energy efficiency and Quality of Service (QoS) characteristics in order to guarantee the efficient use of the sensor nodes and effective access to the collected data. Also, with integration of real time applications in Wireless Senor Networks (WSNs), the use of QoS routing protocols is not only becoming a significant topic, but is also gaining the attention of researchers. In designing an efficient QoS routing protocol, the reliability and guarantee of end-to-end delay are critical events while conserving energy. Thus, considerable research has been focused on designing energy efficient and robust QoS routing protocols. In this paper, we present a state of the art research work based on real-time QoS routing protocols for WMSNs that have already been proposed. This paper categorizes the real-time QoS routing protocols into probabilistic and deterministic protocols. In addition, both categories are classified into soft and hard real time protocols by highlighting the QoS issues including the limitations and features of each protocol. Furthermore, we have compared the performance of mobility-aware query based real-time QoS routing protocols from each category using Network Simulator-2 (NS2). This paper also focuses on the design challenges and future research directions as well as highlights the characteristics of each QoS routing protocol.

  19. Partial path column generation for the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Petersen, Bjørn; Jepsen, Mads Kehlet

    2009-01-01

    This paper presents a column generation algorithm for the Vehicle Routing Problem with Time Windows (VRPTW). Traditionally, column generation models of the VRPTW have consisted of a Set Partitioning master problem with each column representing a route, i.e., a resource feasible path starting...... and ending at the depot. Elementary routes (no customer visited more than once) have shown superior results on difficult instances (less restrictive capacity and time windows). However, the pricing problems do not scale well when the number of feasible routes increases, i.e., when a route may contain a large...... number of customers. We suggest to relax that ‘each column is a route’ into ‘each column is a part of the giant tour’; a so-called partial path, i.e., not necessarily starting and ending in the depot. This way, the length of the partial path can be bounded and a better control of the size of the solution...

  20. The Linehaul-Feeder Vehicle Routing Problem with Virtual Depots and Time Windows

    Directory of Open Access Journals (Sweden)

    Huey-Kuo Chen

    2011-01-01

    Full Text Available This paper addresses the linehaul-feeder vehicle routing problem with virtual depots and time windows (LFVRPTW. Small and large vehicles deliver services to customers within time constraints; small vehicles en route may reload commodities from either the physical depot or from the larger vehicle at a virtual depot before continuing onward. A two-stage solution heuristic involving Tabu search is proposed to solve this problem. The test results show that the LFVRPTW performs better than the vehicle routing problem with time windows in terms of both objective value and the number of small vehicles dispatched.

  1. A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows

    Directory of Open Access Journals (Sweden)

    N. Rincon-Garcia

    2017-01-01

    Full Text Available This article paper presents a hybrid metaheuristic algorithm to solve the time-dependent vehicle routing problem with hard time windows. Time-dependent travel times are influenced by different congestion levels experienced throughout the day. Vehicle scheduling without consideration of congestion might lead to underestimation of travel times and consequently missed deliveries. The algorithm presented in this paper makes use of Large Neighbourhood Search approaches and Variable Neighbourhood Search techniques to guide the search. A first stage is specifically designed to reduce the number of vehicles required in a search space by the reduction of penalties generated by time-window violations with Large Neighbourhood Search procedures. A second stage minimises the travel distance and travel time in an ‘always feasible’ search space. Comparison of results with available test instances shows that the proposed algorithm is capable of obtaining a reduction in the number of vehicles (4.15%, travel distance (10.88% and travel time (12.00% compared to previous implementations in reasonable time.

  2. Constrained choices? Linking employees' and spouses' work time to health behaviors.

    Science.gov (United States)

    Fan, Wen; Lam, Jack; Moen, Phyllis; Kelly, Erin; King, Rosalind; McHale, Susan

    2015-02-01

    There are extensive literatures on work conditions and health and on family contexts and health, but less research asking how a spouse or partners' work conditions may affect health behaviors. Drawing on the constrained choices framework, we theorized health behaviors as a product of one's own time and spouses' work time as well as gender expectations. We examined fast food consumption and exercise behaviors using survey data from 429 employees in an Information Technology (IT) division of a U.S. Fortune 500 firm and from their spouses. We found fast food consumption is affected by men's work hours-both male employees' own work hours and the hours worked by husbands of women respondents-in a nonlinear way. The groups most likely to eat fast food are men working 50 h/week and women whose husbands work 45-50 h/week. Second, exercise is better explained if work time is conceptualized at the couple, rather than individual, level. In particular, neo-traditional arrangements (where husbands work longer than their wives) constrain women's ability to engage in exercise but increase odds of men exercising. Women in couples where both partners are working long hours have the highest odds of exercise. In addition, women working long hours with high schedule control are more apt to exercise and men working long hours whose wives have high schedule flexibility are as well. Our findings suggest different health behaviors may have distinct antecedents but gendered work-family expectations shape time allocations in ways that promote men's and constrain women's health behaviors. They also suggest the need to expand the constrained choices framework to recognize that long hours may encourage exercise if both partners are looking to sustain long work hours and that work resources, specifically schedule control, of one partner may expand the choices of the other. Copyright © 2014 Elsevier Ltd. All rights reserved.

  3. Vehicle Routing Problem with Backhaul, Multiple Trips and Time Window

    Directory of Open Access Journals (Sweden)

    Johan Oscar Ong

    2011-01-01

    Full Text Available Transportation planning is one of the important components to increase efficiency and effectiveness in the supply chain system. Good planning will give a saving in total cost of the supply chain. This paper develops the new VRP variants’, VRP with backhauls, multiple trips, and time window (VRPBMTTW along with its problem solving techniques by using Ant Colony Optimization (ACO and Sequential Insertion as initial solution algorithm. ACO is modified by adding the decoding process in order to determine the number of vehicles, total duration time, and range of duration time regardless of checking capacity constraint and time window. This algorithm is tested by using set of random data and verified as well as analyzed its parameter changing’s. The computational results for hypothetical data with 50% backhaul and mix time windows are reported.

  4. A First-order Prediction-Correction Algorithm for Time-varying (Constrained) Optimization: Preprint

    Energy Technology Data Exchange (ETDEWEB)

    Dall-Anese, Emiliano [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Simonetto, Andrea [Universite catholique de Louvain

    2017-07-25

    This paper focuses on the design of online algorithms based on prediction-correction steps to track the optimal solution of a time-varying constrained problem. Existing prediction-correction methods have been shown to work well for unconstrained convex problems and for settings where obtaining the inverse of the Hessian of the cost function can be computationally affordable. The prediction-correction algorithm proposed in this paper addresses the limitations of existing methods by tackling constrained problems and by designing a first-order prediction step that relies on the Hessian of the cost function (and do not require the computation of its inverse). Analytical results are established to quantify the tracking error. Numerical simulations corroborate the analytical results and showcase performance and benefits of the algorithms.

  5. Constraining the timing of palaeosol development in Iranian arid environments using OSL dating

    DEFF Research Database (Denmark)

    Rashidi, Zakieh; Sohbati, Reza; Karimi, Alireza

    2018-01-01

    are compared to investigate the degree of bleaching of quartz OSL in individual samples at the time of deposition. A comparison between the quartz OSL and K-feldspar IR50 ages shows that 12 out of 15 samples were probably well-bleached prior to deposition. The 17 OSL ages constrain at least four broad phases......The ages of palaeosols in arid environments in Iran are constrained using the optically stimulated luminescence (OSL) signal from quartz. The luminescence properties of quartz OSL and K-feldspar infrared stimulated luminescence (IRSL) at 50 °C (IR50) and post-IR IRSL at 290 °C (pIRIR290) signals...

  6. Sailing Vessel Routing Considering Safety Zone and Penalty Time for Altering Course

    Directory of Open Access Journals (Sweden)

    Marcin Zyczkowski

    2017-06-01

    Full Text Available In this paper we introduce new model for simulation sea vessel routing. Besides a vessel types (polar diagram and weather forecast, travel security and the number of maneuvers are considered. Based on these data both the minimal travelling costs and the minimal processing time are found for different vessels and different routes. To test our model the applications SailingAssistance wad improved. The obtained results shows that we can obtain quite acceptable results.

  7. Stochastic time-dependent vehicle routing problem: Mathematical models and ant colony algorithm

    Directory of Open Access Journals (Sweden)

    Zhengyu Duan

    2015-11-01

    Full Text Available This article addresses the stochastic time-dependent vehicle routing problem. Two mathematical models named robust optimal schedule time model and minimum expected schedule time model are proposed for stochastic time-dependent vehicle routing problem, which can guarantee delivery within the time windows of customers. The robust optimal schedule time model only requires the variation range of link travel time, which can be conveniently derived from historical traffic data. In addition, the robust optimal schedule time model based on robust optimization method can be converted into a time-dependent vehicle routing problem. Moreover, an ant colony optimization algorithm is designed to solve stochastic time-dependent vehicle routing problem. As the improvements in initial solution and transition probability, ant colony optimization algorithm has a good performance in convergence. Through computational instances and Monte Carlo simulation tests, robust optimal schedule time model is proved to be better than minimum expected schedule time model in computational efficiency and coping with the travel time fluctuations. Therefore, robust optimal schedule time model is applicable in real road network.

  8. Time and multiple objectives in scheduling and routing problems

    NARCIS (Netherlands)

    Dabia, S.

    2012-01-01

    Many optimization problems encountered in practice are multi-objective by nature, i.e., different objectives are conflicting and equally important. Many times, it is not desirable to drop some of them or to optimize them in a composite single objective or hierarchical manner. Furthermore, cost

  9. Refinements of the column generation process for the Vehicle Routing Problem with Time Windows

    DEFF Research Database (Denmark)

    Larsen, Jesper

    2004-01-01

    interval denoted the time window. The objective is to determine routes for the vehicles that minimizes the accumulated cost (or distance) with respect to the above mentioned constraints. Currently the best approaches for determining optimal solutions are based on column generation and Branch......-and-Bound, also known as Branch-and-Price. This paper presents two ideas for run-time improvements of the Branch-and-Price framework for the Vehicle Routing Problem with Time Windows. Both ideas reveal a significant potential for using run-time refinements when speeding up an exact approach without compromising...

  10. Constraining designs for synthesis and timing analysis a practical guide to synopsys design constraints (SDC)

    CERN Document Server

    Gangadharan, Sridhar

    2013-01-01

    This book serves as a hands-on guide to timing constraints in integrated circuit design.  Readers will learn to maximize performance of their IC designs, by specifying timing requirements correctly.  Coverage includes key aspects of the design flow impacted by timing constraints, including synthesis, static timing analysis and placement and routing.  Concepts needed for specifying timing requirements are explained in detail and then applied to specific stages in the design flow, all within the context of Synopsys Design Constraints (SDC), the industry-leading format for specifying constraints.  ·         Provides a hands-on guide to synthesis and timing analysis, using Synopsys Design Constraints (SDC), the industry-leading format for specifying constraints; ·         Includes key topics of interest to a synthesis, static timing analysis or  place and route engineer; ·         Explains which constraints command to use for ease of maintenance and reuse, given several options pos...

  11. Layered and Laterally Constrained 2D Inversion of Time Domain Induced Polarization Data

    DEFF Research Database (Denmark)

    Fiandaca, Gianluca; Ramm, James; Auken, Esben

    description of the transmitter waveform and of the receiver transfer function allowing for a quantitative interpretation of the parameters. The code has been optimized for parallel computation and the inversion time is comparable to codes inverting just for direct current resistivity. The new inversion......In a sedimentary environment, quasi-layered models often represent the actual geology more accurately than smooth minimum-structure models. We have developed a new layered and laterally constrained inversion algorithm for time domain induced polarization data. The algorithm is based on the time...... transform of a complex resistivity forward response and the inversion extracts the spectral information of the time domain measures in terms of the Cole-Cole parameters. The developed forward code and inversion algorithm use the full time decay of the induced polarization response, together with an accurate...

  12. Optimal routing of hazardous substances in time-varying, stochastic transportation networks

    International Nuclear Information System (INIS)

    Woods, A.L.; Miller-Hooks, E.; Mahmassani, H.S.

    1998-07-01

    This report is concerned with the selection of routes in a network along which to transport hazardous substances, taking into consideration several key factors pertaining to the cost of transport and the risk of population exposure in the event of an accident. Furthermore, the fact that travel time and the risk measures are not constant over time is explicitly recognized in the routing decisions. Existing approaches typically assume static conditions, possibly resulting in inefficient route selection and unnecessary risk exposure. The report described the application of recent advances in network analysis methodologies to the problem of routing hazardous substances. Several specific problem formulations are presented, reflecting different degrees of risk aversion on the part of the decision-maker, as well as different possible operational scenarios. All procedures explicitly consider travel times and travel costs (including risk measures) to be stochastic time-varying quantities. The procedures include both exact algorithms, which may require extensive computational effort in some situations, as well as more efficient heuristics that may not guarantee a Pareto-optimal solution. All procedures are systematically illustrated for an example application using the Texas highway network, for both normal and incident condition scenarios. The application illustrates the trade-offs between the information obtained in the solution and computational efficiency, and highlights the benefits of incorporating these procedures in a decision-support system for hazardous substance shipment routing decisions

  13. The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations

    DEFF Research Database (Denmark)

    Hiermann, Gerhard; Puchinger, Jakob; Røpke, Stefan

    2016-01-01

    Due to new regulations and further technological progress in the field of electric vehicles, the research community faces the new challenge of incorporating the electric energy based restrictions into vehicle routing problems. One of these restrictions is the limited battery capacity which makes...... detours to recharging stations necessary, thus requiring efficient tour planning mechanisms in order to sustain the competitiveness of electric vehicles compared to conventional vehicles. We introduce the Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations (E......-FSMFTW) to model decisions to be made with regards to fleet composition and the actual vehicle routes including the choice of recharging times and locations. The available vehicle types differ in their transport capacity, battery size and acquisition cost. Furthermore, we consider time windows at customer...

  14. Modified Pagerank Algorithm Based Real-Time Metropolitan Vehicular Traffic Routing Using GPS Crowdsourcing Data

    Directory of Open Access Journals (Sweden)

    Adithya Guru Vaishnav.S

    2015-08-01

    Full Text Available This paper aims at providing a theoretical framework to find an optimized route from any source to destination considering the real-time traffic congestion issues. The distance of various possible routes from the source and destination are calculated and a PathRank is allocated in the descending order of distance to each possible path. Each intermediate locations are considered as nodes of a graph and the edges are represented by real-time traffic flow monitored using GoogleMaps GPS crowdsourcing data. The Page Rank is calculated for each intermediate node. From the values of PageRank and PathRank the minimum sum term is used to find an optimized route with minimal trade-off between shortest path and real-time traffic.

  15. New heuristics for the fleet size and mix vehicle routing problem with time windows

    NARCIS (Netherlands)

    Dullaert, W.; Janssens, Gerrit K.; Sirensen, K.; Vernimmen, Bert

    2002-01-01

    In the Fleet Size and Mix Vehicle Routing Problem with Time Windows (FSMVRPTW) customers need to be serviced in their time windows at minimal costs by a heterogeneous fleet. In this paper new heuristics for the FSMVRPTW are developed. The performance of the heuristics is shown to be significantly

  16. A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem

    NARCIS (Netherlands)

    K. Dalmeijer (Kevin); R. Spliet (Remy)

    2016-01-01

    textabstractThis paper presents a branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem (TWAVRP), the problem of assigning time windows for delivery before demand volume becomes known. A novel set of valid inequalities, the precedence inequalities, is introduced and

  17. Robust model predictive control for constrained continuous-time nonlinear systems

    Science.gov (United States)

    Sun, Tairen; Pan, Yongping; Zhang, Jun; Yu, Haoyong

    2018-02-01

    In this paper, a robust model predictive control (MPC) is designed for a class of constrained continuous-time nonlinear systems with bounded additive disturbances. The robust MPC consists of a nonlinear feedback control and a continuous-time model-based dual-mode MPC. The nonlinear feedback control guarantees the actual trajectory being contained in a tube centred at the nominal trajectory. The dual-mode MPC is designed to ensure asymptotic convergence of the nominal trajectory to zero. This paper extends current results on discrete-time model-based tube MPC and linear system model-based tube MPC to continuous-time nonlinear model-based tube MPC. The feasibility and robustness of the proposed robust MPC have been demonstrated by theoretical analysis and applications to a cart-damper springer system and a one-link robot manipulator.

  18. Real-time travel time prediction framework for departure time and route advice

    NARCIS (Netherlands)

    Calvert, S.C.; Snelder, M.; Bakri, T.; Heijligers, B.; Knoop, V.L.

    2015-01-01

    Heavily used urban networks remain a challenge for travel time prediction because traffic flow is rarely homogeneous and is also subject to a wide variety of disturbances. Various models, some of which use traffic flow theory and some of which are data driven, have been developed to predict traffic

  19. A New Continuous-Time Equality-Constrained Optimization to Avoid Singularity.

    Science.gov (United States)

    Quan, Quan; Cai, Kai-Yuan

    2016-02-01

    In equality-constrained optimization, a standard regularity assumption is often associated with feasible point methods, namely, that the gradients of constraints are linearly independent. In practice, the regularity assumption may be violated. In order to avoid such a singularity, a new projection matrix is proposed based on which a feasible point method to continuous-time, equality-constrained optimization is developed. First, the equality constraint is transformed into a continuous-time dynamical system with solutions that always satisfy the equality constraint. Second, a new projection matrix without singularity is proposed to realize the transformation. An update (or say a controller) is subsequently designed to decrease the objective function along the solutions of the transformed continuous-time dynamical system. The invariance principle is then applied to analyze the behavior of the solution. Furthermore, the proposed method is modified to address cases in which solutions do not satisfy the equality constraint. Finally, the proposed optimization approach is applied to three examples to demonstrate its effectiveness.

  20. Joint optimization of green vehicle scheduling and routing problem with time-varying speeds

    Science.gov (United States)

    Zhang, Dezhi; Wang, Xin; Ni, Nan; Zhang, Zhuo

    2018-01-01

    Based on an analysis of the congestion effect and changes in the speed of vehicle flow during morning and evening peaks in a large- or medium-sized city, the piecewise function is used to capture the rules of the time-varying speed of vehicles, which are very important in modelling their fuel consumption and CO2 emission. A joint optimization model of the green vehicle scheduling and routing problem with time-varying speeds is presented in this study. Extra wages during nonworking periods and soft time-window constraints are considered. A heuristic algorithm based on the adaptive large neighborhood search algorithm is also presented. Finally, a numerical simulation example is provided to illustrate the optimization model and its algorithm. Results show that, (1) the shortest route is not necessarily the route that consumes the least energy, (2) the departure time influences the vehicle fuel consumption and CO2 emissions and the optimal departure time saves on fuel consumption and reduces CO2 emissions by up to 5.4%, and (3) extra driver wages have significant effects on routing and departure time slot decisions. PMID:29466370

  1. 'Football Fitness': constraining and enabling possibilities for the management of leisure time for women

    DEFF Research Database (Denmark)

    Thing, Lone Friis; Hybholt, Maria Gliemann; Jensen, Andorra Lynn

    2017-01-01

    The aim of the article is to identify constraining and enabling aspects for the management of leisure time for women participating in ‘Football Fitness’, a new ‘sport for all programme’ carried out in associative sport clubs in Denmark. The article is based on six focus group interviews with white......, middle-class female participants (N = 32, aged 27–56). An analysis combining Hochschild’s conceptualization of the second and third shift [1989. The Second Shift. New York: Avon] with Elias and Dunning’s perspective on leisure as part of the spare-time spectrum and leisure sport as a quest for excitement...... [1986. Quest for Excitement. Sport and Leisure in the Civilizing Process. New York: Basil Blackwell] demonstrates that leisure sport participation must be understood in relation to both spare time, family life, and work life, as these spheres are interrelated. According to the women, both doing...

  2. Performance Analysis of the Enhanced DSR Routing Protocol for the Short Time Disconnected MANET to the OPNET Modeler

    Directory of Open Access Journals (Sweden)

    PAPAJ Ján

    2013-05-01

    Full Text Available Disconnected mobile ad-hoc networks (MANET are very important areas of the research. In this article, the performance analysis of the enhanced dynamic source routing protocol (OPP_DSR is introduced. This modification enables the routing process in the case when there are no connections to other mobile nodes. It also will enable the routing mechanisms when the routes, selected by routing mechanisms, are disconnected for some time. Disconnection can be for a short time and standard routing protocol DSR cannot reflect on this situation.The main idea is based on opportunistic forwarding where the nodes not only forward data but it's stored in the cache during long time. The network parameters throughput, routing load and are analysed.

  3. On the optimal identification of tag sets in time-constrained RFID configurations.

    Science.gov (United States)

    Vales-Alonso, Javier; Bueno-Delgado, María Victoria; Egea-López, Esteban; Alcaraz, Juan José; Pérez-Mañogil, Juan Manuel

    2011-01-01

    In Radio Frequency Identification facilities the identification delay of a set of tags is mainly caused by the random access nature of the reading protocol, yielding a random identification time of the set of tags. In this paper, the cumulative distribution function of the identification time is evaluated using a discrete time Markov chain for single-set time-constrained passive RFID systems, namely those ones where a single group of tags is assumed to be in the reading area and only for a bounded time (sojourn time) before leaving. In these scenarios some tags in a set may leave the reader coverage area unidentified. The probability of this event is obtained from the cumulative distribution function of the identification time as a function of the sojourn time. This result provides a suitable criterion to minimize the probability of losing tags. Besides, an identification strategy based on splitting the set of tags in smaller subsets is also considered. Results demonstrate that there are optimal splitting configurations that reduce the overall identification time while keeping the same probability of losing tags.

  4. Influence of capacity- and time-constrained intermediate storage in two-stage food production systems

    DEFF Research Database (Denmark)

    Akkerman, Renzo; van Donk, Dirk Pieter; Gaalman, Gerard

    2007-01-01

    In food processing, two-stage production systems with a batch processor in the first stage and packaging lines in the second stage are common and mostly separated by capacity- and time-constrained intermediate storage. This combination of constraints is common in practice, but the literature hardly...... of systems like this. Contrary to the common sense in operations management, the LPT rule is able to maximize the total production volume per day. Furthermore, we show that adding one tank has considerable effects. Finally, we conclude that the optimal setup frequency for batches in the first stage...... pays any attention to this. In this paper, we show how various capacity and time constraints influence the performance of a specific two-stage system. We study the effects of several basic scheduling and sequencing rules in the presence of these constraints in order to learn the characteristics...

  5. Distance Constrained Based Adaptive Flocking Control for Multiagent Networks with Time Delay

    Directory of Open Access Journals (Sweden)

    Qing Zhang

    2015-01-01

    Full Text Available The flocking control of multiagent system is a new type of decentralized control method, which has aroused great attention. The paper includes a detailed research in terms of distance constrained based adaptive flocking control for multiagent system with time delay. Firstly, the program on the adaptive flocking with time delay of multiagent is proposed. Secondly, a kind of adaptive controllers and updating laws are presented. According to the Lyapunov stability theory, it is proved that the distance between agents can be larger than a constant during the motion evolution. What is more, velocities of each agent come to the same asymptotically. Finally, the analytical results can be verified by a numerical example.

  6. Off-Line Robust Constrained MPC for Linear Time-Varying Systems with Persistent Disturbances

    Directory of Open Access Journals (Sweden)

    P. Bumroongsri

    2014-01-01

    Full Text Available An off-line robust constrained model predictive control (MPC algorithm for linear time-varying (LTV systems is developed. A novel feature is the fact that both model uncertainty and bounded additive disturbance are explicitly taken into account in the off-line formulation of MPC. In order to reduce the on-line computational burdens, a sequence of explicit control laws corresponding to a sequence of positively invariant sets is computed off-line. At each sampling time, the smallest positively invariant set containing the measured state is determined and the corresponding control law is implemented in the process. The proposed MPC algorithm can guarantee robust stability while ensuring the satisfaction of input and output constraints. The effectiveness of the proposed MPC algorithm is illustrated by two examples.

  7. Approximation algorithms for deadline-TSP and vehicle routing with time-windows

    NARCIS (Netherlands)

    Bansal, N.; Blum, A.; Chawla, S.; Meyerson, A.; Babai, L.

    2004-01-01

    Given a metric space G on n nodes, with a start node r and deadlines D(v) for each vertex v, we consider the Deadline-TSP problem of finding a path starting at r that visits as many nodes as possible by their deadlines. We also consider the more general Vehicle Routing with Time-Windows problem, in

  8. Constraint Programming based Local Search for the Vehicle Routing Problem with Time Windows

    OpenAIRE

    Sala Reixach, Joan

    2012-01-01

    El projecte es centra en el "Vehicle Routing Problem with Time Windows". Explora i testeja un mètode basat en una formulació del problema en termes de programació de restriccions. Implementa un mètode de cerca local amb la capacitat de fer grans moviments anomenat "Large Neighbourhood Search".

  9. Bicriterion a priori route choice in stochastic time-dependent networks

    DEFF Research Database (Denmark)

    Nielsen, Lars Relund; Andersen, Kim Allan; Pretolani, Daniele

    In recent years there has been a growing interest in using stochastic time-dependent (STD) networks as a modelling tool for a number of applications within such areas as transportation and telecommunications. It is known that an optimal routing policy does not necessarily correspond to a path...

  10. Bicriterion a priori route choice in stochastic time-dependent networks

    DEFF Research Database (Denmark)

    Nielsen, Lars Relund; Pretolani, D; Andersen, K A

    2006-01-01

    In recent years there has been a growing interest in using stochastic time-dependent (STD) networks as a modelling tool for a number of applications within such areas as transportation and telecommunications. It is known that an optimal routing policy does not necessarily correspond to a path...

  11. Simultaneous Optimization of Container Ship Sailing Speed and Container Routing with Transit Time Restrictions

    DEFF Research Database (Denmark)

    Karsten, Christian Vad; Røpke, Stefan; Pisinger, David

    We introduce a decision support tool for liner shipping companies to optimally determine the sailing speed and needed fleet for a global network. As a novelty we incorporate cargo routing decisions with tight transit time restrictions on each container such that we get a realistic picture...

  12. ANALYTICAL ESTIMATION OF MINIMUM AND MAXIMUM TIME EXPENDITURES OF PASSENGERS AT AN URBAN ROUTE STOP

    Directory of Open Access Journals (Sweden)

    Gorbachov, P.

    2013-01-01

    Full Text Available This scientific paper deals with the problem related to the definition of average time spent by passengers while waiting for transport vehicles at urban stops as well as the results of analytical modeling of this value at traffic schedule unknown to the passengers and of two options of the vehicle traffic management on the given route.

  13. Formulations and exact algorithms for the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Kallehauge, Brian

    2008-01-01

    In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for the VRPTW are in many aspects inherited from work on the traveling salesman problem (TSP). In recognition of this fact...

  14. Simulated annealing (SA to vehicle routing problems with soft time windows

    Directory of Open Access Journals (Sweden)

    Suphan Sodsoon

    2014-12-01

    Full Text Available The researcher has applied and develops the meta-heuristics method to solve Vehicle Routing Problems with Soft Time Windows (VRPSTW. For this case there was only one depot, multi customers which each generally sparse either or demand was different though perceived number of demand and specific period of time to receive them. The Operation Research was representative combinatorial optimization problems and is known to be NP-hard. In this research algorithm, use Simulated Annealing (SA to determine the optimum solutions which rapidly time solving. After developed the algorithms, apply them to examine the factors and the optimum extended time windows and test these factors with vehicle problem routing under specific time windows by Solomon in OR-Library in case of maximum 25 customers. Meanwhile, 6 problems are including of C101, C102, R101, R102, RC101 and RC102 respectively. The result shows the optimum extended time windows at level of 50%. At last, after comparison these answers with the case of vehicle problem routing under specific time windows and flexible time windows, found that percentage errors on number of vehicles approximately by -28.57% and percentage errors on distances approximately by -28.57% which this algorithm spent average processing time on 45.5 sec/problems.

  15. Time Dependent Heterogeneous Vehicle Routing Problem for Catering Service Delivery Problem

    Science.gov (United States)

    Azis, Zainal; Mawengkang, Herman

    2017-09-01

    The heterogeneous vehicle routing problem (HVRP) is a variant of vehicle routing problem (VRP) which describes various types of vehicles with different capacity to serve a set of customers with known geographical locations. This paper considers the optimal service deliveries of meals of a catering company located in Medan City, Indonesia. Due to the road condition as well as traffic, it is necessary for the company to use different type of vehicle to fulfill customers demand in time. The HVRP incorporates time dependency of travel times on the particular time of the day. The objective is to minimize the sum of the costs of travelling and elapsed time over the planning horizon. The problem can be modeled as a linear mixed integer program and we address a feasible neighbourhood search approach to solve the problem.

  16. Dynamic Bus Travel Time Prediction Models on Road with Multiple Bus Routes

    Science.gov (United States)

    Bai, Cong; Peng, Zhong-Ren; Lu, Qing-Chang; Sun, Jian

    2015-01-01

    Accurate and real-time travel time information for buses can help passengers better plan their trips and minimize waiting times. A dynamic travel time prediction model for buses addressing the cases on road with multiple bus routes is proposed in this paper, based on support vector machines (SVMs) and Kalman filtering-based algorithm. In the proposed model, the well-trained SVM model predicts the baseline bus travel times from the historical bus trip data; the Kalman filtering-based dynamic algorithm can adjust bus travel times with the latest bus operation information and the estimated baseline travel times. The performance of the proposed dynamic model is validated with the real-world data on road with multiple bus routes in Shenzhen, China. The results show that the proposed dynamic model is feasible and applicable for bus travel time prediction and has the best prediction performance among all the five models proposed in the study in terms of prediction accuracy on road with multiple bus routes. PMID:26294903

  17. Dynamic Bus Travel Time Prediction Models on Road with Multiple Bus Routes.

    Science.gov (United States)

    Bai, Cong; Peng, Zhong-Ren; Lu, Qing-Chang; Sun, Jian

    2015-01-01

    Accurate and real-time travel time information for buses can help passengers better plan their trips and minimize waiting times. A dynamic travel time prediction model for buses addressing the cases on road with multiple bus routes is proposed in this paper, based on support vector machines (SVMs) and Kalman filtering-based algorithm. In the proposed model, the well-trained SVM model predicts the baseline bus travel times from the historical bus trip data; the Kalman filtering-based dynamic algorithm can adjust bus travel times with the latest bus operation information and the estimated baseline travel times. The performance of the proposed dynamic model is validated with the real-world data on road with multiple bus routes in Shenzhen, China. The results show that the proposed dynamic model is feasible and applicable for bus travel time prediction and has the best prediction performance among all the five models proposed in the study in terms of prediction accuracy on road with multiple bus routes.

  18. Operating Time Division for a Bus Route Based on the Recovery of GPS Data

    Directory of Open Access Journals (Sweden)

    Jian Wang

    2017-01-01

    Full Text Available Bus travel time is an important source of data for time of day partition of the bus route. However, in practice, a bus driver may deliberately speed up or slow down on route so as to follow the predetermined timetable. The raw GPS data collected by the GPS device equipped on the bus, as a result, cannot reflect its real operating conditions. To address this concern, this study first develops a method to identify whether there is deliberate speed-up or slow-down movement of a bus. Building upon the relationships between the intersection delay, link travel time, and traffic flow, a recovery method is established for calculating the real bus travel time. Using the dwell time at each stop and the recovered travel time between each of them as the division indexes, a sequential clustering-based time of day partition method is proposed. The effectiveness of the developed method is demonstrated using the data of bus route 63 in Harbin, China. Results show that the partition method can help bus enterprises to design reasonable time of day intervals and significantly improve their level of service.

  19. Split delivery vehicle routing problem with time windows: a case study

    Science.gov (United States)

    Latiffianti, E.; Siswanto, N.; Firmandani, R. A.

    2018-04-01

    This paper aims to implement an extension of VRP so called split delivery vehicle routing problem (SDVRP) with time windows in a case study involving pickups and deliveries of workers from several points of origin and several destinations. Each origin represents a bus stop and the destination represents either site or office location. An integer linear programming of the SDVRP problem is presented. The solution was generated using three stages of defining the starting points, assigning busses, and solving the SDVRP with time windows using an exact method. Although the overall computational time was relatively lengthy, the results indicated that the produced solution was better than the existing routing and scheduling that the firm used. The produced solution was also capable of reducing fuel cost by 9% that was obtained from shorter total distance travelled by the shuttle buses.

  20. Exact method for the vehicle routing problem with mixed linehaul and backhaul customers, heterogeneous fleet, time window and manufacturing capacity

    OpenAIRE

    Oesterle, Jonathan; Bauernhansl, Thomas

    2016-01-01

    Due to concerns over food safety, quality, and transparency, the food industry has been challenged to deal with an increased complexity in its logistics and production planning. This complexity is mostly associated to the task of optimally exploring a highly constrained solution space. This paper addresses the problem of designing a set of vehicle routes satisfying the delivery and the collection requirements of a set of geographically scattered linehaul and backhaul customers. Each customer ...

  1. A Comprehensive Real-Time Traffic Map for Geographic Routing in VANETs

    Directory of Open Access Journals (Sweden)

    Chi-Fu Huang

    2017-01-01

    Full Text Available Vehicular Ad Hoc Networks (VANETs have attracted a lot of attention during the last decade. VANETs can not only improve driving safety, but also convenience, and support most future Intelligent Transportation System (ITS. Due to the highly dynamic network topology of VANETs, many geographic routing protocols have been proposed and use real-time traffic information as an important metric to select a reliable forwarding path. However, most of the existing works do not describe how to gather real-time traffic. They either assume this information is already available, or can query an existing traffic center. Few studies have noticed this issue but the proposed solutions only consider a small region. In this paper, we propose a Comprehensive Real-Time Traffic Map (CRT Map to collect wide-ranging real-time traffic information with low overhead. In the design of a CRT Map, the concept of Crowdsensing is adopted. Vehicles cooperatively gather traffic information and share it with each other to construct an overview of the whole road network traffic. In addition, we design a CRT Map Based Routing (CBR, which takes into account the connectivity of consecutive roads in routing decisions. Simulation results show that the CBR can achieve a lower end-to-end delay and a higher packet delivery ratio.

  2. The Time-Dependent Multiple-Vehicle Prize-Collecting Arc Routing Problem

    DEFF Research Database (Denmark)

    Black, Daniel; Eglese, Richard; Wøhlk, Sanne

    2015-01-01

    -life traffic situations where the travel times change with the time of day are taken into account. Two metaheuristic algorithms, one based on Variable Neighborhood Search and one based on Tabu Search, are proposed and tested for a set of benchmark problems, generated from real road networks and travel time......In this paper, we introduce a multi vehicle version of the Time-Dependent Prize-Collecting Arc Routing Problem (TD-MPARP). It is inspired by a situation where a transport manager has to choose between a number of full truck load pick-ups and deliveries to be performed by a fleet of vehicles. Real...

  3. Multiple Charging Station Location-Routing Problem with Time Window of Electric Vehicle

    Directory of Open Access Journals (Sweden)

    Wang Li-ying

    2015-11-01

    Full Text Available This paper presents the electric vehicle (EV multiple charging station location-routing problem with time window to optimize the routing plan of capacitated EVs and the strategy of charging stations. In particular, the strategy of charging stations includes both infrastructure-type selection and station location decisions. The problem accounts for two critical constraints in logistic practice: the vehicle loading capacity and the customer time windows. A hybrid heuristic that incorporates an adaptive variable neighborhood search (AVNS with the tabu search algorithm for intensification was developed to address the problem. The specialized neighborhood structures and the selection methods of charging station used in the shaking step of AVNS were proposed. In contrast to the commercial solver CPLEX, experimental results on small-scale test instances demonstrate that the algorithm can find nearly optimal solutions on small-scale instances. The results on large-scale instances also show the effectiveness of the algorithm.

  4. Application of the multi-objective cross-entropy method to the vehicle routing problem with soft time windows

    Directory of Open Access Journals (Sweden)

    C Hauman

    2014-06-01

    Full Text Available The vehicle routing problem with time windows is a widely studied problem with many real-world applications. The problem considered here entails the construction of routes that a number of identical vehicles travel to service different nodes within a certain time window. New benchmark problems with multi-objective features were recently suggested in the literature and the multi-objective optimisation cross-entropy method is applied to these problems to investigate the feasibility of the method and to determine and propose reference solutions for the benchmark problems. The application of the cross-entropy method to the multi-objective vehicle routing problem with soft time windows is investigated. The objectives that are evaluated include the minimisation of the total distance travelled, the number of vehicles and/or routes, the total waiting time and delay time of the vehicles and the makespan of a route.

  5. Perspectives on Constraining a Cosmological Constant-Type Parameter with Pulsar Timing in the Galactic Center

    Directory of Open Access Journals (Sweden)

    Lorenzo Iorio

    2018-03-01

    Full Text Available Independent tests aiming to constrain the value of the cosmological constant Λ are usually difficult because of its extreme smallness ( Λ ≃ 1 × 10 - 52 m - 2 , or 2 . 89 × 10 - 122 in Planck units . Bounds on it from Solar System orbital motions determined with spacecraft tracking are currently at the ≃ 10 - 43 – 10 - 44 m - 2 ( 5 – 1 × 10 - 113 in Planck units level, but they may turn out to be optimistic since Λ has not yet been explicitly modeled in the planetary data reductions. Accurate ( σ τ p ≃ 1 – 10 μ s timing of expected pulsars orbiting the Black Hole at the Galactic Center, preferably along highly eccentric and wide orbits, might, at least in principle, improve the planetary constraints by several orders of magnitude. By looking at the average time shift per orbit Δ δ τ ¯ p Λ , an S2-like orbital configuration with e = 0 . 8839 , P b = 16 yr would permit a preliminarily upper bound of the order of Λ ≲ 9 × 10 - 47 m - 2 ≲ 2 × 10 - 116 in Planck units if only σ τ p were to be considered. Our results can be easily extended to modified models of gravity using Λ -type parameters.

  6. The effect of stimulus intensity on response time and accuracy in dynamic, temporally constrained environments.

    Science.gov (United States)

    Causer, J; McRobert, A P; Williams, A M

    2013-10-01

    The ability to make accurate judgments and execute effective skilled movements under severe temporal constraints are fundamental to elite performance in a number of domains including sport, military combat, law enforcement, and medicine. In two experiments, we examine the effect of stimulus strength on response time and accuracy in a temporally constrained, real-world, decision-making task. Specifically, we examine the effect of low stimulus intensity (black) and high stimulus intensity (sequin) uniform designs, worn by teammates, to determine the effect of stimulus strength on the ability of soccer players to make rapid and accurate responses. In both field- and laboratory-based scenarios, professional soccer players viewed developing patterns of play and were required to make a penetrative pass to an attacking player. Significant differences in response accuracy between uniform designs were reported in laboratory- and field-based experiments. Response accuracy was significantly higher in the sequin compared with the black uniform condition. Response times only differed between uniform designs in the laboratory-based experiment. These findings extend the literature into a real-world environment and have significant implications for the design of clothing wear in a number of domains. © 2012 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.

  7. A constructive heuristic for time-dependent multi-depot vehicle routing problem with time-windows and heterogeneous fleet

    Directory of Open Access Journals (Sweden)

    Behrouz Afshar-Nadjafi

    2017-01-01

    Full Text Available In this paper, we consider the time-dependent multi-depot vehicle routing problem. The objective is to minimize the total heterogeneous fleet cost assuming that the travel time between locations depends on the departure time. Also, hard time window constraints for the customers and limitation on maximum number of the vehicles in depots must be satisfied. The problem is formulated as a mixed integer programming model. A constructive heuristic procedure is proposed for the problem. Also, the efficiency of the proposed algorithm is evaluated on 180 test problems. The obtained computational results indicate that the procedure is capable to obtain a satisfying solution.

  8. Estimating the implicit component of visuomotor rotation learning by constraining movement preparation time.

    Science.gov (United States)

    Leow, Li-Ann; Gunn, Reece; Marinovic, Welber; Carroll, Timothy J

    2017-08-01

    When sensory feedback is perturbed, accurate movement is restored by a combination of implicit processes and deliberate reaiming to strategically compensate for errors. Here, we directly compare two methods used previously to dissociate implicit from explicit learning on a trial-by-trial basis: 1 ) asking participants to report the direction that they aim their movements, and contrasting this with the directions of the target and the movement that they actually produce, and 2 ) manipulating movement preparation time. By instructing participants to reaim without a sensory perturbation, we show that reaiming is possible even with the shortest possible preparation times, particularly when targets are narrowly distributed. Nonetheless, reaiming is effortful and comes at the cost of increased variability, so we tested whether constraining preparation time is sufficient to suppress strategic reaiming during adaptation to visuomotor rotation with a broad target distribution. The rate and extent of error reduction under preparation time constraints were similar to estimates of implicit learning obtained from self-report without time pressure, suggesting that participants chose not to apply a reaiming strategy to correct visual errors under time pressure. Surprisingly, participants who reported aiming directions showed less implicit learning according to an alternative measure, obtained during trials performed without visual feedback. This suggests that the process of reporting can affect the extent or persistence of implicit learning. The data extend existing evidence that restricting preparation time can suppress explicit reaiming and provide an estimate of implicit visuomotor rotation learning that does not require participants to report their aiming directions. NEW & NOTEWORTHY During sensorimotor adaptation, implicit error-driven learning can be isolated from explicit strategy-driven reaiming by subtracting self-reported aiming directions from movement directions, or

  9. En route position and time control of aircraft using Kalman filtering of radio aid data

    Science.gov (United States)

    Mcgee, L. A.; Christensen, J. V.

    1973-01-01

    Fixed-time-of-arrival (FTA) guidance and navigation is investigated as a possible technique capable of operation within much more stringent en route separation standards and offering significant advantages in safety, higher traffic densities, and improved scheduling reliability, both en route and in the terminal areas. This study investigated the application of FTA guidance previously used in spacecraft guidance. These FTA guidance techniques have been modified and are employed to compute the velocity corrections necessary to return an aircraft to a specified great-circle reference path in order to exercise en route time and position control throughout the entire flight. The necessary position and velocity estimates to accomplish this task are provided by Kalman filtering of data from Loran-C, VORTAC/TACAN, Doppler radar, radio or barometric altitude,and altitude rate. The guidance and navigation system was evaluated using a digital simulation of the cruise phase of supersonic and subsonic flights between San Francisco and New York City, and between New York City and London.

  10. A Combination of Genetic Algorithm and Particle Swarm Optimization for Vehicle Routing Problem with Time Windows.

    Science.gov (United States)

    Xu, Sheng-Hua; Liu, Ji-Ping; Zhang, Fu-Hao; Wang, Liang; Sun, Li-Jian

    2015-08-27

    A combination of genetic algorithm and particle swarm optimization (PSO) for vehicle routing problems with time windows (VRPTW) is proposed in this paper. The improvements of the proposed algorithm include: using the particle real number encoding method to decode the route to alleviate the computation burden, applying a linear decreasing function based on the number of the iterations to provide balance between global and local exploration abilities, and integrating with the crossover operator of genetic algorithm to avoid the premature convergence and the local minimum. The experimental results show that the proposed algorithm is not only more efficient and competitive with other published results but can also obtain more optimal solutions for solving the VRPTW issue. One new well-known solution for this benchmark problem is also outlined in the following.

  11. Time-constrained mother and expanding market: emerging model of under-nutrition in India

    Directory of Open Access Journals (Sweden)

    S. Chaturvedi

    2016-07-01

    Full Text Available Abstract Background Persistent high levels of under-nutrition in India despite economic growth continue to challenge political leadership and policy makers at the highest level. The present inductive enquiry was conducted to map the perceptions of mothers and other key stakeholders, to identify emerging drivers of childhood under-nutrition. Methods We conducted a multi-centric qualitative investigation in six empowered action group states of India. The study sample included 509 in-depth interviews with mothers of undernourished and normal nourished children, policy makers, district level managers, implementer and facilitators. Sixty six focus group discussions and 72 non-formal interactions were conducted in two rounds with primary caretakers of undernourished children, Anganwadi Workers and Auxiliary Nurse Midwives. Results Based on the perceptions of the mothers and other key stakeholders, a model evolved inductively showing core themes as drivers of under-nutrition. The most forceful emerging themes were: multitasking, time constrained mother with dwindling family support; fragile food security or seasonal food paucity; child targeted market with wide availability and consumption of ready-to-eat market food items; rising non-food expenditure, in the context of rising food prices; inadequate and inappropriate feeding; delayed recognition of under-nutrition and delayed care seeking; and inadequate responsiveness of health care system and Integrated Child Development Services (ICDS. The study emphasized that the persistence of child malnutrition in India is also tied closely to the high workload and consequent time constraint of mothers who are increasingly pursuing income generating activities and enrolled in paid labour force, without robust institutional support for childcare. Conclusion The emerging framework needs to be further tested through mixed and multiple method research approaches to quantify the contribution of time limitation of

  12. A Hybrid Chaos-Particle Swarm Optimization Algorithm for the Vehicle Routing Problem with Time Window

    Directory of Open Access Journals (Sweden)

    Qi Hu

    2013-04-01

    Full Text Available State-of-the-art heuristic algorithms to solve the vehicle routing problem with time windows (VRPTW usually present slow speeds during the early iterations and easily fall into local optimal solutions. Focusing on solving the above problems, this paper analyzes the particle encoding and decoding strategy of the particle swarm optimization algorithm, the construction of the vehicle route and the judgment of the local optimal solution. Based on these, a hybrid chaos-particle swarm optimization algorithm (HPSO is proposed to solve VRPTW. The chaos algorithm is employed to re-initialize the particle swarm. An efficient insertion heuristic algorithm is also proposed to build the valid vehicle route in the particle decoding process. A particle swarm premature convergence judgment mechanism is formulated and combined with the chaos algorithm and Gaussian mutation into HPSO when the particle swarm falls into the local convergence. Extensive experiments are carried out to test the parameter settings in the insertion heuristic algorithm and to evaluate that they are corresponding to the data’s real-distribution in the concrete problem. It is also revealed that the HPSO achieves a better performance than the other state-of-the-art algorithms on solving VRPTW.

  13. Change Semantic Constrained Online Data Cleaning Method for Real-Time Observational Data Stream

    Science.gov (United States)

    Ding, Yulin; Lin, Hui; Li, Rongrong

    2016-06-01

    to large estimation error. In order to achieve the best generalization error, it is an important challenge for the data cleaning methodology to be able to characterize the behavior of data stream distributions and adaptively update a model to include new information and remove old information. However, the complicated data changing property invalidates traditional data cleaning methods, which rely on the assumption of a stationary data distribution, and drives the need for more dynamic and adaptive online data cleaning methods. To overcome these shortcomings, this paper presents a change semantics constrained online filtering method for real-time observational data. Based on the principle that the filter parameter should vary in accordance to the data change patterns, this paper embeds semantic description, which quantitatively depicts the change patterns in the data distribution to self-adapt the filter parameter automatically. Real-time observational water level data streams of different precipitation scenarios are selected for testing. Experimental results prove that by means of this method, more accurate and reliable water level information can be available, which is prior to scientific and prompt flood assessment and decision-making.

  14. CHANGE SEMANTIC CONSTRAINED ONLINE DATA CLEANING METHOD FOR REAL-TIME OBSERVATIONAL DATA STREAM

    Directory of Open Access Journals (Sweden)

    Y. Ding

    2016-06-01

    data streams, which may led to large estimation error. In order to achieve the best generalization error, it is an important challenge for the data cleaning methodology to be able to characterize the behavior of data stream distributions and adaptively update a model to include new information and remove old information. However, the complicated data changing property invalidates traditional data cleaning methods, which rely on the assumption of a stationary data distribution, and drives the need for more dynamic and adaptive online data cleaning methods. To overcome these shortcomings, this paper presents a change semantics constrained online filtering method for real-time observational data. Based on the principle that the filter parameter should vary in accordance to the data change patterns, this paper embeds semantic description, which quantitatively depicts the change patterns in the data distribution to self-adapt the filter parameter automatically. Real-time observational water level data streams of different precipitation scenarios are selected for testing. Experimental results prove that by means of this method, more accurate and reliable water level information can be available, which is prior to scientific and prompt flood assessment and decision-making.

  15. Multi-UAV Routing for Area Coverage and Remote Sensing with Minimum Time.

    Science.gov (United States)

    Avellar, Gustavo S C; Pereira, Guilherme A S; Pimenta, Luciano C A; Iscold, Paulo

    2015-11-02

    This paper presents a solution for the problem of minimum time coverage of ground areas using a group of unmanned air vehicles (UAVs) equipped with image sensors. The solution is divided into two parts: (i) the task modeling as a graph whose vertices are geographic coordinates determined in such a way that a single UAV would cover the area in minimum time; and (ii) the solution of a mixed integer linear programming problem, formulated according to the graph variables defined in the first part, to route the team of UAVs over the area. The main contribution of the proposed methodology, when compared with the traditional vehicle routing problem's (VRP) solutions, is the fact that our method solves some practical problems only encountered during the execution of the task with actual UAVs. In this line, one of the main contributions of the paper is that the number of UAVs used to cover the area is automatically selected by solving the optimization problem. The number of UAVs is influenced by the vehicles' maximum flight time and by the setup time, which is the time needed to prepare and launch a UAV. To illustrate the methodology, the paper presents experimental results obtained with two hand-launched, fixed-wing UAVs.

  16. A real-time Java tool chain for resource constrained platforms

    DEFF Research Database (Denmark)

    Korsholm, Stephan E.; Søndergaard, Hans; Ravn, Anders Peter

    2014-01-01

    The Java programming language was originally developed for embedded systems, but the resource requirements of previous and current Java implementations – especially memory consumption – tend to exclude them from being used on a significant class of resource constrained embedded platforms. The con......The Java programming language was originally developed for embedded systems, but the resource requirements of previous and current Java implementations – especially memory consumption – tend to exclude them from being used on a significant class of resource constrained embedded platforms...... by integrating the following: (1) a lean virtual machine without any external dependencies on POSIX-like libraries or other OS functionalities; (2) a hardware abstraction layer, implemented almost entirely in Java through the use of hardware objects, first level interrupt handlers, and native variables; and (3....... An evaluation of the presented solution shows that the miniCDj benchmark gets reduced to a size where it can run on resource constrained platforms....

  17. A real-time Java tool chain for resource constrained platforms

    DEFF Research Database (Denmark)

    Korsholm, Stephan Erbs; Søndergaard, Hans; Ravn, Anders P.

    2013-01-01

    The Java programming language was originally developed for embedded systems, but the resource requirements of previous and current Java implementations - especially memory consumption - tend to exclude them from being used on a significant class of resource constrained embedded platforms. The con......The Java programming language was originally developed for embedded systems, but the resource requirements of previous and current Java implementations - especially memory consumption - tend to exclude them from being used on a significant class of resource constrained embedded platforms...... by integrating: (1) a lean virtual machine (HVM) without any external dependencies on POSIX-like libraries or other OS functionalities, (2) a hardware abstraction layer, implemented almost entirely in Java through the use of hardware objects, first level interrupt handlers, and native variables, and (3....... An evaluation of the presented solution shows that the miniCDj benchmark gets reduced to a size where it can run on resource constrained platforms....

  18. The constrained discrete-time state-dependent Riccati equation technique for uncertain nonlinear systems

    Science.gov (United States)

    Chang, Insu

    The objective of the thesis is to introduce a relatively general nonlinear controller/estimator synthesis framework using a special type of the state-dependent Riccati equation technique. The continuous time state-dependent Riccati equation (SDRE) technique is extended to discrete-time under input and state constraints, yielding constrained (C) discrete-time (D) SDRE, referred to as CD-SDRE. For the latter, stability analysis and calculation of a region of attraction are carried out. The derivation of the D-SDRE under state-dependent weights is provided. Stability of the D-SDRE feedback system is established using Lyapunov stability approach. Receding horizon strategy is used to take into account the constraints on D-SDRE controller. Stability condition of the CD-SDRE controller is analyzed by using a switched system. The use of CD-SDRE scheme in the presence of constraints is then systematically demonstrated by applying this scheme to problems of spacecraft formation orbit reconfiguration under limited performance on thrusters. Simulation results demonstrate the efficacy and reliability of the proposed CD-SDRE. The CD-SDRE technique is further investigated in a case where there are uncertainties in nonlinear systems to be controlled. First, the system stability under each of the controllers in the robust CD-SDRE technique is separately established. The stability of the closed-loop system under the robust CD-SDRE controller is then proven based on the stability of each control system comprising switching configuration. A high fidelity dynamical model of spacecraft attitude motion in 3-dimensional space is derived with a partially filled fuel tank, assumed to have the first fuel slosh mode. The proposed robust CD-SDRE controller is then applied to the spacecraft attitude control system to stabilize its motion in the presence of uncertainties characterized by the first fuel slosh mode. The performance of the robust CD-SDRE technique is discussed. Subsequently

  19. The Edge Set Cost of the Vehicle Routing Problem with Time Windows

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander; Jepsen, Mads Kehlet; Pisinger, David

    2016-01-01

    . The certifications and investments impose a cost for the company while they also give unlimited usage of a set of roads to all vehicles belonging to the company. This violates the traditional assumption that the path between two destinations is well defined and independent of other choices. Different versions......We consider an important generalization of the vehicle routing problem with time windows in which a fixed cost must be paid for accessing a set of edges. This fixed cost could reflect payment for toll roads, investment in new facilities, the need for certifications, and other costly investments...

  20. A multiple ship routing and speed optimization problem under time, cost and environmental objectives

    DEFF Research Database (Denmark)

    Wen, M.; Pacino, Dario; Kontovas, C.A.

    2017-01-01

    The purpose of this paper is to investigate a multiple ship routing and speed optimization problem under time, cost and environmental objectives. A branch and price algorithm as well as a constraint programming model are developed that consider (a) fuel consumption as a function of payload, (b......) fuel price as an explicit input, (c) freight rate as an input, and (d) in-transit cargo inventory costs. The alternative objective functions are minimum total trip duration, minimum total cost and minimum emissions. Computational experience with the algorithm is reported on a variety of scenarios....

  1. Real-Time Vehicle Routing for Repairing Damaged Infrastructures Due to Natural Disasters

    Directory of Open Access Journals (Sweden)

    Huey-Kuo Chen

    2011-01-01

    Full Text Available We address the task of repairing damaged infrastructures as a series of multidepot vehicle-routing problems with time windows in a time-rolling frame. The network size of the tackled problems changes from time to time, as new disaster nodes will be added to and serviced disaster nodes will be deleted from the current network. In addition, an inaccessible disaster node would become accessible when one of its adjacent disaster nodes has been repaired. By the “take-and-conquer” strategy, the repair sequence of the disaster nodes in the affected area can be suitably scheduled. Thirteen instances were tested with our proposed heuristic, that is, Chen et al.'s approach. For comparison, Hsueh et al.'s approach (2008 with necessary modification was also tested. The results show that Chen et al.'s approach performs slightly better for larger size networks in terms of objective value.

  2. Similarity-Based Prediction of Travel Times for Vehicles Traveling on Known Routes

    DEFF Research Database (Denmark)

    Tiesyte, Dalia; Jensen, Christian Søndergaard

    2008-01-01

    , historical data in combination with real-time data may be used to predict the future travel times of vehicles more accurately, thus improving the experience of the users who rely on such information. We propose a Nearest-Neighbor Trajectory (NNT) technique that identifies the historical trajectory......The use of centralized, real-time position tracking is proliferating in the areas of logistics and public transportation. Real-time positions can be used to provide up-to-date information to a variety of users, and they can also be accumulated for uses in subsequent data analyses. In particular...... of vehicles that travel along known routes. In empirical studies with real data from buses, we evaluate how well the proposed distance functions are capable of predicting future vehicle movements. Second, we propose a main-memory index structure that enables incremental similarity search and that is capable...

  3. A capacitated vehicle routing problem with order available time in e-commerce industry

    Science.gov (United States)

    Liu, Ling; Li, Kunpeng; Liu, Zhixue

    2017-03-01

    In this article, a variant of the well-known capacitated vehicle routing problem (CVRP) called the capacitated vehicle routing problem with order available time (CVRPOAT) is considered, which is observed in the operations of the current e-commerce industry. In this problem, the orders are not available for delivery at the beginning of the planning period. CVRPOAT takes all the assumptions of CVRP, except the order available time, which is determined by the precedent order picking and packing stage in the warehouse of the online grocer. The objective is to minimize the sum of vehicle completion times. An efficient tabu search algorithm is presented to tackle the problem. Moreover, a Lagrangian relaxation algorithm is developed to obtain the lower bounds of reasonably sized problems. Based on the test instances derived from benchmark data, the proposed tabu search algorithm is compared with a published related genetic algorithm, as well as the derived lower bounds. Also, the tabu search algorithm is compared with the current operation strategy of the online grocer. Computational results indicate that the gap between the lower bounds and the results of the tabu search algorithm is small and the tabu search algorithm is superior to the genetic algorithm. Moreover, the CVRPOAT formulation together with the tabu search algorithm performs much better than the current operation strategy of the online grocer.

  4. The multi-depot electric vehicle location routing problem with time windows

    Directory of Open Access Journals (Sweden)

    Juan Camilo Paz

    2018-01-01

    Full Text Available In this paper, the Multi-Depot Electric Vehicle Location Routing Problem with Time Windows (MDVLRP is addressed. This problem is an extension of the MDVLRP, where electric vehicles are used instead of internal combustion engine vehicles. The recent development of this model is explained by the advantages of this technology, such as the diminution of carbon dioxide emissions, and the support that they can provide to the design of the logistic and energy-support structure of electric vehicle fleets. There are many models that extend the classical VRP model to take electric vehicles into consideration, but the multi-depot case for location-routing models has not been worked out yet. Moreover, we consider the availability of two energy supply technologies: the “Plug-in” Conventional Charge technology, and Battery Swapping Stations; options in which the recharging time is a function of the amount of energy to charge and a fixed time, respectively. Three models are proposed: one for each of the technologies mentioned above, and another in which both options are taken in consideration. The models were solved for small scale instances using C++ and Cplex 12.5. The results show that the models can be used to design logistic and energy-support structures, and compare the performance of the different options of energy supply, as well as measure the impact of these decisions on the overall distance traveled or other optimization objectives that could be worked on in the future.

  5. Value of Information for Optimal Adaptive Routing in Stochastic Time-Dependent Traffic Networks: Algorithms and Computational Tools

    Science.gov (United States)

    2010-10-25

    Real-time information is important for travelers' routing decisions in uncertain networks by enabling online adaptation to revealed traffic conditions. Usually there are spatial and/or temporal limitations in traveler information. In this research, a...

  6. Mathematical Formulation and Comparison of Solution Approaches for the Vehicle Routing Problem with Access Time Windows

    Directory of Open Access Journals (Sweden)

    Rafael Grosso

    2018-01-01

    Full Text Available The application of the principles of sustainability to the implementation of urban freight policies requires the estimation of all the costs and externalities involved. We focus here on the case of access time windows, which ban the access of freight vehicles to central urban areas in many European cities. Even though this measure seeks to reduce congestion and emissions in the most crowded periods of the day, it also imposes additional costs for carriers and results in higher emissions and energy consumption. We present here a mathematical model for the Vehicle Routing Problem with Access Time Windows, a variant of the VRP suitable for planning delivery routes in a city subject to this type of accessibility restriction. We use the model to find exact solutions to small problem instances based on a case study and then compare the performance over larger instances of a modified savings algorithm, a genetic algorithm, and a tabu search procedure, with the results showing no clear prevalence of any of them, but confirming the significance of those additional costs and externalities.

  7. Field deployment to quantify the value of real-time information by integrating driver routing decisions and route assignment strategies.

    Science.gov (United States)

    2014-05-01

    Advanced Traveler Information Systems (ATIS) have been proposed as a mechanism to generate and : distribute real-time travel information to drivers for the purpose of improving travel experience : represented by experienced travel time and enhancing ...

  8. Adaptive Constrained Optimal Control Design for Data-Based Nonlinear Discrete-Time Systems With Critic-Only Structure.

    Science.gov (United States)

    Luo, Biao; Liu, Derong; Wu, Huai-Ning

    2018-06-01

    Reinforcement learning has proved to be a powerful tool to solve optimal control problems over the past few years. However, the data-based constrained optimal control problem of nonaffine nonlinear discrete-time systems has rarely been studied yet. To solve this problem, an adaptive optimal control approach is developed by using the value iteration-based Q-learning (VIQL) with the critic-only structure. Most of the existing constrained control methods require the use of a certain performance index and only suit for linear or affine nonlinear systems, which is unreasonable in practice. To overcome this problem, the system transformation is first introduced with the general performance index. Then, the constrained optimal control problem is converted to an unconstrained optimal control problem. By introducing the action-state value function, i.e., Q-function, the VIQL algorithm is proposed to learn the optimal Q-function of the data-based unconstrained optimal control problem. The convergence results of the VIQL algorithm are established with an easy-to-realize initial condition . To implement the VIQL algorithm, the critic-only structure is developed, where only one neural network is required to approximate the Q-function. The converged Q-function obtained from the critic-only VIQL method is employed to design the adaptive constrained optimal controller based on the gradient descent scheme. Finally, the effectiveness of the developed adaptive control method is tested on three examples with computer simulation.

  9. LBMR: Load-Balanced Multipath Routing for Wireless Data-Intensive Transmission in Real-Time Medical Monitoring.

    Science.gov (United States)

    Tseng, Chinyang Henry

    2016-05-31

    In wireless networks, low-power Zigbee is an excellent network solution for wireless medical monitoring systems. Medical monitoring generally involves transmission of a large amount of data and easily causes bottleneck problems. Although Zigbee's AODV mesh routing provides extensible multi-hop data transmission to extend network coverage, it originally does not, and needs to support some form of load balancing mechanism to avoid bottlenecks. To guarantee a more reliable multi-hop data transmission for life-critical medical applications, we have developed a multipath solution, called Load-Balanced Multipath Routing (LBMR) to replace Zigbee's routing mechanism. LBMR consists of three main parts: Layer Routing Construction (LRC), a Load Estimation Algorithm (LEA), and a Route Maintenance (RM) mechanism. LRC assigns nodes into different layers based on the node's distance to the medical data gateway. Nodes can have multiple next-hops delivering medical data toward the gateway. All neighboring layer-nodes exchange flow information containing current load, which is the used by the LEA to estimate future load of next-hops to the gateway. With LBMR, nodes can choose the neighbors with the least load as the next-hops and thus can achieve load balancing and avoid bottlenecks. Furthermore, RM can detect route failures in real-time and perform route redirection to ensure routing robustness. Since LRC and LEA prevent bottlenecks while RM ensures routing fault tolerance, LBMR provides a highly reliable routing service for medical monitoring. To evaluate these accomplishments, we compare LBMR with Zigbee's AODV and another multipath protocol, AOMDV. The simulation results demonstrate LBMR achieves better load balancing, less unreachable nodes, and better packet delivery ratio than either AODV or AOMDV.

  10. Modified artificial bee colony for the vehicle routing problems with time windows.

    Science.gov (United States)

    Alzaqebah, Malek; Abdullah, Salwani; Jawarneh, Sana

    2016-01-01

    The natural behaviour of the honeybee has attracted the attention of researchers in recent years and several algorithms have been developed that mimic swarm behaviour to solve optimisation problems. This paper introduces an artificial bee colony (ABC) algorithm for the vehicle routing problem with time windows (VRPTW). A Modified ABC algorithm is proposed to improve the solution quality of the original ABC. The high exploration ability of the ABC slows-down its convergence speed, which may due to the mechanism used by scout bees in replacing abandoned (unimproved) solutions with new ones. In the Modified ABC a list of abandoned solutions is used by the scout bees to memorise the abandoned solutions, then the scout bees select a solution from the list based on roulette wheel selection and replace by a new solution with random routs selected from the best solution. The performance of the Modified ABC is evaluated on Solomon benchmark datasets and compared with the original ABC. The computational results demonstrate that the Modified ABC outperforms the original ABC also produce good solutions when compared with the best-known results in the literature. Computational investigations show that the proposed algorithm is a good and promising approach for the VRPTW.

  11. Routing of radioactive shipments in networks with time-varying costs and curfews

    Energy Technology Data Exchange (ETDEWEB)

    Bowler, L.A.; Mahmassani, H.S. [Univ. of Texas, Austin, TX (United States). Dept. of Civil Engineering

    1998-09-01

    This research examines routing of radioactive shipments in highway networks with time-dependent travel times and population densities. A time-dependent least-cost path (TDLCP) algorithm that uses a label-correcting approach is adapted to include curfews and waiting at nodes. A method is developed to estimate time-dependent population densities, which are required to estimate risk associated with the use of a particular highway link at a particular time. The TDLCP algorithm is implemented for example networks and used to examine policy questions related to radioactive shipments. It is observed that when only Interstate highway facilities are used to transport these materials, a shipment must go through many cities and has difficulty avoiding all of them during their rush hour periods. Decreases in risk, increased departure time flexibility, and modest increases in travel times are observed when primary and/or secondary roads are included in the network. Based on the results of the example implementation, the suitability of the TDLCP algorithm for strategic nuclear material and general radioactive material shipments is demonstrated.

  12. Routing of radioactive shipments in networks with time-varying costs and curfews

    International Nuclear Information System (INIS)

    Bowler, L.A.; Mahmassani, H.S.

    1998-09-01

    This research examines routing of radioactive shipments in highway networks with time-dependent travel times and population densities. A time-dependent least-cost path (TDLCP) algorithm that uses a label-correcting approach is adapted to include curfews and waiting at nodes. A method is developed to estimate time-dependent population densities, which are required to estimate risk associated with the use of a particular highway link at a particular time. The TDLCP algorithm is implemented for example networks and used to examine policy questions related to radioactive shipments. It is observed that when only Interstate highway facilities are used to transport these materials, a shipment must go through many cities and has difficulty avoiding all of them during their rush hour periods. Decreases in risk, increased departure time flexibility, and modest increases in travel times are observed when primary and/or secondary roads are included in the network. Based on the results of the example implementation, the suitability of the TDLCP algorithm for strategic nuclear material and general radioactive material shipments is demonstrated

  13. Branch and price for the time-dependent vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Dabia, Said; Dabia, Said; Van Woensel, Tom

    2013-01-01

    of column generation, and a tailored labeling algorithm is used to solve the pricing problem. We introduce new dominance criteria that allow more label dominance. For our numerical results, we modified Solomon's data sets by adding time dependency. Our algorithm is able to solve about 63% of the instances...... solution methods to the DM-TDVRPTW are based on (meta-)heuristics. The decomposition of an arc-based formulation leads to a setpartitioning problem as the master problem, and a time-dependent shortest path problem with resource constraints as the pricing problem. The master problem is solved by means...... with 25 customers, 38% of the instances with 50 customers, and 15% of the instances with 100 customers. © 2013 INFORMS....

  14. Subset-row inequalities applied to the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Jepsen, Mads Kehlet; Petersen, Bjørn; Spoorendonk, Simon

    2008-01-01

    constraints as the pricing problem. We introduce the subset-row inequalities, which are Chvatal-Gomory rank-1 cuts based on a subset of the constraints in the master problem. Applying a subset-row inequality in the master problem increases the complexity of the label-setting algorithm used to solve......This paper presents a branch-and-cut-and-price algorithm for the vehicle-routing problem with time windows. The standard Dantzig-Wolfe decomposition of the arc flow formulation leads to a set-partitioning problem as the master problem and an elementary shortest-path problem with resource...... the pricing problem because an additional resource is added for each inequality. We propose a modified dominance criterion that makes it possible to dominate more labels by exploiting the step-like structure of the objective function of the pricing problem. Computational experiments have been performed...

  15. Metabolism of T-2 toxin in rats: Effects of dose, route, and time

    International Nuclear Information System (INIS)

    Pfeiffer, R.L.; Swanson, S.P.; Buck, W.B.

    1988-01-01

    Metabolic profiles of the excreta from rats following iv, oral, and dermal administration of tritium-labeled T-2 toxin at 0.15 and 0.60 mg/kg were determined. The major metabolites in urine were 3'-OH HT-2, T-2 tetraol, and unknown metabolite M5, whereas the major metabolites in feces were deepoxy T-2 tetraol, 3'-OH HT-2, and unknown metabolites M5, M7, and M9. The metabolite labeled M9 (major metabolite) was tentatively identified as deepoxy 3'-OH HT-2. There was no significant effect on metabolic profiles due to dose, but there was a variable effect associated with the route of administration. The increase over time of appreciable levels of deepoxy metabolites as a percentage of extracted radioactivity was both consistent and statistically significant

  16. Routing strategy including time and carbon dioxide emissions : effects on network performance

    NARCIS (Netherlands)

    Zhang, Fan; Chen, Y.; Goni Ros, B.; GAO, Jian; Knoop, V.L.

    2016-01-01

    Traffic congestion leads to delays and increased carbon dioxide (CO2) emissions. Traffic management measures such as providing information on environmental route costs have been proposed to mitigate congestion. Multi-criteria routing dynamic traffic assignment (MCR-DTA) models are needed to evaluate

  17. Real time monitoring system used in route planning for the electric vehicle

    Science.gov (United States)

    Ionescu, LM; Mazare, A.; Serban, G.; Ionita, S.

    2017-10-01

    The electric vehicle is a new consumer of electricity that is becoming more and more widespread. Under these circumstances, new strategies for optimizing power consumption and increasing vehicle autonomy must be designed. These must include route planning along with consumption, fuelling points and points of interest. The hardware and software solution proposed by us allows: non-invasive monitoring of power consumption, energy autonomy - it does not add any extra consumption, data transmission to a server and data fusion with the route, the points of interest of the route and the power supply points. As a result: an optimal route planning service will be provided to the driver, considering the route, the requirements of the electric vehicle and the consumer profile. The solution can be easily installed on any type of electric car - it does not involve any intervention on the equipment.

  18. Modeling and Solving the Multi-depot Vehicle Routing Problem with Time Window by Considering the Flexible end Depot in Each Route

    Directory of Open Access Journals (Sweden)

    Mohammad Mirabi

    2016-11-01

    Full Text Available This paper considers the multi-depot vehicle routing problem with time window in which each vehicle starts from a depot and there is no need to return to its primary depot after serving customers. The mathematical model which is developed by new approach aims to minimizing the transportation cost including the travelled distance, the latest and the earliest arrival time penalties. Furthermore, in order to reduce the problem searching space, a novel GA clustering method is developed. Finally, Experiments are run on number problems of varying depots and time window, and customer sizes. The method is compared to two other clustering techniques, fuzzy C means (FCM and K-means algorithm. Experimental results show the robustness and effectiveness of the proposed algorithm.

  19. A hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction

    Science.gov (United States)

    Tavakkoli-Moghaddam, Reza; Alinaghian, Mehdi; Salamat-Bakhsh, Alireza; Norouzi, Narges

    2012-05-01

    A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. On the other hand, this satisfaction, which will decrease by increasing the service time, is considered as an important logistic problem for a company. The stochastic time dominated by a probability variable leads to variation of the service time, while it is ignored in classical routing problems. This paper investigates the problem of the increasing service time by using the stochastic time for each tour such that the total traveling time of the vehicles is limited to a specific limit based on a defined probability. Since exact solutions of the vehicle routing problem that belong to the category of NP-hard problems are not practical in a large scale, a hybrid algorithm based on simulated annealing with genetic operators was proposed to obtain an efficient solution with reasonable computational cost and time. Finally, for some small cases, the related results of the proposed algorithm were compared with results obtained by the Lingo 8 software. The obtained results indicate the efficiency of the proposed hybrid simulated annealing algorithm.

  20. Role of Travel Time Information on Day-to-Day Route Choice Behavior Based on Real-World Experiments

    NARCIS (Netherlands)

    van Essen, Mariska; Thomas, Tom; Chorus, Caspar; van Berkum, Eric C.

    2016-01-01

    It is widely believed that travel time information leads to reductions in traffic congestion and thereby improves network efficiency. An important research topic within travel behavior research is therefore how car drivers choose their routes, specifically when they receive travel time information.

  1. Disruption Management for the Real-Time Home Caregiver Scheduling and Routing Problem

    Directory of Open Access Journals (Sweden)

    Biao Yuan

    2017-11-01

    Full Text Available The aggravating trend of the aging population, the miniaturization of the family structure, and the increase of families with empty nesters greatly affect the sustainable development of the national economy and social old-age security system of China. The emergence of home health care or home care (HHC/HC service mode provides an alternative for elderly care. How to develop and apply this new mobile service mode is crucial for the government. Therefore, the pertinent optimization problems regarding HHC/HC have constantly attracted the attention of researchers. Unexpected events, such as new requests of customers, cancellations of customers’ services, and changes of customers’ time windows, may occur during the process of executing an a priori visiting plan. These events may sometimes make the original plan non-optimal or even infeasible. To cope with this situation, we introduce disruption management to the real-time home caregiver scheduling and routing problem. The deviation measurements on customers, caregivers, and companies are first defined. A mathematical model that minimizes the weighted sum of deviation measurements is then constructed. Next, a tabu search (TS heuristic is developed to efficiently solve the problem, and a cost recorded mechanism is used to strengthen the performance. Finally, by performing computational experiments on three real-life instances, the effectiveness of the TS heuristic is tested, and the advantages of disruption management are analyzed.

  2. Constraining the time evolution of dark energy, curvature and neutrino properties with cosmic chronometers

    Energy Technology Data Exchange (ETDEWEB)

    Moresco, Michele; Cimatti, Andrea [ALMA Mater Studiorum—Università degli Studi di Bologna, Dipartimento di Astronomia, via Ranzani 1, Bologna, I-40127 Italy (Italy); Jimenez, Raul; Verde, Licia [ICREA, Pg. Lluis Companys 23, Barcelona, 08010 Spain (Spain); Pozzetti, Lucia [INAF—Osservatorio Astronomico di Bologna, via Ranzani 1, Bologna, 40127 Italy (Italy); Maraston, Claudia; Thomas, Daniel, E-mail: michele.moresco@unibo.it, E-mail: raul.jimenez@icc.ub.edu, E-mail: liciaverde@icc.ub.edu, E-mail: a.cimatti@unibo.it, E-mail: lucia.pozzetti@oabo.inaf.it, E-mail: claudia.maraston@port.ac.uk, E-mail: daniel.thomas@port.ac.uk [Institute of Cosmology and Gravitation, Dennis Sciama Building, University of Portsmouth, Burnaby Road, Portsmouth, PO1 3FX U.K. (United Kingdom)

    2016-12-01

    We use the latest compilation of observational Hubble parameter measurements estimated with the differential evolution of cosmic chronometers , in the redshift range 0< z <2, to place constraints on cosmological parameters. We used a Markov-Chain Monte-Carlo approach to sample the parameter space for the cosmic chronometers dataset alone and in combination with other state-of-the art cosmological measurements: CMB data from the latest Planck 2015 release, the most recent estimate of the Hubble constant H {sub 0}, a compilation of recent baryon acoustic oscillation data, and the latest type Ia cosmological supernovae sample. From late-Universe probes alone ( z <2) we find that w {sub 0} = −0.9 ± 0.18 and w {sub a} = −0.5 ± 1.7, and when combining also Planck 2015 data we obtain w {sub 0}=−0.98± 0.11 and w {sub a} =−0.30±0.4. These new constraints imply that nearly all quintessence models are disfavoured by the data; only phantom models or a pure cosmological constant are favoured. This is a remarkable finding as it imposes severe constraints on the nature of dark energy. For the curvature our constraints are Ω {sub k} = 0.003 ± 0.003, considering also CMB data. We also find that H ( z ) data from cosmic chronometers are important to constrain parameters that do no affect directly the expansion history, by breaking or reducing degeneracies with other parameters. We find that N {sub eff} = 3.17 ± 0.15, thus excluding the possibility of an extra (sterile) neutrino at more than 5 σ, and put competitive limits on the sum of neutrino masses, Σ m {sub ν}< 0.27 eV at 95% confidence level. Finally, we constrain the redshift evolution of dark energy by exploring separately the early and late-Universe, and find a dark energy equation of state evolution w ( z ) consistent with that in the ΛCDM model at the ± 0.4 level over the entire redshift range 0 < z < 2.

  3. Minimizing the Carbon Footprint for the Time-Dependent Heterogeneous-Fleet Vehicle Routing Problem with Alternative Paths

    Directory of Open Access Journals (Sweden)

    Wan-Yu Liu

    2014-07-01

    Full Text Available Torespondto the reduction of greenhouse gas emissions and global warming, this paper investigates the minimal-carbon-footprint time-dependent heterogeneous-fleet vehicle routing problem with alternative paths (MTHVRPP. This finds a route with the smallestcarbon footprint, instead of the shortestroute distance, which is the conventional approach, to serve a number of customers with a heterogeneous fleet of vehicles in cases wherethere may not be only one path between each pair of customers, and the vehicle speed differs at different times of the day. Inheriting from the NP-hardness of the vehicle routing problem, the MTHVRPP is also NP-hard. This paper further proposes a genetic algorithm (GA to solve this problem. The solution representedbyour GA determines the customer serving ordering of each vehicle type. Then, the capacity check is used to classify multiple routes of each vehicle type, and the path selection determines the detailed paths of each route. Additionally, this paper improves the energy consumption model used for calculating the carbon footprint amount more precisely. Compared with the results without alternative paths, our experimental results show that the alternative path in this experimenthas a significant impact on the experimental results in terms of carbon footprint.

  4. MIROS: a hybrid real-time energy-efficient operating system for the resource-constrained wireless sensor nodes.

    Science.gov (United States)

    Liu, Xing; Hou, Kun Mean; de Vaulx, Christophe; Shi, Hongling; El Gholami, Khalid

    2014-09-22

    Operating system (OS) technology is significant for the proliferation of the wireless sensor network (WSN). With an outstanding OS; the constrained WSN resources (processor; memory and energy) can be utilized efficiently. Moreover; the user application development can be served soundly. In this article; a new hybrid; real-time; memory-efficient; energy-efficient; user-friendly and fault-tolerant WSN OS MIROS is designed and implemented. MIROS implements the hybrid scheduler and the dynamic memory allocator. Real-time scheduling can thus be achieved with low memory consumption. In addition; it implements a mid-layer software EMIDE (Efficient Mid-layer Software for User-Friendly Application Development Environment) to decouple the WSN application from the low-level system. The application programming process can consequently be simplified and the application reprogramming performance improved. Moreover; it combines both the software and the multi-core hardware techniques to conserve the energy resources; improve the node reliability; as well as achieve a new debugging method. To evaluate the performance of MIROS; it is compared with the other WSN OSes (TinyOS; Contiki; SOS; openWSN and mantisOS) from different OS concerns. The final evaluation results prove that MIROS is suitable to be used even on the tight resource-constrained WSN nodes. It can support the real-time WSN applications. Furthermore; it is energy efficient; user friendly and fault tolerant.

  5. MIROS: A Hybrid Real-Time Energy-Efficient Operating System for the Resource-Constrained Wireless Sensor Nodes

    Science.gov (United States)

    Liu, Xing; Hou, Kun Mean; de Vaulx, Christophe; Shi, Hongling; Gholami, Khalid El

    2014-01-01

    Operating system (OS) technology is significant for the proliferation of the wireless sensor network (WSN). With an outstanding OS; the constrained WSN resources (processor; memory and energy) can be utilized efficiently. Moreover; the user application development can be served soundly. In this article; a new hybrid; real-time; memory-efficient; energy-efficient; user-friendly and fault-tolerant WSN OS MIROS is designed and implemented. MIROS implements the hybrid scheduler and the dynamic memory allocator. Real-time scheduling can thus be achieved with low memory consumption. In addition; it implements a mid-layer software EMIDE (Efficient Mid-layer Software for User-Friendly Application Development Environment) to decouple the WSN application from the low-level system. The application programming process can consequently be simplified and the application reprogramming performance improved. Moreover; it combines both the software and the multi-core hardware techniques to conserve the energy resources; improve the node reliability; as well as achieve a new debugging method. To evaluate the performance of MIROS; it is compared with the other WSN OSes (TinyOS; Contiki; SOS; openWSN and mantisOS) from different OS concerns. The final evaluation results prove that MIROS is suitable to be used even on the tight resource-constrained WSN nodes. It can support the real-time WSN applications. Furthermore; it is energy efficient; user friendly and fault tolerant. PMID:25248069

  6. Opportunities, constraints and constrained opportunities - A study on mothers' working time patterns in 22 European countries

    Directory of Open Access Journals (Sweden)

    Milla Salin

    2014-11-01

    Full Text Available The aim of this study was to analyze mothers’ working time patters across 22 European countries. The focu was on three questions: how much mothers prefer to work, how much they actually work, and to what degree their preferred and actual working times are (inconsistent with each other. The focus was on cross-national differences in mothers’ working time patterns, comparison of mothers’ working times to that of childless women and fathers, as well as on individual- and country-level factors that explain the variation between them. In the theoretical background, the departure point was an integrative theoretical approach where the assumption is that there are various kinds of explanations for the differences in mothers’ working time patterns – namely structural, cultural and institutional – , and that these factors are laid in two levels: individual- and country-levels. Data were extracted from the European Social Survey (ESS 2010 / 2011. The results showed that mothers’ working time patterns, both preferred and actual working times, varied across European countries. Four clusters were formed to illustrate the differences. In the full-time pattern, full-time work was the most important form of work, leaving all other working time forms marginal. The full-time pattern was perceived in terms of preferred working times in Bulgaria and Portugal. In polarised pattern countries, full-time work was also important, but it was accompanied by a large share of mothers not working at all. In the case of preferred working times, many Eastern and Southern European countries followed it whereas in terms of actual working times it included all Eastern and Southern European countries as well as Finland. The combination pattern was characterised by the importance of long part-time hours and full-time work. It was the preferred working time pattern in the Nordic countries, France, Slovenia, and Spain, but Belgium, Denmark, France, Norway, and Sweden

  7. A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows

    NARCIS (Netherlands)

    Bräysy, Olli; Porkka, Pasi P.; Dullaert, Wout; Repoussis, Panagiotis P.; Tarantilis, Christos D.

    This paper presents an efficient and well-scalable metaheuristic for fleet size and mix vehicle routing with time windows. The suggested solution method combines the strengths of well-known threshold accepting and guided local search metaheuristics to guide a set of four local search heuristics. The

  8. Verification and controller synthesis for resource-constrained real-time systems

    DEFF Research Database (Denmark)

    Li, Shuhao; Pettersson, Paul

    2010-01-01

    -TIGA to check whether a given control objective can be enforced, and if so, we synthesize a controller for the system. We carry out a case study of this approach on a battery-powered autonomous truck. Experimental results indicate that the method is effective and computationally feasible.......An embedded system is often subject to timing constraints, resource constraints, and it should operate properly no matter how its environment behaves. This paper proposes to use timed game automata to characterize the timed behaviors and the environment uncertainties, and use piece-wise constant...... integer functions to approximate the continuous resources in real-time embedded systems. Based on these formal models and techniques, we employ the realtime model checker UPPAAL to verify a system against a given functional and/or timing requirement. Furthermore, we employ the timed game solver UPPAAL...

  9. Lyapunov-based constrained engine torque control using electronic throttle and variable cam timing

    NARCIS (Netherlands)

    Feru, E.; Lazar, M.; Gielen, R.H.; Kolmanovsky, I.V.; Di Cairano, S.

    2012-01-01

    In this paper, predictive control of a spark ignition engine equipped with an electronic throttle and a variable cam timing actuator is considered. The objective is to adjust the throttle angle and the engine cam timing in order to reduce the exhaust gas emissions while maintaining fast and

  10. Timing Analysis of Rate Constrained Traffic for the TTEthernet Communication Protocol

    DEFF Research Database (Denmark)

    Tamas-Selicean, Domitian; Pop, Paul; Steiner, Wilfried

    2015-01-01

    Ethernet is a low-cost communication solution offering high transmission speeds. Although its applications extend beyond computer networking, Ethernet is not suitable for real-time and safety-critical systems. To alleviate this, several real-time Ethernet-based communication protocols have been...

  11. ’Football Fitness’: Constraining and enabling possibilities for the management of leisure time for middle aged women

    DEFF Research Database (Denmark)

    Thing, Lone Friis; Hybholt, Maria Gliemann; Ottesen, Laila

    recreational football activities and the ‘Football Fitness’ concept are experienced from a participant perspective is examined. We investigate how the implementation is actually carried out in the local football clubs and identify constraining and enabling possibilities for the management of leisure time. We......The aim of the paper is to generate empirically based sociological knowledge about a ‘Football Fitness’ intervention carried out in associative sport clubs. There is an increased pressure on the voluntary sector, e.g. the sport clubs, to embrace new segments of users and to meet social and health......, and inspired by them, we have chosen to analyse Football Fitness as part of a spare-time spectrum. How do grown up women make sense of their new ‘football lives’?...

  12. Time-resolved PHERMEX image restorations constrained with an additional multiply-exposed image

    International Nuclear Information System (INIS)

    Kruger, R.P.; Breedlove, J.R. Jr.; Trussell, H.J.

    1978-06-01

    There are a number of possible industrial and scientific applications of nanosecond cineradiographs. Although the technology exists to produce closely spaced pulses of x rays for this application, the quality of the time-resolved radiographs is severely limited. The limitations arise from the necessity of using a fluorescent screen to convert the transmitted x rays to light and then using electro-optical imaging systems to gate and to record the images with conventional high-speed cameras. It has been proposed that, in addition to the time-resolved images, a conventional multiply exposed radiograph be obtained. This report uses both PHERMEX and conventional photographic simulations to demonstrate that the additional information supplied by the multiply exposed radiograph can be used to improve the quality of digital image restorations of the time-resolved pictures over what could be achieved with the degraded images alone

  13. Nonfragile Robust Model Predictive Control for Uncertain Constrained Systems with Time-Delay Compensation

    Directory of Open Access Journals (Sweden)

    Wei Jiang

    2016-01-01

    Full Text Available This study investigates the problem of asymptotic stabilization for a class of discrete-time linear uncertain time-delayed systems with input constraints. Parametric uncertainty is assumed to be structured, and delay is assumed to be known. In Lyapunov stability theory framework, two synthesis schemes of designing nonfragile robust model predictive control (RMPC with time-delay compensation are put forward, where the additive and the multiplicative gain perturbations are, respectively, considered. First, by designing appropriate Lyapunov-Krasovskii (L-K functions, the robust performance index is defined as optimization problems that minimize upper bounds of infinite horizon cost function. Then, to guarantee closed-loop stability, the sufficient conditions for the existence of desired nonfragile RMPC are obtained in terms of linear matrix inequalities (LMIs. Finally, two numerical examples are provided to illustrate the effectiveness of the proposed approaches.

  14. Design Optimization of Time- and Cost-Constrained Fault-Tolerant Distributed Embedded Systems

    DEFF Research Database (Denmark)

    Izosimov, Viacheslav; Pop, Paul; Eles, Petru

    2005-01-01

    In this paper we present an approach to the design optimization of fault-tolerant embedded systems for safety-critical applications. Processes are statically scheduled and communications are performed using the time-triggered protocol. We use process re-execution and replication for tolerating...... transient faults. Our design optimization approach decides the mapping of processes to processors and the assignment of fault-tolerant policies to processes such that transient faults are tolerated and the timing constraints of the application are satisfied. We present several heuristics which are able...

  15. Automated observatory in Antarctica: real-time data transfer on constrained networks in practice

    Directory of Open Access Journals (Sweden)

    S. Bracke

    2017-08-01

    Full Text Available In 2013 a project was started by the geophysical centre in Dourbes to install a fully automated magnetic observatory in Antarctica. This isolated place comes with specific requirements: unmanned station during 6 months, low temperatures with extreme values down to −50 °C, minimum power consumption and satellite bandwidth limited to 56 Kbit s−1. The ultimate aim is to transfer real-time magnetic data every second: vector data from a LEMI-25 vector magnetometer, absolute F measurements from a GEM Systems scalar proton magnetometer and absolute magnetic inclination–declination (DI measurements (five times a day with an automated DI-fluxgate magnetometer. Traditional file transfer protocols (for instance File Transfer Protocol (FTP, email, rsync show severe limitations when it comes to real-time capability. After evaluation of pro and cons of the available real-time Internet of things (IoT protocols and seismic software solutions, we chose to use Message Queuing Telemetry Transport (MQTT and receive the 1 s data with a negligible latency cost and no loss of data. Each individual instrument sends the magnetic data immediately after capturing, and the data arrive approximately 300 ms after being sent, which corresponds with the normal satellite latency.

  16. Automated observatory in Antarctica: real-time data transfer on constrained networks in practice

    Science.gov (United States)

    Bracke, Stephan; Gonsette, Alexandre; Rasson, Jean; Poncelet, Antoine; Hendrickx, Olivier

    2017-08-01

    In 2013 a project was started by the geophysical centre in Dourbes to install a fully automated magnetic observatory in Antarctica. This isolated place comes with specific requirements: unmanned station during 6 months, low temperatures with extreme values down to -50 °C, minimum power consumption and satellite bandwidth limited to 56 Kbit s-1. The ultimate aim is to transfer real-time magnetic data every second: vector data from a LEMI-25 vector magnetometer, absolute F measurements from a GEM Systems scalar proton magnetometer and absolute magnetic inclination-declination (DI) measurements (five times a day) with an automated DI-fluxgate magnetometer. Traditional file transfer protocols (for instance File Transfer Protocol (FTP), email, rsync) show severe limitations when it comes to real-time capability. After evaluation of pro and cons of the available real-time Internet of things (IoT) protocols and seismic software solutions, we chose to use Message Queuing Telemetry Transport (MQTT) and receive the 1 s data with a negligible latency cost and no loss of data. Each individual instrument sends the magnetic data immediately after capturing, and the data arrive approximately 300 ms after being sent, which corresponds with the normal satellite latency.

  17. Timing-Constrained FPGA Placement: A Force-Directed Formulation and Its Performance Evaluation

    Directory of Open Access Journals (Sweden)

    Srilata Raman

    1996-01-01

    Full Text Available In this paper we present a simple but efficient timing-driven placement algorithm for FPGAs. The algorithm computes forces acting on a logic block in the FPGA to determine its relative location with respect to other blocks. The forces depend on the criticality of nets shared between the two blocks. Unlike other net-based approaches, timing constraints are incorporated directly into the force equations to guide the placement. Slot assignment is then used to move the blocks into valid slot locations on the FPGA chip. The assignment algorithm also makes use of the delay information of nets so that the final placement is able to meet the timing criteria specified for the circuit. The novelty of the approach lies in the formulation of the force equations and the manner in which weights of the nets are dynamically altered to influence the placement. Experiments conducted on industrial test circuits and MCNC circuits give very promising results and indicate that the algorithm succeeds in significantly reducing the maximum delay in the circuit. In addition, routability is not adversely affected and running time is low.

  18. The life and times of the Savings Method for Vehicle Routing Problems

    African Journals Online (AJOL)

    Forty ve years ago, an academic and practitioner from the north of England published a method of tackling the vehicle routing problem (VRP) in an American journal. Little could they have realised how the method they devised would still be a signicant part of the research agenda nearly half a century later. Adaptations of ...

  19. Design Optimization of Mixed-Criticality Real-Time Applications on Cost-Constrained Partitioned Architectures

    DEFF Research Database (Denmark)

    Tamas-Selicean, Domitian; Pop, Paul

    2011-01-01

    In this paper we are interested to implement mixed-criticality hard real-time applications on a given heterogeneous distributed architecture. Applications have different criticality levels, captured by their Safety-Integrity Level (SIL), and are scheduled using static-cyclic scheduling. Mixed......-criticality tasks can be integrated onto the same architecture only if there is enough spatial and temporal separation among them. We consider that the separation is provided by partitioning, such that applications run in separate partitions, and each partition is allocated several time slots on a processor. Tasks...... slots on each processor and (iv) the schedule tables, such that all the applications are schedulable and the development costs are minimized. We have proposed a Tabu Search-based approach to solve this optimization problem. The proposed algorithm has been evaluated using several synthetic and real...

  20. A preconditioner for optimal control problems, constrained by Stokes equation with a time-harmonic control

    Czech Academy of Sciences Publication Activity Database

    Axelsson, Owe; Farouq, S.; Neytcheva, M.

    2017-01-01

    Roč. 310, January 2017 (2017), s. 5-18 ISSN 0377-0427 R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:68145535 Keywords : optimal control * time-harmonic Stokes problem * preconditioning Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 1.357, year: 2016 http://www. science direct.com/ science /article/pii/S0377042716302631?via%3Dihub

  1. A preconditioner for optimal control problems, constrained by Stokes equation with a time-harmonic control

    Czech Academy of Sciences Publication Activity Database

    Axelsson, Owe; Farouq, S.; Neytcheva, M.

    2017-01-01

    Roč. 310, January 2017 (2017), s. 5-18 ISSN 0377-0427 R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:68145535 Keywords : optimal control * time-harmonic Stokes problem * preconditioning Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 1.357, year: 2016 http://www.sciencedirect.com/science/article/pii/S0377042716302631?via%3Dihub

  2. Timing of Crystallisation of the Lunar Magma Ocean Constrained by the Oldest Zircon

    Science.gov (United States)

    Nemchin, A.; Timms, N.; Pidgeon, R.; Geisler, T.; Reddy, S.; Meyer, C.

    2009-01-01

    The presently favoured concept for the early evolution of the Moon involves consolidation of debris from a giant impact of a Mars sized body with Earth forming a primitive Moon with a thick global layer of melt referred to as the Lunar Magma Ocean1 . It is widely accepted that many significant features observed on the Moon today are the result of crystallisation of this magma ocean. However, controversy exists over the precise timing and duration of the crystallisation process. Resolution of this problem depends on the establishment of precise and robust key crystallisation time points. We report a 4417 6 Myr old zircon in lunar breccia sample 72215,195, which provides a precisely determined younger limit for the solidification of the Lunar Magma Ocean. A model based on these data, together with the age of the Moon forming giant impact, defines an exponential time frame for crystallisation and suggests formation of anorthositic crust after about 80-85% of the magma ocean was solidified. In combination with other zircon ages the 4417 +/- 6 Myr age also suggests that the very small (less than a few per cent) residual portion of the magma ocean continued to solidify during the following 300-500 m.y.

  3. Real-time, resource-constrained object classification on a micro-air vehicle

    Science.gov (United States)

    Buck, Louis; Ray, Laura

    2013-12-01

    A real-time embedded object classification algorithm is developed through the novel combination of binary feature descriptors, a bag-of-visual-words object model and the cortico-striatal loop (CSL) learning algorithm. The BRIEF, ORB and FREAK binary descriptors are tested and compared to SIFT descriptors with regard to their respective classification accuracies, execution times, and memory requirements when used with CSL on a 12.6 g ARM Cortex embedded processor running at 800 MHz. Additionally, the effect of x2 feature mapping and opponent-color representations used with these descriptors is examined. These tests are performed on four data sets of varying sizes and difficulty, and the BRIEF descriptor is found to yield the best combination of speed and classification accuracy. Its use with CSL achieves accuracies between 67% and 95% of those achieved with SIFT descriptors and allows for the embedded classification of a 128x192 pixel image in 0.15 seconds, 60 times faster than classification with SIFT. X2 mapping is found to provide substantial improvements in classification accuracy for all of the descriptors at little cost, while opponent-color descriptors are offer accuracy improvements only on colorful datasets.

  4. Efficient adaptive constrained control with time-varying predefined performance for a hypersonic flight vehicle

    Directory of Open Access Journals (Sweden)

    Caisheng Wei

    2017-03-01

    Full Text Available A novel low-complexity adaptive control method, capable of guaranteeing the transient and steady-state tracking performance in the presence of unknown nonlinearities and actuator saturation, is investigated for the longitudinal dynamics of a generic hypersonic flight vehicle. In order to attenuate the negative effects of classical predefined performance function for unknown initial tracking errors, a modified predefined performance function with time-varying design parameters is presented. Under the newly developed predefined performance function, two novel adaptive controllers with low-complexity computation are proposed for velocity and altitude subsystems of the hypersonic flight vehicle, respectively. Wherein, different from neural network-based approximation, a least square support vector machine with only two design parameters is utilized to approximate the unknown hypersonic dynamics. And the relevant ideal weights are obtained by solving a linear system without resorting to specialized optimization algorithms. Based on the approximation by least square support vector machine, only two adaptive scalars are required to be updated online in the parameter projection method. Besides, a new finite-time-convergent differentiator, with a quite simple structure, is proposed to estimate the unknown generated state variables in the newly established normal output-feedback formulation of altitude subsystem. Moreover, it is also employed to obtain accurate estimations for the derivatives of virtual controllers in a recursive design. This avoids the inherent drawback of backstepping — “explosion of terms” and makes the proposed control method achievable for the hypersonic flight vehicle. Further, the compensation design is employed when the saturations of the actuator occur. Finally, the numerical simulations validate the efficiency of the proposed finite-time-convergent differentiator and control method.

  5. Travel time tomography with local image regularization by sparsity constrained dictionary learning

    Science.gov (United States)

    Bianco, M.; Gerstoft, P.

    2017-12-01

    We propose a regularization approach for 2D seismic travel time tomography which models small rectangular groups of slowness pixels, within an overall or `global' slowness image, as sparse linear combinations of atoms from a dictionary. The groups of slowness pixels are referred to as patches and a dictionary corresponds to a collection of functions or `atoms' describing the slowness in each patch. These functions could for example be wavelets.The patch regularization is incorporated into the global slowness image. The global image models the broad features, while the local patch images incorporate prior information from the dictionary. Further, high resolution slowness within patches is permitted if the travel times from the global estimates support it. The proposed approach is formulated as an algorithm, which is repeated until convergence is achieved: 1) From travel times, find the global slowness image with a minimum energy constraint on the pixel variance relative to a reference. 2) Find the patch level solutions to fit the global estimate as a sparse linear combination of dictionary atoms.3) Update the reference as the weighted average of the patch level solutions.This approach relies on the redundancy of the patches in the seismic image. Redundancy means that the patches are repetitions of a finite number of patterns, which are described by the dictionary atoms. Redundancy in the earth's structure was demonstrated in previous works in seismics where dictionaries of wavelet functions regularized inversion. We further exploit redundancy of the patches by using dictionary learning algorithms, a form of unsupervised machine learning, to estimate optimal dictionaries from the data in parallel with the inversion. We demonstrate our approach on densely, but irregularly sampled synthetic seismic images.

  6. Designing time-of-use program based on stochastic security constrained unit commitment considering reliability index

    International Nuclear Information System (INIS)

    Nikzad, Mehdi; Mozafari, Babak; Bashirvand, Mahdi; Solaymani, Soodabeh; Ranjbar, Ali Mohamad

    2012-01-01

    Recently in electricity markets, a massive focus has been made on setting up opportunities for participating demand side. Such opportunities, also known as demand response (DR) options, are triggered by either a grid reliability problem or high electricity prices. Two important challenges that market operators are facing are appropriate designing and reasonable pricing of DR options. In this paper, time-of-use program (TOU) as a prevalent time-varying program is modeled linearly based on own and cross elasticity definition. In order to decide on TOU rates, a stochastic model is proposed in which the optimum TOU rates are determined based on grid reliability index set by the operator. Expected Load Not Supplied (ELNS) is used to evaluate reliability of the power system in each hour. The proposed stochastic model is formulated as a two-stage stochastic mixed-integer linear programming (SMILP) problem and solved using CPLEX solver. The validity of the method is tested over the IEEE 24-bus test system. In this regard, the impact of the proposed pricing method on system load profile; operational costs and required capacity of up- and down-spinning reserve as well as improvement of load factor is demonstrated. Also the sensitivity of the results to elasticity coefficients is investigated. -- Highlights: ► Time-of-use demand response program is linearly modeled. ► A stochastic model is proposed to determine the optimum TOU rates based on ELNS index set by the operator. ► The model is formulated as a short-term two-stage stochastic mixed-integer linear programming problem.

  7. ASAP: A MAC Protocol for Dense and Time-Constrained RFID Systems

    Directory of Open Access Journals (Sweden)

    Kyounghwan Lee

    2007-08-01

    Full Text Available We introduce a novel medium access control (MAC protocol for radio frequency identification (RFID systems which exploits the statistical information collected at the reader. The protocol, termed adaptive slotted ALOHA protocol (ASAP, is motivated by the need to significantly improve the total read time performance of the currently suggested MAC protocols for RFID systems. In order to accomplish this task, ASAP estimates the dynamic tag population and adapts the frame size in the subsequent round via a simple policy that maximizes an appropriately defined efficiency function. We demonstrate that ASAP provides significant improvement in total read time performance over the current RFID MAC protocols. We next extend the design to accomplish reliable performance of ASAP in realistic scenarios such as the existence of constraints on frame size, and mobile RFID systems where tags move at constant velocity in the reader's field. We also consider the case where tags may fail to respond because of a physical breakdown or a temporary malfunction, and show the robustness in those scenarios as well.

  8. Design considerations for computationally constrained two-way real-time video communication

    Science.gov (United States)

    Bivolarski, Lazar M.; Saunders, Steven E.; Ralston, John D.

    2009-08-01

    Today's video codecs have evolved primarily to meet the requirements of the motion picture and broadcast industries, where high-complexity studio encoding can be utilized to create highly-compressed master copies that are then broadcast one-way for playback using less-expensive, lower-complexity consumer devices for decoding and playback. Related standards activities have largely ignored the computational complexity and bandwidth constraints of wireless or Internet based real-time video communications using devices such as cell phones or webcams. Telecommunications industry efforts to develop and standardize video codecs for applications such as video telephony and video conferencing have not yielded image size, quality, and frame-rate performance that match today's consumer expectations and market requirements for Internet and mobile video services. This paper reviews the constraints and the corresponding video codec requirements imposed by real-time, 2-way mobile video applications. Several promising elements of a new mobile video codec architecture are identified, and more comprehensive computational complexity metrics and video quality metrics are proposed in order to support the design, testing, and standardization of these new mobile video codecs.

  9. CONSTRAINING GAMMA-RAY BURST EMISSION PHYSICS WITH EXTENSIVE EARLY-TIME, MULTIBAND FOLLOW-UP

    International Nuclear Information System (INIS)

    Cucchiara, A.; Cenko, S. B.; Bloom, J. S.; Morgan, A.; Perley, D. A.; Li, W.; Butler, N. R.; Filippenko, A. V.; Melandri, A.; Kobayashi, S.; Smith, R. J.; Mundell, C. G.; Steele, I. A.; Hora, J. L.; Da Silva, R. L.; Prochaska, J. X.; Worseck, G.; Fumagalli, M.; Milne, P. A.; Cobb, B.

    2011-01-01

    Understanding the origin and diversity of emission processes responsible for gamma-ray bursts (GRBs) remains a pressing challenge. While prompt and contemporaneous panchromatic observations have the potential to test predictions of the internal-external shock model, extensive multiband imaging has been conducted for only a few GRBs. We present rich, early-time, multiband data sets for two Swift events, GRB 110205A and GRB 110213A. The former shows optical emission since the early stages of the prompt phase, followed by the steep rising in flux up to ∼1000 s after the burst (t –α with α = –6.13 ± 0.75). We discuss this feature in the context of the reverse-shock scenario and interpret the following single power-law decay as being forward-shock dominated. Polarization measurements, obtained with the RINGO2 instrument mounted on the Liverpool Telescope, also provide hints on the nature of the emitting ejecta. The latter event, instead, displays a very peculiar optical to near-infrared light curve, with two achromatic peaks. In this case, while the first peak is probably due to the onset of the afterglow, we interpret the second peak to be produced by newly injected material, signifying a late-time activity of the central engine.

  10. CONSTRAINING GAMMA-RAY BURST EMISSION PHYSICS WITH EXTENSIVE EARLY-TIME, MULTIBAND FOLLOW-UP

    Energy Technology Data Exchange (ETDEWEB)

    Cucchiara, A.; Cenko, S. B.; Bloom, J. S.; Morgan, A.; Perley, D. A.; Li, W.; Butler, N. R.; Filippenko, A. V. [Department of Astronomy, University of California, Berkeley, CA 94720-3411 (United States); Melandri, A. [INAF, Osservatorio Astronomicodi Brera, via E. Bianchi 46, I-23807 Merate (Saint Lucia) (Italy); Kobayashi, S.; Smith, R. J.; Mundell, C. G.; Steele, I. A. [Astrophysics Research Institute, Liverpool John Moores University, Twelve Quays House, Egerton Wharf, Birkenhead, CH41 1LD (United Kingdom); Hora, J. L. [Harvard-Smithsonian Center for Astrophysics, 60 Garden St., Cambridge, MA 02138 (United States); Da Silva, R. L.; Prochaska, J. X.; Worseck, G.; Fumagalli, M. [Department of Astronomy and Astrophysics, UCO/Lick Observatory, University of California, 1156 High Street, Santa Cruz, CA 95064 (United States); Milne, P. A. [Steward Observatory, University of Arizona, 933 N. Cherry Ave., Tucson, AZ 85719 (United States); Cobb, B., E-mail: acucchia@ucolick.org [Department of Physics, George Washington University, Corcoran 105, 725 21st St, NW, Washington, DC 20052 (United States); and others

    2011-12-20

    Understanding the origin and diversity of emission processes responsible for gamma-ray bursts (GRBs) remains a pressing challenge. While prompt and contemporaneous panchromatic observations have the potential to test predictions of the internal-external shock model, extensive multiband imaging has been conducted for only a few GRBs. We present rich, early-time, multiband data sets for two Swift events, GRB 110205A and GRB 110213A. The former shows optical emission since the early stages of the prompt phase, followed by the steep rising in flux up to {approx}1000 s after the burst (t{sup -{alpha}} with {alpha} = -6.13 {+-} 0.75). We discuss this feature in the context of the reverse-shock scenario and interpret the following single power-law decay as being forward-shock dominated. Polarization measurements, obtained with the RINGO2 instrument mounted on the Liverpool Telescope, also provide hints on the nature of the emitting ejecta. The latter event, instead, displays a very peculiar optical to near-infrared light curve, with two achromatic peaks. In this case, while the first peak is probably due to the onset of the afterglow, we interpret the second peak to be produced by newly injected material, signifying a late-time activity of the central engine.

  11. Matching-range-constrained real-time loop closure detection with CNNs features.

    Science.gov (United States)

    Bai, Dongdong; Wang, Chaoqun; Zhang, Bo; Yi, Xiaodong; Tang, Yuhua

    2016-01-01

    The loop closure detection (LCD) is an essential part of visual simultaneous localization and mapping systems (SLAM). LCD is capable of identifying and compensating the accumulation drift of localization algorithms to produce an consistent map if the loops are checked correctly. Deep convolutional neural networks (CNNs) have outperformed state-of-the-art solutions that use traditional hand-crafted features in many computer vision and pattern recognition applications. After the great success of CNNs, there has been much interest in applying CNNs features to robotic fields such as visual LCD. Some researchers focus on using a pre-trained CNNs model as a method of generating an image representation appropriate for visual loop closure detection in SLAM. However, there are many fundamental differences and challenges involved in character between simple computer vision applications and robotic applications. Firstly, the adjacent images in the dataset of loop closure detection might have more resemblance than the images that form the loop closure. Secondly, real-time performance is one of the most critical demands for robots. In this paper, we focus on making use of the feature generated by CNNs layers to implement LCD in real environment. In order to address the above challenges, we explicitly provide a value to limit the matching range of images to solve the first problem; meanwhile we get better results than state-of-the-art methods and improve the real-time performance using an efficient feature compression method.

  12. Time series analysis of Mexico City subsidence constrained by radar interferometry

    Science.gov (United States)

    Doin, Marie-Pierre; Lopez-Quiroz, Penelope; Yan, Yajing; Bascou, Pascale; Pinel, Virginie

    2010-05-01

    In Mexico City, subsidence rates reach up to 40 cm/yr mainly due to soil compaction led by the over exploitation of the Mexico Basin aquifer. The Mexico Valley, an endoreic basin surrounded by mountains, was in the past covered by large lakes. After the Spanish conquest, the lakes have almost completely disappeared, being progressively replaced by buildings of the current Mexican capital. The simplified hydrogeologic structure includes a superficial 50 to 300 m thick lacustrine aquitard overlying a thicker aquifer made of alluvial deposits. The aquitard layer plays a crucial role in the subsidence process due to the extremely high compressibility of its clay deposits separated by a less compressible sand layer where the biggest buildings of the city are anchored. The aquifer over-exploitation leads to a large scale 30m depression of its piezometric level, inducing water downwards flow in the clays, yielding compaction and subsidence. In order to quantitatively link subsidence to water pumping, the Mexico city subsidence needs to be mapped and analyzed through space and time. We map its spatial and temporal patterns by differential radar interferometry, using 38 ENVISAT images acquired between end of 2002 and beginning of 2007. We employ both a Permanent Scatterer (PS) and a small baseline (SBAS) approach. The main difficulty consists in the severe unwrapping problems mostly due to the high deformation rate. We develop a specific SBAS approach based on 71 differential interferograms with a perpendicular baseline smaller than 500 m and a temporal baseline smaller than 9 months, forming a redundant network linking all images: (1) To help the unwrapping step, we use the fact that the deformation shape is stable for similar time intervals during the studied period. As a result, a stack of the five best interferograms can be used to reduce the number of fringes in wrapped interferograms. (2) Based on the redundancy of the interferometric data base, we quantify the

  13. Adaptive near-optimal neuro controller for continuous-time nonaffine nonlinear systems with constrained input.

    Science.gov (United States)

    Esfandiari, Kasra; Abdollahi, Farzaneh; Talebi, Heidar Ali

    2017-09-01

    In this paper, an identifier-critic structure is introduced to find an online near-optimal controller for continuous-time nonaffine nonlinear systems having saturated control signal. By employing two Neural Networks (NNs), the solution of Hamilton-Jacobi-Bellman (HJB) equation associated with the cost function is derived without requiring a priori knowledge about system dynamics. Weights of the identifier and critic NNs are tuned online and simultaneously such that unknown terms are approximated accurately and the control signal is kept between the saturation bounds. The convergence of NNs' weights, identification error, and system states is guaranteed using Lyapunov's direct method. Finally, simulation results are performed on two nonlinear systems to confirm the effectiveness of the proposed control strategy. Copyright © 2017 Elsevier Ltd. All rights reserved.

  14. Faulting and groundwater in a desert environment: constraining hydrogeology using time-domain electromagnetic data

    Science.gov (United States)

    Bedrosian, Paul A.; Burgess, Matthew K.; Nishikawa, Tracy

    2013-01-01

    Within the south-western Mojave Desert, the Joshua Basin Water District is considering applying imported water into infiltration ponds in the Joshua Tree groundwater sub-basin in an attempt to artificially recharge the underlying aquifer. Scarce subsurface hydrogeological data are available near the proposed recharge site; therefore, time-domain electromagnetic (TDEM) data were collected and analysed to characterize the subsurface. TDEM soundings were acquired to estimate the depth to water on either side of the Pinto Mountain Fault, a major east-west trending strike-slip fault that transects the proposed recharge site. While TDEM is a standard technique for groundwater investigations, special care must be taken when acquiring and interpreting TDEM data in a twodimensional (2D) faulted environment. A subset of the TDEM data consistent with a layered-earth interpretation was identified through a combination of three-dimensional (3D) forward modelling and diffusion time-distance estimates. Inverse modelling indicates an offset in water table elevation of nearly 40 m across the fault. These findings imply that the fault acts as a low-permeability barrier to groundwater flow in the vicinity of the proposed recharge site. Existing production wells on the south side of the fault, together with a thick unsaturated zone and permeable near-surface deposits, suggest the southern half of the study area is suitable for artificial recharge. These results illustrate the effectiveness of targeted TDEM in support of hydrological studies in a heavily faulted desert environment where data are scarce and the cost of obtaining these data by conventional drilling techniques is prohibitive.

  15. Time-lapse three-dimensional inversion of complex conductivity data using an active time constrained (ATC) approach

    Science.gov (United States)

    Karaoulis, M.; Revil, A.; Werkema, D.D.; Minsley, B.J.; Woodruff, W.F.; Kemna, A.

    2011-01-01

    Induced polarization (more precisely the magnitude and phase of impedance of the subsurface) is measured using a network of electrodes located at the ground surface or in boreholes. This method yields important information related to the distribution of permeability and contaminants in the shallow subsurface. We propose a new time-lapse 3-D modelling and inversion algorithm to image the evolution of complex conductivity over time. We discretize the subsurface using hexahedron cells. Each cell is assigned a complex resistivity or conductivity value. Using the finite-element approach, we model the in-phase and out-of-phase (quadrature) electrical potentials on the 3-D grid, which are then transformed into apparent complex resistivity. Inhomogeneous Dirichlet boundary conditions are used at the boundary of the domain. The calculation of the Jacobian matrix is based on the principles of reciprocity. The goal of time-lapse inversion is to determine the change in the complex resistivity of each cell of the spatial grid as a function of time. Each model along the time axis is called a 'reference space model'. This approach can be simplified into an inverse problem looking for the optimum of several reference space models using the approximation that the material properties vary linearly in time between two subsequent reference models. Regularizations in both space domain and time domain reduce inversion artefacts and improve the stability of the inversion problem. In addition, the use of the time-lapse equations allows the simultaneous inversion of data obtained at different times in just one inversion step (4-D inversion). The advantages of this new inversion algorithm are demonstrated on synthetic time-lapse data resulting from the simulation of a salt tracer test in a heterogeneous random material described by an anisotropic semi-variogram. ?? 2011 The Authors Geophysical Journal International ?? 2011 RAS.

  16. TEXPLORE temporal difference reinforcement learning for robots and time-constrained domains

    CERN Document Server

    Hester, Todd

    2013-01-01

    This book presents and develops new reinforcement learning methods that enable fast and robust learning on robots in real-time. Robots have the potential to solve many problems in society, because of their ability to work in dangerous places doing necessary jobs that no one wants or is able to do. One barrier to their widespread deployment is that they are mainly limited to tasks where it is possible to hand-program behaviors for every situation that may be encountered. For robots to meet their potential, they need methods that enable them to learn and adapt to novel situations that they were not programmed for. Reinforcement learning (RL) is a paradigm for learning sequential decision making processes and could solve the problems of learning and adaptation on robots. This book identifies four key challenges that must be addressed for an RL algorithm to be practical for robotic control tasks. These RL for Robotics Challenges are: 1) it must learn in very few samples; 2) it must learn in domains with continuou...

  17. A policy iteration approach to online optimal control of continuous-time constrained-input systems.

    Science.gov (United States)

    Modares, Hamidreza; Naghibi Sistani, Mohammad-Bagher; Lewis, Frank L

    2013-09-01

    This paper is an effort towards developing an online learning algorithm to find the optimal control solution for continuous-time (CT) systems subject to input constraints. The proposed method is based on the policy iteration (PI) technique which has recently evolved as a major technique for solving optimal control problems. Although a number of online PI algorithms have been developed for CT systems, none of them take into account the input constraints caused by actuator saturation. In practice, however, ignoring these constraints leads to performance degradation or even system instability. In this paper, to deal with the input constraints, a suitable nonquadratic functional is employed to encode the constraints into the optimization formulation. Then, the proposed PI algorithm is implemented on an actor-critic structure to solve the Hamilton-Jacobi-Bellman (HJB) equation associated with this nonquadratic cost functional in an online fashion. That is, two coupled neural network (NN) approximators, namely an actor and a critic are tuned online and simultaneously for approximating the associated HJB solution and computing the optimal control policy. The critic is used to evaluate the cost associated with the current policy, while the actor is used to find an improved policy based on information provided by the critic. Convergence to a close approximation of the HJB solution as well as stability of the proposed feedback control law are shown. Simulation results of the proposed method on a nonlinear CT system illustrate the effectiveness of the proposed approach. Copyright © 2013 ISA. All rights reserved.

  18. A set packing inspired method for real-time junction train routing

    DEFF Research Database (Denmark)

    Lusby, Richard Martin; Larsen, Jesper; Ehrgott, Matthias

    2013-01-01

    Efficiently coordinating the often large number of interdependent, timetabled train movements on a railway junction, while satisfying a number of operational requirements, is one of the most important problems faced by a railway company. The most critical variant of the problem arises on a daily...... basis at major railway junctions where disruptions to rail traffic make the planned schedule/routing infeasible and rolling stock planners are forced to re-schedule/re-route trains in order to recover feasibility. The dynamic nature of the problem means that good solutions must be obtained quickly....... In this paper we describe a set packing inspired formulation of this problem and develop a branch-and-price based solution approach. A real life test instance arising in Germany and supplied by the major German railway company, Deutsche Bahn, indicates the efficiency of the proposed approach by confirming...

  19. A Set Packing Inspired Method for Real-Time Junction Train Routing

    DEFF Research Database (Denmark)

    Lusby, Richard Martin; Larsen, Jesper; Ehrgott, Matthias

    Efficiently coordinating the often large number of interdependent, timetabled train movements on a railway junction, while satisfying a number of operational requirements, is one of the most important problems faced by a railway company. The most critical variant of the problem arises on a daily...... basis at major railway junctions where disruptions to rail traffi c make the planned schedule/routing infeasible and rolling stock planners are forced to reschedule/re-route trains in order to recover feasibility. The dynamic nature of the problem means that good solutions must be obtained quickly....... In this paper we describe a set packing inspired formulation of this problem and develop a branch-and-price based solution approach. A real life test instance arising in Germany and supplied by the major German railway company, Deutsche Bahn, indicates the efficiency of the proposed approach by confirming...

  20. Sediment residence times constrained by uranium-series isotopes: A critical appraisal of the comminution approach

    Science.gov (United States)

    Handley, Heather K.; Turner, Simon; Afonso, Juan C.; Dosseto, Anthony; Cohen, Tim

    2013-02-01

    Quantifying the rates of landscape evolution in response to climate change is inhibited by the difficulty of dating the formation of continental detrital sediments. We present uranium isotope data for Cooper Creek palaeochannel sediments from the Lake Eyre Basin in semi-arid South Australia in order to attempt to determine the formation ages and hence residence times of the sediments. To calculate the amount of recoil loss of 234U, a key input parameter used in the comminution approach, we use two suggested methods (weighted geometric and surface area measurement with an incorporated fractal correction) and typical assumed input parameter values found in the literature. The calculated recoil loss factors and comminution ages are highly dependent on the method of recoil loss factor determination used and the chosen assumptions. To appraise the ramifications of the assumptions inherent in the comminution age approach and determine individual and combined comminution age uncertainties associated to each variable, Monte Carlo simulations were conducted for a synthetic sediment sample. Using a reasonable associated uncertainty for each input factor and including variations in the source rock and measured (234U/238U) ratios, the total combined uncertainty on comminution age in our simulation (for both methods of recoil loss factor estimation) can amount to ±220-280 ka. The modelling shows that small changes in assumed input values translate into large effects on absolute comminution age. To improve the accuracy of the technique and provide meaningful absolute comminution ages, much tighter constraints are required on the assumptions for input factors such as the fraction of α-recoil lost 234Th and the initial (234U/238U) ratio of the source material. In order to be able to directly compare calculated comminution ages produced by different research groups, the standardisation of pre-treatment procedures, recoil loss factor estimation and assumed input parameter values

  1. Cell therapy attenuates cardiac dysfunction post myocardial infarction: effect of timing, routes of injection and a fibrin scaffold.

    Directory of Open Access Journals (Sweden)

    Juliana S Nakamuta

    Full Text Available BACKGROUND: Cell therapy approaches for biologic cardiac repair hold great promises, although basic fundamental issues remain poorly understood. In the present study we examined the effects of timing and routes of administration of bone marrow cells (BMC post-myocardial infarction (MI and the efficacy of an injectable biopolymer scaffold to improve cardiac cell retention and function. METHODOLOGY/PRINCIPAL FINDINGS: (99mTc-labeled BMC (6 x 10(6 cells were injected by 4 different routes in adult rats: intravenous (IV, left ventricular cavity (LV, left ventricular cavity with temporal aorta occlusion (LV(+ to mimic coronary injection, and intramyocardial (IM. The injections were performed 1, 2, 3, or 7 days post-MI and cell retention was estimated by gamma-emission counting of the organs excised 24 hs after cell injection. IM injection improved cell retention and attenuated cardiac dysfunction, whereas IV, LV or LV* routes were somewhat inefficient (<1%. Cardiac BMC retention was not influenced by timing except for the IM injection that showed greater cell retention at 7 (16% vs. 1, 2 or 3 (average of 7% days post-MI. Cardiac cell retention was further improved by an injectable fibrin scaffold at day 3 post-MI (17 vs. 7%, even though morphometric and function parameters evaluated 4 weeks later displayed similar improvements. CONCLUSIONS/SIGNIFICANCE: These results show that cells injected post-MI display comparable tissue distribution profile regardless of the route of injection and that there is no time effect for cardiac cell accumulation for injections performed 1 to 3 days post-MI. As expected the IM injection is the most efficient for cardiac cell retention, it can be further improved by co-injection with a fibrin scaffold and it significantly attenuates cardiac dysfunction evaluated 4 weeks post myocardial infarction. These pharmacokinetic data obtained under similar experimental conditions are essential for further development of these

  2. Clique inequalities applied to the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Spoorendonk, Simon; Desaulniers, Guy

    2010-01-01

    criterion applied in the pricing algorithm, which is a labeling algorithm for solving resource-constrained elementary shortest path problems. The idea of using cutting planes defined on the master problem variables for the VRPTW has been recently developed: Chva´tal-Gomory rank-1 cuts were applied. However......, to our knowledge, this is a first attempt at incorporating for the VRPTW a set of valid inequalities specialized for the set partitioning polytope. Computational results show that the use of clique inequalities improves the lower bound at the root node of the search tree and reduces the number of nodes...

  3. Traffic Route Guidance using Feedback of Predicted Travel Times : Improving Travel Times in the Berlin Traffic Network

    OpenAIRE

    Bergsten, Arvid; Zetterberg, Daniel

    2008-01-01

    Traffic congestions constitute a problem in many large cities. Congestions can be handled by reducing the network demand, expanding the infrastructure, or by utilizing the road network more efficiently. This master thesis presents a methodology for route guidance, based on automatic feedback control from the current traffic situation. Through variable direction signs or individual in-car devices, all vehicles with a certain origin and destination (which are both normally intermediate) are gui...

  4. A Time-Slotted On-Demand Routing Protocol for Mobile Ad Hoc Unmanned Vehicle Systems

    Energy Technology Data Exchange (ETDEWEB)

    Hope Forsmann; Robert Hiromoto; John Svoboda

    2007-04-01

    The popularity of UAVs has increased dramatically because of their successful deployment in military operations, their ability to preserve human life, and the continual improvements in wireless communication that serves to increase their capabilities. We believe the usefulness of UAVs would be dramatically increased if formation flight were added to the list of capabilities. Currently, sustained formation flight with a cluster of UAVs has only been achieved with two nodes by the Multi-UAV Testbed at the Massachusetts Institute of Technology. (Park, 2004) Formation flight is a complex operation requiring the ability to adjust the flight patterns on the fly and correct for wind gusts, terrain, and differences in node equipment. All of which increases the amount of inner node communication. Since one of the problems with MANET communication is network congestion, we believe a first step towards formation flight can be made through improved inner node communication. We have investigated current communication routing protocols and developed an altered hybrid routing protocol in order to provide communication with less network congestion.

  5. Improving the Dominating-Set Routing over Delay-Tolerant Mobile Ad-Hoc Networks via Estimating Node Intermeeting Times

    Directory of Open Access Journals (Sweden)

    Preiss Bruno

    2011-01-01

    Full Text Available With limited coverage of wireless networks and frequent roaming of mobile users, providing a seamless communication service poses a technical challenge. In our previous research, we presented a supernode system architecture that employs the delay-tolerant network (DTN concept to provide seamless communications for roaming users over interconnected heterogeneous wireless networks. Mobile ad hoc networks (MANETs are considered a key component of the supernode system for services over an area not covered by other wireless networks. Within the super node system, a dominating-set routing technique is proposed to improve message delivery over MANETs and to achieve better resource utilization. The performance of the dominating-set routing technique depends on estimation accuracy of the probability of a future contact between nodes. This paper studies how node mobility can be modeled and used to better estimate the probability of a contact. We derive a distribution for the node-to-node intermeeting time and present numerical results to demonstrate that the distribution can be used to improve the dominating-set routing technique performance. Moreover, we investigate how the distribution can be employed to relax the constraints of selecting the dominating-set members in order to improve the system resource utilization.

  6. Palaeomagnetic Constrains on the Timing and the Geographical Distribution of Tectonic Rotations in the Betic Chain, Southern Spain. A Review

    Science.gov (United States)

    Osete, M. L.; Villalain, J. J.; Pavon-Carrasco, F. J.; Palencia, A.

    2009-05-01

    The Betic Cordillera is the northern branch of the Betic-Rifean orogen, the westernmost segment of the Mediterranean Alpine orogenic system. Several palaeomagnetic studies have enhanced the important role that block rotations about vertical axes have played in the tectonic evolution of the region. In this work we present a review of published palaeomagnetic data. According with the rotational deformation, the Betics are divided into the central-western area and the eastern Betics. A sequence of rotations for the two regions is also proposed. In central and western Subbetics almost constant clockwise rotations of about 60 are documented in Jurassic limestones. The existence of a pervasive remagnetization of Jurassic limestones, which was coeval with the folding of the studied units and dated as post-Palaeogene, constrains the timing of tectonic rotations in western Subbetics. New palaeomagnetic data from Neogene sedimentary sequences in central Betics indicate that palaeomagnetic clockwise rotations continued after late Miocene. A similar pattern of 40 CW rotations occurred after 20-17 Ma was obtained from the study of the Ronda-Malaga peridotites (western Internal Betics). In eastern Subbetics a more heterogeneous pattern, including very high CW rotations has been observed. But recent rotational deformation in the Internal part of eastern Betics is CCW and related to the left-lateral strike-slip fault systems. Proposed kinematics models for the Betics are discussed under the light of the present available palaeomagnetic information.

  7. Using CATS Near-Real-time Lidar Observations to Monitor and Constrain Volcanic Sulfur Dioxide (SO2) Forecasts

    Science.gov (United States)

    Hughes, E. J.; Yorks, J.; Krotkov, N. A.; da Silva, A. M.; Mcgill, M.

    2016-01-01

    An eruption of Italian volcano Mount Etna on 3 December 2015 produced fast-moving sulfur dioxide (SO2) and sulfate aerosol clouds that traveled across Asia and the Pacific Ocean, reaching North America in just 5 days. The Ozone Profiler and Mapping Suite's Nadir Mapping UV spectrometer aboard the U.S. National Polar-orbiting Partnership satellite observed the horizontal transport of the SO2 cloud. Vertical profiles of the colocated volcanic sulfate aerosols were observed between 11.5 and 13.5 km by the new Cloud Aerosol Transport System (CATS) space-based lidar aboard the International Space Station. Backward trajectory analysis estimates the SO2 cloud altitude at 7-12 km. Eulerian model simulations of the SO2 cloud constrained by CATS measurements produced more accurate dispersion patterns compared to those initialized with the back trajectory height estimate. The near-real-time data processing capabilities of CATS are unique, and this work demonstrates the use of these observations to monitor and model volcanic clouds.

  8. Fall migration routes, timing, and wintering sites of North American ospreys as determined by satellite telemetry

    Science.gov (United States)

    Martell, M.S.; Henny, Charles J.; Nye, P.; Solensky, Matthew J.

    2001-01-01

    Satellite telemetry was used to determine fall migratory movements of Ospreys (Pandion haliaetus) breeding in the United States. Study areas were established along the lower Columbia River between Oregon and Washington; in north-central Minnesota; on Shelter Island, New York; and in southern New Jersey. Seventy-four adults (25 males, 49 females) were tracked from 1995 through 1999. Migration routes differed among populations but not by sex. Western Ospreys migrated through California and to a lesser degree other western states and wintered in Mexico (88%), El Salvador (6%), and Honduras (6%) (25.9A?N to 13.0A?N and 108.3A?W to 87.3A?W). Minnesota Ospreys migrated along three routes: (1) through the Central U.S. and then along the east coast of Mexico, (2) along the Mississippi River Valley, then across the Gulf of Mexico, or (3) through the southeastern U.S., then across the Caribbean. East Coast birds migrated along the eastern seaboard of the U.S., through Florida, and across the Caribbean. Midwestern birds wintered from Mexico south to Bolivia (22.35A?N to 13.64A?S, and 91.75A?W to 61.76A?W), while East Coast birds wintered from Florida to as far south as Brazil (27.48A?N to 18.5A?S and 80.4A?W to 57.29A?W). Dates of departure from breeding areas differed significantly between sexes and geographic regions, with females leaving earlier than males. Western birds traveled a shorter distance than either midwestern or eastern Ospreys. Females traveled farther than males from the same population, which resulted in females typically wintering south of males.

  9. A Space-Time Network-Based Modeling Framework for Dynamic Unmanned Aerial Vehicle Routing in Traffic Incident Monitoring Applications

    Directory of Open Access Journals (Sweden)

    Jisheng Zhang

    2015-06-01

    Full Text Available It is essential for transportation management centers to equip and manage a network of fixed and mobile sensors in order to quickly detect traffic incidents and further monitor the related impact areas, especially for high-impact accidents with dramatic traffic congestion propagation. As emerging small Unmanned Aerial Vehicles (UAVs start to have a more flexible regulation environment, it is critically important to fully explore the potential for of using UAVs for monitoring recurring and non-recurring traffic conditions and special events on transportation networks. This paper presents a space-time network- based modeling framework for integrated fixed and mobile sensor networks, in order to provide a rapid and systematic road traffic monitoring mechanism. By constructing a discretized space-time network to characterize not only the speed for UAVs but also the time-sensitive impact areas of traffic congestion, we formulate the problem as a linear integer programming model to minimize the detection delay cost and operational cost, subject to feasible flying route constraints. A Lagrangian relaxation solution framework is developed to decompose the original complex problem into a series of computationally efficient time-dependent and least cost path finding sub-problems. Several examples are used to demonstrate the results of proposed models in UAVs’ route planning for small and medium-scale networks.

  10. Vehicle Routing Problem with Time Windows and Simultaneous Delivery and Pick-Up Service Based on MCPSO

    Directory of Open Access Journals (Sweden)

    Xiaobing Gan

    2012-01-01

    Full Text Available This paper considers two additional factors of the widely researched vehicle routing problem with time windows (VRPTW. The two factors, which are very common characteristics in realworld, are uncertain number of vehicles and simultaneous delivery and pick-up service. Using minimization of the total transport costs as the objective of the extension VRPTW, a mathematic model is constructed. To solve the problem, an efficient multiswarm cooperative particle swarm optimization (MCPSO algorithm is applied. And a new encoding method is proposed for the extension VRPTW. Finally, comparing with genetic algorithm (GA and particle swarm optimization (PSO algorithm, the MCPSO algorithm performs best for solving this problem.

  11. A granular t abu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows

    Energy Technology Data Exchange (ETDEWEB)

    Bernal, Jose; Escobar, John Willmer; Linfati, Rodrigo

    2017-07-01

    We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW) for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase), a granular tabu search is applied during the improvement phase (second phase). Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.

  12. A granular t abu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows

    International Nuclear Information System (INIS)

    Bernal, Jose; Escobar, John Willmer; Linfati, Rodrigo

    2017-01-01

    We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW) for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase), a granular tabu search is applied during the improvement phase (second phase). Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.

  13. (TRANSATLANTIC ROUTES IN COLONIAL TIME AFRICAN POETRY: THE CASE OF NOÉMIA DE SOUSA

    Directory of Open Access Journals (Sweden)

    Simone Pereira Schmidt

    2011-11-01

    Full Text Available From the mid-twentieth century on, African authors mark their poetry with strong libertarian tones. Their poems can be interpreted as a discourse of identity affirmation that played an important role in anti­-colonial struggle. Among these authors, the Mozambican Noemia de Sousa took an important part, and in her poetry we can read a dialogue with intellectuals and artists linked, directly or indirectly, with the stru­ggles of American black movement for civil rights. This article seeks to interpret the dialogue established by Noemia e Sousa, in her poetry, with the construction of a ‘black identity’ discourse, especially in the con­solidation of black movements in West and in the growth of an anti-colonial consciousness in African countries. By reading some Noémia de Sousa poems, we intend to investigate the routes traced by such dis­courses, also considering the gender issues involved in the poet’s work.

  14. Installation of dynamic travel time signs and efforts to obtain and test a graphical route information panel (GRIP) sign in Austin.

    Science.gov (United States)

    2016-08-01

    Graphic Route Information Panel (GRIP) signs use a combination of text, colors, and representative maps of : the roadway system to convey real-time roadway congestion location and severity information. The intent of : this project was to facilitate t...

  15. The time dependent Schrodinger equation revisited I: quantum field and classical Hamilton-Jacobi routes to Schrodinger's wave equation

    International Nuclear Information System (INIS)

    Scully, M O

    2008-01-01

    The time dependent Schrodinger equation is frequently 'derived' by postulating the energy E → i h-bar (∂/∂t) and momentum p-vector → ( h-bar /i)∇ operator relations. In the present paper we review the quantum field theoretic route to the Schrodinger wave equation which treats time and space as parameters, not operators. Furthermore, we recall that a classical (nonlinear) wave equation can be derived from the classical action via Hamiltonian-Jacobi theory. By requiring the wave equation to be linear we again arrive at the Schrodinger equation, without postulating operator relations. The underlying philosophy is operational: namely 'a particle is what a particle detector detects.' This leads us to a useful physical picture combining the wave (field) and particle paradigms which points the way to the time-dependent Schrodinger equation

  16. Constraining the Timing of Lobate Debris Apron Emplacement at Martian Mid-Latitudes Using a Numerical Model of Ice Flow

    Science.gov (United States)

    Parsons, R. A.; Nimmo, F.

    2010-03-01

    SHARAD observations constrain the thickness and dust content of lobate debris aprons (LDAs). Simulations of dust-free ice-sheet flow over a flat surface at 205 K for 10-100 m.y. give LDA lengths and thicknesses that are consistent with observations.

  17. Value of travel-time reliability : commuters' route-choice behavior in the Twin Cities.

    Science.gov (United States)

    2011-10-01

    Travel-time variability is a noteworthy factor in network performance. It measures the temporal uncertainty experienced by users in their : movement between any two nodes in a network. The importance of the time variance depends on the penalties incu...

  18. A Practical and Robust Execution Time-Frame Procedure for the Multi-Mode Resource-Constrained Project Scheduling Problem with Minimal and Maximal Time Lags

    Directory of Open Access Journals (Sweden)

    Angela Hsiang-Ling Chen

    2016-09-01

    Full Text Available Modeling and optimizing organizational processes, such as the one represented by the Resource-Constrained Project Scheduling Problem (RCPSP, improve outcomes. Based on assumptions and simplification, this model tackles the allocation of resources so that organizations can continue to generate profits and reinvest in future growth. Nonetheless, despite all of the research dedicated to solving the RCPSP and its multi-mode variations, there is no standardized procedure that can guide project management practitioners in their scheduling tasks. This is mainly because many of the proposed approaches are either based on unrealistic/oversimplified scenarios or they propose solution procedures not easily applicable or even feasible in real-life situations. In this study, we solve a more true-to-life and complex model, Multimode RCPSP with minimal and maximal time lags (MRCPSP/max. The complexity of the model solved is presented, and the practicality of the proposed approach is justified depending on only information that is available for every project regardless of its industrial context. The results confirm that it is possible to determine a robust makespan and to calculate an execution time-frame with gaps lower than 11% between their lower and upper bounds. In addition, in many instances, the solved lower bound obtained was equal to the best-known optimum.

  19. Biased random key genetic algorithm with insertion and gender selection for capacitated vehicle routing problem with time windows

    Science.gov (United States)

    Rochman, Auliya Noor; Prasetyo, Hari; Nugroho, Munajat Tri

    2017-06-01

    Vehicle Routing Problem (VRP) often occurs when the manufacturers need to distribute their product to some customers/outlets. The distribution process is typically restricted by the capacity of the vehicle and the working hours at the distributor. This type of VRP is also known as Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). A Biased Random Key Genetic Algorithm (BRKGA) was designed and coded in MATLAB to solve the CVRPTW case of soft drink distribution. The standard BRKGA was then modified by applying chromosome insertion into the initial population and defining chromosome gender for parent undergoing crossover operation. The performance of the established algorithms was then compared to a heuristic procedure for solving a soft drink distribution. Some findings are revealed (1) the total distribution cost of BRKGA with insertion (BRKGA-I) results in a cost saving of 39% compared to the total cost of heuristic method, (2) BRKGA with the gender selection (BRKGA-GS) could further improve the performance of the heuristic method. However, the BRKGA-GS tends to yield worse results compared to that obtained from the standard BRKGA.

  20. OPTIMASI OLSR ROUTING PROTOCOL PADA JARINGAN WIRELESS MESH DENGAN ADAPTIVE REFRESHING TIME INTERVAL DAN ENHANCE MULTI POINT RELAY SELECTING ALGORITHM

    Directory of Open Access Journals (Sweden)

    Faosan Mapa

    2014-01-01

    Full Text Available Normal 0 false false false IN X-NONE X-NONE MicrosoftInternetExplorer4 /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} Wireless Mesh Network (WMN adalah suatu konektivitas jaringan yang self-organized, self-configured dan multi-hop. Tujuan dari WMN adalah menawarkan pengguna suatu bentuk jaringan nirkabel yang dapat dengan mudah berkomunikasi dengan jaringan konvensional dengan kecepatan tinggi dan dengan cakupan yang lebih luas serta biaya awal yang minimal. Diperlukan suatu desain protokol routing yang efisien untuk WMN yang secara adaptif dapat mendukung mesh routers dan mesh clients. Dalam tulisan ini, diusulkan untuk mengoptimalkan protokol OLSR, yang merupakan protokol routing proaktif. Digunakan heuristik yang meningkatkan protokol OLSR melalui adaptive refreshing time interval dan memperbaiki metode MPR selecting algorithm. Suatu analisa dalam meningkatkan protokol OLSR melalui adaptive refreshing time interval dan memperbaiki algoritma pemilihan MPR menunjukkan kinerja yang signifikan dalam hal throughput jika dibandingkan dengan protokol OLSR yang asli. Akan tetapi, terdapat kenaikan dalam hal delay. Pada simulasi yang dilakukan dapat disimpulkan bahwa OLSR dapat dioptimalkan dengan memodifikasi pemilihan node MPR berdasarkan cost effective dan penyesuaian waktu interval refreshing hello message sesuai dengan keadaan

  1. Two-dimensional and 3-D images of thick tissue using time-constrained times-of-flight and absorbance spectrophotometry

    Science.gov (United States)

    Benaron, David A.; Lennox, M.; Stevenson, David K.

    1992-05-01

    Reconstructing deep-tissue images in real time using spectrophotometric data from optically diffusing thick tissues has been problematic. Continuous wave applications (e.g., pulse oximetry, regional cerebral saturation) ignore both the multiple paths traveled by the photons through the tissue and the effects of scattering, allowing scalar measurements but only under limited conditions; interferometry works poorly in thick, highly-scattering media; frequency- modulated approaches may not allow full deconvolution of scattering and absorbance; and pulsed-light techniques allow for preservation of information regarding the multiple paths taken by light through the tissue, but reconstruction is both computation intensive and limited by the relative surface area available for detection of photons. We have developed a picosecond times-of-flight and absorbance (TOFA) optical system, time-constrained to measure only photons with a narrow range of path lengths and arriving within a narrow angel of the emitter-detector axis. The delay until arrival of the earliest arriving photons is a function of both the scattering and absorbance of the tissues in a direct line between the emitter and detector, reducing the influence of surrounding tissues. Measurement using a variety of emitter and detector locations produces spatial information which can be analyzed in a standard 2-D grid, or subject to computer reconstruction to produce tomographic images representing 3-D structure. Using such a technique, we have been able to demonstrate the principles of tc-TOFA, detect and localize diffusive and/or absorptive objects suspended in highly scattering media (such as blood admixed with yeast), and perform simple 3-D reconstructions using phantom objects. We are now attempting to obtain images in vivo. Potential future applications include use as a research tool, and as a continuous, noninvasive, nondestructive monitor in diagnostic imaging, fetal monitoring, neurologic and cardiac

  2. Fault-Tolerant Topology and Routing Synthesis for IEEE Time-Sensitive Networking

    DEFF Research Database (Denmark)

    Gavrilut, Voica Maria; Zarrin, Bahram; Pop, Paul

    2017-01-01

    of the applications are satisffied. We propose three approaches to solve this optimization problem: (1) a heuristic solution, (2) a Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic, and (3) a Constraint Programmingbased model. The approaches are evaluated on several test cases, including a test case......Time-Sensitive Networking (TSN) is a set of IEEE standards that extend Ethernet for safety-critical and real-time applications. TSN is envisioned to be widely used in several applications areas, from industrial automation to in-vehicle networking. A TSN network is composed of end systems...... interconnected by physical links and bridges (switches). The data in TSN is exchanged via streams. We address safety-critical real-time systems, and we consider that the streams use the Urgency-Based Scheduler (UBS) traffic-type, suitable for hard real-time traffic. We are interested in determining a fault...

  3. Integrated deployment architecture for predictive real-time traffic routing incorporating human factors considerations.

    Science.gov (United States)

    2014-05-01

    As Advanced Traveler Information Systems (ATIS) are being more widely accessed by drivers, understanding drivers behavioral responses to real-time travel information through ATIS and its consequential benefits are important to the widespread deplo...

  4. Penetration route of functional molecules in stratum corneum studied by time-resolved small- and wide-angle x-ray diffraction

    International Nuclear Information System (INIS)

    Hatta, Ichiro; Ohta, Noboru; Yagi, Naoto; Nakazawa, Hiromitsu; Obata, Yasuko; Inoue, Katsuaki

    2011-01-01

    We studied effects of functional molecules on corneocytes in stratum corneum using time-resolved small- and wide-angle x-ray diffraction after applying a functional molecule. From these results it was revealed that in the stratum corneum a typical hydrophilic molecule, ethanol, penetrates via the transcellular route and on the other hand a typical hydrophobic molecule, d-limonene, penetrates via the intercellular route.

  5. A Novel Spatial-Temporal Voronoi Diagram-Based Heuristic Approach for Large-Scale Vehicle Routing Optimization with Time Constraints

    Directory of Open Access Journals (Sweden)

    Wei Tu

    2015-10-01

    Full Text Available Vehicle routing optimization (VRO designs the best routes to reduce travel cost, energy consumption, and carbon emission. Due to non-deterministic polynomial-time hard (NP-hard complexity, many VROs involved in real-world applications require too much computing effort. Shortening computing time for VRO is a great challenge for state-of-the-art spatial optimization algorithms. From a spatial-temporal perspective, this paper presents a spatial-temporal Voronoi diagram-based heuristic approach for large-scale vehicle routing problems with time windows (VRPTW. Considering time constraints, a spatial-temporal Voronoi distance is derived from the spatial-temporal Voronoi diagram to find near neighbors in the space-time searching context. A Voronoi distance decay strategy that integrates a time warp operation is proposed to accelerate local search procedures. A spatial-temporal feature-guided search is developed to improve unpromising micro route structures. Experiments on VRPTW benchmarks and real-world instances are conducted to verify performance. The results demonstrate that the proposed approach is competitive with state-of-the-art heuristics and achieves high-quality solutions for large-scale instances of VRPTWs in a short time. This novel approach will contribute to spatial decision support community by developing an effective vehicle routing optimization method for large transportation applications in both public and private sectors.

  6. CP Methods for Scheduling and Routing with Time-Dependent Task Costs

    DEFF Research Database (Denmark)

    Tierney, Kevin; Kelareva, Elena; Kilby, Philip

    2013-01-01

    a cost function, and Mixed Integer Programming (MIP) are often used for solving such problems. However, Constraint Programming (CP), particularly with Lazy Clause Genera- tion (LCG), has been found to be faster than MIP for some scheduling problems with time-varying action costs. In this paper, we...... compare CP and LCG against a solve-and-improve approach for two recently introduced problems in maritime logistics with time-varying action costs: the Liner Shipping Fleet Repositioning Problem (LSFRP) and the Bulk Port Cargo Throughput Optimisation Problem (BPCTOP). We present a novel CP model...... for the LSFRP, which is faster than all previous methods and outperforms a simplified automated planning model without time-varying costs. We show that a LCG solver is faster for solving the BPCTOP than a standard finite domain CP solver with a simplified model. We find that CP and LCG are effective methods...

  7. Towards the Engineering of Dependable P2P-Based Network Control — The Case of Timely Routing Control Messages

    Science.gov (United States)

    Tutschku, Kurt; Nakao, Akihiro

    This paper introduces a methodology for engineering best-effort P2P algorithms into dependable P2P-based network control mechanism. The proposed method is built upon an iterative approach consisting of improving the original P2P algorithm by appropriate mechanisms and of thorough performance assessment with respect to dependability measures. The potential of the methodology is outlined by the example of timely routing control for vertical handover in B3G wireless networks. In detail, the well-known Pastry and CAN algorithms are enhanced to include locality. By showing how to combine algorithmic enhancements with performance indicators, this case study paves the way for future engineering of dependable network control mechanisms through P2P algorithms.

  8. Time-optimum packet scheduling for many-to-one routing in wireless sensor networks

    Science.gov (United States)

    Song, W.-Z.; Yuan, F.; LaHusen, R.; Shirazi, B.

    2007-01-01

    This paper studies the wireless sensor networks (WSN) application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs [image omitted], N(u0)-1) time slots, assuming each node reports one unit of data in each round. Here [image omitted] is the total number of sensors, while [image omitted] denotes the number of sensors in a sink's largest branch subtree. With a few adjustments, we then show that our algorithm also achieves time-optimum scheduling in heterogeneous scenarios, where each sensor reports a heterogeneous amount of data in each round. Then we give a distributed implementation to let each node calculate its duty-cycle locally and maximize efficiency globally. In this packet-scheduling algorithm, each node goes to sleep whenever it is not transceiving, so that the energy waste of idle listening is also mitigated. Finally, simulations are conducted to evaluate network performance using the Qualnet simulator. Among other contributions, our study also identifies the maximum reporting frequency that a deployed sensor network can handle.

  9. Telling time from analog and digital clocks: A multiple-route account

    NARCIS (Netherlands)

    Korvorst, M.H.W.; Roelofs, A.P.A.; Levelt, W.J.M.

    2007-01-01

    Does the naming of clocks always require conceptual preparation? To examine this question, speakers were presented with analog and digital clocks that had to be named in Dutch using either a relative (e.g., "quarter to four") or an absolute (e.g., "three forty-five") clock time expression format.

  10. Constrained consequence

    CSIR Research Space (South Africa)

    Britz, K

    2011-09-01

    Full Text Available their basic properties and relationship. In Section 3 we present a modal instance of these constructions which also illustrates with an example how to reason abductively with constrained entailment in a causal or action oriented context. In Section 4 we... of models with the former approach, whereas in Section 3.3 we give an example illustrating ways in which C can be de ned with both. Here we employ the following versions of local consequence: De nition 3.4. Given a model M = hW;R;Vi and formulas...

  11. Finite-time convergent recurrent neural network with a hard-limiting activation function for constrained optimization with piecewise-linear objective functions.

    Science.gov (United States)

    Liu, Qingshan; Wang, Jun

    2011-04-01

    This paper presents a one-layer recurrent neural network for solving a class of constrained nonsmooth optimization problems with piecewise-linear objective functions. The proposed neural network is guaranteed to be globally convergent in finite time to the optimal solutions under a mild condition on a derived lower bound of a single gain parameter in the model. The number of neurons in the neural network is the same as the number of decision variables of the optimization problem. Compared with existing neural networks for optimization, the proposed neural network has a couple of salient features such as finite-time convergence and a low model complexity. Specific models for two important special cases, namely, linear programming and nonsmooth optimization, are also presented. In addition, applications to the shortest path problem and constrained least absolute deviation problem are discussed with simulation results to demonstrate the effectiveness and characteristics of the proposed neural network.

  12. Discrete events simulation of a route with traffic lights through automated control in real time

    Directory of Open Access Journals (Sweden)

    Rodrigo César Teixeira Baptista

    2013-03-01

    Full Text Available This paper presents the integration and communication in real-time of a discrete event simulation model with an automatic control system. The simulation model of an intersection with roads having traffic lights was built in the Arena environment. The integration and communication have been made via network, and the control system was operated by a programmable logic controller. Scenarios were simulated for the free, regular and congested traffic situations. The results showed the average number of vehicles that entered in the system and that were retained and also the total average time of the crossing of the vehicles on the road. In general, the model allowed evaluating the behavior of the traffic in each of the ways and the commands from the controller to activation and deactivation of the traffic lights.

  13. An Efficient Genetic Algorithm for Routing Multiple UAVs under Flight Range and Service Time Window Constraints

    OpenAIRE

    KARAKAYA, Murat; SEVİNÇ, Ender

    2017-01-01

    Recently using Unmanned Aerial Vehicles (UAVs) either for military or civilian purposes is getting popularity. However, UAVs have their own limitations which require adopted approaches to satisfy the Quality of Service (QoS) promised by the applications depending on effective use of UAVs. One of the important limitations of the UAVs encounter is the flight range. Most of the time, UAVs have very scarce energy resources and, thus, they have relatively short flight ranges. Besides, for the appl...

  14. A granular tabu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows

    Directory of Open Access Journals (Sweden)

    Jose Bernal

    2017-10-01

    Full Text Available Purpose: We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase, a granular tabu search is applied during the improvement phase (second phase. Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.

  15. Miniaturized pulsed laser source for time-domain diffuse optics routes to wearable devices.

    Science.gov (United States)

    Di Sieno, Laura; Nissinen, Jan; Hallman, Lauri; Martinenghi, Edoardo; Contini, Davide; Pifferi, Antonio; Kostamovaara, Juha; Mora, Alberto Dalla

    2017-08-01

    We validate a miniaturized pulsed laser source for use in time-domain (TD) diffuse optics, following rigorous and shared protocols for performance assessment of this class of devices. This compact source (12×6  mm2) has been previously developed for range finding applications and is able to provide short, high energy (∼100  ps, ∼0.5  nJ) optical pulses at up to 1 MHz repetition rate. Here, we start with a basic level laser characterization with an analysis of suitability of this laser for the diffuse optics application. Then, we present a TD optical system using this source and its performances in both recovering optical properties of tissue-mimicking homogeneous phantoms and in detecting localized absorption perturbations. Finally, as a proof of concept of in vivo application, we demonstrate that the system is able to detect hemodynamic changes occurring in the arm of healthy volunteers during a venous occlusion. Squeezing the laser source in a small footprint removes a key technological bottleneck that has hampered so far the realization of a miniaturized TD diffuse optics system, able to compete with already assessed continuous-wave devices in terms of size and cost, but with wider performance potentialities, as demonstrated by research over the last two decades. (2017) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE).

  16. Applications of a saving method with max-min ant system to a vehicle routing problem with time windows and speed limits

    Directory of Open Access Journals (Sweden)

    Suphan Sodsoon

    2014-06-01

    Full Text Available This study aims to solve a Vehicle Routing Problem with Time Windows and Speed Limits (VRPTWSL, which has received considerable attention in recent years. The vehicle routing problem with time windows is an extension of the well-known Vehicle Routing Problem (VRP and involves a fleet of vehicles set of from a depot to serve a number of customers at different geographic locations with various demands within specific time and speed limits before returning to the depot eventually. To solve the problem, an efficient Saving Method-Max Min Ant System (Saving-MMAS with Local Search algorithm is applied. Using minimization of the total transportation costs as the objective of the extension VRPTWSL, a mathematic model is constructed. Finally, the Saving-MMAS algorithms indicated the good quality of the method in this problem.

  17. Fully digital routing logic for single-photon avalanche diode arrays in highly efficient time-resolved imaging

    Science.gov (United States)

    Cominelli, Alessandro; Acconcia, Giulia; Ghioni, Massimo; Rech, Ivan

    2018-03-01

    Time-correlated single-photon counting (TCSPC) is a powerful optical technique, which permits recording fast luminous signals with picosecond precision. Unfortunately, given its repetitive nature, TCSPC is recognized as a relatively slow technique, especially when a large time-resolved image has to be recorded. In recent years, there has been a fast trend toward the development of TCPSC imagers. Unfortunately, present systems still suffer from a trade-off between number of channels and performance. Even worse, the overall measurement speed is still limited well below the saturation of the transfer bandwidth toward the external processor. We present a routing algorithm that enables a smart connection between a 32×32 detector array and five shared high-performance converters able to provide an overall conversion rate up to 10 Gbit/s. The proposed solution exploits a fully digital logic circuit distributed in a tree structure to limit the number and length of interconnections, which is a major issue in densely integrated circuits. The behavior of the logic has been validated by means of a field-programmable gate array, while a fully integrated prototype has been designed in 180-nm technology and analyzed by means of postlayout simulations.

  18. High-efficiency dynamic routing architecture for the readout of single photon avalanche diode arrays in time-correlated measurements

    Science.gov (United States)

    Cominelli, A.; Acconcia, G.; Peronio, P.; Rech, I.; Ghioni, M.

    2017-05-01

    In recent years, the Time-Correlated Single Photon Counting (TCSPC) technique has gained a prominent role in many fields, where the analysis of extremely fast and faint luminous signals is required. In the life science, for instance, the estimation of fluorescence time-constants with picosecond accuracy has been leading to a deeper insight into many biological processes. Although the many advantages provided by TCSPC-based techniques, their intrinsically repetitive nature leads to a relatively long acquisition time, especially when time-resolved images are obtained by means of a single detector, along with a scanning point system. In the last decade, TCSPC acquisition systems have been subjected to a fast trend towards the parallelization of many independent channels, in order to speed up the measure. On one hand, some high-performance multi-module systems have been already made commercially available, but high area and power consumption of each module have limited the number of channels to only some units. On the other hand, many compact systems based on Single Photon Avalanche Diodes (SPAD) have been proposed in literature, featuring thousands of independent acquisition chains on a single chip. The integration of both detectors and conversion electronic in the same pixel area, though, has imposed tight constraints on power dissipation and area occupation of the electronics, resulting in a tradeoff with performance, both in terms of differential nonlinearity and timing jitter. Furthermore, in the ideal case of simultaneous readout of a huge number of channels, the overall data rate can be as high as 100 Gbit/s, which is nowadays too high to be easily processed in real time by a PC. Typical adopted solutions involve an arbitrary dwell time, followed by a sequential readout of the converters, thus limiting the maximum operating frequency of each channel and impairing the measurement speed, which still lies well below the limit imposed by the saturation of the

  19. A stochastic time-dependent green capacitated vehicle routing and scheduling problem with time window, resiliency and reliability: a case study

    Directory of Open Access Journals (Sweden)

    Masoud Rabbani

    2018-09-01

    Full Text Available This paper presents a new multi-objective model for a vehicle routing problem under a stochastic uncertainty. It considers traffic point as an inflection point to deal with the arrival time of vehicles. It aims to minimize the total transportation cost, traffic pollution, customer dissatisfaction and maximizes the reliability of vehicles. Moreover, resiliency factors are included in the model to increase the flexibility of the system and decrease the possible losses that may impose on the system. Due to the NP-hardness of the presented model, a meta-heuristic algorithm, namely Simulated Annealing (SA is developed. Furthermore, a number of sensitivity analyses are provided to validate the effectiveness of the proposed model. Lastly, the foregoing meta-heuristic is compared with GAMS, in which the computational results demonstrate an acceptable performance of the proposed SA.

  20. Multi-Sensor Constrained Time Varying Emissions Estimation of Black Carbon: Attributing Urban and Fire Sources Globally

    Science.gov (United States)

    Cohen, J. B.

    2015-12-01

    The short lifetime and heterogeneous distribution of Black Carbon (BC) in the atmosphere leads to complex impacts on radiative forcing, climate, and health, and complicates analysis of its atmospheric processing and emissions. Two recent papers have estimated the global and regional emissions of BC using advanced statistical and computational methods. One used a Kalman Filter, including data from AERONET, NOAA, and other ground-based sources, to estimate global emissions of 17.8+/-5.6 Tg BC/year (with the increase attributable to East Asia, South Asia, Southeast Asia, and Eastern Europe - all regions which have had rapid urban, industrial, and economic expansion). The second additionally used remotely sensed measurements from MISR and a variance maximizing technique, uniquely quantifying fire and urban sources in Southeast Asia, as well as their large year-to-year variability over the past 12 years, leading to increases from 10% to 150%. These new emissions products, when run through our state-of-the art modelling system of chemistry, physics, transport, removal, radiation, and climate, match 140 ground stations and satellites better in both an absolute and a temporal sense. New work now further includes trace species measurements from OMI, which are used with the variance maximizing technique to constrain the types of emissions sources. Furthermore, land-use change and fire estimation products from MODIS are also included, which provide other constraints on the temporal and spatial nature of the variations of intermittent sources like fires or new permanent sources like expanded urbanization. This talk will introduce a new, top-down constrained, weekly varying BC emissions dataset, show that it produces a better fit with observations, and draw conclusions about the sources and impacts from urbanization one hand, and fires on another hand. Results specific to the Southeast and East Asia will demonstrate inter- and intra-annual variations, such as the function of

  1. Constrained quadratic stabilization of discrete-time uncertain nonlinear multi-model systems using piecewise affine state-feedback

    Directory of Open Access Journals (Sweden)

    Olav Slupphaug

    1999-07-01

    Full Text Available In this paper a method for nonlinear robust stabilization based on solving a bilinear matrix inequality (BMI feasibility problem is developed. Robustness against model uncertainty is handled. In different non-overlapping regions of the state-space called clusters the plant is assumed to be an element in a polytope which vertices (local models are affine systems. In the clusters containing the origin in their closure, the local models are restricted to be linear systems. The clusters cover the region of interest in the state-space. An affine state-feedback is associated with each cluster. By utilizing the affinity of the local models and the state-feedback, a set of linear matrix inequalities (LMIs combined with a single nonconvex BMI are obtained which, if feasible, guarantee quadratic stability of the origin of the closed-loop. The feasibility problem is attacked by a branch-and-bound based global approach. If the feasibility check is successful, the Liapunov matrix and the piecewise affine state-feedback are given directly by the feasible solution. Control constraints are shown to be representable by LMIs or BMIs, and an application of the control design method to robustify constrained nonlinear model predictive control is presented. Also, the control design method is applied to a simple example.

  2. Two phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction

    Science.gov (United States)

    Baniamerian, Ali; Bashiri, Mahdi; Zabihi, Fahime

    2018-03-01

    Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfaction. In this paper, we introduce a vehicle routing and scheduling problem with cross-docking and time windows in a three-echelon supply chain that considers customer satisfaction. A set of homogeneous vehicles collect products from suppliers and after consolidation process in the cross-dock, immediately deliver them to customers. A mixed integer linear programming model is presented for this problem to minimize transportation cost and early/tardy deliveries with scheduling of inbound and outbound vehicles to increase customer satisfaction. A two phase genetic algorithm (GA) is developed for the problem. For investigating the performance of the algorithm, it was compared with exact and lower bound solutions in small and large-size instances, respectively. Results show that there are at least 86.6% customer satisfaction by the proposed method, whereas customer satisfaction in the classical model is at most 33.3%. Numerical examples results show that the proposed two phase algorithm could achieve optimal solutions in small-size instances. Also in large-size instances, the proposed two phase algorithm could achieve better solutions with less gap from the lower bound in less computational time in comparison with the classic GA.

  3. Robust LS-SVM-based adaptive constrained control for a class of uncertain nonlinear systems with time-varying predefined performance

    Science.gov (United States)

    Luo, Jianjun; Wei, Caisheng; Dai, Honghua; Yuan, Jianping

    2018-03-01

    This paper focuses on robust adaptive control for a class of uncertain nonlinear systems subject to input saturation and external disturbance with guaranteed predefined tracking performance. To reduce the limitations of classical predefined performance control method in the presence of unknown initial tracking errors, a novel predefined performance function with time-varying design parameters is first proposed. Then, aiming at reducing the complexity of nonlinear approximations, only two least-square-support-vector-machine-based (LS-SVM-based) approximators with two design parameters are required through norm form transformation of the original system. Further, a novel LS-SVM-based adaptive constrained control scheme is developed under the time-vary predefined performance using backstepping technique. Wherein, to avoid the tedious analysis and repeated differentiations of virtual control laws in the backstepping technique, a simple and robust finite-time-convergent differentiator is devised to only extract its first-order derivative at each step in the presence of external disturbance. In this sense, the inherent demerit of backstepping technique-;explosion of terms; brought by the recursive virtual controller design is conquered. Moreover, an auxiliary system is designed to compensate the control saturation. Finally, three groups of numerical simulations are employed to validate the effectiveness of the newly developed differentiator and the proposed adaptive constrained control scheme.

  4. Port Authority of Allegheny County Transit Routes

    Data.gov (United States)

    Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Shapefile of Transit Routes - Please refer to each resource for active dates of the route information. Routes change over time,

  5. Proxies for Anonymous Routing

    National Research Council Canada - National Science Library

    Reed, Michael G; Syverson, Paul F; Goldschlag, David M

    1996-01-01

    ...), and file transfers (FTP) have been implemented. Onion routing provides application independent, real-time, and bi-directional anonymous connections that are resistant to both eavesdropping and traffic analysis...

  6. The time constrained multi-commodity network flow problem and its application to liner shipping network design

    DEFF Research Database (Denmark)

    Karsten, Christian Vad; Pisinger, David; Røpke, Stefan

    2015-01-01

    -commodity network flow problem with transit time constraints which puts limits on the duration of the transit of the commodities through the network. It is shown that for the particular application it does not increase the solution time to include the transit time constraints and that including the transit time...... is essential to offer customers a competitive product. © 2015 Elsevier Ltd. All rights reserved....

  7. A massively parallel algorithm for the solution of constrained equations of motion with applications to large-scale, long-time molecular dynamics simulations

    Energy Technology Data Exchange (ETDEWEB)

    Fijany, A. [Jet Propulsion Lab., Pasadena, CA (United States); Coley, T.R. [Virtual Chemistry, Inc., San Diego, CA (United States); Cagin, T.; Goddard, W.A. III [California Institute of Technology, Pasadena, CA (United States)

    1997-12-31

    Successful molecular dynamics (MD) simulation of large systems (> million atoms) for long times (> nanoseconds) requires the integration of constrained equations of motion (CEOM). Constraints are used to eliminate high frequency degrees of freedom (DOF) and to allow the use of rigid bodies. Solving the CEOM allows for larger integration time-steps and helps focus the simulation on the important collective dynamics of chemical, biological, and materials systems. We explore advances in multibody dynamics which have resulted in O(N) algorithms for propagating the CEOM. However, because of their strictly sequential nature, the computational time required by these algorithms does not scale down with increased numbers of processors. We then present the new constraint force algorithm for solving the CEOM and show that this algorithm is fully parallelizable, leading to a computational cost of O(N/P+IogP) for N DOF on P processors.

  8. Integration of real-time mapping technology in disaster relief distribution.

    Science.gov (United States)

    2013-02-01

    Vehicle routing for disaster relief distribution involves many challenges that distinguish this problem from those in commercial settings, given the time sensitive and resource constrained nature of relief activities. While operations research approa...

  9. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    couple of decades. To deliver competitive service and price, transportation today needs to be cost effective. A company requiring for things to be shipped will aim at having the freight shipped as cheaply as possible while often satisfying certain time constraints. For the transportation company......, the effectiveness of the network is of importance aiming at satisfying as many costumer demands as possible at a low cost. Routing represent a path between locations such as an origin and destination for the object routed. Sometimes routing has a time dimension as well as the physical paths. This may...... set cost making the cost of the individual vehicle routes inter-dependant. Depending on the problem type, the size of the problems and time available for solving, different solution methods can be applicable. In this thesis both heuristic methods and several exact methods are investigated depending...

  10. A new approach to motion control of torque-constrained manipulators by using time-scaling of reference trajectories

    Energy Technology Data Exchange (ETDEWEB)

    Moreno-Valenzuela, Javier; Orozco-Manriquez, Ernesto [Digital del IPN, CITEDI-IPN, Tijuana, (Mexico)

    2009-12-15

    We introduce a control scheme based on using a trajectory tracking controller and an algorithm for on-line time scaling of the reference trajectories. The reference trajectories are time-scaled according to the measured tracking errors and the detected torque/acceleration saturation. Experiments are presented to illustrate the advantages of the proposed approach

  11. A new approach to motion control of torque-constrained manipulators by using time-scaling of reference trajectories

    International Nuclear Information System (INIS)

    Moreno-Valenzuela, Javier; Orozco-Manriquez, Ernesto

    2009-01-01

    We introduce a control scheme based on using a trajectory tracking controller and an algorithm for on-line time scaling of the reference trajectories. The reference trajectories are time-scaled according to the measured tracking errors and the detected torque/acceleration saturation. Experiments are presented to illustrate the advantages of the proposed approach

  12. Robust self-triggered model predictive control for constrained discrete-time LTI systems based on homothetic tubes

    NARCIS (Netherlands)

    Aydiner, E.; Brunner, F.D.; Heemels, W.P.M.H.; Allgower, F.

    2015-01-01

    In this paper we present a robust self-triggered model predictive control (MPC) scheme for discrete-time linear time-invariant systems subject to input and state constraints and additive disturbances. In self-triggered model predictive control, at every sampling instant an optimization problem based

  13. An Adaptive Large Neighborhood Search-based Three-Stage Matheuristic for the Vehicle Routing Problem with Time Windows

    DEFF Research Database (Denmark)

    Christensen, Jonas Mark; Røpke, Stefan

    that serves all the customers. The second stage usesan Adaptive Large Neighborhood Search (ALNS) algorithm to minimise the travel distance, during the second phase all of the generated routes are considered by solving a set cover problem. The ALNS algorithm uses 4 destroy operators, 2 repair operators...

  14. SHARP - III. First use of adaptive-optics imaging to constrain cosmology with gravitational lens time delays

    NARCIS (Netherlands)

    Chen, Geoff C. -F; Suyu, Sherry H.; Wong, Kenneth C.; Fassnacht, Christopher D.; Chiueh, Tzihong; Halkola, Aleksi; Hu, I. Shing; Auger, Matthew W.; Koopmans, Léon V. E.; Lagattuta, David J.; McKean, John P.; Vegetti, Simona

    2016-01-01

    Accurate and precise measurements of the Hubble constant are critical for testing our current standard cosmological model and revealing possibly new physics. With Hubble Space Telescope (HST) imaging, each strong gravitational lens system with measured time delays can allow one to determine the

  15. Design Optimization of Time- and Cost-Constrained Fault-Tolerant Embedded Systems with Checkpointing and Replication

    DEFF Research Database (Denmark)

    Pop, Paul; Izosimov, Viacheslav; Eles, Petru

    2009-01-01

    We present an approach to the synthesis of fault-tolerant hard real-time systems for safety-critical applications. We use checkpointing with rollback recovery and active replication for tolerating transient faults. Processes and communications are statically scheduled. Our synthesis approach deci...

  16. A global cyclostratigraphic framework constrains the timing and pacing of environmental changes over the Late Devonian (Frasnian - Famennian) mass extinction

    Science.gov (United States)

    De Vleeschouwer, David; Da Silva, Anne-Christine; Day, James E.; Whalen, Michael; Claeys, Philippe

    2016-04-01

    Milankovitch cycles (obliquity, eccentricity and precession) result in changes in the distribution of solar energy over seasons, as well as over latitudes, on time scales of ten thousands of years to millions of years. These changing patterns in insolation have induced significant variations in Earth's past climate over the last 4.5 billion years. Cyclostratigraphy and astrochronology utilize the geologic imprint of such quasi-cyclic climatic variations to measure geologic time. In recent years, major improvements of the Geologic Time Scale have been proposed through the application of cyclostratigraphy, mostly for the Mesozoic and Cenozoic (Gradstein et al., 2012). However, the field of Paleozoic cyclostratigraphy and astrochronology is still in its infancy and the application of cyclostratigraphic techniques in the Paleozoic allows for a whole new range of research questions. For example, unraveling the timing and pacing of environmental changes over the Late Devonian mass extinction on a 105-year time-scale concerns such a novel research question. Here, we present a global cyclostratigraphic framework for late Frasnian to early Famennian climatic and environmental change, through the integration of globally distributed sections. The backbone of this relative time scale consists of previously published cyclostratigraphies for western Canada and Poland (De Vleeschouwer et al., 2012; De Vleeschouwer et al., 2013). We elaborate this Euramerican base by integrating new proxy data -interpreted in terms of astronomical climate forcing- from the Iowa basin (USA, magnetic susceptibility and carbon isotope data) and Belgium (XRF and carbon isotope data). Next, we expand this well-established cyclostratigraphic framework towards the Paleo-Tethys Ocean, using magnetic susceptibility and carbon isotope records from the Fuhe section in South China (Whalen et al., 2015). The resulting global cyclostratigraphic framework implies an important refinement of the late Frasnian to

  17. Finite-time sliding surface constrained control for a robot manipulator with an unknown deadzone and disturbance.

    Science.gov (United States)

    Ik Han, Seong; Lee, Jangmyung

    2016-11-01

    This paper presents finite-time sliding mode control (FSMC) with predefined constraints for the tracking error and sliding surface in order to obtain robust positioning of a robot manipulator with input nonlinearity due to an unknown deadzone and external disturbance. An assumed model feedforward FSMC was designed to avoid tedious identification procedures for the manipulator parameters and to obtain a fast response time. Two constraint switching control functions based on the tracking error and finite-time sliding surface were added to the FSMC to guarantee the predefined tracking performance despite the presence of an unknown deadzone and disturbance. The tracking error due to the deadzone and disturbance can be suppressed within the predefined error boundary simply by tuning the gain value of the constraint switching function and without the addition of an extra compensator. Therefore, the designed constraint controller has a simpler structure than conventional transformed error constraint methods and the sliding surface constraint scheme can also indirectly guarantee the tracking error constraint while being more stable than the tracking error constraint control. A simulation and experiment were performed on an articulated robot manipulator to validate the proposed control schemes. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

  18. LITERATURE SURVEY ON EXISTING POWER SAVING ROUTING METHODS AND TECHNIQUES FOR INCREASING NETWORK LIFE TIME IN MANET

    Directory of Open Access Journals (Sweden)

    K Mariyappan

    2017-06-01

    Full Text Available Mobile ad hoc network (MANET is a special type of wireless network in which a collection of wireless mobile devices (called also nodes dynamically forming a temporary network without the need of any pre-existing network infrastructure or centralized administration. Currently, Mobile ad hoc networks (MANETs play a significant role in university campus, advertisement, emergency response, disaster recovery, military use in battle fields, disaster management scenarios, in sensor network, and so on. However, wireless network devices, especially in ad hoc networks, are typically battery-powered. Thus, energy efficiency is a critical issue for battery-powered mobile devices in ad hoc networks. This is due to the fact that failure of node or link allows re-routing and establishing a new path from source to destination which creates extra energy consumption of nodes and sparse network connectivity, leading to a more likelihood occurrences of network partition. Routing based on energy related parameters is one of the important solutions to extend the lifetime of the node and reduce energy consumption of the network. In this paper detail literature survey on existing energy efficient routing method are studied and compared for their performance under different condition. The result has shown that both the broadcast schemes and energy aware metrics have great potential in overcoming the broadcast storm problem associated with flooding. However, the performances of these approaches rely on either the appropriate selection of the broadcast decision parameter or an energy efficient path. In the earlier proposed broadcast methods, the forwarding probability is selected based on fixed probability or number of neighbors regardless of nodes battery capacity whereas in energy aware schemes energy inefficient node could be part of an established path. Therefore, in an attempt to remedy the paucity of research and to address the gaps identified in this area, a study

  19. An Adaptive Tabu Search Heuristic for the Location Routing Pickup and Delivery Problem with Time Windows with a Theater Distribution Application

    National Research Council Canada - National Science Library

    Burks, Jr, Robert E

    2006-01-01

    .... The location routing problem (LRP) is an extension of the vehicle routing problem where the solution identifies the optimal location of the depots and provides the vehicle schedules and distribution routes...

  20. An Airlift Hub-and-Spoke Location-Routing Model with Time Windows: Case Study of the CONUS-to-Korea Airlift Problem

    Science.gov (United States)

    1998-03-01

    a point of embarkation to a point of debarkation. This study develops an alternative hub-and-spoke combined location-routing integer linear...programming prototype model, and uses this model to determine what advantages a hub-and-spoke system offers, and in which scenarios it is better-suited than the...extension on the following works: the hierarchical model of Perl and Daskin (1983), time windows features of Chan (1991), combining subtour-breaking and range

  1. Long-term changes in migration timing of Song Thrush Turdus philomelos at the southern Baltic coast in response to temperatures on route and at breeding grounds.

    Science.gov (United States)

    Redlisiak, Michał; Remisiewicz, Magdalena; Nowakowski, Jarosław K

    2018-05-26

    Climate warming causes the advancement of spring arrival of many migrant birds breeding in Europe, but the effects on their autumn migration are less known. We aimed to determine any changes in the timing of Song Thrush captured during spring and autumn migrations at the Polish Baltic coast from 1975 to 2014, and if these were related to long-term changes of temperature at their breeding grounds and migration routes. The timing of spring migration at Hel ringing station in 1975-2014 did not show long-term advance, but they had responded to environmental conditions on the year-to-year basis. The warmer the temperatures were in April on their migration route, the earlier were the dates of the median and the end of spring migration at Hel. The beginning of autumn migration at the Mierzeja Wiślana ringing station advanced by 5 days between 1975 and 2014. The warmer the April on route, and the July at the Song Thrushes' breeding grounds, the earlier young birds began autumn migration across the Baltic coast. We suggest this was a combined effect of adults' migration and breeding early during warm springs and young birds getting ready faster for autumn migration during warm summers. The average time span of 90% of the autumn migration was extended by 5 days, probably because of early migration of young birds from first broods and late of those from second broods enabled by warm springs and summers. The response of Song Thrushes' migration timing to temperatures on route and at the breeding grounds indicated high plasticity in the species and suggested it might adapt well to climate changes.

  2. Exploiting Redundancy and Application Scalability for Cost-Effective, Time-Constrained Execution of HPC Applications on Amazon EC2

    International Nuclear Information System (INIS)

    Marathe, Aniruddha P.; Harris, Rachel A.; Lowenthal, David K.; Supinski, Bronis R. de; Rountree, Barry L.; Schulz, Martin

    2015-01-01

    The use of clouds to execute high-performance computing (HPC) applications has greatly increased recently. Clouds provide several potential advantages over traditional supercomputers and in-house clusters. The most popular cloud is currently Amazon EC2, which provides fixed-cost and variable-cost, auction-based options. The auction market trades lower cost for potential interruptions that necessitate checkpointing; if the market price exceeds the bid price, a node is taken away from the user without warning. We explore techniques to maximize performance per dollar given a time constraint within which an application must complete. Specifically, we design and implement multiple techniques to reduce expected cost by exploiting redundancy in the EC2 auction market. We then design an adaptive algorithm that selects a scheduling algorithm and determines the bid price. We show that our adaptive algorithm executes programs up to seven times cheaper than using the on-demand market and up to 44 percent cheaper than the best non-redundant, auction-market algorithm. We extend our adaptive algorithm to incorporate application scalability characteristics for further cost savings. In conclusion, we show that the adaptive algorithm informed with scalability characteristics of applications achieves up to 56 percent cost savings compared to the expected cost for the base adaptive algorithm run at a fixed, user-defined scale.

  3. Feasible Initial Population with Genetic Diversity for a Population-Based Algorithm Applied to the Vehicle Routing Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Marco Antonio Cruz-Chávez

    2016-01-01

    Full Text Available A stochastic algorithm for obtaining feasible initial populations to the Vehicle Routing Problem with Time Windows is presented. The theoretical formulation for the Vehicle Routing Problem with Time Windows is explained. The proposed method is primarily divided into a clustering algorithm and a two-phase algorithm. The first step is the application of a modified k-means clustering algorithm which is proposed in this paper. The two-phase algorithm evaluates a partial solution to transform it into a feasible individual. The two-phase algorithm consists of a hybridization of four kinds of insertions which interact randomly to obtain feasible individuals. It has been proven that different kinds of insertions impact the diversity among individuals in initial populations, which is crucial for population-based algorithm behavior. A modification to the Hamming distance method is applied to the populations generated for the Vehicle Routing Problem with Time Windows to evaluate their diversity. Experimental tests were performed based on the Solomon benchmarking. Experimental results show that the proposed method facilitates generation of highly diverse populations, which vary according to the type and distribution of the instances.

  4. Timing and structure of the penultimate deglaciation in north China constrained by a precisely dated stalagmite record

    Science.gov (United States)

    Duan, W.; Cheng, H.; Tan, M.; Li, X.; Edwards, R. L.

    2017-12-01

    The timing and structure of the penultimate deglaciation (Termination II, T-II) is still controversial due to the lack of precise-date and high-resolution paleoclimate documents. This study firstly presents high-precision stalagmite δ18O data encompassing T-II from north China, near the northern limit of the East Asian summer monsoon (EASM), an area sensitive to climate change. An obvious 2200-year long 18O-depleted excursion was identified within T-II, 1500 years later than in south China, mostly indicating it's a hitherto unidentified interstadial event, but the possibility of a local signal linked to karst hydrologic changes cannot be excluded. The sharpest T-II transition occurred at 129.20 ka BP (BP=before AD 1950), consistent with other EASM records but 3000 years later than mid-high-latitudinal cave records in Europe and North America. The different ages between them are attributed to that the original ice sheet melting during T-II did not inhibit the overturning in the Nordic Seas, leaving the heat transport to western Europe unaffected. Furthermore, the rise in EASM after the main T-II transition was interrupted by a significant "pause" in our record, whereas only expressed as a "slowdown" in south Chinese caves, further confirming the higher sensitivity of climate in north China. Compared with the last deglaciation (T-I), this climate pause could be considered as a Younger Dryas (YD)-type event that was shifted into the early stage of the last interglacial period, though its intensity and duration were not as strong as the YD during T-I. Key words: North China stalagmite record Timing and structure Termination II

  5. Class network routing

    Science.gov (United States)

    Bhanot, Gyan [Princeton, NJ; Blumrich, Matthias A [Ridgefield, CT; Chen, Dong [Croton On Hudson, NY; Coteus, Paul W [Yorktown Heights, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Steinmacher-Burow, Burkhard D [Mount Kisco, NY; Takken, Todd E [Mount Kisco, NY; Vranas, Pavlos M [Bedford Hills, NY

    2009-09-08

    Class network routing is implemented in a network such as a computer network comprising a plurality of parallel compute processors at nodes thereof. Class network routing allows a compute processor to broadcast a message to a range (one or more) of other compute processors in the computer network, such as processors in a column or a row. Normally this type of operation requires a separate message to be sent to each processor. With class network routing pursuant to the invention, a single message is sufficient, which generally reduces the total number of messages in the network as well as the latency to do a broadcast. Class network routing is also applied to dense matrix inversion algorithms on distributed memory parallel supercomputers with hardware class function (multicast) capability. This is achieved by exploiting the fact that the communication patterns of dense matrix inversion can be served by hardware class functions, which results in faster execution times.

  6. Effect of time-varying tropospheric models on near-regional and regional infrasound propagation as constrained by observational data

    Science.gov (United States)

    McKenna, Mihan H.; Stump, Brian W.; Hayward, Chris

    2008-06-01

    The Chulwon Seismo-Acoustic Array (CHNAR) is a regional seismo-acoustic array with co-located seismometers and infrasound microphones on the Korean peninsula. Data from forty-two days over the course of a year between October 1999 and August 2000 were analyzed; 2052 infrasound-only arrivals and 23 seismo-acoustic arrivals were observed over the six week study period. A majority of the signals occur during local working hours, hour 0 to hour 9 UT and appear to be the result of cultural activity located within a 250 km radius. Atmospheric modeling is presented for four sample days during the study period, one in each of November, February, April, and August. Local meteorological data sampled at six hour intervals is needed to accurately model the observed arrivals and this data produced highly temporally variable thermal ducts that propagated infrasound signals within 250 km, matching the temporal variation in the observed arrivals. These ducts change dramatically on the order of hours, and meteorological data from the appropriate sampled time frame was necessary to interpret the observed arrivals.

  7. Perception bias in route choice

    NARCIS (Netherlands)

    Vreeswijk, Jacob Dirk; Thomas, Tom; van Berkum, Eric C.; van Arem, Bart

    2014-01-01

    Travel time is probably one of the most studied attributes in route choice. Recently, perception of travel time received more attention as several studies have shown its importance in explaining route choice behavior. In particular, travel time estimates by travelers appear to be biased against

  8. Solving a bi-objective mathematical model for location-routing problem with time windows in multi-echelon reverse logistics using metaheuristic procedure

    Science.gov (United States)

    Ghezavati, V. R.; Beigi, M.

    2016-12-01

    During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among established facilities and existing demand points. In this paper, the location-routing problem with time window (LRPTW) and homogeneous fleet type and designing a multi-echelon, and capacitated reverse logistics network, are considered which may arise in many real-life situations in logistics management. Our proposed RL network consists of hybrid collection/inspection centers, recovery centers and disposal centers. Here, we present a new bi-objective mathematical programming (BOMP) for LRPTW in reverse logistic. Since this type of problem is NP-hard, the non-dominated sorting genetic algorithm II (NSGA-II) is proposed to obtain the Pareto frontier for the given problem. Several numerical examples are presented to illustrate the effectiveness of the proposed model and algorithm. Also, the present work is an effort to effectively implement the ɛ-constraint method in GAMS software for producing the Pareto-optimal solutions in a BOMP. The results of the proposed algorithm have been compared with the ɛ-constraint method. The computational results show that the ɛ-constraint method is able to solve small-size instances to optimality within reasonable computing times, and for medium-to-large-sized problems, the proposed NSGA-II works better than the ɛ-constraint.

  9. Personal continuous route pattern mining

    Institute of Scientific and Technical Information of China (English)

    Qian YE; Ling CHEN; Gen-cai CHEN

    2009-01-01

    In the daily life, people often repeat regular routes in certain periods. In this paper, a mining system is developed to find the continuous route patterns of personal past trips. In order to count the diversity of personal moving status, the mining system employs the adaptive GPS data recording and five data filters to guarantee the clean trips data. The mining system uses a client/server architecture to protect personal privacy and to reduce the computational load. The server conducts the main mining procedure but with insufficient information to recover real personal routes. In order to improve the scalability of sequential pattern mining, a novel pattern mining algorithm, continuous route pattern mining (CRPM), is proposed. This algorithm can tolerate the different disturbances in real routes and extract the frequent patterns. Experimental results based on nine persons' trips show that CRPM can extract more than two times longer route patterns than the traditional route pattern mining algorithms.

  10. Diversity in destinations, routes and timing of small adult and sub-adult striped bass Morone saxatilis on their southward autumn migration

    Science.gov (United States)

    Mather, Martha E.; Finn, John T.; Pautzke, Sarah M.; Fox, Dewayne A.; Savoy, Tom; Brundage, Harold M.; Deegan, Linda A.; Muth, Robert M.

    2010-01-01

    Almost three-quarters of the 46 young adult and sub-adult striped bass Morone saxatilis that were acoustically tagged in Plum Island Estuary, Massachusetts, U.S.A., in the summer of 2006 were detected in one or more southern coastal arrays during their autumn migration. On the basis of the trajectories along which these M. saxatilis moved from feeding to overwintering areas, three migratory groups emerged. After leaving Plum Island Estuary, about half of the fish were detected only in a mid-latitude array, Long Island Sound. The other half of the tagged fish were detected during autumn and winter in a more southern array, the Delaware Estuary. This latter group of fish may have used two routes. Some travelled to the Delaware Estuary through Long Island Sound while other fish may have taken a second, more direct, coastal route that did not include Long Island Sound. Consequently, a seemingly homogeneous group of fish tagged at the same time in the same non-natal feeding location exhibited a diversity of southward movement patterns that could affect population-level processes. These three groups that differed in overwintering location and migration route could be movement contingents with migratory connectivity.

  11. Paleomagnetism of Jurassic and Cretaceous rocks in central Patagonia: a key to constrain the timing of rotations during the breakup of southwestern Gondwana?

    Science.gov (United States)

    Geuna, Silvana E.; Somoza, Rubén; Vizán, Haroldo; Figari, Eduardo G.; Rinaldi, Carlos A.

    2000-08-01

    A paleomagnetic study in Jurassic and Cretaceous rocks from the Cañadón Asfalto basin, central Patagonia, indicates the occurrence of about 25-30° clockwise rotation in Upper Jurassic-lowermost Cretaceous rocks, whereas the overlying mid-Cretaceous rocks do not show evidence of rotation. This constrains the tectonic rotation to be related to a major regional unconformity in Patagonia, which in turn seems to be close in time with the early opening of the South Atlantic Ocean. The sense and probably the timing of this rotation are similar to those of other paleomagnetically detected rotations in different areas of southwestern Gondwana, suggesting a possible relationship between these and major tectonic processes related with fragmentation of the supercontinent. On the other hand, the mid-Cretaceous rocks in the region yield a paleopole located at Lat. 87° South, Long. 159° East, A95=3.8°. This pole position is consistent with coeval high-quality paleopoles of other plates when transferred to South American coordinates, implying it is an accurate determination of the Aptian (circa 116 Ma) geomagnetic field in South America.

  12. Optimizing well intervention routes

    Energy Technology Data Exchange (ETDEWEB)

    Paiva, Ronaldo O. [PETROBRAS S.A., Vitoria, ES (Brazil); Schiozer, Denis J.; Bordalo, Sergio N. [Universidade Estadual de Campinas, SP (Brazil). Faculdade de Engenharia Mecanica. Centro de Estudo do Petroleo (CEPETRO)]. E-mail: denis@dep.fem.unicamp.br; bordalo@dep.fem.unicamp.br

    2000-07-01

    This work presents a method for optimizing the itinerary of work over rigs, i.e., the search for the route of minimum total cost, and demonstrates the importance of the dynamics of reservoir behaviour. The total cost of a route includes the rig expenses (transport, assembly and operation), which are functions of time and distances, plus the losses of revenue in wells waiting for the rig, which are also dependent of time. A reservoir simulator is used to evaluate the monetary influence of the well shutdown on the present value of the production curve. Finally, search algorithms are employed to determine the route of minimal cost. The Simulated Annealing algorithm was also successful in optimizing the distribution of a list of wells among different work over rigs. The rational approach presented here is recommended for management teams as a standard procedure to define the priority of wells scheduled for work over. (author)

  13. Routing Service Quality—Local Driver Behavior Versus Routing Services

    DEFF Research Database (Denmark)

    Ceikute, Vaida; Jensen, Christian S.

    2013-01-01

    of the quality of one kind of location-based service, namely routing services. Specifically, the paper presents a framework that enables the comparison of the routes provided by routing services with the actual driving behaviors of local drivers. Comparisons include route length, travel time, and also route...... popularity, which are enabled by common driving behaviors found in available trajectory data. The ability to evaluate the quality of routing services enables service providers to improve the quality of their services and enables users to identify the services that best serve their needs. The paper covers......Mobile location-based services is a very successful class of services that are being used frequently by users with GPS-enabled mobile devices such as smartphones. This paper presents a study of how to exploit GPS trajectory data, which is available in increasing volumes, for the assessment...

  14. Routing Cooperating Vehicles to Perform Precedence-Linked Tasks

    National Research Council Canada - National Science Library

    Vakhutinsky, Andrew; Wu, Cynara

    2005-01-01

    The problem of scheduling cooperating vehicles is a generalization of the classical vehicle routing problem where certain tasks are linked by precedence constraints and vehicles have varying constrained resources...

  15. Value of travel-time reliability : commuters' route-choice behavior in the Twin Cities, phase 2.

    Science.gov (United States)

    2012-04-01

    Travel-time variability is a noteworthy factor in network performance. It measures the temporal uncertainty : experienced by users in their movement between any two nodes in a network. The importance : of the time variance depends on the penalties in...

  16. An algorithm for routing optimization in DiffServ-aware MPLS networks

    OpenAIRE

    Luigi Atzori; Fabio D'Andreagiovanni; Carlo Mannino; Tatiana Onali

    2010-01-01

    This paper addresses the constrained-based routing problem in DiffServaware MPLS networks. We consider a dynamic context in which new requests appear over time, asking for reconfigurations of the previous allocation. In the classical approach, a multi-phase heuristic procedure is adopted: the new requests are evaluated considering available bandwidth; if the bandwidth is not sufficient, preemption and rerouting of one or more connections are performed in sequence. As an alternative, we propos...

  17. Improvement In MAODV Protocol Using Location Based Routing Protocol

    Directory of Open Access Journals (Sweden)

    Kaur Sharnjeet

    2016-01-01

    Full Text Available Energy saving is difficult in wireless sensor network (WSN due to limited resources. Each node in WSN is constrained by their limited battery power for their energy. The energy is reduced as the time goes off due to the packet transmission and reception. Energy management techniques are necessary to minimize the total power consumption of all the nodes in the network in order to maximize its life span. Our proposed protocol Location based routing (LBR aimed to find a path which utilizes the minimum energy to transmit the packets between the source and the destination. The required energy for the transmission and reception of data is evaluated in MATLAB. LBR is implemented on Multicast Ad hoc On Demand Distance Vector Routing Protocol (MAODV to manage the energy consumption in the transmission and reception of data. Simulation results of LBR show the energy consumption has been reduced.

  18. Increasing the Intensity over Time of an Electric-Assist Bike Based on the User and Route: The Bike Becomes the Gym

    Directory of Open Access Journals (Sweden)

    Daniel H. De La Iglesia

    2018-01-01

    Full Text Available Nowadays, many citizens have busy days that make finding time for physical activity difficult. Thus, it is important to provide citizens with tools that allow them to introduce physical activity into their lives as part of the day’s routine. This article proposes an app for an electric pedal-assist-system (PAS bicycle that increases the pedaling intensity so the bicyclist can achieve higher and higher levels of physical activity. The app includes personalized assist levels that have been adapted to the user’s strength/ability and a profile of the route, segmented according to its slopes. Additionally, a social component motivates interaction and competition between users based on a scoring system that shows the level of their performances. To test the training module, a case study in three different European countries lasted four months and included nine people who traveled 551 routes. The electric PAS bicycle with the app that increases intensity of physical activity shows promise for increasing levels of physical activity as a regular part of the day.

  19. Infection routes of Aeromonas salmonicida in rainbow trout monitored in vivo by real-time bioluminescence imaging

    DEFF Research Database (Denmark)

    Bartkova, Simona; Kokotovic, Branko; Dalsgaard, Inger

    2017-01-01

    Recent development of imaging tools has facilitated studies of pathogen infections in vivo in real time. This trend can be exemplified by advances in bioluminescence imaging (BLI), an approach that helps to visualize dissemination of pathogens within the same animal over several time points. Here...

  20. Constraining the depth of the time-lapse changes of P- and S-wave velocities in the first year after the 2011 Tohoku earthquake, Japan

    Science.gov (United States)

    Sawazaki, K.; Kimura, H.; Uchida, N.; Takagi, R.; Snieder, R.

    2012-12-01

    Using deconvolutions of vertical array of KiK-net (nationwide strong-motion seismograph digital network in Japan) records and applying coda wave interferometry (CWI) to Hi-net (high-sensitivity seismograph network in Japan; collocated with a borehole receiver of KiK-net) borehole records, we constrain the responsible depth of the medium changes associated with the 2011 Tohoku earthquake (MW9.0). There is a systematic reduction in VS up to 6% in the shallow subsurface which experienced strong dynamic strain by the Tohoku earthquake. In contrast, both positive and negative changes are observed for VP, which are less than 2% for both directions. We propose that this discrepancy between the changes of VS and VP is explained by the behavior of shear and bulk moduli of a porous medium exposed to an increase of excess pore fluid pressure. At many stations, VS recovers proportional to logarithm of the lapse time after the mainshock, and mostly recovers to the reference value obtained before the mainshock in one year. However, some stations that have been exposed by additional strong motions of aftershocks and/or other earthquakes take much longer time for the recovery. The CWI technique applied to horizontal components of S-coda reveals a velocity reduction up to 0.2% widely along the coastline of northeastern Japan. For the vertical component of P-coda, however, the velocity change is mostly less than 0.1% at the same region. From single scattering model including P-S and S-P conversion scatterings, we verify that both components are sensitive to VS change around the source, but the vertical component of P-coda is sensitive to VP change around the receiver. Consequently, the difference in velocity changes revealed from the horizontal and vertical components represents the difference of VS and VP changes near the receiver. As the conclusion, VS reduction ratio in the deep lithosphere is smaller than that at the shallow ground by 1 to 2 orders.

  1. 1:N Space Division Switches for Optical Routing, Reconfigurable Interconnections, and Time and Wavelength-Division Switching Applications

    National Research Council Canada - National Science Library

    Shire, D

    1998-01-01

    ... of time-division multiplexing and demultiplexing operations. Hysteresis in the input-output transfer characteristics of the coupled in-plane lasers and VCSELs also leads to bistable operation over a range of bias conditions...

  2. Tracking Cancer Evolution Reveals Constrained Routes to Metastases: TRACERx Renal.

    Science.gov (United States)

    Turajlic, Samra; Xu, Hang; Litchfield, Kevin; Rowan, Andrew; Chambers, Tim; Lopez, Jose I; Nicol, David; O'Brien, Tim; Larkin, James; Horswell, Stuart; Stares, Mark; Au, Lewis; Jamal-Hanjani, Mariam; Challacombe, Ben; Chandra, Ashish; Hazell, Steve; Eichler-Jonsson, Claudia; Soultati, Aspasia; Chowdhury, Simon; Rudman, Sarah; Lynch, Joanna; Fernando, Archana; Stamp, Gordon; Nye, Emma; Jabbar, Faiz; Spain, Lavinia; Lall, Sharanpreet; Guarch, Rosa; Falzon, Mary; Proctor, Ian; Pickering, Lisa; Gore, Martin; Watkins, Thomas B K; Ward, Sophia; Stewart, Aengus; DiNatale, Renzo; Becerra, Maria F; Reznik, Ed; Hsieh, James J; Richmond, Todd A; Mayhew, George F; Hill, Samantha M; McNally, Catherine D; Jones, Carol; Rosenbaum, Heidi; Stanislaw, Stacey; Burgess, Daniel L; Alexander, Nelson R; Swanton, Charles

    2018-04-19

    Clear-cell renal cell carcinoma (ccRCC) exhibits a broad range of metastatic phenotypes that have not been systematically studied to date. Here, we analyzed 575 primary and 335 metastatic biopsies across 100 patients with metastatic ccRCC, including two cases sampledat post-mortem. Metastatic competence was afforded by chromosome complexity, and we identify 9p loss as a highly selected event driving metastasis and ccRCC-related mortality (p = 0.0014). Distinct patterns of metastatic dissemination were observed, including rapid progression to multiple tissue sites seeded by primary tumors of monoclonal structure. By contrast, we observed attenuated progression in cases characterized by high primary tumor heterogeneity, with metastatic competence acquired gradually and initial progression to solitary metastasis. Finally, we observed early divergence of primitive ancestral clones and protracted latency of up to two decades as a feature of pancreatic metastases. Crown Copyright © 2018. Published by Elsevier Inc. All rights reserved.

  3. A comprehensive cloud-based real-time simulation framework for oblivious power routing in clusters of DC microgrids

    DEFF Research Database (Denmark)

    Amini, M. Hadi; Boroojeni, Kianoosh G.; Dragicevic, Tomislav

    2017-01-01

    of microgrids. The effectiveness of the proposed algorithm has been verified in MATLAB simulation. Furthermore, we propose a comprehensive simulation platform for further implementation of the proposed strategy on OPAL-RT real-time simulator system (RTDS). In our proposed platform, the communication path...

  4. Freight distribution problems in congested urban areas : fast and effective solution procedures to time-dependent vehicle routing problems

    Science.gov (United States)

    2011-01-01

    Congestion is a common phenomenon in all medium to large cities of the world. Reliability of freight movement in urban areas is an important : issue to manufacturing or service companies whose operation is based in just-in-time approaches. These comp...

  5. Robust routing for hazardous materials transportation with conditional value-at-risk on time-dependent networks.

    Science.gov (United States)

    2012-11-01

    New methods are proposed for mitigating risk in hazardous materials (hazmat) transportation, based on Conditional : Value-at-Risk (CVaR) measure, on time-dependent vehicular networks. While the CVaR risk measure has been : popularly used in financial...

  6. Permian U-Pb (CA-TIMS) zircon ages from Australia and China: Constraining the time scale of environmental and biotic change

    Science.gov (United States)

    Denyszyn, S. W.; Mundil, R.; Metcalfe, I.; He, B.

    2010-12-01

    ca. 257 Ma, the latter two units lying stratigraphically below the latest identified glacial deposits. U-Pb (CA-TIMS) results on zircons from the Emeishan flood basalts and related volcanic products confirm the end-Guadalupian age (ca. 260 Ma) of the magmatism, and based on present data, place the Emeishan volcanic event (and its possibly associated mass extinction) within the occurrence of the Late Paleozoic Ice Age. This study’s primary goal is the establishment of a chronostratigraphic framework that would allow the integration of calibrated records from both terrestrial and marine units from different parts of the world in order to constrain the timing and rates of extinctions and recoveries in different locations and physical environments. [1] Fielding et al. (2008), J. Geol Soc. Lon., v. 165, pp. 129-140 [2] Michaelsen et al. (2001), Aus. J. Earth Sci., v. 48, pp. 183-192 [3] Roberts et al. (1996), Aus. J. Earth Sci., v. 43, pp. 401-421 [4] He et al. (2007), EPSL, v. 255, pp. 306-323

  7. Fat, weather, and date affect migratory songbirds' departure decisions, routes, and time it takes to cross the Gulf of Mexico.

    Science.gov (United States)

    Deppe, Jill L; Ward, Michael P; Bolus, Rachel T; Diehl, Robert H; Celis-Murillo, Antonio; Zenzal, Theodore J; Moore, Frank R; Benson, Thomas J; Smolinsky, Jaclyn A; Schofield, Lynn N; Enstrom, David A; Paxton, Eben H; Bohrer, Gil; Beveroth, Tara A; Raim, Arlo; Obringer, Renee L; Delaney, David; Cochran, William W

    2015-11-17

    Approximately two thirds of migratory songbirds in eastern North America negotiate the Gulf of Mexico (GOM), where inclement weather coupled with no refueling or resting opportunities can be lethal. However, decisions made when navigating such features and their consequences remain largely unknown due to technological limitations of tracking small animals over large areas. We used automated radio telemetry to track three songbird species (Red-eyed Vireo, Swainson's Thrush, Wood Thrush) from coastal Alabama to the northern Yucatan Peninsula (YP) during fall migration. Detecting songbirds after crossing ∼1,000 km of open water allowed us to examine intrinsic (age, wing length, fat) and extrinsic (weather, date) variables shaping departure decisions, arrival at the YP, and crossing times. Large fat reserves and low humidity, indicative of beneficial synoptic weather patterns, favored southward departure across the Gulf. Individuals detected in the YP departed with large fat reserves and later in the fall with profitable winds, and flight durations (mean = 22.4 h) were positively related to wind profit. Age was not related to departure behavior, arrival, or travel time. However, vireos negotiated the GOM differently than thrushes, including different departure decisions, lower probability of detection in the YP, and longer crossing times. Defense of winter territories by thrushes but not vireos and species-specific foraging habits may explain the divergent migratory behaviors. Fat reserves appear extremely important to departure decisions and arrival in the YP. As habitat along the GOM is degraded, birds may be limited in their ability to acquire fat to cross the Gulf.

  8. Fat, weather, and date affect migratory songbirds’ departure decisions, routes, and time it takes to cross the Gulf of Mexico

    Science.gov (United States)

    Deppe, Jill L.; Ward, Michael P.; Bolus, Rachel T.; Diehl, Robert H.; Celis-Murillo, A.; Zenzal, Theodore J.; Moore, Frank R.; Benson, Thomas J.; Smolinsky, Jaclyn A.; Schofield, Lynn N.; Enstrom, David A.; Paxton, Eben H.; Bohrer, Gil; Beveroth, Tara A.; Raim, Arlo; Obringer, Renee L.; Delaney, David; Cochran, William W.

    2015-01-01

    Approximately two thirds of migratory songbirds in eastern North America negotiate the Gulf of Mexico (GOM), where inclement weather coupled with no refueling or resting opportunities can be lethal. However, decisions made when navigating such features and their consequences remain largely unknown due to technological limitations of tracking small animals over large areas. We used automated radio telemetry to track three songbird species (Red-eyed Vireo, Swainson’s Thrush, Wood Thrush) from coastal Alabama to the northern Yucatan Peninsula (YP) during fall migration. Detecting songbirds after crossing ∼1,000 km of open water allowed us to examine intrinsic (age, wing length, fat) and extrinsic (weather, date) variables shaping departure decisions, arrival at the YP, and crossing times. Large fat reserves and low humidity, indicative of beneficial synoptic weather patterns, favored southward departure across the Gulf. Individuals detected in the YP departed with large fat reserves and later in the fall with profitable winds, and flight durations (mean = 22.4 h) were positively related to wind profit. Age was not related to departure behavior, arrival, or travel time. However, vireos negotiated the GOM differently than thrushes, including different departure decisions, lower probability of detection in the YP, and longer crossing times. Defense of winter territories by thrushes but not vireos and species-specific foraging habits may explain the divergent migratory behaviors. Fat reserves appear extremely important to departure decisions and arrival in the YP. As habitat along the GOM is degraded, birds may be limited in their ability to acquire fat to cross the Gulf.

  9. Hurricane Evacuation Routes

    Data.gov (United States)

    Department of Homeland Security — Hurricane Evacuation Routes in the United States A hurricane evacuation route is a designated route used to direct traffic inland in case of a hurricane threat. This...

  10. Migratory timing, rate, routes and wintering areas of White-crested Elaenia (Elaenia albiceps chilensis, a key seed disperser for Patagonian forest regeneration.

    Directory of Open Access Journals (Sweden)

    Susana Patricia Bravo

    Full Text Available Migratory animals often play key ecological roles within the communities they visit throughout their annual journeys. As a consequence of the links between biomes mediated by migrants, changes in one biome could affect remote areas in unpredictable ways. Migratory routes and timing of most Neotropical austral migrants, which breed at south temperate latitudes of South America and overwinter closer to or within tropical latitudes of South America, have yet to be described in detail. As a result, our understanding about how these birds provide links between South American biomes is almost non-existent. White-crested Elaenia (Elaenia albiceps chilensis is a long-distance austral migrant that breeds in the Patagonian Forest biome and overwinters in tropical South America. Because this small flycatcher plays a key role in the regeneration of this ecosystem, our objective was to describe the annual cycle of White-crested elaenias to evaluate the degree of migratory connectivity between breeding and wintering areas and therefore to determine if there are specific biomes of northern South America linked by elaenias to Patagonian forests. Fifteen individuals were successfully tracked throughout a complete migration cycle using miniature light-level geolocators. All individuals resided and moved through the same general regions. During fall (March-April-May, elaenias were located in the Caatinga and the Atlantic Forest biomes, from Rio de Janeiro to the region near Salvador da Bahia, Brazil. During winter (June-July-Aug., birds were located further inland, within the Cerrado biome. Birds used three different routes during fall migration. Our results indicate that some individuals use a direct route, flying between 500-600 km/day, crossing desert and grasslands, while others took a detour, flying 100-200 km/day through forested areas with refueling opportunities. All birds used the Yunga forest during spring migration, with ten out of 15 individuals

  11. High speed network for real-time data acquisition and control with lossless and balanced self-routing

    International Nuclear Information System (INIS)

    Ofek, Y.; Hicks, S.E.

    1990-01-01

    The authors present a gigabit network architecture for interconnecting the on-line and off-line data acquisition and processing farms for future detector facilities at the SSC (Superconducting Super Collider). In the solution they concentrate on how to interconnect the front-end (ADCs and leve 1 and 2 triggers) with the on-line (real-time) computer farm. They propose that the on-line solution be extended into the off-line data processing and mass-storage. As a result, this solution provides a single uniform structure which will simplify the overall system

  12. Fish Species in a Changing World: The Route and Timing of Species Migration between Tropical and Temperate Ecosystems in Eastern Atlantic.

    Directory of Open Access Journals (Sweden)

    Awaluddin Halirin Kaimuddin

    2016-09-01

    Full Text Available The presence of tropical species has been reported in Atlantic-European waters with increasing frequency in recent years. Unfortunately, the history of their migrations is not well understood. In this study, we examined the routes and timing of fish migrations in several ecosystems of the East Atlantic Ocean, combining several publicly available and unpublicized datasets on species occurrences. The species studied were those noted as exotic or rare outside their previous known area of distribution. We used sea surface temperature (SST data obtained from 30 years of satellite observation to define three distinct time periods. Within these periods, temperature trends were studied in six ecosystems: the North Sea, the Celtic Sea, the South European Atlantic Waters, the Mediterranean Sea, the Canary Current and the Guinea Current. We also incorporated bathymetry data to describe the distribution of species. Measurement across a relatively large spatial extent was made possible by incorporating the capabilities of GIS.While SST increased consistently over time in all of the ecosystems observed, the change in number of species differed among ecosystems. The number of species in the middle regions, such as the South European Atlantic Shelf and the Western Mediterranean Sea, tended to increase over time. These regions received numbers of species from the lower or the upper latitudes according to season. Of all of the species observed in the recent period, 7 species from the Canary Current tended to be found in the Western Mediterranean Sea, and 6 species from these two regions extended their distributions to the South European Atlantic Shelf. Twelve species from the Canary Current moved seasonally to the Guinea Current. In the northern regions, 13 species moved seasonally in the North Sea and the Celtic Seas, and 12 of these species reached the South European Atlantic Shelf.This study presents a picture of routes and timing of species migration at the

  13. Early cosmology constrained

    Energy Technology Data Exchange (ETDEWEB)

    Verde, Licia; Jimenez, Raul [Institute of Cosmos Sciences, University of Barcelona, IEEC-UB, Martí Franquès, 1, E08028 Barcelona (Spain); Bellini, Emilio [University of Oxford, Denys Wilkinson Building, Keble Road, Oxford, OX1 3RH (United Kingdom); Pigozzo, Cassio [Instituto de Física, Universidade Federal da Bahia, Salvador, BA (Brazil); Heavens, Alan F., E-mail: liciaverde@icc.ub.edu, E-mail: emilio.bellini@physics.ox.ac.uk, E-mail: cpigozzo@ufba.br, E-mail: a.heavens@imperial.ac.uk, E-mail: raul.jimenez@icc.ub.edu [Imperial Centre for Inference and Cosmology (ICIC), Imperial College, Blackett Laboratory, Prince Consort Road, London SW7 2AZ (United Kingdom)

    2017-04-01

    We investigate our knowledge of early universe cosmology by exploring how much additional energy density can be placed in different components beyond those in the ΛCDM model. To do this we use a method to separate early- and late-universe information enclosed in observational data, thus markedly reducing the model-dependency of the conclusions. We find that the 95% credibility regions for extra energy components of the early universe at recombination are: non-accelerating additional fluid density parameter Ω{sub MR} < 0.006 and extra radiation parameterised as extra effective neutrino species 2.3 < N {sub eff} < 3.2 when imposing flatness. Our constraints thus show that even when analyzing the data in this largely model-independent way, the possibility of hiding extra energy components beyond ΛCDM in the early universe is seriously constrained by current observations. We also find that the standard ruler, the sound horizon at radiation drag, can be well determined in a way that does not depend on late-time Universe assumptions, but depends strongly on early-time physics and in particular on additional components that behave like radiation. We find that the standard ruler length determined in this way is r {sub s} = 147.4 ± 0.7 Mpc if the radiation and neutrino components are standard, but the uncertainty increases by an order of magnitude when non-standard dark radiation components are allowed, to r {sub s} = 150 ± 5 Mpc.

  14. Post-breeding migration of Dutch-breeding black-tailed godwits: timing, routes, use of stopovers, and nonbreeding destinations

    Science.gov (United States)

    Hooijmeijer, Jos C. E. W.; Senner, Nathan R.; Tibbitts, T. Lee; Gill, Robert E.; Douglas, David C.; Bruinzeel, Leo W.; Wymenga, Eddy; Piersma, Theunis

    2014-01-01

    Conservation of long-distance migratory shorebirds is complex because these species use habitats spread across continents and hemispheres, making identification of critical habitats and potential bottlenecks in the annual cycle especially difficult. The population of Black-tailed Godwits that breeds in Western Europe, Limosa limosa limosa, has declined precipitously over the past few decades. Despite significant efforts to identify the root causes of this decline, much remains unclear. To better understand the migratory timing, use of stopover and nonbreeding sites, and the potential impact of breeding success on these parameters, we attached 15 Argos satellite transmitters and 10 geolocation tracking devices to adult godwits nearing completion of incubation at breeding sites in southwest Friesland, The Netherlands during the spring of 2009. We successfully tracked 16 adult godwits for their entire southward migration and two others for part of it. Three migration patterns and four regions of use were apparent. Most godwits left their breeding sites and proceeded south directly to stopover sites in the Mediterranean — e.g. Spain, Portugal, and Morocco — before flying on to non-breeding sites in West Africa. Other individuals spent the entire nonbreeding season in the Mediterranean. A third pattern included a few individuals that flew nonstop from their Dutch breeding sites to nonbreeding sites in West Africa. Tracking data from this study will be immediately useful for conservation efforts focused on preserving the dispersed network of sites used by godwits during their southward migration.

  15. Evolutionary constrained optimization

    CERN Document Server

    Deb, Kalyanmoy

    2015-01-01

    This book makes available a self-contained collection of modern research addressing the general constrained optimization problems using evolutionary algorithms. Broadly the topics covered include constraint handling for single and multi-objective optimizations; penalty function based methodology; multi-objective based methodology; new constraint handling mechanism; hybrid methodology; scaling issues in constrained optimization; design of scalable test problems; parameter adaptation in constrained optimization; handling of integer, discrete and mix variables in addition to continuous variables; application of constraint handling techniques to real-world problems; and constrained optimization in dynamic environment. There is also a separate chapter on hybrid optimization, which is gaining lots of popularity nowadays due to its capability of bridging the gap between evolutionary and classical optimization. The material in the book is useful to researchers, novice, and experts alike. The book will also be useful...

  16. Route planning algorithms: Planific@ Project

    Directory of Open Access Journals (Sweden)

    Gonzalo Martín Ortega

    2009-12-01

    Full Text Available Planific@ is a route planning project for the city of Madrid (Spain. Its main aim is to develop an intelligence system capable of routing people from one place in the city to any other using the public transport. In order to do this, it is necessary to take into account such things as: time, traffic, user preferences, etc. Before beginning to design the project is necessary to make a comprehensive study of the variety of main known route planning algorithms suitable to be used in this project.

  17. VINE ROUTES IN BULGARIA

    Directory of Open Access Journals (Sweden)

    Lyuben Hristov

    2015-03-01

    Full Text Available The article deals with a scheme for the modern vine route in Bulgaria. Five basic vine routes and one international, between Bulgaria, Macedonia and Greece are defined. All routes consider characteristic varieties of grapes and kinds of vine products. Vine tourist products combined with visits of important natural and anthropological object are in the bases of the defined routes. The described routes are an important contribution to development of alternative tourist products in the country.

  18. An Airlift Hub-and-Spoke Location-Routing Model with Time Windows: Case Study of the CONUS-to-Korea Airlift Problem

    National Research Council Canada - National Science Library

    Cox, David

    1998-01-01

    .... This study develops an alternative hub-and-spoke combined location-routing integer linear programming prototype model, and uses this model to determine what advantages a hub-and-spoke system offers...

  19. Exploring Constrained Creative Communication

    DEFF Research Database (Denmark)

    Sørensen, Jannick Kirk

    2017-01-01

    Creative collaboration via online tools offers a less ‘media rich’ exchange of information between participants than face-to-face collaboration. The participants’ freedom to communicate is restricted in means of communication, and rectified in terms of possibilities offered in the interface. How do...... these constrains influence the creative process and the outcome? In order to isolate the communication problem from the interface- and technology problem, we examine via a design game the creative communication on an open-ended task in a highly constrained setting, a design game. Via an experiment the relation...... between communicative constrains and participants’ perception of dialogue and creativity is examined. Four batches of students preparing for forming semester project groups were conducted and documented. Students were asked to create an unspecified object without any exchange of communication except...

  20. Choosing health, constrained choices.

    Science.gov (United States)

    Chee Khoon Chan

    2009-12-01

    In parallel with the neo-liberal retrenchment of the welfarist state, an increasing emphasis on the responsibility of individuals in managing their own affairs and their well-being has been evident. In the health arena for instance, this was a major theme permeating the UK government's White Paper Choosing Health: Making Healthy Choices Easier (2004), which appealed to an ethos of autonomy and self-actualization through activity and consumption which merited esteem. As a counterpoint to this growing trend of informed responsibilization, constrained choices (constrained agency) provides a useful framework for a judicious balance and sense of proportion between an individual behavioural focus and a focus on societal, systemic, and structural determinants of health and well-being. Constrained choices is also a conceptual bridge between responsibilization and population health which could be further developed within an integrative biosocial perspective one might refer to as the social ecology of health and disease.

  1. Routing in opportunistic networks

    CERN Document Server

    Dhurandher, Sanjay; Anpalagan, Alagan; Vasilakos, Athanasios

    2013-01-01

    This book provides a comprehensive guide to selected topics, both ongoing and emerging, in routing in OppNets. The book is edited by worldwide technical leaders, prolific researchers and outstanding academics, Dr. Isaac Woungang and co-editors, Dr. Sanjay Kumar Dhurandher, Prof. Alagan Anpalagan and Prof. Athanasios Vasilakos. Consisting of contributions from well known and high profile researchers and scientists in their respective specialties, the main topics that are covered in this book include mobility and routing, social-aware routing, context-based routing, energy-aware routing, incentive-aware routing, stochastic routing, modeling of intermittent connectivity, in both infrastructure and infrastructure-less OppNets. Key Features: Discusses existing and emerging techniques for routing in infrastructure and infrastructure-less OppNets. Provides a unified covering of otherwise disperse selected topics on routing in infrastructure and infrastructure-less OppNets.  Includes a set of PowerPoint slides and g...

  2. Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks.

    Science.gov (United States)

    Saleem, Kashif; Derhab, Abdelouahid; Orgun, Mehmet A; Al-Muhtadi, Jalal; Rodrigues, Joel J P C; Khalil, Mohammed Sayim; Ali Ahmed, Adel

    2016-03-31

    The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs) composed of various miniature resource-constrained wireless sensor nodes. The development of routing protocols for WSNs is a major challenge because of their severe resource constraints, ad hoc topology and dynamic nature. Among those proposed routing protocols, the biology-inspired self-organized secure autonomous routing protocol (BIOSARP) involves an artificial immune system (AIS) that requires a certain amount of time to build up knowledge of neighboring nodes. The AIS algorithm uses this knowledge to distinguish between self and non-self neighboring nodes. The knowledge-building phase is a critical period in the WSN lifespan and requires active security measures. This paper proposes an enhanced BIOSARP (E-BIOSARP) that incorporates a random key encryption mechanism in a cost-effective manner to provide active security measures in WSNs. A detailed description of E-BIOSARP is presented, followed by an extensive security and performance analysis to demonstrate its efficiency. A scenario with E-BIOSARP is implemented in network simulator 2 (ns-2) and is populated with malicious nodes for analysis. Furthermore, E-BIOSARP is compared with state-of-the-art secure routing protocols in terms of processing time, delivery ratio, energy consumption, and packet overhead. The findings show that the proposed mechanism can efficiently protect WSNs from selective forwarding, brute-force or exhaustive key search, spoofing, eavesdropping, replaying or altering of routing information, cloning, acknowledgment spoofing, HELLO flood attacks, and Sybil attacks.

  3. Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks

    Science.gov (United States)

    Saleem, Kashif; Derhab, Abdelouahid; Orgun, Mehmet A.; Al-Muhtadi, Jalal; Rodrigues, Joel J. P. C.; Khalil, Mohammed Sayim; Ali Ahmed, Adel

    2016-01-01

    The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs) composed of various miniature resource-constrained wireless sensor nodes. The development of routing protocols for WSNs is a major challenge because of their severe resource constraints, ad hoc topology and dynamic nature. Among those proposed routing protocols, the biology-inspired self-organized secure autonomous routing protocol (BIOSARP) involves an artificial immune system (AIS) that requires a certain amount of time to build up knowledge of neighboring nodes. The AIS algorithm uses this knowledge to distinguish between self and non-self neighboring nodes. The knowledge-building phase is a critical period in the WSN lifespan and requires active security measures. This paper proposes an enhanced BIOSARP (E-BIOSARP) that incorporates a random key encryption mechanism in a cost-effective manner to provide active security measures in WSNs. A detailed description of E-BIOSARP is presented, followed by an extensive security and performance analysis to demonstrate its efficiency. A scenario with E-BIOSARP is implemented in network simulator 2 (ns-2) and is populated with malicious nodes for analysis. Furthermore, E-BIOSARP is compared with state-of-the-art secure routing protocols in terms of processing time, delivery ratio, energy consumption, and packet overhead. The findings show that the proposed mechanism can efficiently protect WSNs from selective forwarding, brute-force or exhaustive key search, spoofing, eavesdropping, replaying or altering of routing information, cloning, acknowledgment spoofing, HELLO flood attacks, and Sybil attacks. PMID:27043572

  4. A Genetic Algorithm on Inventory Routing Problem

    Directory of Open Access Journals (Sweden)

    Nevin Aydın

    2014-03-01

    Full Text Available Inventory routing problem can be defined as forming the routes to serve to the retailers from the manufacturer, deciding on the quantity of the shipment to the retailers and deciding on the timing of the replenishments. The difference of inventory routing problems from vehicle routing problems is the consideration of the inventory positions of retailers and supplier, and making the decision accordingly. Inventory routing problems are complex in nature and they can be solved either theoretically or using a heuristics method. Metaheuristics is an emerging class of heuristics that can be applied to combinatorial optimization problems. In this paper, we provide the relationship between vendor-managed inventory and inventory routing problem. The proposed genetic for solving vehicle routing problem is described in detail.

  5. Constrained superfields in supergravity

    Energy Technology Data Exchange (ETDEWEB)

    Dall’Agata, Gianguido; Farakos, Fotis [Dipartimento di Fisica ed Astronomia “Galileo Galilei”, Università di Padova,Via Marzolo 8, 35131 Padova (Italy); INFN, Sezione di Padova,Via Marzolo 8, 35131 Padova (Italy)

    2016-02-16

    We analyze constrained superfields in supergravity. We investigate the consistency and solve all known constraints, presenting a new class that may have interesting applications in the construction of inflationary models. We provide the superspace Lagrangians for minimal supergravity models based on them and write the corresponding theories in component form using a simplifying gauge for the goldstino couplings.

  6. Minimal constrained supergravity

    Energy Technology Data Exchange (ETDEWEB)

    Cribiori, N. [Dipartimento di Fisica e Astronomia “Galileo Galilei”, Università di Padova, Via Marzolo 8, 35131 Padova (Italy); INFN, Sezione di Padova, Via Marzolo 8, 35131 Padova (Italy); Dall' Agata, G., E-mail: dallagat@pd.infn.it [Dipartimento di Fisica e Astronomia “Galileo Galilei”, Università di Padova, Via Marzolo 8, 35131 Padova (Italy); INFN, Sezione di Padova, Via Marzolo 8, 35131 Padova (Italy); Farakos, F. [Dipartimento di Fisica e Astronomia “Galileo Galilei”, Università di Padova, Via Marzolo 8, 35131 Padova (Italy); INFN, Sezione di Padova, Via Marzolo 8, 35131 Padova (Italy); Porrati, M. [Center for Cosmology and Particle Physics, Department of Physics, New York University, 4 Washington Place, New York, NY 10003 (United States)

    2017-01-10

    We describe minimal supergravity models where supersymmetry is non-linearly realized via constrained superfields. We show that the resulting actions differ from the so called “de Sitter” supergravities because we consider constraints eliminating directly the auxiliary fields of the gravity multiplet.

  7. Minimal constrained supergravity

    Directory of Open Access Journals (Sweden)

    N. Cribiori

    2017-01-01

    Full Text Available We describe minimal supergravity models where supersymmetry is non-linearly realized via constrained superfields. We show that the resulting actions differ from the so called “de Sitter” supergravities because we consider constraints eliminating directly the auxiliary fields of the gravity multiplet.

  8. Minimal constrained supergravity

    International Nuclear Information System (INIS)

    Cribiori, N.; Dall'Agata, G.; Farakos, F.; Porrati, M.

    2017-01-01

    We describe minimal supergravity models where supersymmetry is non-linearly realized via constrained superfields. We show that the resulting actions differ from the so called “de Sitter” supergravities because we consider constraints eliminating directly the auxiliary fields of the gravity multiplet.

  9. Time and Energy Characterization of a Neutron Time of Flight Detector Using a Novel Coincidence Method for Constraining Neutron Yield, Ion Temperature and Liner Density Measurements from MagLIF Experiments

    Science.gov (United States)

    Styron, Jedediah D.

    The focus of this work is the characterization of a typical neutron time-of-flight (NTOF) detector that is fielded on inertial confinement fusion (ICF) experiments conducted at the Z-experimental facility with emphasis on the Magnetized Liner Fusion (MagLIF) concept. An NTOF detector consisting of EJ-228 scintillator and two independent photomultiplier tubes (PMTs), a Hamamatsu-mod 5 and Photek-PMT240, has been characterized in terms of the absolute time and energy response. The characterization was done by measuring single, neutron-induced events in the scintillator by measuring the alpha particle and neutron produced from the D-T reaction in kinematic coincidence. The results of these experiments provided the time dependent instrument response function and the detector sensitivity as a function of applied voltage covering the entire dynamic range of the detector. Historically, impulse response functions have been measured using various photon sources as surrogates for a neutron source. Thus, this measurement using a single hit neutron source results in the most accurate measured response function, which will improve the accuracy of impulse response corrections to the NTOF signals. While this detector has not yet been fielded on any MagLIF experiments, the development of a predictive capability was desired for transferring the measured detector response from the calibration geometry to the more complex Z geometry. As a proof-of-principle, a detailed model of the Z-machine was developed in MCNP6 to correct for geometry issues when transferring the calibration results from a light lab setting to the Z-environment. Representative values for the instrument response function and the sensitivity for the current detectors fielded on MagLIF experiments were convolved with the modeled results. These results were compared with data collected on three previous MagLIF experiments. The comparison shows the model results can be used to constrain three parameters that are

  10. Hazmat Routes (National)

    Data.gov (United States)

    Department of Transportation — The Federal Motor Carrier Safety Administration (FMCSA) Hazardous Material Routes (NTAD) were developed using the 2004 First Edition TIGER/Line files. The routes are...

  11. Evacuation route planning during nuclear emergency using genetic algorithm

    International Nuclear Information System (INIS)

    Suman, Vitisha; Sarkar, P.K.

    2012-01-01

    In nuclear industry the routing in case of any emergency is a cause of concern and of great importance. Even the smallest of time saved in the affected region saves a huge amount of otherwise received dose. Genetic algorithm an optimization technique has great ability to search for the optimal path from the affected region to a destination station in a spatially addressed problem. Usually heuristic algorithms are used to carry out these types of search strategy, but due to the lack of global sampling in the feasible solution space, these algorithms have considerable possibility of being trapped into local optima. Routing problems mainly are search problems for finding the shortest distance within a time limit to cover the required number of stations taking care of the traffics, road quality, population size etc. Lack of any formal mechanisms to help decision-makers explore the solution space of their problem and thereby challenges their assumptions about the number and range of options available. The Genetic Algorithm provides a way to optimize a multi-parameter constrained problem with an ease. Here use of Genetic Algorithm to generate a range of options available and to search a solution space and selectively focus on promising combinations of criteria makes them ideally suited to such complex spatial decision problems. The emergency response and routing can be made efficient, in accessing the closest facilities and determining the shortest route using genetic algorithm. The accuracy and care in creating database can be used to improve the result of the final output. The Genetic algorithm can be used to improve the accuracy of result on the basis of distance where other algorithm cannot be obtained. The search space can be utilized to its great extend

  12. Power Conditioning And Distribution Units For 50V Platforms A Flexible And Modular Concept Allowing To Deal With Time Constraining Programs

    Science.gov (United States)

    Lempereur, V.; Liegeois, B.; Deplus, N.

    2011-10-01

    In the frame of its Power Conditioning and Distribution Unit (PCDU) Medium power product family, Thales Alenia space ETCA is currently developing Power Conditioning Unit (PCU) and PCDU products for 50V platforms applications. These developments are performed in very schedule constraining programs. This challenge can be met thanks to the modular PCDU concept allowing to share a common heritage at mechanical & thermal points of view as well as at electrical functions level. First Medium power PCDU application has been developed for Herschel-Planck PCDU and re-used in several other missions (e.g. GlobalStar2 PCDU for which we are producing more than 26 units). Based on this heritage, a development plan based on Electrical Model (EM) (avoiding Electrical Qualification Model - EQM) can be proposed when the mechanical qualification of the concept covers the environment required in new projects. This first heritage level allows reducing development schedule and activities. In addition, development is also optimized thanks to the re-use of functions designed and qualified in Herschel- PlanckPCDU. This coversinternal TM/TC management inside PCDU based on a centralized scheduler and an internal high speed serial bus. Finally, thanks to common architecture of several 50V platforms based on full regulated bus, S3R (Sequential Shunt Switch Regulator) concept and one (or two) Li- Ion battery(ies), a common PCU/PCDU architecture has allowed the development of modules or functions that are used in several applications. These achievements are discussed with particular emphasis on PCDU architecture trade-offs allowing flexibility of proposed technical solutions (w.r.t. mono/bi-battery configurations, SA inner capacitance value, output power needs...). Pro's and con's of sharing concepts and designs between several applications on 50V platforms are also be discussed.

  13. In the right place at the right time: habitat representation in protected areas of South American Nothofagus-dominated plants after a dispersal constrained climate change scenario.

    Directory of Open Access Journals (Sweden)

    Diego Alarcón

    Full Text Available In order to assess the effects of climate change in temperate rainforest plants in southern South America in terms of habitat size, representation in protected areas, considering also if the expected impacts are similar for dominant trees and understory plant species, we used niche modeling constrained by species migration on 118 plant species, considering two groups of dominant trees and two groups of understory ferns. Representation in protected areas included Chilean national protected areas, private protected areas, and priority areas planned for future reserves, with two thresholds for minimum representation at the country level: 10% and 17%. With a 10% representation threshold, national protected areas currently represent only 50% of the assessed species. Private reserves are important since they increase up to 66% the species representation level. Besides, 97% of the evaluated species may achieve the minimum representation target only if the proposed priority areas were included. With the climate change scenario representation levels slightly increase to 53%, 69%, and 99%, respectively, to the categories previously mentioned. Thus, the current location of all the representation categories is useful for overcoming climate change by 2050. Climate change impacts on habitat size and representation of dominant trees in protected areas are not applicable to understory plants, highlighting the importance of assessing these effects with a larger number of species. Although climate change will modify the habitat size of plant species in South American temperate rainforests, it will have no significant impact in terms of the number of species adequately represented in Chile, where the implementation of the proposed reserves is vital to accomplish the present and future minimum representation. Our results also show the importance of using migration dispersal constraints to develop more realistic future habitat maps from climate change predictions.

  14. Routing in Wireless Multimedia Home Networks

    NARCIS (Netherlands)

    Scholten, Johan; Jansen, P.G.; Hop, Laurens

    This paper describes an adapted version of the destination sequenced distance vector routing protocol (DSDV) which is suitable to calculate routes in a wireless real-time home network. The home network is based on a IEEE 802.11b ad hoc network and uses a scheduled token to enforce real-time

  15. Routing in Wireless Multimedia Home Networks

    NARCIS (Netherlands)

    Scholten, Johan; Jansen, P.G.; Hop, Laurens

    This paper describes an adapted version of the destination sequenced distance vector routing protocol (DSDV) which is suitable to calculate routes in a wireless ¿real-time¿ home network. The home network is based on a IEEE 802.11b ad hoc network and uses a scheduled token to enforce real-time

  16. Constrained Vapor Bubble Experiment

    Science.gov (United States)

    Gokhale, Shripad; Plawsky, Joel; Wayner, Peter C., Jr.; Zheng, Ling; Wang, Ying-Xi

    2002-11-01

    Microgravity experiments on the Constrained Vapor Bubble Heat Exchanger, CVB, are being developed for the International Space Station. In particular, we present results of a precursory experimental and theoretical study of the vertical Constrained Vapor Bubble in the Earth's environment. A novel non-isothermal experimental setup was designed and built to study the transport processes in an ethanol/quartz vertical CVB system. Temperature profiles were measured using an in situ PC (personal computer)-based LabView data acquisition system via thermocouples. Film thickness profiles were measured using interferometry. A theoretical model was developed to predict the curvature profile of the stable film in the evaporator. The concept of the total amount of evaporation, which can be obtained directly by integrating the experimental temperature profile, was introduced. Experimentally measured curvature profiles are in good agreement with modeling results. For microgravity conditions, an analytical expression, which reveals an inherent relation between temperature and curvature profiles, was derived.

  17. Constrained noninformative priors

    International Nuclear Information System (INIS)

    Atwood, C.L.

    1994-10-01

    The Jeffreys noninformative prior distribution for a single unknown parameter is the distribution corresponding to a uniform distribution in the transformed model where the unknown parameter is approximately a location parameter. To obtain a prior distribution with a specified mean but with diffusion reflecting great uncertainty, a natural generalization of the noninformative prior is the distribution corresponding to the constrained maximum entropy distribution in the transformed model. Examples are given

  18. State alternative route designations

    International Nuclear Information System (INIS)

    1989-07-01

    Pursuant to the Hazardous Materials Transportation Act (HMTA), the Department of Transportation (DOT) has promulgated a comprehensive set of regulations regarding the highway transportation of high-level radioactive materials. These regulations, under HM-164 and HM-164A, establish interstate highways as the preferred routes for the transportation of radioactive materials within and through the states. The regulations also provide a methodology by which a state may select alternative routes. First,the state must establish a ''state routing agency,'' defined as an entity authorized to use the state legal process to impose routing requirements on carriers of radioactive material (49 CFR 171.8). Once identified, the state routing agency must select routes in accordance with Large Quantity Shipments of Radioactive Materials or an equivalent routing analysis. Adjoining states and localities should be consulted on the impact of proposed alternative routes as a prerequisite of final route selection. Lastly, the states must provide written notice of DOT of any alternative route designation before the routes are deemed effective

  19. An Adaptive Tabu Search Heuristic for the Location Routing Pickup and Delivery Problem with Time Windows with a Theater Distribution Application

    Science.gov (United States)

    2006-08-01

    including approximations of delivery costs. The solution of a sub-problem provides input for another sub-problem. Perl (1983) and Perl and Daskin (1985...developed in this section represents a modification and combination of both the three-layer location routing formulation of Perl and Daskin (1985) and the...1985) LRP formulation to create the LPDPTW. 4.2.1 Generalization of the LRP Perl and Daskin (1985) utilize a fixed charge location problem as the

  20. Aircraft route forecasting under adverse weather conditions

    Directory of Open Access Journals (Sweden)

    Thomas Hauf

    2017-04-01

    Full Text Available In this paper storm nowcasts in the terminal manoeuvring area (TMA of Hong Kong International Airport are used to forecast deviation routes through a field of storms for arriving and departing aircraft. Storms were observed and nowcast by the nowcast system SWIRLS from the Hong Kong Observatory. Storms were considered as no-go zones for aircraft and deviation routes were determined with the DIVSIM software package. Two days (21 and 22 May 2011 with 22 actual flown routes were investigated. Flights were simulated with a nowcast issued at the time an aircraft entered the TMA or departed from the airport. These flights were compared with a posteriori simulations, in which all storm fields were known and circumnavigated. Both types of simulated routes were then compared with the actual flown routes. The qualitative comparison of the various routes revealed generally good agreement. Larger differences were found in more complex situations with many active storms in the TMA. Route differences resulted primarily from air traffic control measures imposed such as holdings, slow-downs and shortcuts, causing the largest differences between the estimated and actual landing time. Route differences could be enhanced as aircraft might be forced to circumnavigate a storm ahead in a different sense. The use of route forecasts to assist controllers coordinating flights in a complex moving storm field is discussed. The study emphasises the important application of storm nowcasts in aviation meteorology.

  1. Ring-constrained Join

    DEFF Research Database (Denmark)

    Yiu, Man Lung; Karras, Panagiotis; Mamoulis, Nikos

    2008-01-01

    . This new operation has important applications in decision support, e.g., placing recycling stations at fair locations between restaurants and residential complexes. Clearly, RCJ is defined based on a geometric constraint but not on distances between points. Thus, our operation is fundamentally different......We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs (p, q) (where p ε P, q ε Q) satisfying an intuitive geometric constraint: the smallest circle enclosing p and q contains no other points in P, Q...

  2. Constraining Nonperturbative Strong-Field Effects in Scalar-Tensor Gravity by Combining Pulsar Timing and Laser-Interferometer Gravitational-Wave Detectors

    Directory of Open Access Journals (Sweden)

    Lijing Shao

    2017-10-01

    Full Text Available Pulsar timing and laser-interferometer gravitational-wave (GW detectors are superb laboratories to study gravity theories in the strong-field regime. Here, we combine these tools to test the mono-scalar-tensor theory of Damour and Esposito-Farèse (DEF, which predicts nonperturbative scalarization phenomena for neutron stars (NSs. First, applying Markov-chain Monte Carlo techniques, we use the absence of dipolar radiation in the pulsar-timing observations of five binary systems composed of a NS and a white dwarf, and eleven equations of state (EOSs for NSs, to derive the most stringent constraints on the two free parameters of the DEF scalar-tensor theory. Since the binary-pulsar bounds depend on the NS mass and the EOS, we find that current pulsar-timing observations leave scalarization windows, i.e., regions of parameter space where scalarization can still be prominent. Then, we investigate if these scalarization windows could be closed and if pulsar-timing constraints could be improved by laser-interferometer GW detectors, when spontaneous (or dynamical scalarization sets in during the early (or late stages of a binary NS (BNS evolution. For the early inspiral of a BNS carrying constant scalar charge, we employ a Fisher-matrix analysis to show that Advanced LIGO can improve pulsar-timing constraints for some EOSs, and next-generation detectors, such as the Cosmic Explorer and Einstein Telescope, will be able to improve those bounds for all eleven EOSs. Using the late inspiral of a BNS, we estimate that for some of the EOSs under consideration, the onset of dynamical scalarization can happen early enough to improve the constraints on the DEF parameters obtained by combining the five binary pulsars. Thus, in the near future, the complementarity of pulsar timing and direct observations of GWs on the ground will be extremely valuable in probing gravity theories in the strong-field regime.

  3. Formal language constrained path problems

    Energy Technology Data Exchange (ETDEWEB)

    Barrett, C.; Jacob, R.; Marathe, M.

    1997-07-08

    In many path finding problems arising in practice, certain patterns of edge/vertex labels in the labeled graph being traversed are allowed/preferred, while others are disallowed. Motivated by such applications as intermodal transportation planning, the authors investigate the complexity of finding feasible paths in a labeled network, where the mode choice for each traveler is specified by a formal language. The main contributions of this paper include the following: (1) the authors show that the problem of finding a shortest path between a source and destination for a traveler whose mode choice is specified as a context free language is solvable efficiently in polynomial time, when the mode choice is specified as a regular language they provide algorithms with improved space and time bounds; (2) in contrast, they show that the problem of finding simple paths between a source and a given destination is NP-hard, even when restricted to very simple regular expressions and/or very simple graphs; (3) for the class of treewidth bounded graphs, they show that (i) the problem of finding a regular language constrained simple path between source and a destination is solvable in polynomial time and (ii) the extension to finding context free language constrained simple paths is NP-complete. Several extensions of these results are presented in the context of finding shortest paths with additional constraints. These results significantly extend the results in [MW95]. As a corollary of the results, they obtain a polynomial time algorithm for the BEST k-SIMILAR PATH problem studied in [SJB97]. The previous best algorithm was given by [SJB97] and takes exponential time in the worst case.

  4. Continuation of Sets of Constrained Orbit Segments

    DEFF Research Database (Denmark)

    Schilder, Frank; Brøns, Morten; Chamoun, George Chaouki

    Sets of constrained orbit segments of time continuous flows are collections of trajectories that represent a whole or parts of an invariant set. A non-trivial but simple example is a homoclinic orbit. A typical representation of this set consists of an equilibrium point of the flow and a trajectory...... that starts close and returns close to this fixed point within finite time. More complicated examples are hybrid periodic orbits of piecewise smooth systems or quasi-periodic invariant tori. Even though it is possible to define generalised two-point boundary value problems for computing sets of constrained...... orbit segments, this is very disadvantageous in practice. In this talk we will present an algorithm that allows the efficient continuation of sets of constrained orbit segments together with the solution of the full variational problem....

  5. 4-D imaging of seepage in earthen embankments with time-lapse inversion of self-potential data constrained by acoustic emissions localization

    Science.gov (United States)

    Rittgers, J. B.; Revil, A.; Planes, T.; Mooney, M. A.; Koelewijn, A. R.

    2015-02-01

    New methods are required to combine the information contained in the passive electrical and seismic signals to detect, localize and monitor hydromechanical disturbances in porous media. We propose a field experiment showing how passive seismic and electrical data can be combined together to detect a preferential flow path associated with internal erosion in a Earth dam. Continuous passive seismic and electrical (self-potential) monitoring data were recorded during a 7-d full-scale levee (earthen embankment) failure test, conducted in Booneschans, Netherlands in 2012. Spatially coherent acoustic emissions events and the development of a self-potential anomaly, associated with induced concentrated seepage and internal erosion phenomena, were identified and imaged near the downstream toe of the embankment, in an area that subsequently developed a series of concentrated water flows and sand boils, and where liquefaction of the embankment toe eventually developed. We present a new 4-D grid-search algorithm for acoustic emissions localization in both time and space, and the application of the localization results to add spatially varying constraints to time-lapse 3-D modelling of self-potential data in the terms of source current localization. Seismic signal localization results are utilized to build a set of time-invariant yet spatially varying model weights used for the inversion of the self-potential data. Results from the combination of these two passive techniques show results that are more consistent in terms of focused ground water flow with respect to visual observation on the embankment. This approach to geophysical monitoring of earthen embankments provides an improved approach for early detection and imaging of the development of embankment defects associated with concentrated seepage and internal erosion phenomena. The same approach can be used to detect various types of hydromechanical disturbances at larger scales.

  6. An Agent-Based Model for Analyzing Control Policies and the Dynamic Service-Time Performance of a Capacity-Constrained Air Traffic Management Facility

    Science.gov (United States)

    Conway, Sheila R.

    2006-01-01

    Simple agent-based models may be useful for investigating air traffic control strategies as a precursory screening for more costly, higher fidelity simulation. Of concern is the ability of the models to capture the essence of the system and provide insight into system behavior in a timely manner and without breaking the bank. The method is put to the test with the development of a model to address situations where capacity is overburdened and potential for propagation of the resultant delay though later flights is possible via flight dependencies. The resultant model includes primitive representations of principal air traffic system attributes, namely system capacity, demand, airline schedules and strategy, and aircraft capability. It affords a venue to explore their interdependence in a time-dependent, dynamic system simulation. The scope of the research question and the carefully-chosen modeling fidelity did allow for the development of an agent-based model in short order. The model predicted non-linear behavior given certain initial conditions and system control strategies. Additionally, a combination of the model and dimensionless techniques borrowed from fluid systems was demonstrated that can predict the system s dynamic behavior across a wide range of parametric settings.

  7. The genetic variance but not the genetic covariance of life-history traits changes towards the north in a time-constrained insect.

    Science.gov (United States)

    Sniegula, Szymon; Golab, Maria J; Drobniak, Szymon M; Johansson, Frank

    2018-03-22

    Seasonal time constraints are usually stronger at higher than lower latitudes and can exert strong selection on life-history traits and the correlations among these traits. To predict the response of life-history traits to environmental change along a latitudinal gradient, information must be obtained about genetic variance in traits and also genetic correlation between traits, that is the genetic variance-covariance matrix, G. Here, we estimated G for key life-history traits in an obligate univoltine damselfly that faces seasonal time constraints. We exposed populations to simulated native temperatures and photoperiods and common garden environmental conditions in a laboratory set-up. Despite differences in genetic variance in these traits between populations (lower variance at northern latitudes), there was no evidence for latitude-specific covariance of the life-history traits. At simulated native conditions, all populations showed strong genetic and phenotypic correlations between traits that shaped growth and development. The variance-covariance matrix changed considerably when populations were exposed to common garden conditions compared with the simulated natural conditions, showing the importance of environmentally induced changes in multivariate genetic structure. Our results highlight the importance of estimating variance-covariance matrixes in environments that mimic selection pressures and not only trait variances or mean trait values in common garden conditions for understanding the trait evolution across populations and environments. © 2018 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2018 European Society For Evolutionary Biology.

  8. Sharp spatially constrained inversion

    DEFF Research Database (Denmark)

    Vignoli, Giulio G.; Fiandaca, Gianluca G.; Christiansen, Anders Vest C A.V.C.

    2013-01-01

    We present sharp reconstruction of multi-layer models using a spatially constrained inversion with minimum gradient support regularization. In particular, its application to airborne electromagnetic data is discussed. Airborne surveys produce extremely large datasets, traditionally inverted...... by using smoothly varying 1D models. Smoothness is a result of the regularization constraints applied to address the inversion ill-posedness. The standard Occam-type regularized multi-layer inversion produces results where boundaries between layers are smeared. The sharp regularization overcomes...... inversions are compared against classical smooth results and available boreholes. With the focusing approach, the obtained blocky results agree with the underlying geology and allow for easier interpretation by the end-user....

  9. Constraining the relative importance of raindrop- and flow-driven sediment transport mechanisms in postwildfire environments and implications for recovery time scales

    Science.gov (United States)

    McGuire, Luke; Kean, Jason W.; Staley, Dennis M.; Rengers, Francis K.; Wasklewicz, Thad A.

    2016-01-01

    Mountain watersheds recently burned by wildfire often experience greater amounts of runoff and increased rates of sediment transport relative to similar unburned areas. Given the sedimentation and debris flow threats caused by increases in erosion, more work is needed to better understand the physical mechanisms responsible for the observed increase in sediment transport in burned environments and the time scale over which a heightened geomorphic response can be expected. In this study, we quantified the relative importance of different hillslope erosion mechanisms during two postwildfire rainstorms at a drainage basin in Southern California by combining terrestrial laser scanner-derived maps of topographic change, field measurements, and numerical modeling of overland flow and sediment transport. Numerous debris flows were initiated by runoff at our study area during a long-duration storm of relatively modest intensity. Despite the presence of a well-developed rill network, numerical model results suggest that the majority of eroded hillslope sediment during this long-duration rainstorm was transported by raindrop-induced sediment transport processes, highlighting the importance of raindrop-driven processes in supplying channels with potential debris flow material. We also used the numerical model to explore relationships between postwildfire storm characteristics, vegetation cover, soil infiltration capacity, and the total volume of eroded sediment from a synthetic hillslope for different end-member erosion regimes. This study adds to our understanding of sediment transport in steep, postwildfire landscapes and shows how data from field monitoring can be combined with numerical modeling of sediment transport to isolate the processes leading to increased erosion in burned areas.

  10. Method and System for Dynamic Automated Corrections to Weather Avoidance Routes for Aircraft in En Route Airspace

    Science.gov (United States)

    McNally, B. David (Inventor); Erzberger, Heinz (Inventor); Sheth, Kapil (Inventor)

    2015-01-01

    A dynamic weather route system automatically analyzes routes for in-flight aircraft flying in convective weather regions and attempts to find more time and fuel efficient reroutes around current and predicted weather cells. The dynamic weather route system continuously analyzes all flights and provides reroute advisories that are dynamically updated in real time while the aircraft are in flight. The dynamic weather route system includes a graphical user interface that allows users to visualize, evaluate, modify if necessary, and implement proposed reroutes.

  11. A source-initiated on-demand routing algorithm based on the Thorup-Zwick theory for mobile wireless sensor networks.

    Science.gov (United States)

    Mao, Yuxin; Zhu, Ping

    2013-01-01

    The unreliability and dynamics of mobile wireless sensor networks make it hard to perform end-to-end communications. This paper presents a novel source-initiated on-demand routing mechanism for efficient data transmission in mobile wireless sensor networks. It explores the Thorup-Zwick theory to achieve source-initiated on-demand routing with time efficiency. It is able to find out shortest routing path between source and target in a network and transfer data in linear time. The algorithm is easy to be implemented and performed in resource-constrained mobile wireless sensor networks. We also evaluate the approach by analyzing its cost in detail. It can be seen that the approach is efficient to support data transmission in mobile wireless sensor networks.

  12. Intelligent routing protocol for ad hoc wireless network

    Science.gov (United States)

    Peng, Chaorong; Chen, Chang Wen

    2006-05-01

    A novel routing scheme for mobile ad hoc networks (MANETs), which combines hybrid and multi-inter-routing path properties with a distributed topology discovery route mechanism using control agents is proposed in this paper. In recent years, a variety of hybrid routing protocols for Mobile Ad hoc wireless networks (MANETs) have been developed. Which is proactively maintains routing information for a local neighborhood, while reactively acquiring routes to destinations beyond the global. The hybrid protocol reduces routing discovery latency and the end-to-end delay by providing high connectivity without requiring much of the scarce network capacity. On the other side the hybrid routing protocols in MANETs likes Zone Routing Protocol still need route "re-discover" time when a route between zones link break. Sine the topology update information needs to be broadcast routing request on local zone. Due to this delay, the routing protocol may not be applicable for real-time data and multimedia communication. We utilize the advantages of a clustering organization and multi-routing path in routing protocol to achieve several goals at the same time. Firstly, IRP efficiently saves network bandwidth and reduces route reconstruction time when a routing path fails. The IRP protocol does not require global periodic routing advertisements, local control agents will automatically monitor and repair broke links. Secondly, it efficiently reduces congestion and traffic "bottlenecks" for ClusterHeads in clustering network. Thirdly, it reduces significant overheads associated with maintaining clusters. Fourthly, it improves clusters stability due to dynamic topology changing frequently. In this paper, we present the Intelligent Routing Protocol. First, we discuss the problem of routing in ad hoc networks and the motivation of IRP. We describe the hierarchical architecture of IRP. We describe the routing process and illustrate it with an example. Further, we describe the control manage

  13. On Tree-Constrained Matchings and Generalizations

    NARCIS (Netherlands)

    S. Canzar (Stefan); K. Elbassioni; G.W. Klau (Gunnar); J. Mestre

    2011-01-01

    htmlabstractWe consider the following \\textsc{Tree-Constrained Bipartite Matching} problem: Given two rooted trees $T_1=(V_1,E_1)$, $T_2=(V_2,E_2)$ and a weight function $w: V_1\\times V_2 \\mapsto \\mathbb{R}_+$, find a maximum weight matching $\\mathcal{M}$ between nodes of the two trees, such that

  14. Understanding individual routing behaviour.

    Science.gov (United States)

    Lima, Antonio; Stanojevic, Rade; Papagiannaki, Dina; Rodriguez, Pablo; González, Marta C

    2016-03-01

    Knowing how individuals move between places is fundamental to advance our understanding of human mobility (González et al. 2008 Nature 453, 779-782. (doi:10.1038/nature06958)), improve our urban infrastructure (Prato 2009 J. Choice Model. 2, 65-100. (doi:10.1016/S1755-5345(13)70005-8)) and drive the development of transportation systems. Current route-choice models that are used in transportation planning are based on the widely accepted assumption that people follow the minimum cost path (Wardrop 1952 Proc. Inst. Civ. Eng. 1, 325-362. (doi:10.1680/ipeds.1952.11362)), despite little empirical support. Fine-grained location traces collected by smart devices give us today an unprecedented opportunity to learn how citizens organize their travel plans into a set of routes, and how similar behaviour patterns emerge among distinct individual choices. Here we study 92 419 anonymized GPS trajectories describing the movement of personal cars over an 18-month period. We group user trips by origin-destination and we find that most drivers use a small number of routes for their routine journeys, and tend to have a preferred route for frequent trips. In contrast to the cost minimization assumption, we also find that a significant fraction of drivers' routes are not optimal. We present a spatial probability distribution that bounds the route selection space within an ellipse, having the origin and the destination as focal points, characterized by high eccentricity independent of the scale. While individual routing choices are not captured by path optimization, their spatial bounds are similar, even for trips performed by distinct individuals and at various scales. These basic discoveries can inform realistic route-choice models that are not based on optimization, having an impact on several applications, such as infrastructure planning, routing recommendation systems and new mobility solutions. © 2016 The Author(s).

  15. Routing architecture and security for airborne networks

    Science.gov (United States)

    Deng, Hongmei; Xie, Peng; Li, Jason; Xu, Roger; Levy, Renato

    2009-05-01

    Airborne networks are envisioned to provide interconnectivity for terrestial and space networks by interconnecting highly mobile airborne platforms. A number of military applications are expected to be used by the operator, and all these applications require proper routing security support to establish correct route between communicating platforms in a timely manner. As airborne networks somewhat different from traditional wired and wireless networks (e.g., Internet, LAN, WLAN, MANET, etc), security aspects valid in these networks are not fully applicable to airborne networks. Designing an efficient security scheme to protect airborne networks is confronted with new requirements. In this paper, we first identify a candidate routing architecture, which works as an underlying structure for our proposed security scheme. And then we investigate the vulnerabilities and attack models against routing protocols in airborne networks. Based on these studies, we propose an integrated security solution to address routing security issues in airborne networks.

  16. User habits and multimodal route planning

    Directory of Open Access Journals (Sweden)

    Géza Katona

    2017-10-01

    Full Text Available The results of route planning researches are monitored by logistic and automotive industries. The economic aspects of the cost saving are in the focus of the attention. An optimal route could cause time or fuel savings. An effective driving or an optimal route is a good basis to achieve an economical aim. Moreover the spread of new automotive solutions especially in case of electric cars the optimisation has particular significance regarding the limited battery storage. Additionally the autonomous car development could not be neglected. As a result the society could expect safer roads, better space usage and effective resource management. Nevertheless the requirements of users are extremely diverse, which is not negligible. Supporting these aims, in this paper the connection between the multimodal route planning and the user requirements are investigated. The examination is focused to a sensitivity analysis and a survey to evaluate the data and support the settings of a user habit effect to the final route.

  17. Emission control with route optimization in solid waste collection ...

    Indian Academy of Sciences (India)

    system is used, route distance and route time will be decreased by 24·6% and. 44·3% as ... Keywords. Exhaust emission; route optimization; solid waste collection; GIS, .... Catchment areas for a sales campaign can be analysed. Customers ...

  18. Constraining neutrinoless double beta decay

    International Nuclear Information System (INIS)

    Dorame, L.; Meloni, D.; Morisi, S.; Peinado, E.; Valle, J.W.F.

    2012-01-01

    A class of discrete flavor-symmetry-based models predicts constrained neutrino mass matrix schemes that lead to specific neutrino mass sum-rules (MSR). We show how these theories may constrain the absolute scale of neutrino mass, leading in most of the cases to a lower bound on the neutrinoless double beta decay effective amplitude.

  19. Routes and Stations

    Data.gov (United States)

    Department of Homeland Security — he Routes_Stations table is composed of fixed rail transit systems within the Continental United States, Alaska, Hawaii, the District of Columbia, and Puerto Rico....

  20. Routed planar networks

    Directory of Open Access Journals (Sweden)

    David J. Aldous

    2016-04-01

    Full Text Available Modeling a road network as a planar graph seems very natural. However, in studying continuum limits of such networks it is useful to take {\\em routes} rather than {\\em edges} as primitives. This article is intended to introduce the relevant (discrete setting notion of {\\em routed network} to graph theorists. We give a naive classification of all 71 topologically different such networks on 4 leaves, and pose a variety of challenging research questions.

  1. Terrestrial Sagnac delay constraining modified gravity models

    Science.gov (United States)

    Karimov, R. Kh.; Izmailov, R. N.; Potapov, A. A.; Nandi, K. K.

    2018-04-01

    Modified gravity theories include f(R)-gravity models that are usually constrained by the cosmological evolutionary scenario. However, it has been recently shown that they can also be constrained by the signatures of accretion disk around constant Ricci curvature Kerr-f(R0) stellar sized black holes. Our aim here is to use another experimental fact, viz., the terrestrial Sagnac delay to constrain the parameters of specific f(R)-gravity prescriptions. We shall assume that a Kerr-f(R0) solution asymptotically describes Earth's weak gravity near its surface. In this spacetime, we shall study oppositely directed light beams from source/observer moving on non-geodesic and geodesic circular trajectories and calculate the time gap, when the beams re-unite. We obtain the exact time gap called Sagnac delay in both cases and expand it to show how the flat space value is corrected by the Ricci curvature, the mass and the spin of the gravitating source. Under the assumption that the magnitude of corrections are of the order of residual uncertainties in the delay measurement, we derive the allowed intervals for Ricci curvature. We conclude that the terrestrial Sagnac delay can be used to constrain the parameters of specific f(R) prescriptions. Despite using the weak field gravity near Earth's surface, it turns out that the model parameter ranges still remain the same as those obtained from the strong field accretion disk phenomenon.

  2. Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Kashif Saleem

    2016-03-01

    Full Text Available The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs composed of various miniature resource-constrained wireless sensor nodes. The development of routing protocols for WSNs is a major challenge because of their severe resource constraints, ad hoc topology and dynamic nature. Among those proposed routing protocols, the biology-inspired self-organized secure autonomous routing protocol (BIOSARP involves an artificial immune system (AIS that requires a certain amount of time to build up knowledge of neighboring nodes. The AIS algorithm uses this knowledge to distinguish between self and non-self neighboring nodes. The knowledge-building phase is a critical period in the WSN lifespan and requires active security measures. This paper proposes an enhanced BIOSARP (E-BIOSARP that incorporates a random key encryption mechanism in a cost-effective manner to provide active security measures in WSNs. A detailed description of E-BIOSARP is presented, followed by an extensive security and performance analysis to demonstrate its efficiency. A scenario with E-BIOSARP is implemented in network simulator 2 (ns-2 and is populated with malicious nodes for analysis. Furthermore, E-BIOSARP is compared with state-of-the-art secure routing protocols in terms of processing time, delivery ratio, energy consumption, and packet overhead. The findings show that the proposed mechanism can efficiently protect WSNs from selective forwarding, brute-force or exhaustive key search, spoofing, eavesdropping, replaying or altering of routing information, cloning, acknowledgment spoofing, HELLO flood attacks, and Sybil attacks.

  3. On line routing per mobile phone

    DEFF Research Database (Denmark)

    Bieding, Thomas; Görtz, Simon; Klose, Andreas

    2009-01-01

    On-line routing is concerned with building vehicle routes in an ongoing fashion in such a way that customer requests arriving dynamically in time are efficiently and effectively served. An indispensable prerequisite for applying on-line routing methods is mobile communication technology....... Additionally it is of utmost importance that the employed communication system is suitable integrated with the firm’s enterprise application system and business processes. On basis of a case study, we describe in this paper a system that is cheap and easy to implement due to the use of simple mobile phones...

  4. Constrained evolution in numerical relativity

    Science.gov (United States)

    Anderson, Matthew William

    The strongest potential source of gravitational radiation for current and future detectors is the merger of binary black holes. Full numerical simulation of such mergers can provide realistic signal predictions and enhance the probability of detection. Numerical simulation of the Einstein equations, however, is fraught with difficulty. Stability even in static test cases of single black holes has proven elusive. Common to unstable simulations is the growth of constraint violations. This work examines the effect of controlling the growth of constraint violations by solving the constraints periodically during a simulation, an approach called constrained evolution. The effects of constrained evolution are contrasted with the results of unconstrained evolution, evolution where the constraints are not solved during the course of a simulation. Two different formulations of the Einstein equations are examined: the standard ADM formulation and the generalized Frittelli-Reula formulation. In most cases constrained evolution vastly improves the stability of a simulation at minimal computational cost when compared with unconstrained evolution. However, in the more demanding test cases examined, constrained evolution fails to produce simulations with long-term stability in spite of producing improvements in simulation lifetime when compared with unconstrained evolution. Constrained evolution is also examined in conjunction with a wide variety of promising numerical techniques, including mesh refinement and overlapping Cartesian and spherical computational grids. Constrained evolution in boosted black hole spacetimes is investigated using overlapping grids. Constrained evolution proves to be central to the host of innovations required in carrying out such intensive simulations.

  5. A Preemptive Link State Spanning Tree Source Routing Scheme for Opportunistic Data Forwarding in MANET

    OpenAIRE

    R. Poonkuzhali; M. Y. Sanavullah; A. Sabari

    2014-01-01

    Opportunistic Data Forwarding (ODF) has drawn much attention in mobile adhoc networking research in recent years. The effectiveness of ODF in MANET depends on a suitable routing protocol which provides a powerful source routing services. PLSR is featured by source routing, loop free and small routing overhead. The update messages in PLSR are integrated into a tree structure and no need to time stamp routing updates which reduces the routing overhead.

  6. Coordinated Platoon Routing in a Metropolitan Network

    Energy Technology Data Exchange (ETDEWEB)

    Larson, Jeffrey; Munson, Todd; Sokolov, Vadim

    2016-10-10

    Platooning vehicles—connected and automated vehicles traveling with small intervehicle distances—use less fuel because of reduced aerodynamic drag. Given a network de- fined by vertex and edge sets and a set of vehicles with origin/destination nodes/times, we model and solve the combinatorial optimization problem of coordinated routing of vehicles in a manner that routes them to their destination on time while using the least amount of fuel. Common approaches decompose the platoon coordination and vehicle routing into separate problems. Our model addresses both problems simultaneously to obtain the best solution. We use modern modeling techniques and constraints implied from analyzing the platoon routing problem to address larger numbers of vehicles and larger networks than previously considered. While the numerical method used is unable to certify optimality for candidate solutions to all networks and parameters considered, we obtain excellent solutions in approximately one minute for much larger networks and vehicle sets than previously considered in the literature.

  7. Nonradiative Decay Route of Cinnamate Derivatives Studied by Frequency and Time Domain Laser Spectroscopy in the Gas Phase, Matrix Isolation FTIR Spectroscopy and Quantum Chemical Calculations

    Science.gov (United States)

    Ebata, Takayuki

    2017-06-01

    The nonraddiative dececy route involving trans → cis photo-isomerization from the S_1 (ππ*) state has been investigated for several trans-cinnamate derivatives, which are known as sunscreen reagents. We examined two types of substitution effects. One is structural isomer such as ortho-, meta-, and para-hydroxy-methylcinnmate (o-, m-, p-HMC). The S_1 lifetime of p-HMC is less than 8 ps at zero-point level, and it undergoes rapid S_1 → ^1nπ* → T_1 decay via multiple conical intersections. Finally, the trans → cis isomerization proceeds in the T_1 state. On the other hand, both o- and m-HMC show very slow decay. Their S_1 lifetimes are in the order of 100 ps even at the excess energy of 2000-3000 \\wn. The other is the effect of the complexity of ester group in para-subsitituted species, such as para-methoxy-methyl, -ethyl and -2ethylhexyl cinnamate (p-MMC, p-MEC, p-M2EHC). p-MMC and p-MEC show sharp S_0 → S_1 (ππ*) vibronic bands, while p-M2EHC shows only broad structureless feature even under the jet-cooled condition. In addition, we found that the S_0 → ^1nπ* absorption appears at 1000 \\wn below the S_0 → S_1 (ππ*) transition in p-MEC and p-M2EHC, but not in p-MMC. Thus, the complexity of the ester group is very important for the appearance of the ^1nπ* state.

  8. Identification of Robust Terminal-Area Routes in Convective Weather

    Science.gov (United States)

    Pfeil, Diana Michalek; Balakrishnan, Hamsa

    2012-01-01

    Convective weather is responsible for large delays and widespread disruptions in the U.S. National Airspace System, especially during summer. Traffic flow management algorithms require reliable forecasts of route blockage to schedule and route traffic. This paper demonstrates how raw convective weather forecasts, which provide deterministic predictions of the vertically integrated liquid (the precipitation content in a column of airspace) can be translated into probabilistic forecasts of whether or not a terminal area route will be blocked. Given a flight route through the terminal area, we apply techniques from machine learning to determine the likelihood that the route will be open in actual weather. The likelihood is then used to optimize terminalarea operations by dynamically moving arrival and departure routes to maximize the expected capacity of the terminal area. Experiments using real weather scenarios on stormy days show that our algorithms recommend that a terminal-area route be modified 30% of the time, opening up 13% more available routes that were forecast to be blocked during these scenarios. The error rate is low, with only 5% of cases corresponding to a modified route being blocked in reality, whereas the original route is in fact open. In addition, for routes predicted to be open with probability 0.95 or greater by our method, 96% of these routes (on average over time horizon) are indeed open in the weather that materializes

  9. Efficient Networks Communication Routing Using Swarm Intelligence

    OpenAIRE

    Koushal Kumar

    2012-01-01

    As demonstrated by natural biological swarm’s collective intelligence has an abundance of desirable properties for problem-solving like in network routing. The focus of this paper is in the applications of swarm based intelligence in information routing for communication networks. As we know networks are growing and adopting new platforms as new technologies comes. Also according to new demands and requirements networks topologies and its complexity is increasing with time. Thus it is becomin...

  10. Hyperbolicity and constrained evolution in linearized gravity

    International Nuclear Information System (INIS)

    Matzner, Richard A.

    2005-01-01

    Solving the 4-d Einstein equations as evolution in time requires solving equations of two types: the four elliptic initial data (constraint) equations, followed by the six second order evolution equations. Analytically the constraint equations remain solved under the action of the evolution, and one approach is to simply monitor them (unconstrained evolution). Since computational solution of differential equations introduces almost inevitable errors, it is clearly 'more correct' to introduce a scheme which actively maintains the constraints by solution (constrained evolution). This has shown promise in computational settings, but the analysis of the resulting mixed elliptic hyperbolic method has not been completely carried out. We present such an analysis for one method of constrained evolution, applied to a simple vacuum system, linearized gravitational waves. We begin with a study of the hyperbolicity of the unconstrained Einstein equations. (Because the study of hyperbolicity deals only with the highest derivative order in the equations, linearization loses no essential details.) We then give explicit analytical construction of the effect of initial data setting and constrained evolution for linearized gravitational waves. While this is clearly a toy model with regard to constrained evolution, certain interesting features are found which have relevance to the full nonlinear Einstein equations

  11. Collective network routing

    Science.gov (United States)

    Hoenicke, Dirk

    2014-12-02

    Disclosed are a unified method and apparatus to classify, route, and process injected data packets into a network so as to belong to a plurality of logical networks, each implementing a specific flow of data on top of a common physical network. The method allows to locally identify collectives of packets for local processing, such as the computation of the sum, difference, maximum, minimum, or other logical operations among the identified packet collective. Packets are injected together with a class-attribute and an opcode attribute. Network routers, employing the described method, use the packet attributes to look-up the class-specific route information from a local route table, which contains the local incoming and outgoing directions as part of the specifically implemented global data flow of the particular virtual network.

  12. Multihop Wireless Networks Opportunistic Routing

    CERN Document Server

    Zeng, Kai; Li, Ming

    2011-01-01

    This book provides an introduction to opportunistic routing an emerging technology designed to improve the packet forwarding reliability, network capacity and energy efficiency of multihop wireless networks This book presents a comprehensive background to the technological challenges lying behind opportunistic routing. The authors cover many fundamental research issues for this new concept, including the basic principles, performance limit and performance improvement of opportunistic routing compared to traditional routing, energy efficiency and distributed opportunistic routing protocol desig

  13. Lightweight cryptography for constrained devices

    DEFF Research Database (Denmark)

    Alippi, Cesare; Bogdanov, Andrey; Regazzoni, Francesco

    2014-01-01

    Lightweight cryptography is a rapidly evolving research field that responds to the request for security in resource constrained devices. This need arises from crucial pervasive IT applications, such as those based on RFID tags where cost and energy constraints drastically limit the solution...... complexity, with the consequence that traditional cryptography solutions become too costly to be implemented. In this paper, we survey design strategies and techniques suitable for implementing security primitives in constrained devices....

  14. Online constrained model-based reinforcement learning

    CSIR Research Space (South Africa)

    Van Niekerk, B

    2017-08-01

    Full Text Available Constrained Model-based Reinforcement Learning Benjamin van Niekerk School of Computer Science University of the Witwatersrand South Africa Andreas Damianou∗ Amazon.com Cambridge, UK Benjamin Rosman Council for Scientific and Industrial Research, and School... MULTIPLE SHOOTING Using direct multiple shooting (Bock and Plitt, 1984), problem (1) can be transformed into a structured non- linear program (NLP). First, the time horizon [t0, t0 + T ] is partitioned into N equal subintervals [tk, tk+1] for k = 0...

  15. Integrating routing decisions in public transportation problems

    CERN Document Server

    Schmidt, Marie E

    2014-01-01

    This book treats three planning problems arising in public railway transportation planning: line planning, timetabling, and delay management, with the objective to minimize passengers’ travel time. While many optimization approaches simplify these problems by assuming that passengers’ route choice is independent of the solution, this book focuses on models which take into account that passengers will adapt their travel route to the implemented planning solution. That is, a planning solution and passengers’ routes are determined and evaluated simultaneously. This work is technically deep, with insightful findings regarding complexity and algorithmic approaches to public transportation problems with integrated passenger routing. It is intended for researchers in the fields of mathematics, computer science, or operations research, working in the field of public transportation from an optimization standpoint. It is also ideal for students who want to gain intuition and experience in doing complexity proofs ...

  16. Quantum chemistry-assisted synthesis route development

    International Nuclear Information System (INIS)

    Hori, Kenji; Sumimoto, Michinori; Murafuji, Toshihiro

    2015-01-01

    We have been investigating “quantum chemistry-assisted synthesis route development” using in silico screenings and applied the method to several targets. Another example was conducted to develop synthesis routes for a urea derivative, namely 1-(4-(trifluoromethyl)-2-oxo-2H-chromen-7-yl)urea. While five synthesis routes were examined, only three routes passed the second in silico screening. Among them, the reaction of 7-amino-4-(trifluoromethyl)-2H-chromen-2-one and O-methyl carbamate with BF 3 as an additive was ranked as the first choice for synthetic work. We were able to experimentally obtain the target compound even though its yield was as low as 21 %. The theoretical result was thus consistent with that observed. The summary of transition state data base (TSDB) is also provided. TSDB is the key to reducing time of in silico screenings

  17. The Route Analysis Based On Flight Plan

    Science.gov (United States)

    Feriyanto, Nur; Saleh, Chairul; Fauzi, Achmad; Rachman Dzakiyullah, Nur; Riza Iwaputra, Kahfi

    2016-02-01

    Economic development effects use of air transportation since the business process in every aspect was increased. Many people these days was prefer using airplane because it can save time and money. This situation also effects flight routes, many airlines offer new routes to deal with competition. Managing flight routes is one of the problems that must be faced in order to find the efficient and effective routes. This paper investigates the best routes based on flight performance by determining the amount of block fuel for the Jakarta-Denpasar flight route. Moreover, in this work compares a two kinds of aircraft and tracks by calculating flight distance, flight time and block fuel. The result shows Jakarta-Denpasar in the Track II has effective and efficient block fuel that can be performed by Airbus 320-200 aircraft. This study can contribute to practice in making an effective decision, especially helping executive management of company due to selecting appropriate aircraft and the track in the flight plan based on the block fuel consumption for business operation.

  18. Whirlpool routing for mobility

    KAUST Repository

    Lee, Jung Woo

    2010-01-01

    We present the Whirlpool Routing Protocol (WARP), which efficiently routes data to a node moving within a static mesh. The key insight in WARP\\'s design is that data traffic can use an existing routing gradient to efficiently probe the topology, repair the routing gradient, and communicate these repairs to nearby nodes. Using simulation, controlled testbeds, and real mobility experiments, we find that using the data plane for topology maintenance is highly effective due to the incremental nature of mobility updates. WARP leverages the fact that converging flows at a destination make the destination have the region of highest traffic. We provide a theoretical basis for WARP\\'s behavior, defining an "update area" in which the topology must adjust when a destination moves. As long as packets arrive at a destination before it moves outside of the update area, WARP can repair the topology using the data plane. Compared to existing protocols, such as DYMO and HYPER, WARP\\'s packet drop rate is up to 90% lower while sending up to 90% fewer packets.

  19. SET-Routes programme

    CERN Multimedia

    Marietta Schupp, EMBL Photolab

    2008-01-01

    Dr Sabine Hentze, specialist in human genetics, giving an Insight Lecture entitled "Human Genetics – Diagnostics, Indications and Ethical Issues" on 23 September 2008 at EMBL Heidelberg. Activities in a achool in Budapest during a visit of Angela Bekesi, Ambassadors for the SET-Routes programme.

  20. Real-time immune-inspired optimum state-of-charge trajectory estimation using upcoming route information preview and neural networks for plug-in hybrid electric vehicles fuel economy

    Science.gov (United States)

    Mozaffari, Ahmad; Vajedi, Mahyar; Azad, Nasser L.

    2015-06-01

    The main proposition of the current investigation is to develop a computational intelligence-based framework which can be used for the real-time estimation of optimum battery state-of-charge (SOC) trajectory in plug-in hybrid electric vehicles (PHEVs). The estimated SOC trajectory can be then employed for an intelligent power management to significantly improve the fuel economy of the vehicle. The devised intelligent SOC trajectory builder takes advantage of the upcoming route information preview to achieve the lowest possible total cost of electricity and fossil fuel. To reduce the complexity of real-time optimization, the authors propose an immune system-based clustering approach which allows categorizing the route information into a predefined number of segments. The intelligent real-time optimizer is also inspired on the basis of interactions in biological immune systems, and is called artificial immune algorithm (AIA). The objective function of the optimizer is derived from a computationally efficient artificial neural network (ANN) which is trained by a database obtained from a high-fidelity model of the vehicle built in the Autonomie software. The simulation results demonstrate that the integration of immune inspired clustering tool, AIA and ANN, will result in a powerful framework which can generate a near global optimum SOC trajectory for the baseline vehicle, that is, the Toyota Prius PHEV. The outcomes of the current investigation prove that by taking advantage of intelligent approaches, it is possible to design a computationally efficient and powerful SOC trajectory builder for the intelligent power management of PHEVs.

  1. Development of safe routes for children in urban environment

    Science.gov (United States)

    Koryagin, M. E.; Medvedev, V. I.; Strykov, P. G.

    2018-01-01

    The matter of development of safe travel routes for children between school and home is analyzed. The availability of various applications and devices to identify the location of the child and his/her travel routes is noted. The main factors to be taken into account when planning children travel routes are described. The most popular Russian services for route planning, Google, Yandex, and 2GIS, are discussed. These services are shown to have a number of shortcomings which does not allow them to choose really safe routes. A decision on making the route selection by two criteria (the travel time and the probability of an accident) is obtained. As a numerical example, the Pareto area for possible routes is constructed.

  2. Cost and time models for the evaluation of intermodal chains by using short sea shipping in the North Sea Region: the Rosyth-Zeebrugge route

    DEFF Research Database (Denmark)

    Lopez, Alba Martínez; Kronbak, Jacob; Jiang, Liping

    2015-01-01

    This paper is framed in the context of the EU Interreg IVB North Sea Region project Food Port. In line with this project, this paper aims to define mathematically cost and time models able to provide realistic information about the performances of road haulage and of intermodal chains using short...

  3. Cosmogenic photons strongly constrain UHECR source models

    Directory of Open Access Journals (Sweden)

    van Vliet Arjen

    2017-01-01

    Full Text Available With the newest version of our Monte Carlo code for ultra-high-energy cosmic ray (UHECR propagation, CRPropa 3, the flux of neutrinos and photons due to interactions of UHECRs with extragalactic background light can be predicted. Together with the recently updated data for the isotropic diffuse gamma-ray background (IGRB by Fermi LAT, it is now possible to severely constrain UHECR source models. The evolution of the UHECR sources especially plays an important role in the determination of the expected secondary photon spectrum. Pure proton UHECR models are already strongly constrained, primarily by the highest energy bins of Fermi LAT’s IGRB, as long as their number density is not strongly peaked at recent times.

  4. Energy-Aware Routing Protocol for Ad Hoc Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Mann Raminder P

    2005-01-01

    Full Text Available Wireless ad hoc sensor networks differ from wireless ad hoc networks from the following perspectives: low energy, lightweight routing protocols, and adaptive communication patterns. This paper proposes an energy-aware routing protocol (EARP suitable for ad hoc wireless sensor networks and presents an analysis for its energy consumption in various phases of route discovery and maintenance. Based on the energy consumption associated with route request processing, EARP advocates the minimization of route requests by allocating dynamic route expiry times. This paper introduces a unique mechanism for estimation of route expiry time based on the probability of route validity, which is a function of time, number of hops, and mobility parameters. In contrast to AODV, EARP reduces the repeated flooding of route requests by maintaining valid routes for longer durations.

  5. Novel route for rapid sol-gel synthesis of hydroxyapatite, avoiding ageing and using fast drying with a 50-fold to 200-fold reduction in process time

    Energy Technology Data Exchange (ETDEWEB)

    Ben-Arfa, Basam A.E.; Salvado, Isabel M. Miranda, E-mail: isabelmsalvado@ua.pt; Ferreira, José M.F.; Pullar, Robert C., E-mail: rpullar@ua.pt

    2017-01-01

    We have developed an innovative, rapid sol-gel method of producing hydroxyapatite nanopowders that avoids the conventional lengthy ageing and drying processes (over a week), being 200 times quicker in comparison to conventional aqueous sol-gel preparation, and 50 times quicker than ethanol based sol-gel synthesis. Two different sets of experimental conditions, in terms of pH value (5.5 and 7.5), synthesis temperature (45 and 90 °C), drying temperature (60 and 80 °C) and calcination temperature (400 and 700 °C) were explored. The products were characterised by X-ray diffraction (XRD) Fourier-transform infrared spectroscopy (FTIR), scanning electron microscopy (SEM) and specific surface area (SSA) measurements. Pure hydroxyapatite (Ca{sub 10}(PO{sub 4}){sub 6}(OH){sub 2}, HAp) was obtained for the powders synthesised at pH 7.5 and calcined at 400 °C, while biphasic mixtures of HAp/β-tricalcium phosphate (β-Ca{sub 3}(PO{sub 4}){sub 2}, TCP) were produced at pH 5.5 and (pH 7.5 at elevated temperature). The novel rapid drying was up to 200 times faster than conventional drying, only needing 1 h with no prior ageing step, and favoured the formation of smaller/finer nanopowders, while producing pure HAp or phase mixtures virtually identical to those obtained from the slow conventional drying method, despite the absence of a slow ageing process. The products of this novel rapid process were actually shown to have smaller crystallite sizes and larger SSA, which should result in increased bioactivity. - Highlights: • Fast, novel sol-gel synthesis of HAp nanopowders, requiring just 1 h for drying • A much shortened process, 200 times faster than the usual slow drying/ageing times • Compares rapidly produced HAp with that from a typical 216 h drying/ageing process • Both methods produce very similar products, but rapid HAp had a larger surface area. • Both methods produced pure HAp at 400 °C, and a HAp/TCP mix at 700 °C.

  6. British Dance: Black Routes

    OpenAIRE

    Adair, C.; Burt, Ramsay, 1953-

    2016-01-01

    British Dance: Black Routes re-examines the distinctive contributions made to British dance by dancers who are Black. Covering the period 1946 to the present, it presents a radical re-reading of dancers and their companies, placing their achievements within a broader historical, cultural and artistic context. The result of a two year research project, British Dance and the African Diaspora, led by editors Christy Adair and Ramsay Burt, the collection looks at artists working with contempor...

  7. Preparation and biological evaluation of conformationally constrained BACE1 inhibitors.

    Science.gov (United States)

    Winneroski, Leonard L; Schiffler, Matthew A; Erickson, Jon A; May, Patrick C; Monk, Scott A; Timm, David E; Audia, James E; Beck, James P; Boggs, Leonard N; Borders, Anthony R; Boyer, Robert D; Brier, Richard A; Hudziak, Kevin J; Klimkowski, Valentine J; Garcia Losada, Pablo; Mathes, Brian M; Stout, Stephanie L; Watson, Brian M; Mergott, Dustin J

    2015-07-01

    The BACE1 enzyme is a key target for Alzheimer's disease. During our BACE1 research efforts, fragment screening revealed that bicyclic thiazine 3 had low millimolar activity against BACE1. Analysis of the co-crystal structure of 3 suggested that potency could be increased through extension toward the S3 pocket and through conformational constraint of the thiazine core. Pursuit of S3-binding groups produced low micromolar inhibitor 6, which informed the S3-design for constrained analogs 7 and 8, themselves prepared via independent, multi-step synthetic routes. Biological characterization of BACE inhibitors 6-8 is described. Copyright © 2015 Elsevier Ltd. All rights reserved.

  8. Indoor 3D Route Modeling Based On Estate Spatial Data

    Science.gov (United States)

    Zhang, H.; Wen, Y.; Jiang, J.; Huang, W.

    2014-04-01

    Indoor three-dimensional route model is essential for space intelligence navigation and emergency evacuation. This paper is motivated by the need of constructing indoor route model automatically and as far as possible. By comparing existing building data sources, this paper firstly explained the reason why the estate spatial management data is chosen as the data source. Then, an applicable method of construction three-dimensional route model in a building is introduced by establishing the mapping relationship between geographic entities and their topological expression. This data model is a weighted graph consist of "node" and "path" to express the spatial relationship and topological structure of a building components. The whole process of modelling internal space of a building is addressed by two key steps: (1) each single floor route model is constructed, including path extraction of corridor using Delaunay triangulation algorithm with constrained edge, fusion of room nodes into the path; (2) the single floor route model is connected with stairs and elevators and the multi-floor route model is eventually generated. In order to validate the method in this paper, a shopping mall called "Longjiang New City Plaza" in Nanjing is chosen as a case of study. And the whole building space is constructed according to the modelling method above. By integrating of existing path finding algorithm, the usability of this modelling method is verified, which shows the indoor three-dimensional route modelling method based on estate spatial data in this paper can support indoor route planning and evacuation route design very well.

  9. Novel route for rapid sol-gel synthesis of hydroxyapatite, avoiding ageing and using fast drying with a 50-fold to 200-fold reduction in process time.

    Science.gov (United States)

    Ben-Arfa, Basam A E; Salvado, Isabel M Miranda; Ferreira, José M F; Pullar, Robert C

    2017-01-01

    We have developed an innovative, rapid sol-gel method of producing hydroxyapatite nanopowders that avoids the conventional lengthy ageing and drying processes (over a week), being 200 times quicker in comparison to conventional aqueous sol-gel preparation, and 50 times quicker than ethanol based sol-gel synthesis. Two different sets of experimental conditions, in terms of pH value (5.5 and 7.5), synthesis temperature (45 and 90°C), drying temperature (60 and 80°C) and calcination temperature (400 and 700°C) were explored. The products were characterised by X-ray diffraction (XRD) Fourier-transform infrared spectroscopy (FTIR), scanning electron microscopy (SEM) and specific surface area (SSA) measurements. Pure hydroxyapatite (Ca 10 (PO 4 ) 6 (OH) 2 , HAp) was obtained for the powders synthesised at pH7.5 and calcined at 400°C, while biphasic mixtures of HAp/β-tricalcium phosphate (β-Ca 3 (PO 4 ) 2 , TCP) were produced at pH5.5 and (pH7.5 at elevated temperature). The novel rapid drying was up to 200 times faster than conventional drying, only needing 1h with no prior ageing step, and favoured the formation of smaller/finer nanopowders, while producing pure HAp or phase mixtures virtually identical to those obtained from the slow conventional drying method, despite the absence of a slow ageing process. The products of this novel rapid process were actually shown to have smaller crystallite sizes and larger SSA, which should result in increased bioactivity. Copyright © 2016 Elsevier B.V. All rights reserved.

  10. Low Carbon Footprint Routes for Bird Watching

    Directory of Open Access Journals (Sweden)

    Wei-Ta Fang

    2015-03-01

    Full Text Available Bird watching is one of many recreational activities popular in ecotourism. Its popularity, therefore, prompts the need for studies on energy conservation. One such environmentally friendly approach toward minimizing bird watching’s ecological impact is ensuring a reduced carbon footprint by using an economic travel itinerary comprising a series of connected routes between tourist attractions that minimizes transit time. This study used a travel-route planning approach using geographic information systems to detect the shortest path, thereby solving the problems associated with time-consuming transport. Based on the results of road network analyses, optimal travel-route planning can be determined. These methods include simulated annealing (SA and genetic algorithms (GA. We applied two algorithms in our simulation research to detect which one is an appropriate algorithm for running carbon-routing algorithms at the regional scale. SA, which is superior to GA, is considered an excellent approach to search for the optimal path to reduce carbon dioxide and high gasoline fees, thereby controlling travel time by using the shortest travel routes.

  11. A Hybrid Column Generation and Clustering Approach to the School Bus Routing Problem with Time WindowsUn Aproximación Híbrida de Generación de Columnas y Agrupación para Resolver el Problema de Ruteo de Buses Escolares con Ventanas deTiempo

    Directory of Open Access Journals (Sweden)

    Eduyn Ramiro Lopez Santana

    2015-03-01

    Full Text Available This paper attempts to solve the School Bus Routing Problem with Time Windows that consists of finding the best set of routes to pick up students distributed geographically with constraints as capacity, time windows and maximum travel time. We formulated the problem as a classic Vehicle Routing Problem with Time Windows and solved it using an approach based on a clustering algorithm and column generation method. A real world case from a school in Bogotá, Colombiais presented including 600 students to pick up in near 400 nodes located in urban and rural areas. The obtained results demonstrate a reduction as the problem’s complexity and  an improvement on the performance measures of the proposed method.

  12. Constraining the mass of the Local Group

    Science.gov (United States)

    Carlesi, Edoardo; Hoffman, Yehuda; Sorce, Jenny G.; Gottlöber, Stefan

    2017-03-01

    The mass of the Local Group (LG) is a crucial parameter for galaxy formation theories. However, its observational determination is challenging - its mass budget is dominated by dark matter that cannot be directly observed. To meet this end, the posterior distributions of the LG and its massive constituents have been constructed by means of constrained and random cosmological simulations. Two priors are assumed - the Λ cold dark matter model that is used to set up the simulations, and an LG model that encodes the observational knowledge of the LG and is used to select LG-like objects from the simulations. The constrained simulations are designed to reproduce the local cosmography as it is imprinted on to the Cosmicflows-2 data base of velocities. Several prescriptions are used to define the LG model, focusing in particular on different recent estimates of the tangential velocity of M31. It is found that (a) different vtan choices affect the peak mass values up to a factor of 2, and change mass ratios of MM31 to MMW by up to 20 per cent; (b) constrained simulations yield more sharply peaked posterior distributions compared with the random ones; (c) LG mass estimates are found to be smaller than those found using the timing argument; (d) preferred Milky Way masses lie in the range of (0.6-0.8) × 1012 M⊙; whereas (e) MM31 is found to vary between (1.0-2.0) × 1012 M⊙, with a strong dependence on the vtan values used.

  13. Constraining walking and custodial technicolor

    DEFF Research Database (Denmark)

    Foadi, Roshan; Frandsen, Mads Toudal; Sannino, Francesco

    2008-01-01

    We show how to constrain the physical spectrum of walking technicolor models via precision measurements and modified Weinberg sum rules. We also study models possessing a custodial symmetry for the S parameter at the effective Lagrangian level-custodial technicolor-and argue that these models...

  14. Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges

    Science.gov (United States)

    Radi, Marjan; Dezfouli, Behnam; Bakar, Kamalrulnizam Abu; Lee, Malrey

    2012-01-01

    A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks. PMID:22368490

  15. Multipath routing in wireless sensor networks: survey and research challenges.

    Science.gov (United States)

    Radi, Marjan; Dezfouli, Behnam; Abu Bakar, Kamalrulnizam; Lee, Malrey

    2012-01-01

    A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks.

  16. RECOVERY ACT: DYNAMIC ENERGY CONSUMPTION MANAGEMENT OF ROUTING TELECOM AND DATA CENTERS THROUGH REAL-TIME OPTIMAL CONTROL (RTOC): Final Scientific/Technical Report

    Energy Technology Data Exchange (ETDEWEB)

    Ron Moon

    2011-06-30

    This final scientific report documents the Industrial Technology Program (ITP) Stage 2 Concept Development effort on Data Center Energy Reduction and Management Through Real-Time Optimal Control (RTOC). Society is becoming increasingly dependent on information technology systems, driving exponential growth in demand for data center processing and an insatiable appetite for energy. David Raths noted, 'A 50,000-square-foot data center uses approximately 4 megawatts of power, or the equivalent of 57 barrels of oil a day1.' The problem has become so severe that in some cases, users are giving up raw performance for a better balance between performance and energy efficiency. Historically, power systems for data centers were crudely sized to meet maximum demand. Since many servers operate at 60%-90% of maximum power while only utilizing an average of 5% to 15% of their capability, there are huge inefficiencies in the consumption and delivery of power in these data centers. The goal of the 'Recovery Act: Decreasing Data Center Energy Use through Network and Infrastructure Control' is to develop a state of the art approach for autonomously and intelligently reducing and managing data center power through real-time optimal control. Advances in microelectronics and software are enabling the opportunity to realize significant data center power savings through the implementation of autonomous power management control algorithms. The first step to realizing these savings was addressed in this study through the successful creation of a flexible and scalable mathematical model (equation) for data center behavior and the formulation of an acceptable low technical risk market introduction strategy leveraging commercial hardware and software familiar to the data center market. Follow-on Stage 3 Concept Development efforts include predictive modeling and simulation of algorithm performance, prototype demonstrations with representative data center equipment to

  17. Cosmicflows Constrained Local UniversE Simulations

    Science.gov (United States)

    Sorce, Jenny G.; Gottlöber, Stefan; Yepes, Gustavo; Hoffman, Yehuda; Courtois, Helene M.; Steinmetz, Matthias; Tully, R. Brent; Pomarède, Daniel; Carlesi, Edoardo

    2016-01-01

    This paper combines observational data sets and cosmological simulations to generate realistic numerical replicas of the nearby Universe. The latter are excellent laboratories for studies of the non-linear process of structure formation in our neighbourhood. With measurements of radial peculiar velocities in the local Universe (cosmicflows-2) and a newly developed technique, we produce Constrained Local UniversE Simulations (CLUES). To assess the quality of these constrained simulations, we compare them with random simulations as well as with local observations. The cosmic variance, defined as the mean one-sigma scatter of cell-to-cell comparison between two fields, is significantly smaller for the constrained simulations than for the random simulations. Within the inner part of the box where most of the constraints are, the scatter is smaller by a factor of 2 to 3 on a 5 h-1 Mpc scale with respect to that found for random simulations. This one-sigma scatter obtained when comparing the simulated and the observation-reconstructed velocity fields is only 104 ± 4 km s-1, I.e. the linear theory threshold. These two results demonstrate that these simulations are in agreement with each other and with the observations of our neighbourhood. For the first time, simulations constrained with observational radial peculiar velocities resemble the local Universe up to a distance of 150 h-1 Mpc on a scale of a few tens of megaparsecs. When focusing on the inner part of the box, the resemblance with our cosmic neighbourhood extends to a few megaparsecs (<5 h-1 Mpc). The simulations provide a proper large-scale environment for studies of the formation of nearby objects.

  18. Power Balance AODV Routing Algorithm of WSN in Precision Agriculture Environment Monitoring

    Directory of Open Access Journals (Sweden)

    Xiaoqin Qin

    2013-11-01

    Full Text Available As one of important technologies of IOT (Internet of Things, WSN (Wireless Sensor Networks has been widely used in precision agriculture environment monitoring. WSN is a kind of energy-constrained network, but power balance is not taken into account in traditional routing protocols. A novel routing algorithm, named Power Balance Ad hoc On-Demand Distance Vector (PB-AODV, is proposed on cross-layer design. In the route discovery process of PB-AODV, routing path is established by the Received Signal Strength Indication (RSSI value. The optimal transmitting power, which is computed according to RSSI value, power threshold and node’s surplus energy, is encapsulated into Route Reply Packet. Hence, the sender node can adjust its transmission power to save energy according to the Route Reply Packet. Simulation results show that the proposed algorithm is effective for load balancing, and increases the WSN’s lifetime 14.3% consequently.

  19. Secure Geographic Routing in Ad Hoc and Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Zahariadis Theodore

    2010-01-01

    Full Text Available Security in sensor networks is one of the most relevant research topics in resource constrained wireless devices and networks. Several attacks can be suffered in ad hoc and wireless sensor networks (WSN, which are highly susceptible to attacks, due to the limited resources of the nodes. In this paper, we propose innovative and lightweight localization techniques that allow for intrusion identification and isolation schemes and provide accurate location information. This information is used by our routing protocol which additionally incorporates a distributed trust model to prevent several routing attacks to the network. We finally evaluate our algorithms for accurate localization and for secure routing which have been implemented and tested in real ad hoc and wireless sensor networks.

  20. Robustness of airline route networks

    Science.gov (United States)

    Lordan, Oriol; Sallan, Jose M.; Escorihuela, Nuria; Gonzalez-Prieto, David

    2016-03-01

    Airlines shape their route network by defining their routes through supply and demand considerations, paying little attention to network performance indicators, such as network robustness. However, the collapse of an airline network can produce high financial costs for the airline and all its geographical area of influence. The aim of this study is to analyze the topology and robustness of the network route of airlines following Low Cost Carriers (LCCs) and Full Service Carriers (FSCs) business models. Results show that FSC hubs are more central than LCC bases in their route network. As a result, LCC route networks are more robust than FSC networks.

  1. Elisabeth Badinter, Fausse route

    OpenAIRE

    Martin-Juchat, Fabienne

    2013-01-01

    Elisabeth Badinter, philosophe de formation, est l’auteure de nombreux ouvrages sur la condition féminine et les rapports hommes/femmes dans la société. Avec Fausse route, elle signe une vision polémique du féminisme occidental. Son ouvrage a suscité de nombreuses critiques de femmes dans diverses revues destinées au grand public. Hélène Strohl, recenseur de la revue Culture en mouvement, conclut que cet ouvrage est peu scientifique, sujet à caution : « Argument contre argument, amalgame cont...

  2. Analyzing multiday route choice behavior of commuters using GPS data

    Directory of Open Access Journals (Sweden)

    Wenyun Tang

    2016-02-01

    Full Text Available In this study, accurate global position system and geographic information system data were employed to reveal multiday routes people used and to study multiday route choice behavior for the same origin–destination trips, from home to work. A new way of thinking about route choice modeling is provided in this study. Travelers are classified into three kinds based on the deviation between actual routes and the shortest travel time paths. Based on the classification, a two-stage route choice process is proposed, in which the first step is to classify the travelers and the second one is to model route choice behavior. After analyzing the characteristics of different types of travelers, an artificial neural network was adopted to classify travelers and model route choice behavior. An empirical study using global position systems data collected in Minneapolis–St Paul metropolitan area was carried out. It finds that most travelers follow the same route during commute trips on successive days. And different types of travelers have a significant difference in route choice property. The modeling results indicate that neural network framework can classify travelers and model route choice well.

  3. Estimation of chloroform inhalation dose by other routes based on the relationship of area under the blood concentration-time curve (AUC)-inhalation dose to chloroform distribution in the blood of rats.

    Science.gov (United States)

    Take, Makoto; Takeuchi, Tetsuya; Haresaku, Mitsuru; Matsumoto, Michiharu; Nagano, Kasuke; Yamamoto, Seigo; Takamura-Enya, Takeji; Fukushima, Shoji

    2014-01-01

    The present study investigated the time-course changes of concentration of chloroform (CHCl3) in the blood during and after exposure of male rats to CHCl3 by inhalation. Increasing the dose of CHCl3 in the inhalation exposed groups caused a commensurate increase in the concentration of CHCl3 in the blood and the area under the blood concentration-time curve (AUC). There was good correlation (r = 0.988) between the inhalation dose and the AUC/kg body weight. Based on the AUC/kg body weight-inhalation dose curve and the AUC/kg body weight after oral administration, inhalation equivalent doses of orally administered CHCl3 were calculated. Calculation of inhalation equivalent doses allows the body burden due to CHCl3 by inhalation exposure and oral exposure to be directly compared. This type of comparison facilitates risk assessment in humans exposed to CHCl3 by different routes. Our results indicate that when calculating inhalation equivalent doses of CHCl3, it is critical to include the AUC from the exposure period in addition to the AUC after the end of the exposure period. Thus, studies which measure the concentration of volatile organic compounds in the blood during the inhalation exposure period are crucial. The data reported here makes an important contribution to the physiologically based pharmacokinetic (PBPK) database of CHCl3 in rodents.

  4. Trends in PDE constrained optimization

    CERN Document Server

    Benner, Peter; Engell, Sebastian; Griewank, Andreas; Harbrecht, Helmut; Hinze, Michael; Rannacher, Rolf; Ulbrich, Stefan

    2014-01-01

    Optimization problems subject to constraints governed by partial differential equations (PDEs) are among the most challenging problems in the context of industrial, economical and medical applications. Almost the entire range of problems in this field of research was studied and further explored as part of the Deutsche Forschungsgemeinschaft (DFG) priority program 1253 on “Optimization with Partial Differential Equations” from 2006 to 2013. The investigations were motivated by the fascinating potential applications and challenging mathematical problems that arise in the field of PDE constrained optimization. New analytic and algorithmic paradigms have been developed, implemented and validated in the context of real-world applications. In this special volume, contributions from more than fifteen German universities combine the results of this interdisciplinary program with a focus on applied mathematics.   The book is divided into five sections on “Constrained Optimization, Identification and Control”...

  5. Capturing Hotspots For Constrained Indoor Movement

    DEFF Research Database (Denmark)

    Ahmed, Tanvir; Pedersen, Torben Bach; Lu, Hua

    2013-01-01

    Finding the hotspots in large indoor spaces is very important for getting overloaded locations, security, crowd management, indoor navigation and guidance. The tracking data coming from indoor tracking are huge in volume and not readily available for finding hotspots. This paper presents a graph......-based model for constrained indoor movement that can map the tracking records into mapping records which represent the entry and exit times of an object in a particular location. Then it discusses the hotspots extraction technique from the mapping records....

  6. Vessels Route Planning Problem with Uncertain Data

    Directory of Open Access Journals (Sweden)

    Tomasz Neumann

    2016-09-01

    Full Text Available The purpose of this paper is to find a solution for route planning in a transport networks, where the costs of tracks, factor of safety and travel time are ambiguous. This approach is based on the Dempster-Shafer theory and well known Dijkstra's algorithm. In this approach important are the influencing factors of the mentioned coefficients using uncertain possibilities presented by probability intervals. Based on these intervals the quality intervals of each route can be determined. Applied decision rules can be described by the end user.

  7. Reconfigurable Robust Routing for Mobile Outreach Network

    Science.gov (United States)

    Lin, Ching-Fang

    2010-01-01

    The Reconfigurable Robust Routing for Mobile Outreach Network (R3MOO N) provides advanced communications networking technologies suitable for the lunar surface environment and applications. The R3MOON techn ology is based on a detailed concept of operations tailored for luna r surface networks, and includes intelligent routing algorithms and wireless mesh network implementation on AGNC's Coremicro Robots. The product's features include an integrated communication solution inco rporating energy efficiency and disruption-tolerance in a mobile ad h oc network, and a real-time control module to provide researchers an d engineers a convenient tool for reconfiguration, investigation, an d management.

  8. Routing in Networks with Random Topologies

    Science.gov (United States)

    Bambos, Nicholas

    1997-01-01

    We examine the problems of routing and server assignment in networks with random connectivities. In such a network the basic topology is fixed, but during each time slot and for each of tis input queues, each server (node) is either connected to or disconnected from each of its queues with some probability.

  9. Evolution Strategies in the Multipoint Connections Routing

    Directory of Open Access Journals (Sweden)

    L. Krulikovska

    2010-09-01

    Full Text Available Routing of multipoint connections plays an important role in final cost and quality of a found connection. New algorithms with better results are still searched. In this paper, a possibility of using the evolution strategies (ES for routing is presented. Quality of found connection is evaluated from the view of final cost and time spent on a searching procedure. First, parametrical analysis of results of the ES are discussed and compared with the Prim’s algorithm, which was chosen as a representative of the deterministic routing algorithms. Second, ways for improving the ES are suggested and implemented. The obtained results are reviewed. The main improvements are specified and discussed in conclusion.

  10. Hazardous materials routing - risk management of mismanagement

    International Nuclear Information System (INIS)

    Glickman, T.S.

    1988-01-01

    Along with emergency planning and preparedness, the placement of restrictions on routing has become an increasingly popular device for managing the highway and rail risks of hazardous materials transportation. Federal studies conducted in 1985 indicate that at that time there were 513 different state and local restrictions on the routing of hazardous materials for these two modes of transportation, and that there were 136 state and local notification requirements, that is, restrictions that take the form of a statute or ordinance requiring advance warning or periodic reporting about hazardous materials shipments. Routing restrictions also take the form of prohibiting the use of road, a tunnel, or a bridge for a specified set of hazardous materials

  11. An overview of smart grid routing algorithms

    Science.gov (United States)

    Wang, Junsheng; OU, Qinghai; Shen, Haijuan

    2017-08-01

    This paper summarizes the typical routing algorithm in smart grid by analyzing the communication business and communication requirements of intelligent grid. Mainly from the two kinds of routing algorithm is analyzed, namely clustering routing algorithm and routing algorithm, analyzed the advantages and disadvantages of two kinds of typical routing algorithm in routing algorithm and applicability.

  12. Clustering Using Boosted Constrained k-Means Algorithm

    Directory of Open Access Journals (Sweden)

    Masayuki Okabe

    2018-03-01

    Full Text Available This article proposes a constrained clustering algorithm with competitive performance and less computation time to the state-of-the-art methods, which consists of a constrained k-means algorithm enhanced by the boosting principle. Constrained k-means clustering using constraints as background knowledge, although easy to implement and quick, has insufficient performance compared with metric learning-based methods. Since it simply adds a function into the data assignment process of the k-means algorithm to check for constraint violations, it often exploits only a small number of constraints. Metric learning-based methods, which exploit constraints to create a new metric for data similarity, have shown promising results although the methods proposed so far are often slow depending on the amount of data or number of feature dimensions. We present a method that exploits the advantages of the constrained k-means and metric learning approaches. It incorporates a mechanism for accepting constraint priorities and a metric learning framework based on the boosting principle into a constrained k-means algorithm. In the framework, a metric is learned in the form of a kernel matrix that integrates weak cluster hypotheses produced by the constrained k-means algorithm, which works as a weak learner under the boosting principle. Experimental results for 12 data sets from 3 data sources demonstrated that our method has performance competitive to those of state-of-the-art constrained clustering methods for most data sets and that it takes much less computation time. Experimental evaluation demonstrated the effectiveness of controlling the constraint priorities by using the boosting principle and that our constrained k-means algorithm functions correctly as a weak learner of boosting.

  13. Route Network Construction with Location-Direction-Enabled Photographs

    Science.gov (United States)

    Fujita, Hideyuki; Sagara, Shota; Ohmori, Tadashi; Shintani, Takahiko

    2018-05-01

    We propose a method for constructing a geometric graph for generating routes that summarize a geographical area and also have visual continuity by using a set of location-direction-enabled photographs. A location- direction-enabled photograph is a photograph that has information about the location (position of the camera at the time of shooting) and the direction (direction of the camera at the time of shooting). Each nodes of the graph corresponds to a location-direction-enabled photograph. The location of each node is the location of the corresponding photograph, and a route on the graph corresponds to a route in the geographic area and a sequence of photographs. The proposed graph is constructed to represent characteristic spots and paths linking the spots, and it is assumed to be a kind of a spatial summarization of the area with the photographs. Therefore, we call the routes on the graph as spatial summary route. Each route on the proposed graph also has a visual continuity, which means that we can understand the spatial relationship among the continuous photographs on the route such as moving forward, backward, turning right, etc. In this study, when the changes in the shooting position and shooting direction satisfied a given threshold, the route was defined to have visual continuity. By presenting the photographs in order along the generated route, information can be presented sequentially, while maintaining visual continuity to a great extent.

  14. Towards seasonal Arctic shipping route predictions

    Science.gov (United States)

    Haines, K.; Melia, N.; Hawkins, E.; Day, J. J.

    2017-12-01

    In our previous work [1] we showed how trans-Arctic shipping routes would become more available through the 21st century as sea ice declines, using CMIP5 models with means and stds calibrated to PIOMAS sea ice observations. Sea ice will continue to close shipping routes to open water vessels through the winter months for the foreseeable future so the availability of open sea routes will vary greatly from year to year. Here [2] we look at whether the trans-Arctic shipping season period can be predicted in seasonal forecasts, again using several climate models, and testing both perfect and imperfect knowledge of the initial sea ice conditions. We find skilful predictions of the upcoming summer shipping season can be made from as early as January, although typically forecasts may show lower skill before a May `predictability barrier'. Focussing on the northern sea route (NSR) off Siberia, the date of opening of this sea route is twice as variable as the closing date, and this carries through to reduced predictability at the start of the season. Under climate change the later freeze-up date accounts for 60% of the lengthening season, Fig1 We find that predictive skill is state dependent with predictions for high or low ice years exhibiting greater skill than for average ice years. Forecasting the exact timing of route open periods is harder (more weather dependent) under average ice conditions while in high and low ice years the season is more controlled by the initial ice conditions from spring onwards. This could be very useful information for companies planning vessel routing for the coming season. We tested this dependence on the initial ice conditions by changing the initial ice state towards climatologically average conditions and show directly that early summer sea-ice thickness information is crucial to obtain skilful forecasts of the coming shipping season. Mechanisms for this are discussed. This strongly suggests that good sea ice thickness observations

  15. Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model

    Science.gov (United States)

    Segui, John S.; Jennings, Esther H.; Clare, Loren P.

    2013-01-01

    Contact Graph Routing (CGR) for Delay/Disruption Tolerant Networking (DTN) space-based networks makes use of the predictable nature of node contacts to make real-time routing decisions given unpredictable traffic patterns. The contact graph will have been disseminated to all nodes before the start of route computation. CGR was designed for space-based networking environments where future contact plans are known or are independently computable (e.g., using known orbital dynamics). For each data item (known as a bundle in DTN), a node independently performs route selection by examining possible paths to the destination. Route computation could conceivably run thousands of times a second, so computational load is important. This work refers to the simulation software model of Enhanced Contact Graph Routing (ECGR) for DTN Bundle Protocol in JPL's MACHETE simulation tool. The simulation model was used for performance analysis of CGR and led to several performance enhancements. The simulation model was used to demonstrate the improvements of ECGR over CGR as well as other routing methods in space network scenarios. ECGR moved to using earliest arrival time because it is a global monotonically increasing metric that guarantees the safety properties needed for the solution's correctness since route re-computation occurs at each node to accommodate unpredicted changes (e.g., traffic pattern, link quality). Furthermore, using earliest arrival time enabled the use of the standard Dijkstra algorithm for path selection. The Dijkstra algorithm for path selection has a well-known inexpensive computational cost. These enhancements have been integrated into the open source CGR implementation. The ECGR model is also useful for route metric experimentation and comparisons with other DTN routing protocols particularly when combined with MACHETE's space networking models and Delay Tolerant Link State Routing (DTLSR) model.

  16. COORDINATION OF THE WORK OF BUSES IN CITY ROUTES

    Directory of Open Access Journals (Sweden)

    Fuad DASHDAMIROV

    2013-12-01

    Full Text Available The paper studied the work of bus routes passing through a street. Optimality criterion was chosen for the development of appropriate models of effective work of buses on the land. The paper proposes a new model costing time passengers at bus stops. A method of technique was developed to coordinate the buses running on the combined section of route.

  17. Delay Management with Re-Routing of Passengers

    NARCIS (Netherlands)

    T.A.B. Dollevoet (Twan); D. Huisman (Dennis); M.E. Schmidt (Marie); A. Schöbel (Anita)

    2010-01-01

    textabstractThe question of delay management is whether trains should wait for a delayed feeder train or should depart on time. In classical delay management models passengers always take their originally planned route. In this paper, we propose a model where re-routing of passengers is

  18. Automated Flight Routing Using Stochastic Dynamic Programming

    Science.gov (United States)

    Ng, Hok K.; Morando, Alex; Grabbe, Shon

    2010-01-01

    Airspace capacity reduction due to convective weather impedes air traffic flows and causes traffic congestion. This study presents an algorithm that reroutes flights in the presence of winds, enroute convective weather, and congested airspace based on stochastic dynamic programming. A stochastic disturbance model incorporates into the reroute design process the capacity uncertainty. A trajectory-based airspace demand model is employed for calculating current and future airspace demand. The optimal routes minimize the total expected traveling time, weather incursion, and induced congestion costs. They are compared to weather-avoidance routes calculated using deterministic dynamic programming. The stochastic reroutes have smaller deviation probability than the deterministic counterpart when both reroutes have similar total flight distance. The stochastic rerouting algorithm takes into account all convective weather fields with all severity levels while the deterministic algorithm only accounts for convective weather systems exceeding a specified level of severity. When the stochastic reroutes are compared to the actual flight routes, they have similar total flight time, and both have about 1% of travel time crossing congested enroute sectors on average. The actual flight routes induce slightly less traffic congestion than the stochastic reroutes but intercept more severe convective weather.

  19. Vertex routing models

    International Nuclear Information System (INIS)

    Markovic, D; Gros, C

    2009-01-01

    A class of models describing the flow of information within networks via routing processes is proposed and investigated, concentrating on the effects of memory traces on the global properties. The long-term flow of information is governed by cyclic attractors, allowing to define a measure for the information centrality of a vertex given by the number of attractors passing through this vertex. We find the number of vertices having a nonzero information centrality to be extensive/subextensive for models with/without a memory trace in the thermodynamic limit. We evaluate the distribution of the number of cycles, of the cycle length and of the maximal basins of attraction, finding a complete scaling collapse in the thermodynamic limit for the latter. Possible implications of our results for the information flow in social networks are discussed.

  20. Hypsometric amplification and routing moderation of Greenland ice sheet meltwater release

    Science.gov (United States)

    van As, Dirk; Mikkelsen, Andreas Bech; Holtegaard Nielsen, Morten; Box, Jason E.; Claesson Liljedahl, Lillemor; Lindbäck, Katrin; Pitcher, Lincoln; Hasholt, Bent

    2017-06-01

    Concurrent ice sheet surface runoff and proglacial discharge monitoring are essential for understanding Greenland ice sheet meltwater release. We use an updated, well-constrained river discharge time series from the Watson River in southwest Greenland, with an accurate, observation-based ice sheet surface mass balance model of the ˜ 12 000 km2 ice sheet area feeding the river. For the 2006-2015 decade, we find a large range of a factor of 3 in interannual variability in discharge. The amount of discharge is amplified ˜ 56 % by the ice sheet's hypsometry, i.e., area increase with elevation. A good match between river discharge and ice sheet surface meltwater production is found after introducing elevation-dependent transit delays that moderate diurnal variability in meltwater release by a factor of 10-20. The routing lag time increases with ice sheet elevation and attains values in excess of 1 week for the upper reaches of the runoff area at ˜ 1800 m above sea level. These multi-day routing delays ensure that the highest proglacial discharge levels and thus overbank flooding events are more likely to occur after multi-day melt episodes. Finally, for the Watson River ice sheet catchment, we find no evidence of meltwater storage in or release from the en- and subglacial environments in quantities exceeding our methodological uncertainty, based on the good match between ice sheet runoff and proglacial discharge.

  1. Energy-Efficient Cluster Based Routing Protocol in Mobile Ad Hoc Networks Using Network Coding

    Directory of Open Access Journals (Sweden)

    Srinivas Kanakala

    2014-01-01

    Full Text Available In mobile ad hoc networks, all nodes are energy constrained. In such situations, it is important to reduce energy consumption. In this paper, we consider the issues of energy efficient communication in MANETs using network coding. Network coding is an effective method to improve the performance of wireless networks. COPE protocol implements network coding concept to reduce number of transmissions by mixing the packets at intermediate nodes. We incorporate COPE into cluster based routing protocol to further reduce the energy consumption. The proposed energy-efficient coding-aware cluster based routing protocol (ECCRP scheme applies network coding at cluster heads to reduce number of transmissions. We also modify the queue management procedure of COPE protocol to further improve coding opportunities. We also use an energy efficient scheme while selecting the cluster head. It helps to increase the life time of the network. We evaluate the performance of proposed energy efficient cluster based protocol using simulation. Simulation results show that the proposed ECCRP algorithm reduces energy consumption and increases life time of the network.

  2. Southern states' routing agency report

    International Nuclear Information System (INIS)

    1989-02-01

    The Southern states' routing agency report is a compendium of 16-southern states' routing programs relative to the transportation of high-level radioactive materials. The report identifies the state-designated routing agencies as defined under 49 Code of Federal Regulations (CFR) Part 171 and provides a reference to the source ad scope of the agencies' rulemaking authority. Additionally, the state agency and contact designated by the state's governor to receive advance notification and shipment routing information under 10 CFR Parts 71 and 73 are also listed

  3. Southern States' Routing Agency Report

    International Nuclear Information System (INIS)

    1990-03-01

    The Southern States' Routing Agency Report is a compendium of 16-southern states' routing program for the transportation of high-level radioactive materials. The report identifies the state-designated routing agencies as defined under 49 Code of Federal Regulations (CFR) Part 171 and provides a reference to the source and scope of the agencies' rulemaking authority. Additionally, the state agency and contact designated by the state's governor to receive advance notification and shipment routing information under 10 CFR Parts 71 and 73 are also listed

  4. Analysis of Pervasive Mobile Ad Hoc Routing Protocols

    Science.gov (United States)

    Qadri, Nadia N.; Liotta, Antonio

    Mobile ad hoc networks (MANETs) are a fundamental element of pervasive networks and therefore, of pervasive systems that truly support pervasive computing, where user can communicate anywhere, anytime and on-the-fly. In fact, future advances in pervasive computing rely on advancements in mobile communication, which includes both infrastructure-based wireless networks and non-infrastructure-based MANETs. MANETs introduce a new communication paradigm, which does not require a fixed infrastructure - they rely on wireless terminals for routing and transport services. Due to highly dynamic topology, absence of established infrastructure for centralized administration, bandwidth constrained wireless links, and limited resources in MANETs, it is challenging to design an efficient and reliable routing protocol. This chapter reviews the key studies carried out so far on the performance of mobile ad hoc routing protocols. We discuss performance issues and metrics required for the evaluation of ad hoc routing protocols. This leads to a survey of existing work, which captures the performance of ad hoc routing algorithms and their behaviour from different perspectives and highlights avenues for future research.

  5. The Prohibitive Link between Position-based Routing and Planarity

    Directory of Open Access Journals (Sweden)

    David Cairns

    2013-12-01

    Full Text Available Position-based routing is touted as an ideal routing strategy for resource-constrained wireless networks. One persistent barrier to adoption is due to its recovery phase, where messages are forwarded according to leftor right-hand rule (LHR. This is often referred to as face-routing. In this paper we investigate the limits of LHR with respect to planarity.We show that the gap between non-planarity and successful delivery is a single link within a single configuration. Our work begins with an analysis to enumerate all node configurations that cause intersections in the unit-disc graph. We find that left-hand rule is able to recover from all but a single case, the ‘umbrella’ configuration so named for its appearance. We use this information to propose the Prohibitive Link Detection Protocol (PLDP that can guarantee delivery over non-planar graphs using standard face-routing techniques. As the name implies, the protocol detects and circumvents the ‘bad’ links that hamper LHR. The goal of this work is to maintain routing guarantees while disturbing the network graph as little as possible. In doing so, a new starting point emerges from which to build rich distributed protocols in the spirit of CLDP and GDSTR.

  6. Nested Sampling with Constrained Hamiltonian Monte Carlo

    OpenAIRE

    Betancourt, M. J.

    2010-01-01

    Nested sampling is a powerful approach to Bayesian inference ultimately limited by the computationally demanding task of sampling from a heavily constrained probability distribution. An effective algorithm in its own right, Hamiltonian Monte Carlo is readily adapted to efficiently sample from any smooth, constrained distribution. Utilizing this constrained Hamiltonian Monte Carlo, I introduce a general implementation of the nested sampling algorithm.

  7. Free and constrained symplectic integrators for numerical general relativity

    International Nuclear Information System (INIS)

    Richter, Ronny; Lubich, Christian

    2008-01-01

    We consider symplectic time integrators in numerical general relativity and discuss both free and constrained evolution schemes. For free evolution of ADM-like equations we propose the use of the Stoermer-Verlet method, a standard symplectic integrator which here is explicit in the computationally expensive curvature terms. For the constrained evolution we give a formulation of the evolution equations that enforces the momentum constraints in a holonomically constrained Hamiltonian system and turns the Hamilton constraint function from a weak to a strong invariant of the system. This formulation permits the use of the constraint-preserving symplectic RATTLE integrator, a constrained version of the Stoermer-Verlet method. The behavior of the methods is illustrated on two effectively (1+1)-dimensional versions of Einstein's equations, which allow us to investigate a perturbed Minkowski problem and the Schwarzschild spacetime. We compare symplectic and non-symplectic integrators for free evolution, showing very different numerical behavior for nearly-conserved quantities in the perturbed Minkowski problem. Further we compare free and constrained evolution, demonstrating in our examples that enforcing the momentum constraints can turn an unstable free evolution into a stable constrained evolution. This is demonstrated in the stabilization of a perturbed Minkowski problem with Dirac gauge, and in the suppression of the propagation of boundary instabilities into the interior of the domain in Schwarzschild spacetime

  8. Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP

    Directory of Open Access Journals (Sweden)

    DWI ARYANTA

    2016-02-01

    Full Text Available Abstrak OSPF (Open Shortest Path First dan EIGRP (Enhanced Interior Gateway Routing Protocol adalah dua routing protokol yang banyak digunakan dalam jaringan komputer. Perbedaan karakteristik antar routing protokol menimbulkan masalah dalam pengiriman paket data. Teknik redistribution adalah solusi untuk melakukan komunikasi antar routing protokol. Dengan menggunakan software Cisco Packet Tracer 5.3 pada penelitian ini dibuat simulasi OSPF dan EIGRP yang dihubungkan oleh teknik redistribution, kemudian dibandingkan kualitasnya dengan single routing protokol EIGRP dan OSPF. Parameter pengujian dalam penelitian ini adalah nilai time delay dan trace route. Nilai trace route berdasarkan perhitungan langsung cost dan metric dibandingkan dengan hasil simulasi. Hasilnya dapat dilakukan proses redistribution OSPF dan EIGRP. Nilai delay redistribution lebih baik 1% dibanding OSPF dan 2-3% di bawah EIGRP tergantung kepadatan traffic. Dalam perhitungan trace route redistribution dilakukan 2 perhitungan, yaitu cost untuk area OSPF dan metric pada area EIGRP. Pengambilan jalur utama dan alternatif pengiriman paket berdasarkan nilai cost dan metric yang terkecil, hal ini terbukti berdasarkan perhitungan dan simulasi. Kata kunci: OSPF, EIGRP, Redistribution, Delay, Cost, Metric. Abstract OSPF (Open Shortest Path First and EIGRP (Enhanced Interior Gateway Routing Protocol are two routing protocols are widely used in computer networks. Differences between the characteristics of routing protocols pose a problem in the delivery of data packets. Redistribution technique is the solution for communication between routing protocols. By using the software Cisco Packet Tracer 5.3 in this study were made simulating OSPF and EIGRP redistribution linked by technique, then compared its quality with a single EIGRP and OSPF routing protocols. Testing parameters in this study is the value of the time delay and trace route. Value trace route based on direct calculation of cost

  9. Lessons learned by southern states in designating alternative routes

    International Nuclear Information System (INIS)

    1989-08-01

    The purpose of this report is to discuss the ''lessons learned'' by the five states within the southem region that have designated alternative or preferred routes under the regulations of the Department of Transportation (DOT) established for the transportation of radioactive materials. The document was prepared by reviewing applicable federal laws and regulations, examining state reports and documents and contacting state officials and routing agencies involved in making routing decisions. In undertaking this project, the Southern States Energy Board hopes to reveal the process used by states that have designated alternative routes and thereby share their experiences (i.e., lessons learned) with other southern states that have yet to make designations. Under DOT regulations (49 CFR 177.826), carriers of highway route controlled quantities of radioactive materials (which include spent nuclear fuel and high-level waste) must use preferred routes selected to reduce time in transit. Such preferred routes consist of (1) an interstate system highway with use of an interstate system bypass or beltway around cities when available, and (2) alternate routes selected by a ''state routing agency.''

  10. Constrained minimization in C ++ environment

    International Nuclear Information System (INIS)

    Dymov, S.N.; Kurbatov, V.S.; Silin, I.N.; Yashchenko, S.V.

    1998-01-01

    Based on the ideas, proposed by one of the authors (I.N.Silin), the suitable software was developed for constrained data fitting. Constraints may be of the arbitrary type: equalities and inequalities. The simplest of possible ways was used. Widely known program FUMILI was realized to the C ++ language. Constraints in the form of inequalities φ (θ i ) ≥ a were taken into account by change into equalities φ (θ i ) = t and simple inequalities of type t ≥ a. The equalities were taken into account by means of quadratic penalty functions. The suitable software was tested on the model data of the ANKE setup (COSY accelerator, Forschungszentrum Juelich, Germany)

  11. Coherent states in constrained systems

    International Nuclear Information System (INIS)

    Nakamura, M.; Kojima, K.

    2001-01-01

    When quantizing the constrained systems, there often arise the quantum corrections due to the non-commutativity in the re-ordering of constraint operators in the products of operators. In the bosonic second-class constraints, furthermore, the quantum corrections caused by the uncertainty principle should be taken into account. In order to treat these corrections simultaneously, the alternative projection technique of operators is proposed by introducing the available minimal uncertainty states of the constraint operators. Using this projection technique together with the projection operator method (POM), these two kinds of quantum corrections were investigated

  12. Routing Optimization of Intelligent Vehicle in Automated Warehouse

    Directory of Open Access Journals (Sweden)

    Yan-cong Zhou

    2014-01-01

    Full Text Available Routing optimization is a key technology in the intelligent warehouse logistics. In order to get an optimal route for warehouse intelligent vehicle, routing optimization in complex global dynamic environment is studied. A new evolutionary ant colony algorithm based on RFID and knowledge-refinement is proposed. The new algorithm gets environmental information timely through the RFID technology and updates the environment map at the same time. It adopts elite ant kept, fallback, and pheromones limitation adjustment strategy. The current optimal route in population space is optimized based on experiential knowledge. The experimental results show that the new algorithm has higher convergence speed and can jump out the U-type or V-type obstacle traps easily. It can also find the global optimal route or approximate optimal one with higher probability in the complex dynamic environment. The new algorithm is proved feasible and effective by simulation results.

  13. Stochastic vehicle routing with recourse

    DEFF Research Database (Denmark)

    Gørtz, Inge Li; Nagarajan, Viswanath; Saket, Rishi

    2012-01-01

    instantiations, a recourse route is computed - but costs here become more expensive by a factor λ. We present an O(log2n ·log(nλ))-approximation algorithm for this stochastic routing problem, under arbitrary distributions. The main idea in this result is relating StochVRP to a special case of submodular...

  14. Route-external and route-internal landmarks in route descriptions : Effects of route length and map design

    NARCIS (Netherlands)

    Westerbeek, Hans; Maes, Alfons

    2013-01-01

    Landmarks are basic ingredients in route descriptions. They often mark choice points: locations where travellers choose from different options how to continue the route. This study focuses on one of the loose ends in the taxonomy of landmarks. In a memory-based production experiment in which

  15. Quantum cosmology of classically constrained gravity

    International Nuclear Information System (INIS)

    Gabadadze, Gregory; Shang Yanwen

    2006-01-01

    In [G. Gabadadze, Y. Shang, hep-th/0506040] we discussed a classically constrained model of gravity. This theory contains known solutions of General Relativity (GR), and admits solutions that are absent in GR. Here we study cosmological implications of some of these new solutions. We show that a spatially-flat de Sitter universe can be created from 'nothing'. This universe has boundaries, and its total energy equals to zero. Although the probability to create such a universe is exponentially suppressed, it favors initial conditions suitable for inflation. Then we discuss a finite-energy solution with a nonzero cosmological constant and zero space-time curvature. There is no tunneling suppression to fluctuate into this state. We show that for a positive cosmological constant this state is unstable-it can rapidly transition to a de Sitter universe providing a new unsuppressed channel for inflation. For a negative cosmological constant the space-time flat solutions is stable.

  16. Changes in epistemic frameworks: Random or constrained?

    Directory of Open Access Journals (Sweden)

    Ananka Loubser

    2012-11-01

    Full Text Available Since the emergence of a solid anti-positivist approach in the philosophy of science, an important question has been to understand how and why epistemic frameworks change in time, are modified or even substituted. In contemporary philosophy of science three main approaches to framework-change were detected in the humanist tradition:1. In both the pre-theoretical and theoretical domains changes occur according to a rather constrained, predictable or even pre-determined pattern (e.g. Holton.2. Changes occur in a way that is more random or unpredictable and free from constraints (e.g. Kuhn, Feyerabend, Rorty, Lyotard.3. Between these approaches, a middle position can be found, attempting some kind of synthesis (e.g. Popper, Lakatos.Because this situation calls for clarification and systematisation, this article in fact tried to achieve more clarity on how changes in pre-scientific frameworks occur, as well as provided transcendental criticism of the above positions. This article suggested that the above-mentioned positions are not fully satisfactory, as change and constancy are not sufficiently integrated. An alternative model was suggested in which changes in epistemic frameworks occur according to a pattern, neither completely random nor rigidly constrained, which results in change being dynamic but not arbitrary. This alternative model is integral, rather than dialectical and therefore does not correspond to position three. 

  17. Rich Vehicle Routing Problems and Applications

    DEFF Research Database (Denmark)

    Wen, Min

    very short computational time on real-life data involving up to 200 pairs of suppliers and customers. The second problem we consider is a dynamic vehicle routing problem with multiple objectives over a planning horizon that consists of multiple periods. In this problem, customer orders are revealed...... the company’s solution in terms of all the objectives, including the travel time, customer waiting and daily workload balances, under the given constraints considered in the work. Finally, we address an integrated vehicle routing and driver scheduling problem, in which a large number of practical constraints....... The method is implemented and tested on real-life data involving up to 2000 orders. It is shown that the method is able to provide solutions of good quality within reasonable running time....

  18. A location-routing problem model with multiple periods and fuzzy demands

    Directory of Open Access Journals (Sweden)

    Ali Nadizadeh

    2014-08-01

    Full Text Available This paper puts forward a dynamic capacitated location-routing problem with fuzzy demands (DCLRP-FD. It is given on input a set of identical vehicles (each having a capacity, a fixed cost and availability level, a set of depots with restricted capacities and opening costs, a set of customers with fuzzy demands, and a planning horizon with multiple periods. The problem consists of determining the depots to be opened only in the first period of the planning horizon, the customers and the vehicles to be assigned to each opened depot, and performing the routes that may be changed in each time period due to fuzzy demands. A fuzzy chance-constrained programming (FCCP model has been designed using credibility theory and a hybrid heuristic algorithm with four phases is presented in order to solve the problem. To obtain the best value of the fuzzy parameters of the model and show the influence of the availability level of vehicles on final solution, some computational experiments are carried out. The validity of the model is then evaluated in contrast with CLRP-FD's models in the literature. The results indicate that the model and the proposed algorithm are robust and could be used in real world problems.

  19. Indoor Semantic Modelling for Routing: The Two-Level Routing Approach for Indoor Navigation

    Directory of Open Access Journals (Sweden)

    Liu Liu

    2017-11-01

    detailed levels. • On the conceptual level, it supports routing on a logical network and assists the derivation of a conceptual path (i.e., logical path for a user in terms of space sequence. Routing criteria are designed based on the INSM semantics of spaces, which can generate logical paths similar to human wayfinding results such as minimizing VerticalUnit or HorizontalConnector. • On the detailed level, it considers the size of users and results in obstacle-avoiding paths. By using this approach, geometric networks can be generated to avoid obstacles for the given users and accessible paths are flexibly provided for user demands. This approach can process changes of user size more efficiently, in contrast to routing on a complete geometric network. • It supports routing on both the logical and the geometric networks, which can generate geometric paths based on user-specific logical paths, or re-compute logical paths when geometric paths are inaccessible. This computation method is very useful for complex buildings. The two-level routing approach can flexibly provide logical and geometric paths according to user preferences and sizes, and can adjust the generated paths in limited time. Based on the two-level routing approach, this thesis also provides a vision on possible cooperation with other methods. A potential direction is to design more routing options according to other indoor scenarios and user preferences. Extensions of the two-level routing approach, such as other types of semantics, multi-level networks and dynamic obstacles, will make it possible to deal with other routing cases. Last but not least, it is also promising to explore its relationships with indoor guidance, different building subdivisions and outdoor navigation.

  20. Energy Reduction Multipath Routing Protocol for MANET Using Recoil Technique

    Directory of Open Access Journals (Sweden)

    Rakesh Kumar Sahu

    2018-04-01

    Full Text Available In Mobile Ad-hoc networks (MANET, power conservation and utilization is an acute problem and has received significant attention from academics and industry in recent years. Nodes in MANET function on battery power, which is a rare and limited energy resource. Hence, its conservation and utilization should be done judiciously for the effective functioning of the network. In this paper, a novel protocol namely Energy Reduction Multipath Routing Protocol for MANET using Recoil Technique (AOMDV-ER is proposed, which conserves the energy along with optimal network lifetime, routing overhead, packet delivery ratio and throughput. It performs better than any other AODV based algorithms, as in AOMDV-ER the nodes transmit packets to their destination smartly by using a varying recoil off time technique based on their geographical location. This concept reduces the number of transmissions, which results in the improvement of network lifetime. In addition, the local level route maintenance reduces the additional routing overhead. Lastly, the prediction based link lifetime of each node is estimated which helps in reducing the packet loss in the network. This protocol has three subparts: an optimal route discovery algorithm amalgamation with the residual energy and distance mechanism; a coordinated recoiled nodes algorithm which eliminates the number of transmissions in order to reduces the data redundancy, traffic redundant, routing overhead, end to end delay and enhance the network lifetime; and a last link reckoning and route maintenance algorithm to improve the packet delivery ratio and link stability in the network. The experimental results show that the AOMDV-ER protocol save at least 16% energy consumption, 12% reduction in routing overhead, significant achievement in network lifetime and packet delivery ratio than Ad hoc on demand multipath distance vector routing protocol (AOMDV, Ad hoc on demand multipath distance vector routing protocol life

  1. Multicriteria vehicle routing problem solved by artificial immune system

    Directory of Open Access Journals (Sweden)

    Bogna MRÓWCZYŃSKA

    2015-09-01

    Full Text Available Vehicles route planning in large transportation companies, where drivers are workers, usually takes place on the basis of experience or intuition of the employees. Because of the cost and environmental protection, it is important to save fuel, thus planning routes in an optimal way. In this article an example of the problem is presented solving delivery vans route planning taking into account the distance and travel time within the constraints of vehicle capacities, restrictions on working time of drivers and having varying degrees of movement. An artificial immune system was used for the calculations.

  2. Road Routes for Waste Disposal - MDC_RecyclingRoute

    Data.gov (United States)

    NSGIC Local Govt | GIS Inventory — This CURBSIDE RECYCLING ROUTES BOUNDARIES LAYER IS A polygon feature class created for the Miami-Dade Department of Solid Waste Management (DSWM). It contains the...

  3. Optimization Model for Headway of a Suburban Bus Route

    Directory of Open Access Journals (Sweden)

    Xiaohong Jiang

    2014-01-01

    Full Text Available Due to relatively low passenger demand, headways of suburban bus route are usually longer than those of urban bus route. Actually it is also difficult to balance the benefits between passengers and operators, subject to the service standards from the government. Hence the headway of a suburban bus route is usually determined on the empirical experience of transport planners. To cope with this problem, this paper proposes an optimization model for designing the headways of suburban bus routes by minimizing the operating and user costs. The user costs take into account both the waiting time cost and the crowding cost. The feasibility and validity of the proposed model are shown by applying it to the Route 206 in Jiangning district, Nanjing city of China. Weightages of passengers’ cost and operating cost are further discussed, considering different passenger flows. It is found that the headway and objective function are affected by the weightages largely.

  4. Nomadic Exploration: Following routes of solar sustenance and temperate climate

    Data.gov (United States)

    National Aeronautics and Space Administration — Conceptual existence of circumnavigation routes was speculated in the proposing team's Phase I NIAC research, but at that time terrain model resolution was too low...

  5. Pheromone based alternative route planning

    Directory of Open Access Journals (Sweden)

    Liangbing Feng

    2016-08-01

    Full Text Available In this work, we propose an improved alternative route calculation based on alternative figures, which is suitable for practical environments. The improvement is based on the fact that the main traffic route is the road network skeleton in a city. Our approach using nodes may generate a higher possibility of overlapping. We employ a bidirectional Dijkstra algorithm to search the route. To measure the quality of an Alternative Figures (AG, three quotas are proposed. The experiment results indicate that the improved algorithm proposed in this paper is more effective than others.

  6. Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP

    Directory of Open Access Journals (Sweden)

    DWI ARYANTA

    2014-07-01

    OSPF (Open Shortest Path First and EIGRP (Enhanced Interior Gateway Routing Protocol are two routing protocols are widely used in computer networks. Differences between the characteristics of routing protocols pose a problem in the delivery of data packets. Redistribution technique is the solution for communication between routing protocols. By using the software Cisco Packet Tracer 5.3 in this study were made simulating OSPF and EIGRP redistribution linked by technique, then compared its quality with a single EIGRP and OSPF routing protocols. Testing parameters in this study is the value of the time delay and trace route. Value trace route based on direct calculation of cost and metric compared with the simulation results. The result can be OSPF and EIGRP redistribution process. Value delay redistribution 1% better than OSPF and EIGRP 2-3% under traffic density dependent. In calculating the trace route redistribution is done 2 calculations, the cost for OSPF area and the area of the EIGRP metric. Making primary and alternate paths based on the packet delivery rate and the cost of the smallest metric, it is proved by calculation and simulation. Keywords: OSPF, EIGRP, Redistribution, Delay, Cost, Metric.

  7. Application of cloud computing in power routing for clusters of microgrids using oblivious network routing algorithm

    DEFF Research Database (Denmark)

    Amini, M. Hadi; Broojeni, Kianoosh G.; Dragicevic, Tomislav

    2017-01-01

    of microgrid while preventing congestion as well as minimizing the power loss. Then, we present a two-layer simulation platform which considers both communication layer and physical layer of the microgrids' cluster. In order to improve the security of communication network, we perform the computations...... regarding the oblivious power routing via a cloud-based network. The proposed framework can be used for further studies that deal with the real-time simulation of the clusters of microgrids. In order to validate the effectiveness of the proposed framework, we implement our proposed oblivious routing scheme...

  8. A Practical Route Search System for Amusement Parks Navigation

    Directory of Open Access Journals (Sweden)

    Takahiro Shibuya

    2013-12-01

    Full Text Available It is very difficult to find the minimum route to travel in amusement park navigation. A searching system for visitors would be useful. Therefore, we constructed a system to find the route with the minimum total traveling time. Facility visitors can employ this system on a smart phone. The system is composed of Java and a Java Servlet. We conclude that our system is useful and can greatly shorten travel time within a typical amusement park.

  9. Advanced routing protocols for wireless networks

    CERN Document Server

    Campista , Miguel Elias Mitre

    2014-01-01

    This text introduces the principles of routing protocols and metrics as they affect wireless networking environments, specifically in urban areas. Timely because of the recent rise in small city life, this topic includes the consideration of ad hoc, mesh, vehicular, sensor, and delay tolerant networks. These approaches are each unique, and author Miguel Mitre Campista provides a thorough, but accessible, explanation of their individual characteristics for engineers, computer scientists, IT professionals, and curious Internet users.

  10. Vehicle Routing Problems for Drone Delivery

    OpenAIRE

    Dorling, Kevin; Heinrichs, Jordan; Messier, Geoffrey G.; Magierowski, Sebastian

    2016-01-01

    Unmanned aerial vehicles, or drones, have the potential to significantly reduce the cost and time of making last-mile deliveries and responding to emergencies. Despite this potential, little work has gone into developing vehicle routing problems (VRPs) specifically for drone delivery scenarios. Existing VRPs are insufficient for planning drone deliveries: either multiple trips to the depot are not permitted, leading to solutions with excess drones, or the effect of battery and payload weight ...

  11. Factorization of Constrained Energy K-Network Reliability with Perfect Nodes

    OpenAIRE

    Burgos, Juan Manuel

    2013-01-01

    This paper proves a new general K-network constrained energy reliability global factorization theorem. As in the unconstrained case, beside its theoretical mathematical importance the theorem shows how to do parallel processing in exact network constrained energy reliability calculations in order to reduce the processing time of this NP-hard problem. Followed by a new simple factorization formula for its calculation, we propose a new definition of constrained energy network reliability motiva...

  12. Reversible patterning of spherical shells through constrained buckling

    Science.gov (United States)

    Marthelot, J.; Brun, P.-T.; Jiménez, F. López; Reis, P. M.

    2017-07-01

    Recent advances in active soft structures envision the large deformations resulting from mechanical instabilities as routes for functional shape morphing. Numerous such examples exist for filamentary and plate systems. However, examples with double-curved shells are rarer, with progress hampered by challenges in fabrication and the complexities involved in analyzing their underlying geometrical nonlinearities. We show that on-demand patterning of hemispherical shells can be achieved through constrained buckling. Their postbuckling response is stabilized by an inner rigid mandrel. Through a combination of experiments, simulations, and scaling analyses, our investigation focuses on the nucleation and evolution of the buckling patterns into a reticulated network of sharp ridges. The geometry of the system, namely, the shell radius and the gap between the shell and the mandrel, is found to be the primary ingredient to set the surface morphology. This prominence of geometry suggests a robust, scalable, and tunable mechanism for reversible shape morphing of elastic shells.

  13. VT Route Log Points 2017

    Data.gov (United States)

    Vermont Center for Geographic Information — This data layer is used with VTrans' Integrated Route Log System (IRA). It is also used to calibrate the linear referencing systems, including the End-to-End and...

  14. Predicting Catastrophic BGP Routing Instabilities

    National Research Council Canada - National Science Library

    Nguyen, Lien

    2004-01-01

    .... Currently, this critical function is performed by the Border Gateway Protocol (BGP) version 4 RF01771. Like all routing protocols, BGP is vulnerable to instabilities that reduce its effectiveness...

  15. Coherent Structures and Entropy in Constrained, Modulationally Unstable, Nonintegrable Systems

    International Nuclear Information System (INIS)

    Rumpf, Benno; Newell, Alan C.

    2001-01-01

    Many studies have shown that nonintegrable systems with modulational instabilities constrained by more than one conservation law exhibit universal long time behavior involving large coherent structures in a sea of small fluctuations. We show how this behavior can be explained in detail by simple thermodynamic arguments

  16. Testing a Constrained MPC Controller in a Process Control Laboratory

    Science.gov (United States)

    Ricardez-Sandoval, Luis A.; Blankespoor, Wesley; Budman, Hector M.

    2010-01-01

    This paper describes an experiment performed by the fourth year chemical engineering students in the process control laboratory at the University of Waterloo. The objective of this experiment is to test the capabilities of a constrained Model Predictive Controller (MPC) to control the operation of a Double Pipe Heat Exchanger (DPHE) in real time.…

  17. Constrained control of a once-through boiler with recirculation

    DEFF Research Database (Denmark)

    Trangbæk, K

    2008-01-01

    There is an increasing need to operate power plants at low load for longer periods of time. When a once-through boiler operates at a sufficiently low load, recirculation is introduced, significantly altering the control structure. This paper illustrates the possibilities for using constrained con...

  18. Lagrangian formalism for constrained systems. 2. Gauge symmetries

    International Nuclear Information System (INIS)

    Pyatov, P.N.

    1990-01-01

    Using the Lagrangian formalism for constrained systems all gauge symmetries peculiar for a given Lagrangian system and in establishing the relation between them and the constraints are constructed. Besides, the question about the possible dependence of gauge transformations on accelerations and other higher order time derivatives of coordinates is clarified. 14 refs

  19. New TPG bus route 28

    CERN Multimedia

    2003-01-01

    Geneva's Public Transport services (TPG) have recently inaugurated a new bus line 28, connecting the La Tour Hospital in Meyrin to the international organisations in Geneva, via the airport. All signs associated with this route will be yellow in colour. Timetables and route details can be found at http://www.tpg.ch. Relations with the Host States Service http://www.cern.ch/relations/ Tel. 72848

  20. Route analysis for MHD equilibria

    International Nuclear Information System (INIS)

    Kikuchi, Fumio; Aizawa, Tatsuhiko

    1982-01-01

    In Tokamak facilities which are promising in nuclear fusion reactor development, the plasma in the core is often described by MHD approximation. Specifically, since an axisymmetric torus is approximately assumed as the first wall (shell) shape in actual Tokamak facilities, the Grad-Shafranov equation to be satisfied by an axisymmetric equilibrium solution for ideal MHD fluid must be solved, and the characteristics of its solution must be clarified. This paper shows the outline of the numerical calculation which employs both the incremental method taking the particular incremental nodal point values as the control parameters and the interaction method in accordance with Newton method at the same time, the analysis objective being a non-linear eigenvalue problem dealing the boundary of plasma region with surrounding vacuum region as the free boundary. Next, the detailed route analysis of the equilibrium solution is performed, utilizing the above numerical calculation technique, to clarify the effect of shell shape on the behaviour of the equilibrium solution. As the shape of the shell, a rectangular section torus, which have a notch depression at a part of the shell inner boundary, is considered. In the paper, the fundamental MHD equation and its approximate solution by the finite element method, the behaviour of plasma equilibrium solution in a shell having a notch, and the effect of notch shapes on plasma behaviour are described. This analysis verifies the effectiveness of the calculation method. (Wakatsuki, Y.)

  1. Wavelet library for constrained devices

    Science.gov (United States)

    Ehlers, Johan Hendrik; Jassim, Sabah A.

    2007-04-01

    The wavelet transform is a powerful tool for image and video processing, useful in a range of applications. This paper is concerned with the efficiency of a certain fast-wavelet-transform (FWT) implementation and several wavelet filters, more suitable for constrained devices. Such constraints are typically found on mobile (cell) phones or personal digital assistants (PDA). These constraints can be a combination of; limited memory, slow floating point operations (compared to integer operations, most often as a result of no hardware support) and limited local storage. Yet these devices are burdened with demanding tasks such as processing a live video or audio signal through on-board capturing sensors. In this paper we present a new wavelet software library, HeatWave, that can be used efficiently for image/video processing/analysis tasks on mobile phones and PDA's. We will demonstrate that HeatWave is suitable for realtime applications with fine control and range to suit transform demands. We shall present experimental results to substantiate these claims. Finally this library is intended to be of real use and applied, hence we considered several well known and common embedded operating system platform differences; such as a lack of common routines or functions, stack limitations, etc. This makes HeatWave suitable for a range of applications and research projects.

  2. Constrained Sintering in Fabrication of Solid Oxide Fuel Cells.

    Science.gov (United States)

    Lee, Hae-Weon; Park, Mansoo; Hong, Jongsup; Kim, Hyoungchul; Yoon, Kyung Joong; Son, Ji-Won; Lee, Jong-Ho; Kim, Byung-Kook

    2016-08-09

    Solid oxide fuel cells (SOFCs) are inevitably affected by the tensile stress field imposed by the rigid substrate during constrained sintering, which strongly affects microstructural evolution and flaw generation in the fabrication process and subsequent operation. In the case of sintering a composite cathode, one component acts as a continuous matrix phase while the other acts as a dispersed phase depending upon the initial composition and packing structure. The clustering of dispersed particles in the matrix has significant effects on the final microstructure, and strong rigidity of the clusters covering the entire cathode volume is desirable to obtain stable pore structure. The local constraints developed around the dispersed particles and their clusters effectively suppress generation of major process flaws, and microstructural features such as triple phase boundary and porosity could be readily controlled by adjusting the content and size of the dispersed particles. However, in the fabrication of the dense electrolyte layer via the chemical solution deposition route using slow-sintering nanoparticles dispersed in a sol matrix, the rigidity of the cluster should be minimized for the fine matrix to continuously densify, and special care should be taken in selecting the size of the dispersed particles to optimize the thermodynamic stability criteria of the grain size and film thickness. The principles of constrained sintering presented in this paper could be used as basic guidelines for realizing the ideal microstructure of SOFCs.

  3. Constrained Sintering in Fabrication of Solid Oxide Fuel Cells

    Science.gov (United States)

    Lee, Hae-Weon; Park, Mansoo; Hong, Jongsup; Kim, Hyoungchul; Yoon, Kyung Joong; Son, Ji-Won; Lee, Jong-Ho; Kim, Byung-Kook

    2016-01-01

    Solid oxide fuel cells (SOFCs) are inevitably affected by the tensile stress field imposed by the rigid substrate during constrained sintering, which strongly affects microstructural evolution and flaw generation in the fabrication process and subsequent operation. In the case of sintering a composite cathode, one component acts as a continuous matrix phase while the other acts as a dispersed phase depending upon the initial composition and packing structure. The clustering of dispersed particles in the matrix has significant effects on the final microstructure, and strong rigidity of the clusters covering the entire cathode volume is desirable to obtain stable pore structure. The local constraints developed around the dispersed particles and their clusters effectively suppress generation of major process flaws, and microstructural features such as triple phase boundary and porosity could be readily controlled by adjusting the content and size of the dispersed particles. However, in the fabrication of the dense electrolyte layer via the chemical solution deposition route using slow-sintering nanoparticles dispersed in a sol matrix, the rigidity of the cluster should be minimized for the fine matrix to continuously densify, and special care should be taken in selecting the size of the dispersed particles to optimize the thermodynamic stability criteria of the grain size and film thickness. The principles of constrained sintering presented in this paper could be used as basic guidelines for realizing the ideal microstructure of SOFCs. PMID:28773795

  4. Capacitated Bounded Cardinality Hub Routing Problem: Model and Solution Algorithm

    OpenAIRE

    Gelareha, Shahin; Monemic, Rahimeh Neamatian; Semetd, Frederic

    2017-01-01

    In this paper, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein each hub acts as a transshipment node for one directed route. The number of hubs lies between a minimum and a maximum and the hub-level network is a complete subgraph. The transshipment operations take place at the hub nodes and flow transfer time from a hub-level transporter to a spoke-level vehicle influences spoke- to-hub allocations. We propose a mathematical model and a branch-and-cut algor...

  5. Routing of Electric Vehicles: City Distribution in Copenhagen

    DEFF Research Database (Denmark)

    Linde, Esben; Larsen, Allan; Nørrelund, Anders Vedsted

    In this work, a Vehicle Routing Problem with Time Windows considering EV constraints of limited driving range and freight capacity is addressed (EVRPTW). The EVs are allowed to recharge at certain locations, and aspects of intelligent location of these recharging points are considered....... The objective is to find the least cost plan for EV routing and compare this to conventional routing. A heuristic method is developed and tested on data based on real-life collected data on distribution vehicles in central Copenhagen, Denmark. The EVRPTW has so far received little attention in the literature...

  6. Fund allocation using capacitated vehicle routing problem

    Science.gov (United States)

    Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah Rozita; Darus, Maslina

    2014-09-01

    In investment fund allocation, it is unwise for an investor to distribute his fund into several assets simultaneously due to economic reasons. One solution is to allocate the fund into a particular asset at a time in a sequence that will either maximize returns or minimize risks depending on the investor's objective. The vehicle routing problem (VRP) provides an avenue to this issue. VRP answers the question on how to efficiently use the available fleet of vehicles to meet a given service demand, subjected to a set of operational requirements. This paper proposes an idea of using capacitated vehicle routing problem (CVRP) to optimize investment fund allocation by employing data of selected stocks in the FTSE Bursa Malaysia. Results suggest that CRVP can be applied to solve the issue of investment fund allocation and increase the investor's profit.

  7. Effective Privacy-Preserving Online Route Planning

    DEFF Research Database (Denmark)

    Vicente, Carmen Ruiz; Assent, Ira; Jensen, Christian S.

    2011-01-01

    An online Route Planning Service (RPS) computes a route from one location to another. Current RPSs such as Google Maps require the use of precise locations. However, some users may not want to disclose their source and destination locations due to privacy concerns. An approach that supplies fake...... privacy. The solution re-uses a standard online RPS rather than replicate this functionality, and it needs no trusted third party. The solution is able to compute the exact results without leaking of the exact locations to the RPS or un-trusted parties. In addition, we provide heuristics that reduce...... the number of times that the RPS needs to be queried, and we also describe how the accuracy and privacy requirements can be relaxed to achieve better performance. An empirical study offers insight into key properties of the approach....

  8. Enabling Routes as Context in Mobile Services

    DEFF Research Database (Denmark)

    Brilingaite, Agne; Jensen, Christian Søndergaard; Zokaite, Nora

    With the continuing advances in wireless communications, geo-positioning, and portable electronics, an infrastructure is emerging that enables the delivery of on-line, location-enabled services to very large numbers of mobile users. A typical usage situation for mobile services is one characteriz...... and accumulates the routes of a user along with their usage patterns and that makes the routes available to services. Experiences from using the component on logs of GPS positions acquired from vehicles traveling within a real road network are reported....... by a small screen and no keyboard, and by the service being only a secondary focus of the user. Under such circumstances, it is particularly important to deliver the "right" information and service at the right time, with as little user interaction as possible. This may be achieved by making services context...

  9. Air Cargo Transportation Route Choice Analysis

    Science.gov (United States)

    Obashi, Hiroshi; Kim, Tae-Seung; Oum, Tae Hoon

    2003-01-01

    Using a unique feature of air cargo transshipment data in the Northeast Asian region, this paper identifies the critical factors that determine the transshipment route choice. Taking advantage of the variations in the transport characteristics in each origin-destination airports pair, the paper uses a discrete choice model to describe the transshipping route choice decision made by an agent (i.e., freight forwarder, consolidator, and large shipper). The analysis incorporates two major factors, monetary cost (such as line-haul cost and landing fee) and time cost (i.e., aircraft turnaround time, including loading and unloading time, custom clearance time, and expected scheduled delay), along with other controls. The estimation method considers the presence of unobserved attributes, and corrects for resulting endogeneity by use of appropriate instrumental variables. Estimation results find that transshipment volumes are more sensitive to time cost, and that the reduction in aircraft turnaround time by 1 hour would be worth the increase in airport charges by more than $1000. Simulation exercises measures the impacts of alternative policy scenarios for a Korean airport, which has recently declared their intention to be a future regional hub in the Northeast Asian region. The results suggest that reducing aircraft turnaround time at the airport be an effective strategy, rather than subsidizing to reduce airport charges.

  10. Route Choice in Subway Station during Morning Peak Hours: A Case of Guangzhou Subway

    Directory of Open Access Journals (Sweden)

    Jie Xu

    2015-01-01

    Full Text Available This paper is aimed at crowding phenomenon in the subway. As passengers are inclined to choose the route with minimum disutility, we put forward a route choice model which is constructed to achieve minimum objective function of feasibility for the optimal solution. Meanwhile we set passenger volume threshold values according to capacity of facilities. In the case of actual capacity exceeding the threshold, the decision node of constrained route will be selected; computing procedure about searching decision points will be presented. Then we should set rational restrictions at the decision node of the minimum utility function route to prevent too many passengers’ access to platform. Through certification, this series of methods can effectively ensure the safety of the station efficient operation.

  11. Order-constrained linear optimization.

    Science.gov (United States)

    Tidwell, Joe W; Dougherty, Michael R; Chrabaszcz, Jeffrey S; Thomas, Rick P

    2017-11-01

    Despite the fact that data and theories in the social, behavioural, and health sciences are often represented on an ordinal scale, there has been relatively little emphasis on modelling ordinal properties. The most common analytic framework used in psychological science is the general linear model, whose variants include ANOVA, MANOVA, and ordinary linear regression. While these methods are designed to provide the best fit to the metric properties of the data, they are not designed to maximally model ordinal properties. In this paper, we develop an order-constrained linear least-squares (OCLO) optimization algorithm that maximizes the linear least-squares fit to the data conditional on maximizing the ordinal fit based on Kendall's τ. The algorithm builds on the maximum rank correlation estimator (Han, 1987, Journal of Econometrics, 35, 303) and the general monotone model (Dougherty & Thomas, 2012, Psychological Review, 119, 321). Analyses of simulated data indicate that when modelling data that adhere to the assumptions of ordinary least squares, OCLO shows minimal bias, little increase in variance, and almost no loss in out-of-sample predictive accuracy. In contrast, under conditions in which data include a small number of extreme scores (fat-tailed distributions), OCLO shows less bias and variance, and substantially better out-of-sample predictive accuracy, even when the outliers are removed. We show that the advantages of OCLO over ordinary least squares in predicting new observations hold across a variety of scenarios in which researchers must decide to retain or eliminate extreme scores when fitting data. © 2017 The British Psychological Society.

  12. Scheduling Aircraft Landings under Constrained Position Shifting

    Science.gov (United States)

    Balakrishnan, Hamsa; Chandran, Bala

    2006-01-01

    Optimal scheduling of airport runway operations can play an important role in improving the safety and efficiency of the National Airspace System (NAS). Methods that compute the optimal landing sequence and landing times of aircraft must accommodate practical issues that affect the implementation of the schedule. One such practical consideration, known as Constrained Position Shifting (CPS), is the restriction that each aircraft must land within a pre-specified number of positions of its place in the First-Come-First-Served (FCFS) sequence. We consider the problem of scheduling landings of aircraft in a CPS environment in order to maximize runway throughput (minimize the completion time of the landing sequence), subject to operational constraints such as FAA-specified minimum inter-arrival spacing restrictions, precedence relationships among aircraft that arise either from airline preferences or air traffic control procedures that prevent overtaking, and time windows (representing possible control actions) during which each aircraft landing can occur. We present a Dynamic Programming-based approach that scales linearly in the number of aircraft, and describe our computational experience with a prototype implementation on realistic data for Denver International Airport.

  13. Route Fidelity during Marine Megafauna Migration

    Directory of Open Access Journals (Sweden)

    Travis W. Horton

    2017-12-01

    Full Text Available The conservation and protection of marine megafauna require robust knowledge of where and when animals are located. Yet, our ability to predict animal distributions in space and time remains limited due to difficulties associated with studying elusive animals with large home ranges. The widespread deployment of satellite telemetry technology creates unprecedented opportunities to remotely monitor animal movements and to analyse the spatial and temporal trajectories of these movements from a variety of geophysical perspectives. Reproducible patterns in movement trajectories can help elucidate the potential mechanisms by which marine megafauna navigate across vast expanses of open-ocean. Here, we present an empirical analysis of humpback whale (Megaptera novaeangliae, great white shark (Carcharodon carcharias, and northern elephant seal (Mirounga angustirostris satellite telemetry-derived route fidelity movements in magnetic and gravitational coordinates. Our analyses demonstrate that: (1 humpback whales, great white sharks and northern elephant seals are capable of performing route fidelity movements across millions of square kilometers of open ocean with a spatial accuracy of better than 150 km despite temporal separations as long as 7 years between individual movements; (2 route fidelity movements include significant (p < 0.05 periodicities that are comparable in duration to the lunar cycles and semi-cycles; (3 latitude and bedrock-dependent gravitational cues are stronger predictors of route fidelity movements than spherical magnetic coordinate cues when analyzed with respect to the temporally dependent moon illumination cycle. We further show that both route fidelity and non-route fidelity movement trajectories, for all three species, describe overlapping in-phase or antiphase sinusoids when individual movements are normalized to the gravitational acceleration present at migratory departure sites. Although these empirical results provide an

  14. Vehicle Routing With User Generated Trajectory Data

    DEFF Research Database (Denmark)

    Ceikute, Vaida; Jensen, Christian S.

    Rapidly increasing volumes of GPS data collected from vehicles provide new and increasingly comprehensive insight into the routes that drivers prefer. While routing services generally compute shortest or fastest routes, recent studies suggest that local drivers often prefer routes that are neithe...

  15. Production of BaAl_2O_4 doped with Eu"3"+ in low temperature: research of the influence of the synthesis route, temperature and calcination time in the optical properties

    International Nuclear Information System (INIS)

    Gomes, Manasses Almeida

    2017-01-01

    In this work, the synthesis condition (complexing agent and temperature and time of calcination) were studied aiming to produce BaAl_2O_4 samples in the ferroelectric hexagonal phase. Pure and Eu"3"+ - doped samples were produced and its luminescent properties were investigated. BaAl_2O_4 was prepared using several thermal treatment conditions, via an alternative sol-gel route, using coconut water or PVA as the complexing agents. The sample production at 600 °C/5h is quite interesting, since to date the lowest calcination temperatures found in the literature was 650 ° C using reagents with high degree of toxicity DTA / TG measurements indicated a possible start of the crystallization of the material at approximately 600 ° C, and the X-ray powder diffraction (XRD) confirm the formation of the desired phase of the calcined barium aluminate at that temperature. The results of the Rietveld refinements showed the occurrence of secondary phase in the samples produced at 600 ° C / 5h, presenting 5% of phase Ba(NO_3)_2, while single phase was found for samples calcined at 1200 ° C for 2 and 5h. Analysis of the diffractogram by the Scherrer equation showed smaller crystallite size for samples calcified at 600 °C/5h, but apparently with a lower degree of crystallinity than the sample prepared at 1200 ° C/ 2 and 5h. The photoluminescence measurements showed that the emission spectra of the samples have great dependence on the times, temperatures and complexing agents used. In particular, samples calcined at 600 ° C have very different characteristics with regard to the probabilities of emissions associated with Eu"3"+ when compared with samples produced at higher temperatures. Differences observed in the spectra of samples produced via different complexing agents are possibly due to defects created in the materials by impurities present in the coconut water. Samples produced using PVA present sites with higher symmetry, which was evidenced by a lower relative emission

  16. Intermittency route to chaos in a biochemical system.

    Science.gov (United States)

    De la Fuente, I M; Martinez, L; Veguillas, J

    1996-01-01

    The numerical analysis of a glycolytic model performed through the construction of a system of three differential-delay equations reveals a phenomenon of intermittency route to chaos. In our biochemical system, the consideration of delay time variations under constant input flux as well as frequency variations of the periodic substrate input flux allows us, in both cases, to observe a type of transition to chaos different from the 'Feigenbaum route'.

  17. Cluster Based Hierarchical Routing Protocol for Wireless Sensor Network

    OpenAIRE

    Rashed, Md. Golam; Kabir, M. Hasnat; Rahim, Muhammad Sajjadur; Ullah, Shaikh Enayet

    2012-01-01

    The efficient use of energy source in a sensor node is most desirable criteria for prolong the life time of wireless sensor network. In this paper, we propose a two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol (CBHRP). We introduce a new concept called head-set, consists of one active cluster head and some other associate cluster heads within a cluster. The head-set members are responsible for control and management of the network. Results show that t...

  18. Energy Aware Cluster Based Routing Scheme For Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Roy Sohini

    2015-09-01

    Full Text Available Wireless Sensor Network (WSN has emerged as an important supplement to the modern wireless communication systems due to its wide range of applications. The recent researches are facing the various challenges of the sensor network more gracefully. However, energy efficiency has still remained a matter of concern for the researches. Meeting the countless security needs, timely data delivery and taking a quick action, efficient route selection and multi-path routing etc. can only be achieved at the cost of energy. Hierarchical routing is more useful in this regard. The proposed algorithm Energy Aware Cluster Based Routing Scheme (EACBRS aims at conserving energy with the help of hierarchical routing by calculating the optimum number of cluster heads for the network, selecting energy-efficient route to the sink and by offering congestion control. Simulation results prove that EACBRS performs better than existing hierarchical routing algorithms like Distributed Energy-Efficient Clustering (DEEC algorithm for heterogeneous wireless sensor networks and Energy Efficient Heterogeneous Clustered scheme for Wireless Sensor Network (EEHC.

  19. Acquisition of business intelligence from human experience in route planning

    Science.gov (United States)

    Bello Orgaz, Gema; Barrero, David F.; R-Moreno, María D.; Camacho, David

    2015-04-01

    The logistic sector raises a number of highly challenging problems. Probably one of the most important ones is the shipping planning, i.e. plan the routes that the shippers have to follow to deliver the goods. In this article, we present an artificial intelligence-based solution that has been designed to help a logistic company to improve its routes planning process. In order to achieve this goal, the solution uses the knowledge acquired by the company drivers to propose optimised routes. Hence, the proposed solution gathers the experience of the drivers, processes it and optimises the delivery process. The solution uses data mining to extract knowledge from the company information systems and prepares it for analysis with a case-based reasoning (CBR) algorithm. The CBR obtains critical business intelligence knowledge from the drivers experience that is needed by the planner. The design of the routes is done by a genetic algorithm that, given the processed information, optimises the routes following several objectives, such as minimise the distance or time. Experimentation shows that the proposed approach is able to find routes that improve, on average, the routes made by the human experts.

  20. Route Flap Damping Made Usable

    Science.gov (United States)

    Pelsser, Cristel; Maennel, Olaf; Mohapatra, Pradosh; Bush, Randy; Patel, Keyur

    The Border Gateway Protocol (BGP), the de facto inter-domain routing protocol of the Internet, is known to be noisy. The protocol has two main mechanisms to ameliorate this, MinRouteAdvertisementInterval (MRAI), and Route Flap Damping (RFD). MRAI deals with very short bursts on the order of a few to 30 seconds. RFD deals with longer bursts, minutes to hours. Unfortunately, RFD was found to severely penalize sites for being well-connected because topological richness amplifies the number of update messages exchanged. So most operators have disabled it. Through measurement, this paper explores the avenue of absolutely minimal change to code, and shows that a few RFD algorithmic constants and limits can be trivially modified, with the result being damping a non-trivial amount of long term churn without penalizing well-behaved prefixes' normal convergence process.

  1. Benefits Analysis of Multi-Center Dynamic Weather Routes

    Science.gov (United States)

    Sheth, Kapil; McNally, David; Morando, Alexander; Clymer, Alexis; Lock, Jennifer; Petersen, Julien

    2014-01-01

    Dynamic weather routes are flight plan corrections that can provide airborne flights more than user-specified minutes of flying-time savings, compared to their current flight plan. These routes are computed from the aircraft's current location to a flight plan fix downstream (within a predefined limit region), while avoiding forecasted convective weather regions. The Dynamic Weather Routes automation has been continuously running with live air traffic data for a field evaluation at the American Airlines Integrated Operations Center in Fort Worth, TX since July 31, 2012, where flights within the Fort Worth Air Route Traffic Control Center are evaluated for time savings. This paper extends the methodology to all Centers in United States and presents benefits analysis of Dynamic Weather Routes automation, if it was implemented in multiple airspace Centers individually and concurrently. The current computation of dynamic weather routes requires a limit rectangle so that a downstream capture fix can be selected, preventing very large route changes spanning several Centers. In this paper, first, a method of computing a limit polygon (as opposed to a rectangle used for Fort Worth Center) is described for each of the 20 Centers in the National Airspace System. The Future ATM Concepts Evaluation Tool, a nationwide simulation and analysis tool, is used for this purpose. After a comparison of results with the Center-based Dynamic Weather Routes automation in Fort Worth Center, results are presented for 11 Centers in the contiguous United States. These Centers are generally most impacted by convective weather. A breakdown of individual Center and airline savings is presented and the results indicate an overall average savings of about 10 minutes of flying time are obtained per flight.

  2. Modeling the microstructural evolution during constrained sintering

    DEFF Research Database (Denmark)

    Bjørk, Rasmus; Frandsen, Henrik Lund; Tikare, V.

    A numerical model able to simulate solid state constrained sintering of a powder compact is presented. The model couples an existing kinetic Monte Carlo (kMC) model for free sintering with a finite element (FE) method for calculating stresses on a microstructural level. The microstructural response...... to the stress field as well as the FE calculation of the stress field from the microstructural evolution is discussed. The sintering behavior of two powder compacts constrained by a rigid substrate is simulated and compared to free sintering of the same samples. Constrained sintering result in a larger number...

  3. Satellite network robust QoS-aware routing

    CERN Document Server

    Long, Fei

    2014-01-01

    Satellite Network Robust QoS-aware Routing presents a novel routing strategy for satellite networks. This strategy is useful for the design of multi-layered satellite networks as it can greatly reduce the number of time slots in one system cycle. The traffic prediction and engineering approaches make the system robust so that the traffic spikes can be handled effectively. The multi-QoS optimization routing algorithm can satisfy various potential user requirements. Clear and sufficient illustrations are also presented in the book. As the chapters cover the above topics independently, readers from different research backgrounds in constellation design, multi-QoS routing, and traffic engineering can benefit from the book.   Fei Long is a senior engineer at Beijing R&D Center of 54th Research Institute of China Electronics Technology Group Corporation.

  4. Dynamic Routing during Disaster Events

    NARCIS (Netherlands)

    Fitrianie, S.; Rothkrantz, L.J.M.

    2015-01-01

    Innovations in mobile technology allow people to request route information on their smartphone to reach safe areas during emergency and disaster evacuations. In return, the affected people in the field can send their observation reports, e.g. using a dedicated icon-based disaster language. However,

  5. Overview: Routes to Open Access

    OpenAIRE

    Tullney, Marco; van Wezenbeek, Wilma

    2017-01-01

    Slides of an overview presentation given at a CESAER workshop on Open Access, February 2nd, 2017, in Brussels Cover major routes to more open access as discussed in the Task Force Open Science of CESAER: (national) open access strategies open access mandates open access incentives open access awareness open access publishing open access infrastructure

  6. Dynamic Weather Routes Architecture Overview

    Science.gov (United States)

    Eslami, Hassan; Eshow, Michelle

    2014-01-01

    Dynamic Weather Routes Architecture Overview, presents the high level software architecture of DWR, based on the CTAS software framework and the Direct-To automation tool. The document also covers external and internal data flows, required dataset, changes to the Direct-To software for DWR, collection of software statistics, and the code structure.

  7. Emissions allocation in transportation routes

    NARCIS (Netherlands)

    Leenders, B.P.J.; Velázquez Martínez, J.; Fransoo, J.C.

    2017-01-01

    This article studies the allocation of CO2 emissions to a specific shipment in routing transportation. The authors show that this problem differs from a cost allocation problem specifically because the concavity condition does not hold necessarily in the CO2 allocation problem. This implies that a

  8. Roots/Routes: Part I

    Science.gov (United States)

    Swanson, Dalene M.

    2009-01-01

    This narrative and poetic rendering acts as an articulation of a journey of many routes. It is a storying of critical research issues and events as performances of lived experience. It is a metissage of hybrid, but interrelated, themes that find cohesion through fragmentation and coalescence, severance, and regrowth. These themes are invoked by…

  9. Roots/Routes: Part II

    Science.gov (United States)

    Swanson, Dalene M.

    2009-01-01

    This narrative acts as an articulation of a journey of many routes. Following Part I of the same research journey of rootedness/routedness, it debates the nature of transformation and transcendence beyond personal and political paradoxes informed by neoliberalism and related repressive globalizing discourses. Through a more personal, descriptive,…

  10. Performansi Algoritma CODEQ dalam Penyelesaian Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Annisa Kesy Garside

    2014-01-01

    Full Text Available Genetic Algorithm, Tabu Search, Simulated Annealing, and Ant Colony Optimization showed a good performance in solving vehicle routing problem. However, the generated solution of those algorithms was changeable regarding on the input parameter of each algorithm. CODEQ is a new, parameter free meta-heuristic algorithm that had been successfully used to solve constrained optimization problems, integer programming, and feed-forward neural network. The purpose of this research are improving CODEQ algorithm to solve vehicle routing problem and testing the performance of the improved algorithm. CODEQ algorithm is started with population initiation as initial solution, generated of mutant vector for each parent in every iteration, replacement of parent by mutant when fitness function value of mutant is better than parent’s, generated of new vector for each iteration based on opposition value or chaos principle, replacement of worst solution by new vector when fitness function value of new vector is better, iteration ceasing when stooping criterion is achieved, and sub-tour determination based on vehicle capacity constraint. The result showed that the average deviation of the best-known and the best-test value is 6.35%. Therefore, CODEQ algorithm is good in solving vehicle routing problem.

  11. Using Seasonal Forecasting Data for Vessel Routing

    Science.gov (United States)

    Bell, Ray; Kirtman, Ben

    2017-04-01

    We present an assessment of seasonal forecasting of surface wind speed, significant wave height and ocean surface current speed in the North Pacific for potential use of vessel routing from Singapore to San Diego. WaveWatchIII is forced with surface winds and ocean surface currents from the Community Climate System Model 4 (CCSM4) retrospective forecasts for the period of 1982-2015. Several lead time forecasts are used from zero months to six months resulting in 2,720 model years, ensuring the findings from this study are robust. July surface wind speed and significant wave height can be skillfully forecast with a one month lead time, with the western North Pacific being the most predictable region. Beyond May initial conditions (lead time of two months) the El Niño Southern Oscillation (ENSO) Spring predictability barrier limits skill of significant wave height but there is skill for surface wind speed with January initial conditions (lead time of six months). In a separate study of vessel routing between Norfolk, Virginia and Gibraltar we demonstrate the benefit of a multimodel approach using the North American Multimodel Ensemble (NMME). In collaboration with Charles River Analytics an all-encompassing forecast is presented by using machine learning on the various ensembles which can be using used for industry applications.

  12. Asymptotic Likelihood Distribution for Correlated & Constrained Systems

    CERN Document Server

    Agarwal, Ujjwal

    2016-01-01

    It describes my work as summer student at CERN. The report discusses the asymptotic distribution of the likelihood ratio for total no. of parameters being h and 2 out of these being are constrained and correlated.

  13. Constrained bidirectional propagation and stroke segmentation

    Energy Technology Data Exchange (ETDEWEB)

    Mori, S; Gillespie, W; Suen, C Y

    1983-03-01

    A new method for decomposing a complex figure into its constituent strokes is described. This method, based on constrained bidirectional propagation, is suitable for parallel processing. Examples of its application to the segmentation of Chinese characters are presented. 9 references.

  14. Mathematical Modeling of Constrained Hamiltonian Systems

    NARCIS (Netherlands)

    Schaft, A.J. van der; Maschke, B.M.

    1995-01-01

    Network modelling of unconstrained energy conserving physical systems leads to an intrinsic generalized Hamiltonian formulation of the dynamics. Constrained energy conserving physical systems are directly modelled as implicit Hamiltonian systems with regard to a generalized Dirac structure on the

  15. Client's Constraining Factors to Construction Project Management

    African Journals Online (AJOL)

    factors as a significant system that constrains project management success of public and ... finance for the project and prompt payment for work executed; clients .... consideration of the loading patterns of these variables, the major factor is ...

  16. Hypsometric amplification and routing moderation of Greenland ice sheet meltwater release

    Directory of Open Access Journals (Sweden)

    D. van As

    2017-06-01

    Full Text Available Concurrent ice sheet surface runoff and proglacial discharge monitoring are essential for understanding Greenland ice sheet meltwater release. We use an updated, well-constrained river discharge time series from the Watson River in southwest Greenland, with an accurate, observation-based ice sheet surface mass balance model of the  ∼  12 000 km2 ice sheet area feeding the river. For the 2006–2015 decade, we find a large range of a factor of 3 in interannual variability in discharge. The amount of discharge is amplified  ∼  56 % by the ice sheet's hypsometry, i.e., area increase with elevation. A good match between river discharge and ice sheet surface meltwater production is found after introducing elevation-dependent transit delays that moderate diurnal variability in meltwater release by a factor of 10–20. The routing lag time increases with ice sheet elevation and attains values in excess of 1 week for the upper reaches of the runoff area at  ∼  1800 m above sea level. These multi-day routing delays ensure that the highest proglacial discharge levels and thus overbank flooding events are more likely to occur after multi-day melt episodes. Finally, for the Watson River ice sheet catchment, we find no evidence of meltwater storage in or release from the en- and subglacial environments in quantities exceeding our methodological uncertainty, based on the good match between ice sheet runoff and proglacial discharge.

  17. On the origin of constrained superfields

    Energy Technology Data Exchange (ETDEWEB)

    Dall’Agata, G. [Dipartimento di Fisica “Galileo Galilei”, Università di Padova,Via Marzolo 8, 35131 Padova (Italy); INFN, Sezione di Padova,Via Marzolo 8, 35131 Padova (Italy); Dudas, E. [Centre de Physique Théorique, École Polytechnique, CNRS, Université Paris-Saclay,F-91128 Palaiseau (France); Farakos, F. [Dipartimento di Fisica “Galileo Galilei”, Università di Padova,Via Marzolo 8, 35131 Padova (Italy); INFN, Sezione di Padova,Via Marzolo 8, 35131 Padova (Italy)

    2016-05-06

    In this work we analyze constrained superfields in supersymmetry and supergravity. We propose a constraint that, in combination with the constrained goldstino multiplet, consistently removes any selected component from a generic superfield. We also describe its origin, providing the operators whose equations of motion lead to the decoupling of such components. We illustrate our proposal by means of various examples and show how known constraints can be reproduced by our method.

  18. Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm

    Directory of Open Access Journals (Sweden)

    Yingcheng Xu

    2013-01-01

    Full Text Available In order to effectively solve the dynamic vehicle routing problem with time windows, the mathematical model is established and an improved variable neighborhood search algorithm is proposed. In the algorithm, allocation customers and planning routes for the initial solution are completed by the clustering method. Hybrid operators of insert and exchange are used to achieve the shaking process, the later optimization process is presented to improve the solution space, and the best-improvement strategy is adopted, which make the algorithm can achieve a better balance in the solution quality and running time. The idea of simulated annealing is introduced to take control of the acceptance of new solutions, and the influences of arrival time, distribution of geographical location, and time window range on route selection are analyzed. In the experiment, the proposed algorithm is applied to solve the different sizes' problems of DVRP. Comparing to other algorithms on the results shows that the algorithm is effective and feasible.

  19. Explaining evolution via constrained persistent perfect phylogeny

    Science.gov (United States)

    2014-01-01

    Background The perfect phylogeny is an often used model in phylogenetics since it provides an efficient basic procedure for representing the evolution of genomic binary characters in several frameworks, such as for example in haplotype inference. The model, which is conceptually the simplest, is based on the infinite sites assumption, that is no character can mutate more than once in the whole tree. A main open problem regarding the model is finding generalizations that retain the computational tractability of the original model but are more flexible in modeling biological data when the infinite site assumption is violated because of e.g. back mutations. A special case of back mutations that has been considered in the study of the evolution of protein domains (where a domain is acquired and then lost) is persistency, that is the fact that a character is allowed to return back to the ancestral state. In this model characters can be gained and lost at most once. In this paper we consider the computational problem of explaining binary data by the Persistent Perfect Phylogeny model (referred as PPP) and for this purpose we investigate the problem of reconstructing an evolution where some constraints are imposed on the paths of the tree. Results We define a natural generalization of the PPP problem obtained by requiring that for some pairs (character, species), neither the species nor any of its ancestors can have the character. In other words, some characters cannot be persistent for some species. This new problem is called Constrained PPP (CPPP). Based on a graph formulation of the CPPP problem, we are able to provide a polynomial time solution for the CPPP problem for matrices whose conflict graph has no edges. Using this result, we develop a parameterized algorithm for solving the CPPP problem where the parameter is the number of characters. Conclusions A preliminary experimental analysis shows that the constrained persistent perfect phylogeny model allows to

  20. Joint Chance-Constrained Dynamic Programming

    Science.gov (United States)

    Ono, Masahiro; Kuwata, Yoshiaki; Balaram, J. Bob

    2012-01-01

    This paper presents a novel dynamic programming algorithm with a joint chance constraint, which explicitly bounds the risk of failure in order to maintain the state within a specified feasible region. A joint chance constraint cannot be handled by existing constrained dynamic programming approaches since their application is limited to constraints in the same form as the cost function, that is, an expectation over a sum of one-stage costs. We overcome this challenge by reformulating the joint chance constraint into a constraint on an expectation over a sum of indicator functions, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the primal variables can be optimized by a standard dynamic programming, while the dual variable is optimized by a root-finding algorithm that converges exponentially. Error bounds on the primal and dual objective values are rigorously derived. We demonstrate the algorithm on a path planning problem, as well as an optimal control problem for Mars entry, descent and landing. The simulations are conducted using a real terrain data of Mars, with four million discrete states at each time step.

  1. Dynamic Routing of Short Transfer Baggage

    DEFF Research Database (Denmark)

    Clausen, Tommy; Pisinger, David

    of dispatch. Computational results are presented for real-life passenger data with stochastic bag arrival times and travel times. The results indicate that the algorithm is able to dispatch the baggage considerably better than the manual delivery plans reported in the case study, and due to its fast running...... that arrive continuously during the day. We present an IP model of the problem and describe the problem as a case study from a real life setting. We present a weighted greedy algorithm for dispatching vehicles that works in an dynamic context, meaning that it only considers bags available at the time......We consider a variant of the Vehicle Routing Problem that arises in airports when transporting baggage for passengers with connecting flights. Each bag can be delivered in two locations with disjunctive time windows. The task is to define multiple trips for the vehicles in order to deliver bags...

  2. Technical Report: Sleep-Route - Routing through Sleeping Sensors

    OpenAIRE

    Sarkar, Chayan; Rao, Vijay S.; Prasad, R. Venkatesha

    2014-01-01

    In this article, we propose an energy-efficient data gathering scheme for wireless sensor network called Sleep-Route, which splits the sensor nodes into two sets - active and dormant (low-power sleep). Only the active set of sensor nodes participate in data collection. The sensing values of the dormant sensor nodes are predicted with the help of an active sensor node. Virtual Sensing Framework (VSF) provides the mechanism to predict the sensing values by exploiting the data correlation among ...

  3. Fatigue mitigation effects of en-route napping on commercial airline pilots flying international routes

    Science.gov (United States)

    Baldwin, Jarret Taylor

    The introduction of ultra-long range commercial aircraft and the evolution of the commercial airline industry has provided new opportunities for air carriers to fly longer range international route segments while deregulation, industry consolidation, and the constant drive to reduce costs wherever possible has pressured airline managements to seek more productivity from their pilots. At the same time, advancements in the understanding of human physiology have begun to make their way into flight and duty time regulations and airline scheduling practices. In this complex and ever changing operating environment, there remains an essential need to better understand how these developments, and other daily realities facing commercial airline pilots, are affecting their fatigue management strategies as they go about their rituals of getting to and from their homes to work and performing their flight assignments. Indeed, the need for commercial airline pilots to have access to better and more effective fatigue mitigation tools to combat fatigue and insure that they are well rested and at the top of their game when flying long-range international route segments has never been greater. This study examined to what extent the maximum fatigue states prior to napping, as self-accessed by commercial airline pilots flying international route segments, were affected by a number of other common flight assignment related factors. The study also examined to what extent the availability of scheduled en-route rest opportunities, in an onboard crew rest facility, affected the usage of en-route napping as a fatigue mitigation strategy, and to what extent the duration of such naps affected the perceived benefits of such naps as self-accessed by commercial airline pilots flying international route segments. The study utilized an online survey tool to collect data on crew position, prior flight segments flown in the same duty period, augmentation, commuting, pre-flight rest obtained in the

  4. Route Scherrer and Route Einstein closed for construction work

    CERN Multimedia

    2015-01-01

    Please note that Route Scherrer will be inaccessible for two and a half months from the beginning of March and that part of Route Einstein will be closed for two weeks from the end of February.   Figure 1. The part of Route Scherrer between Building 510 and Building 53 (see Figure 1) will be closed from the beginning of March until mid-May for civil engineering works.   The superheated water pipes supplying the buildings in this area date back to 1959 and therefore present a significant risk of leakage. In order to ensure the reliable supply of superheated water, and, by extension, heating, to all premises near the Main Building (i.e. Buildings 500, 501, 503, 60, 62, 63 and 64), a new buried service duct will be installed between the basements of Buildings 53 and 61 to house a new superheated water pipe. Figure 2. The following car parks will, however, remain accessible for the duration of the works: the Cèdres car park, the car park for Buildings 4 and 5, and the ca...

  5. Highway route controlled quantity shipment routing reports - An overview

    International Nuclear Information System (INIS)

    Cashwell, J.W.; Welles, B.W.; Welch, M.J.

    1989-01-01

    US Department of Transportation (DOT) regulations require a postnotification report from the shipper for all shipments of radioactive materials categorized as a Highway Route Controlled Quantity. These postnotification reports, filed in compliance with 49 CFR 172.203(d), have been compiled by the DOT in a database known as the Radioactive Materials Routing Report (RAMRT) since 1982. The data were sorted by each of its elements to establish historical records and trends of Highway Route Controlled Quantity shipments from 1982 through 1987. Approximately 1520 records in the RAMRT database were compiled for this analysis. Approximately half of the shipments reported for the study period were from the US Department of Energy (DOE) and its contractors, with the others being commercial movements. Two DOE installations, EG and G Idaho and Oak Ridge, accounted for nearly half of the DOE activities. Similarly, almost half of the commercial movements were reported by two vendors, Nuclear Assurance Corporation and Transnuclear, Incorporated. Spent fuel from power and research reactors accounted for approximately half of all shipments

  6. Unintended Consequences: How Qualification Constrains Innovation

    Science.gov (United States)

    Brice, Craig A.

    2011-01-01

    The development and implementation of new materials and manufacturing processes for aerospace application is often hindered by the high cost and long time span associated with current qualification procedures. The data requirements necessary for material and process qualification are extensive and often require millions of dollars and multiple years to complete. Furthermore, these qualification data can become obsolete for even minor changes to the processing route. This burden is a serious impediment to the pursuit of revolutionary new materials and more affordable processing methods for air vehicle structures. The application of integrated computational materials engineering methods to this problem can help to reduce the barriers to rapid insertion of new materials and processes. By establishing predictive capability for the development of microstructural features in relation to processing and relating this to critical property characteristics, a streamlined approach to qualification is possible. This paper critically examines the advantages and challenges to a modeling-assisted qualification approach for aerospace structural materials. An example of how this approach might apply towards the emerging field of additive manufacturing is discussed in detail.

  7. A constrained approximation for nuclear barrier penetration and fission

    International Nuclear Information System (INIS)

    Tang, H.H.K.; Negele, J.W.; Massachusetts Inst. of Tech., Cambridge; Massachusetts Inst. of Tech., Cambridge

    1983-01-01

    An approximation to the time-dependent mean-field theory for barrier penetration by a nucleus is obtained in terms of constrained Hartree-Fock wave functions and a coherent velocity field. A discrete approximation to the continuum theory suitable for practical numerical calculations is presented and applied to three illustrative models. Potential application of the theory to the study of nuclear fission is discussed. (orig.)

  8. Prospects of Constraining the Dense Matter Equation of State from Timing Analysis of Pulsars in Double Neutron Star Binaries: The Cases of PSR J0737 ‒ 3039A and PSR J1757 ‒ 1854

    Directory of Open Access Journals (Sweden)

    Manjari Bagchi

    2018-02-01

    Full Text Available The Lense-Thirring effect from spinning neutron stars in double neutron star binaries contributes to the periastron advance of the orbit. This extra term involves the moment of inertia of the neutron stars. The moment of inertia, on the other hand, depends on the mass and spin of the neutron star, as well as the equation of state of the matter. If at least one member of the double neutron star binary (better the faster one is a radio pulsar, then accurate timing analysis might lead to the estimation of the contribution of the Lense-Thirring effect to the periastron advance, which will lead to the measurement of the moment of inertia of the pulsar. The combination of the knowledge on the values of the moment of inertia, the mass and the spin of the pulsar will give a new constraint on the equation of state. Pulsars in double neutron star binaries are the best for this purpose as short orbits and moderately high eccentricities make the Lense-Thirring effect substantial, whereas tidal effects are negligible (unlike pulsars with main sequence or white-dwarf binaries. The most promising pulsars are PSR J0737 − 3039A and PSR J1757 − 1854. The spin-precession of pulsars due to the misalignment between the spin and the orbital angular momentum vectors affect the contribution of the Lense-Thirring effect to the periastron advance. This effect has been explored for both PSR J0737 − 3039A and PSR J1757 − 1854, and as the misalignment angles for both of these pulsars are small, the variation in the Lense-Thirring term is not much. However, to extract the Lense-Thirring effect from the observed rate of the periastron advance, more accurate timing solutions including precise proper motion and distance measurements are essential.

  9. Preventing Restricted Space Inference in Online Route Planning Services

    Directory of Open Access Journals (Sweden)

    Florian Dorfmeister

    2016-03-01

    Full Text Available Online route planning services compute routes from any given location to a desired destination address. Unlike offline implementations, they do so in a traffic-aware fashion by taking into consideration up-to-date map data and real-time traffic information. In return, users have to provide precise location information about a route’s endpoints to a not necessarily trusted service provider. As suchlike leakage of personal information threatens a user’s privacy and anonymity, this paper presents PrOSPR, a comprehensive approach for using current online route planning services in a privacy-preserving way, and introduces the concept of k-immune route requests to avert inference attacks based on restricted space information. Using a map-based approach for creating cloaked regions for the start and destination addresses, our solution queries the online service for routes between subsets of points from these regions. This, however, might result in the returned path deviating from the optimal route. By means of empirical evaluation on a real road network, we demonstrate the feasibility of our approach regarding quality of service and communication overhead.

  10. Quasicanonical structure of optimal control in constrained discrete systems

    Science.gov (United States)

    Sieniutycz, S.

    2003-06-01

    This paper considers discrete processes governed by difference rather than differential equations for the state transformation. The basic question asked is if and when Hamiltonian canonical structures are possible in optimal discrete systems. Considering constrained discrete control, general optimization algorithms are derived that constitute suitable theoretical and computational tools when evaluating extremum properties of constrained physical models. The mathematical basis of the general theory is the Bellman method of dynamic programming (DP) and its extension in the form of the so-called Carathéodory-Boltyanski (CB) stage criterion which allows a variation of the terminal state that is otherwise fixed in the Bellman's method. Two relatively unknown, powerful optimization algorithms are obtained: an unconventional discrete formalism of optimization based on a Hamiltonian for multistage systems with unconstrained intervals of holdup time, and the time interval constrained extension of the formalism. These results are general; namely, one arrives at: the discrete canonical Hamilton equations, maximum principles, and (at the continuous limit of processes with free intervals of time) the classical Hamilton-Jacobi theory along with all basic results of variational calculus. Vast spectrum of applications of the theory is briefly discussed.

  11. Hot Routes: Developing a New Technique for the Spatial Analysis of Crime

    OpenAIRE

    Tompson, L.; Partridge, H.; Shepherd, N.

    2009-01-01

    The use of hotspot mapping techniques such as KDE to represent the geographical spread of linear events can be problematic. Network-constrained data (for example transport-related crime) require a different approach to visualize concentration. We propose a methodology called Hot Routes, which measures the risk distribution of crime along a linear network by calculating the rate of crimes per section of road. This method has been designed for everyday crime analysts, and requires only a Geogra...

  12. Energy-Efficient Cluster Based Routing Protocol in Mobile Ad Hoc Networks Using Network Coding

    OpenAIRE

    Srinivas Kanakala; Venugopal Reddy Ananthula; Prashanthi Vempaty

    2014-01-01

    In mobile ad hoc networks, all nodes are energy constrained. In such situations, it is important to reduce energy consumption. In this paper, we consider the issues of energy efficient communication in MANETs using network coding. Network coding is an effective method to improve the performance of wireless networks. COPE protocol implements network coding concept to reduce number of transmissions by mixing the packets at intermediate nodes. We incorporate COPE into cluster based routing proto...

  13. Radon exposure in selected underground touring routes in Poland

    International Nuclear Information System (INIS)

    Olszewski, J.; Chruscielewski, W.; Jankowski, J.

    2006-01-01

    The radioactive elements abounding in the natural environment cause that the whole human population is exposed to radiation. In Poland, mean gamma radiation dose power is 45.4 n Gy h -1 , while atmospheric radon concentration is 4.4 Bq m -3 [1]. In closed rooms, where radon tends to accumulate, the concentrations may be many times higher.Underground touring routes located in caves, mines, ancient cellars, vaults may accumulate radon at concentrations several thousand times exceeding its atmospheric levels. Studies on natural radioactivity in underground touring routes, with particular reference to caves, have continued worldwide since the 80's. Current register of underground touring routes in Poland comprises over 30 items, which include caves (e.g. Niedzwiedzia), mines (Wieliczka), cellars and underground stores (Opatow City vaults) and military objects (underground factories of Walim). The Nofer Institute of Occupational Medicine has for several years already continued determinations of periodical mean radon concentrations in four underground touring routes (starting date in parentheses): Niedzwiedzia Cave (1995); Kowary Drifts closed uranium mine (2001); closed uranium mine in Kletno (2004); Zloty Stok closed gold mine (2004); Osowka underground city in Gluszyca (2004).The results of our determinations of radon concentrations at five selected touring routes lead to the following conclusions. 1. The exposure in the Kowary Drifts touring route is at the level of 5% of the recommended maximum annual admissible limit of 20 mSv. 2. It is assessed that workers of the touring routes where exposures are estimated from the measured concentrations and the time spent underground may receive doses ranging from 0.01 to 5 mSv. (N.C.)

  14. Radon exposure in selected underground touring routes in Poland

    Energy Technology Data Exchange (ETDEWEB)

    Olszewski, J.; Chruscielewski, W.; Jankowski, J. [Nofer Institute of Occupational Medicine, Dept. of Radiation Protection, Lodz (Poland)

    2006-07-01

    The radioactive elements abounding in the natural environment cause that the whole human population is exposed to radiation. In Poland, mean gamma radiation dose power is 45.4 n Gy h{sup -1}, while atmospheric radon concentration is 4.4 Bq m{sup -3} [1]. In closed rooms, where radon tends to accumulate, the concentrations may be many times higher.Underground touring routes located in caves, mines, ancient cellars, vaults may accumulate radon at concentrations several thousand times exceeding its atmospheric levels. Studies on natural radioactivity in underground touring routes, with particular reference to caves, have continued worldwide since the 80's. Current register of underground touring routes in Poland comprises over 30 items, which include caves (e.g. Niedzwiedzia), mines (Wieliczka), cellars and underground stores (Opatow City vaults) and military objects (underground factories of Walim). The Nofer Institute of Occupational Medicine has for several years already continued determinations of periodical mean radon concentrations in four underground touring routes (starting date in parentheses): Niedzwiedzia Cave (1995); Kowary Drifts closed uranium mine (2001); closed uranium mine in Kletno (2004); Zloty Stok closed gold mine (2004); Osowka underground city in Gluszyca (2004).The results of our determinations of radon concentrations at five selected touring routes lead to the following conclusions. 1. The exposure in the Kowary Drifts touring route is at the level of 5% of the recommended maximum annual admissible limit of 20 mSv. 2. It is assessed that workers of the touring routes where exposures are estimated from the measured concentrations and the time spent underground may receive doses ranging from 0.01 to 5 mSv. (N.C.)

  15. Efficient priority queueing routing strategy on networks of mobile agents

    Science.gov (United States)

    Wu, Gan-Hua; Yang, Hui-Jie; Pan, Jia-Hui

    2018-03-01

    As a consequence of their practical implications for communications networks, traffic dynamics on complex networks have recently captivated researchers. Previous routing strategies for improving transport efficiency have paid little attention to the orders in which the packets should be forwarded, just simply used first-in-first-out queue discipline. Here, we apply a priority queuing discipline and propose a shortest-distance-first routing strategy on networks of mobile agents. Numerical experiments reveal that the proposed scheme remarkably improves both the network throughput and the packet arrival rate and reduces both the average traveling time and the rate of waiting time to traveling time. Moreover, we find that the network capacity increases with an increase in both the communication radius and the number of agents. Our work may be helpful for the design of routing strategies on networks of mobile agents.

  16. Comparison of Mucosal, Subcutaneous and Intraperitoneal Routes of Rat Leptospira Infection

    Science.gov (United States)

    Zilber, Anne-Laure; Belli, Patrick; Grezel, Delphine; Artois, Marc; Kodjo, Angeli; Djelouadji, Zoheira

    2016-01-01

    Leptospirosis is a zoonosis found worldwide that is caused by a spirochete. The main reservoirs of Leptospira, which presents an asymptomatic infection, are wild rodents, including the brown rat (Rattus norvegicus). Experimental studies of the mechanisms of its renal colonization in rats have previously used an intraperitoneal inoculation route. However, knowledge of rat-rat transmission requires the use of a natural route of inoculation, such as a mucosal or subcutaneous route. We investigated for the first time the effects of subcutaneous and mucosal inoculation routes compared to the reference intraperitoneal route during Leptospira infection in adult rats. Infection characteristics were studied using Leptospira renal isolation, serology, and molecular and histological analyses. Leptospira infection was asymptomatic using each inoculation route, and caused similar antibody production regardless of renal colonization. The observed renal colonization rates were 8 out of 8 rats, 5 out of 8 rats and 1 out of 8 rats for the intraperitoneal, mucosal and subcutaneous inoculation routes, respectively. Thus, among the natural infection routes studied, mucosal inoculation was more efficient for renal colonization associated with urinary excretion than the subcutaneous route and induced a slower-progressing infection than the intraperitoneal route. These results can facilitate understanding of the infection modalities in rats, unlike the epidemiological studies conducted in wild rats. Future studies of other natural inoculation routes in rat models will increase our knowledge of rat-rat disease transmission and allow the investigation of infection kinetics. PMID:27031867

  17. Label-controlled optical packet routing technologies and applications

    DEFF Research Database (Denmark)

    Koonen, A.M.J.; Yan, N.; Vegas Olmos, Juan José

    2007-01-01

    An overview is given of various optical packet labeling techniques. The architecture and technologies are discussed for optical packet routing nodes using orthogonal labeling with optoelectronic label processing, and for nodes using time-serial labeling with all-optical time-serial label processing...

  18. An optimization algorithm for a capacitated vehicle routing problem ...

    Indian Academy of Sciences (India)

    In this paper, vehicle routing problem (VRP) with time windows and real world constraints are considered as a real-world application on google maps. Also, tabu search is used and Hopfield neural networks is utilized. Basic constraints consist of customer demands, time windows, vehicle speed, vehicle capacity andworking ...

  19. Shortest Paths and Vehicle Routing

    DEFF Research Database (Denmark)

    Petersen, Bjørn

    This thesis presents how to parallelize a shortest path labeling algorithm. It is shown how to handle Chvátal-Gomory rank-1 cuts in a column generation context. A Branch-and-Cut algorithm is given for the Elementary Shortest Paths Problem with Capacity Constraint. A reformulation of the Vehicle...... Routing Problem based on partial paths is presented. Finally, a practical application of finding shortest paths in the telecommunication industry is shown....

  20. Hydrologic and hydraulic flood forecasting constrained by remote sensing data

    Science.gov (United States)

    Li, Y.; Grimaldi, S.; Pauwels, V. R. N.; Walker, J. P.; Wright, A. J.

    2017-12-01

    Flooding is one of the most destructive natural disasters, resulting in many deaths and billions of dollars of damages each year. An indispensable tool to mitigate the effect of floods is to provide accurate and timely forecasts. An operational flood forecasting system typically consists of a hydrologic model, converting rainfall data into flood volumes entering the river system, and a hydraulic model, converting these flood volumes into water levels and flood extents. Such a system is prone to various sources of uncertainties from the initial conditions, meteorological forcing, topographic data, model parameters and model structure. To reduce those uncertainties, current forecasting systems are typically calibrated and/or updated using ground-based streamflow measurements, and such applications are limited to well-gauged areas. The recent increasing availability of spatially distributed remote sensing (RS) data offers new opportunities to improve flood forecasting skill. Based on an Australian case study, this presentation will discuss the use of 1) RS soil moisture to constrain a hydrologic model, and 2) RS flood extent and level to constrain a hydraulic model.The GRKAL hydrological model is calibrated through a joint calibration scheme using both ground-based streamflow and RS soil moisture observations. A lag-aware data assimilation approach is tested through a set of synthetic experiments to integrate RS soil moisture to constrain the streamflow forecasting in real-time.The hydraulic model is LISFLOOD-FP which solves the 2-dimensional inertial approximation of the Shallow Water Equations. Gauged water level time series and RS-derived flood extent and levels are used to apply a multi-objective calibration protocol. The effectiveness with which each data source or combination of data sources constrained the parameter space will be discussed.

  1. New routes of allergen immunotherapy.

    Science.gov (United States)

    Aricigil, Mitat; Muluk, Nuray Bayar; Sakarya, Engin Umut; Sakalar, Emine Güven; Senturk, Mehmet; Reisacher, William R; Cingi, Cemal

    2016-11-01

    Allergen immunotherapy is the only cure for immunoglobulin E mediated type I respiratory allergies. Subcutaneous immunotherapy (SCIT) and sublingual immunotherapy (SLIT) are the most common treatments. In this article, we reviewed new routes of allergen immunotherapy. Data on alternative routes to allow intralymphatic immunotherapy (ILIT), epicutaneous immunotherapy (EPIT), local nasal immunotherapy (LNIT), oral immunotherapy (OIT), and oral mucosal immunotherapy (OMIT) were gathered from the literature and were discussed. ILIT features direct injection of allergens into lymph nodes. ILIT may be clinically effective after only a few injections and induces allergen-specific immunoglobulin G, similarly to SCIT. A limitation of ILIT is that intralymphatic injections are required. EPIT features allergen administration by using patches mounted on the skin. EPIT seeks to target epidermal antigen-presenting Langerhans cells rather than mast cells or the vasculature; this should reduce both local and systemic adverse effects. LNIT involves the spraying of allergen extracts into the nasal cavity. Natural or chemically modified allergens (the latter, termed allergoids, lack immunoglobulin E reactivity) are prepared in a soluble form. OIT involves the regular administration of small amounts of a food allergen by mouth and commences with low oral doses, which are then increased as tolerance develops. OMIT seeks to deliver allergenic proteins to an expanded population of Langerhans cells in the mucosa of the oral cavity. ILIT, EPIT, LNIT, OIT, and OMIT are new routes for allergen immunotherapy. They are safe and effective.

  2. Cultural Routes and Intangible Heritage

    Directory of Open Access Journals (Sweden)

    Enza Zabbini

    2012-08-01

    Full Text Available The theoretical interpretation of thematic routes helps to predict the effects on the territories visited by cultured tourists who want to enrich their cultural and emotional baggage. After the analysis of some interpretations, this paper will examine how the practical implementation of an itinerary approved by the Council of Europe has evolved over the years. And it will also reflect on the practical results in the areas involved in that project. "The Hannibal Pathway ", the main overland walk on the "Phoenician Route - Cultural Route recognized by the Council of Europe" – represents a case of study that allows to reflect over the impact of cultural tourism based on immaterial heritage. In fact, in the areas where the battle of 21 June 217 BC took place, nothing tangible is left, except the landscape that has kept its conformation intact. In these areas, thanks to the foresight of the local governments in the last three decades, the landscape of the plain has been preserved. This makes possible today to propose an historical path precisely based on the landscape and on the new techniques for the valorization of the heritage. In the Tuoro plain it is possible to see the battlefields, thus retracing the various stages of the battle, supported by the Documentation Centre of the Capra Palace and virtual reconstructions of high technical quality.

  3. VANET Routing Protocols: Pros and Cons

    OpenAIRE

    Paul, Bijan; Ibrahim, Md.; Bikas, Md. Abu Naser

    2012-01-01

    VANET (Vehicular Ad-hoc Network) is a new technology which has taken enormous attention in the recent years. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles, called V2V or vehicle to vehicle communication and vehicle to road side infrastructure, called V2I. The existing routing protocols for VANET are not efficient to meet every traffic scenarios. Thus design of an efficient routing protocol h...

  4. Routing Data Authentication in Wireless Networks; TOPICAL

    International Nuclear Information System (INIS)

    TORGERSON, MARK D.; VAN LEEUWEN, BRIAN P.

    2001-01-01

    In this paper, we discuss several specific threats directed at the routing data of an ad hoc network. We address security issues that arise from wrapping authentication mechanisms around ad hoc routing data. We show that this bolt-on approach to security may make certain attacks more difficult, but still leaves the network routing data vulnerable. We also show that under a certain adversarial model, most existing routing protocols cannot be secured with the aid of digital signatures

  5. Inventory slack routing application in emergency logistics and relief distributions.

    Science.gov (United States)

    Yang, Xianfeng; Hao, Wei; Lu, Yang

    2018-01-01

    Various natural and manmade disasters during last decades have highlighted the need of further improving on governmental preparedness to emergency events, and a relief supplies distribution problem named Inventory Slack Routing Problem (ISRP) has received increasing attentions. In an ISRP, inventory slack is defined as the duration between reliefs arriving time and estimated inventory stock-out time. Hence, a larger inventory slack could grant more responsive time in facing of various factors (e.g., traffic congestion) that may lead to delivery lateness. In this study, the relief distribution problem is formulated as an optimization model that maximize the minimum slack among all dispensing sites. To efficiently solve this problem, we propose a two-stage approach to tackle the vehicle routing and relief allocation sub-problems. By analyzing the inter-relations between these two sub-problems, a new objective function considering both delivery durations and dispensing rates of demand sites is applied in the first stage to design the vehicle routes. A hierarchical routing approach and a sweep approach are also proposed in this stage. Given the vehicle routing plan, the relief allocation could be easily solved in the second stage. Numerical experiment with a comparison of multi-vehicle Traveling Salesman Problem (TSP) has demonstrated the need of ISRP and the capability of the proposed solution approaches.

  6. Privacy-Preserving Interdomain Routing at Internet Scale

    Directory of Open Access Journals (Sweden)

    Asharov Gilad

    2017-07-01

    Full Text Available The Border Gateway Protocol (BGP computes routes between the organizational networks that make up today’s Internet. Unfortunately, BGP suffers from deficiencies, including slow convergence, security problems, a lack of innovation, and the leakage of sensitive information about domains’ routing preferences. To overcome some of these problems, we revisit the idea of centralizing and using secure multi-party computation (MPC for interdomain routing which was proposed by Gupta et al. (ACM HotNets’12. We implement two algorithms for interdomain routing with state-of-the-art MPC protocols. On an empirically derived dataset that approximates the topology of today’s Internet (55 809 nodes, our protocols take as little as 6 s of topology-independent precomputation and only 3 s of online time. We show, moreover, that when our MPC approach is applied at country/region-level scale, runtimes can be as low as 0.17 s online time and 0.20 s pre-computation time. Our results motivate the MPC approach for interdomain routing and furthermore demonstrate that current MPC techniques are capable of efficiently tackling real-world problems at a large scale.

  7. Optimal Route Searching with Multiple Dynamical Constraints—A Geometric Algebra Approach

    Directory of Open Access Journals (Sweden)

    Dongshuang Li

    2018-05-01

    Full Text Available The process of searching for a dynamic constrained optimal path has received increasing attention in traffic planning, evacuation, and personalized or collaborative traffic service. As most existing multiple constrained optimal path (MCOP methods cannot search for a path given various types of constraints that dynamically change during the search, few approaches for dynamic multiple constrained optimal path (DMCOP with type II dynamics are available for practical use. In this study, we develop a method to solve the DMCOP problem with type II dynamics based on the unification of various types of constraints under a geometric algebra (GA framework. In our method, the network topology and three different types of constraints are represented by using algebraic base coding. With a parameterized optimization of the MCOP algorithm based on a greedy search strategy under the generation-refinement paradigm, this algorithm is found to accurately support the discovery of optimal paths as the constraints of numerical values, nodes, and route structure types are dynamically added to the network. The algorithm was tested with simulated cases of optimal tourism route searches in China’s road networks with various combinations of constraints. The case study indicates that our algorithm can not only solve the DMCOP with different types of constraints but also use constraints to speed up the route filtering.

  8. Constrained generalized mechanics. The second-order case

    International Nuclear Information System (INIS)

    Tapia, V.

    1985-01-01

    The Dirac formalism for constrained systems is developed for systems described by a Lagrangian depending on up to a second-order time derivatives of the generalized co-ordinates (accelerations). It turns out that for a Lagrangian of this kind differing by a total time derivative from a Lagrangian depending on only up to first-order time-derivatives of the generalized co-ordinates (velocities), both classical mechanics at the Lagrangian level are the same; at the Hamiltonian level the two classical mechanics differ conceptually even when the solutions to both sets of Hamiltonian equations of motion are the same

  9. Route Optimization for Offloading Congested Meter Fixes

    Science.gov (United States)

    Xue, Min; Zelinski, Shannon

    2016-01-01

    The Optimized Route Capability (ORC) concept proposed by the FAA facilitates traffic managers to identify and resolve arrival flight delays caused by bottlenecks formed at arrival meter fixes when there exists imbalance between arrival fixes and runways. ORC makes use of the prediction capability of existing automation tools, monitors the traffic delays based on these predictions, and searches the best reroutes upstream of the meter fixes based on the predictions and estimated arrival schedules when delays are over a predefined threshold. Initial implementation and evaluation of the ORC concept considered only reroutes available at the time arrival congestion was first predicted. This work extends previous work by introducing an additional dimension in reroute options such that ORC can find the best time to reroute and overcome the 'firstcome- first-reroute' phenomenon. To deal with the enlarged reroute solution space, a genetic algorithm was developed to solve this problem. Experiments were conducted using the same traffic scenario used in previous work, when an arrival rush was created for one of the four arrival meter fixes at George Bush Intercontinental Houston Airport. Results showed the new approach further improved delay savings. The suggested route changes from the new approach were on average 30 minutes later than those using other approaches, and fewer numbers of reroutes were required. Fewer numbers of reroutes reduce operational complexity and later reroutes help decision makers deal with uncertain situations.

  10. Developing an eco-routing application.

    Science.gov (United States)

    2014-01-01

    The study develops eco-routing algorithms and investigates and quantifies the system-wide impacts of implementing an eco-routing system. Two eco-routing algorithms are developed: one based on vehicle sub-populations (ECO-Subpopulation Feedback Assign...

  11. Is Entrepreneurship a Route Out of Deprivation?

    DEFF Research Database (Denmark)

    Frankish, Julian S.; Roberts, Richard G.; Coad, Alexander Jean-Luc

    2014-01-01

    Frankish J. S., Roberts R. G., Coad A. and Storey D. J. Is entrepreneurship a route out of deprivation?, Regional Studies. This paper investigates whether entrepreneurship constitutes a route out of deprivation for those living in deprived areas. The measure of income/wealth used is based...... the wealth distribution. Hence, entrepreneurship can be a route out of deprivation....

  12. The Pyramidal Capacitated Vehicle Routing Problem

    DEFF Research Database (Denmark)

    Lysgaard, Jens

    This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the Pyramidal Traveling Salesman Problem (PTSP). A pyramidal...

  13. The pyramidal capacitated vehicle routing problem

    DEFF Research Database (Denmark)

    Lysgaard, Jens

    2010-01-01

    This paper introduces the pyramidal capacitated vehicle routing problem (PCVRP) as a restricted version of the capacitated vehicle routing problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the pyramidal traveling salesman problem (PTSP). A pyramidal...

  14. Route-Based Signal Preemption Control of Emergency Vehicle

    Directory of Open Access Journals (Sweden)

    Haibo Mu

    2018-01-01

    Full Text Available This paper focuses on the signal preemption control of emergency vehicles (EV. A signal preemption control method based on route is proposed to reduce time delay of EV at intersections. According to the time at which EV is detected and the current phase of each intersection on the travelling route of EV, the calculation methods of the earliest start time and the latest start time of green light at each intersection are given. Consequently, the effective time range of green light at each intersection is determined in theory. A multiobjective programming model, whose objectives are the minimal residence time of EV at all intersections and the maximal passing numbers of general society vehicles, is presented. Finally, a simulation calculation is carried out. Calculation results indicate that, by adopting the signal preemption method based on route, the delay of EV is reduced and the number of society vehicles passing through the whole system is increased. The signal preemption control method of EV based on route can reduce the time delay of EV and improve the evacuation efficiency of the system.

  15. Transient thermal stresses in a circular cylinder with constrained ends

    International Nuclear Information System (INIS)

    Goshima, Takahito; Miyao, Kaju

    1986-01-01

    This paker deals with the transient thermal stresses in a finite circular cylinder constrained at both end surfaces and subjected to axisymmetric temperature distribution on the lateral surface. The thermoelastic problem is formulated in terms of a thermoelastic displacement potential and three harmonic stress functions. Numerical calculations are carried out for the case of the uniform temperature distribution on the lateral surface. The stress distributions on the constrained end and the free suface are shown graphically, and the singularity in stresses appearing at the circumferencial edge is considered. Moreover, the approximate solution based upon the plane strain theory is introduced in order to compare the rigorous one, and it is considered how the length of the cylinder and the time proceeds affect on the accuracy of the approximation. (author)

  16. Constraining the noncommutative spectral action via astrophysical observations.

    Science.gov (United States)

    Nelson, William; Ochoa, Joseph; Sakellariadou, Mairi

    2010-09-03

    The noncommutative spectral action extends our familiar notion of commutative spaces, using the data encoded in a spectral triple on an almost commutative space. Varying a rather simple action, one can derive all of the standard model of particle physics in this setting, in addition to a modified version of Einstein-Hilbert gravity. In this Letter we use observations of pulsar timings, assuming that no deviation from general relativity has been observed, to constrain the gravitational sector of this theory. While the bounds on the coupling constants remain rather weak, they are comparable to existing bounds on deviations from general relativity in other settings and are likely to be further constrained by future observations.

  17. The bounds of feasible space on constrained nonconvex quadratic programming

    Science.gov (United States)

    Zhu, Jinghao

    2008-03-01

    This paper presents a method to estimate the bounds of the radius of the feasible space for a class of constrained nonconvex quadratic programmingsE Results show that one may compute a bound of the radius of the feasible space by a linear programming which is known to be a P-problem [N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984) 373-395]. It is proposed that one applies this method for using the canonical dual transformation [D.Y. Gao, Canonical duality theory and solutions to constrained nonconvex quadratic programming, J. Global Optimization 29 (2004) 377-399] for solving a standard quadratic programming problem.

  18. An advanced traveler navigation system adapted to route choice preferences of the individual users

    Directory of Open Access Journals (Sweden)

    Mahyar Amirgholy

    2017-12-01

    Full Text Available The majority of existing navigation systems only account for a single aspect of the route choice, like travel time or distance, in finding the optimal route for the trips in the network. In this research, we first identify a range of diverse factors that travelers take into account in their route choice decision in the network. A stated preference survey is conducted to show the heterogeneity in the preferences of users and its dependence to the purpose of the trips over the weekdays and weekends. Interestingly, results of the survey show that road safety is the most influential factor in the route choice decision of the average participants over weekends, exceeding even the travel time, and participants give more importance to the scenic quality of the routes for their weekend trips in comparison to their weekday trips. The results of the second part of the survey also indicate that in 27% of the cases participants choose routes other than the ones suggested by navigation systems, and 33% of the times that they take the suggested routes, they modify these routes according to their own preferences. The partial inability of existing navigation systems to suggest the routes that match the preferences of users can be attributed to ignoring (1 the diversity in influential factors and (2 the heterogeneity in preferences of the users by these systems. We propose a dynamic mixed logit route choice model to include the effects of information and learning to estimate parameters of a multivariable utility function for individual users based on their own historical route choice data over time. Finally, we present the concept of a smart navigation system that can gather the required information from real-time and online sources to suggest the routes that best match the users’ own preferences.

  19. Exact route-length formulas and a storage location assignment heuristic for picker-to-parts warehouses

    NARCIS (Netherlands)

    Dijkstra, Arjan; Roodbergen, Kees Jan

    2017-01-01

    Order picking is one of the most time-critical processes in warehouses. We focus on the combined effects of routing methods and storage location assignment on process performance. We present exact formulas for the average route length under any storage location assignment for four common routing

  20. Ultimate fate of constrained voters

    International Nuclear Information System (INIS)

    Vazquez, F; Redner, S

    2004-01-01

    We examine the ultimate fate of individual opinions in a socially interacting population of leftists, centrists and rightists. In an elemental interaction between agents, a centrist and a leftist can both become centrists or both become leftists with equal rates (and similarly for a centrist and a rightist). However leftists and rightists do not interact. This interaction step between pairs of agents is applied repeatedly until the system can no longer evolve. In the mean-field limit, we determine the exact probability that the system reaches consensus (either leftist, rightist or centrist) or a frozen mixture of leftists and rightists as a function of the initial composition of the population. We also determine the mean time until the final state is reached. Some implications of our results for the ultimate fate in a limit of the Axelrod model are discussed