Improving Transportation Services for the University of the Thai Chamber of Commerce: A Case Study on Solving the Mixed-Fleet Vehicle Routing Problem with Split Deliveries

NASA Astrophysics Data System (ADS)

Suthikarnnarunai, N.; Olinick, E.

2009-01-01

We present a case study on the application of techniques for solving the Vehicle Routing Problem (VRP) to improve the transportation service provided by the University of The Thai Chamber of Commerce to its staff. The problem is modeled as VRP with time windows, split deliveries, and a mixed fleet. An exact algorithm and a heuristic solution procedure are developed to solve the problem and implemented in the AMPL modeling language and CPLEX Integer Programming solver. Empirical results indicate that the heuristic can find relatively good solutions in a small fraction of the time required by the exact method. We also perform sensitivity analysis and find that a savings in outsourcing cost can be achieved with a small increase in vehicle capacity.

On the Miller-Tucker-Zemlin Based Formulations for the Distance Constrained Vehicle Routing Problems

NASA Astrophysics Data System (ADS)

Kara, Imdat

2010-11-01

Vehicle Routing Problem (VRP), is an extension of the well known Traveling Salesman Problem (TSP) and has many practical applications in the fields of distribution and logistics. When the VRP consists of distance based constraints it is called Distance Constrained Vehicle Routing Problem (DVRP). However, the literature addressing on the DVRP is scarce. In this paper, existing two-indexed integer programming formulations, having Miller-Tucker-Zemlin based subtour elimination constraints, are reviewed. Existing formulations are simplified and obtained formulation is presented as formulation F1. It is shown that, the distance bounding constraints of the formulation F1, may not generate the distance traveled up to the related node. To do this, we redefine the auxiliary variables of the formulation and propose second formulation F2 with new and easy to use distance bounding constraints. Adaptation of the second formulation to the cases where new restrictions such as minimal distance traveled by each vehicle or other objectives such as minimizing the longest distance traveled is discussed.

Routing strategies for efficient deployment of alternative fuel vehicles for freight delivery.

DOT National Transportation Integrated Search

2017-02-01

With increasing concerns on environmental issues, recent research on Vehicle Routing Problems : (VRP) has added new factors such as greenhouse gas emissions and alternative fuel vehicles into : the models. In this report, we consider one such promisi...

Vehicle-Routing Optimization for Municipal Solid Waste Collection Using Genetic Algorithm: The Case of Southern Nablus City

NASA Astrophysics Data System (ADS)

Assaf, Ramiz; Saleh, Yahya

2017-09-01

Municipalities are responsible for solid waste collectiont for environmental, social and economic purposes. Practices of municipalities should be effective and efficient, with the objectives of reducing the total incurred costs in the solid waste collection network concurrently achieving the highest service level. This study aims at finding the best routes of solid waste collection network in Nablus city-Palestine. More specifically, the study seeks the optimal route that minimizes the total travelled distance by the trucks and hence the resulted costs. The current situation is evaluated and the problem is modelled as a Vehicle Routing Problem (VRP). The VRP is then optimized via a genetic algorithm. Specifically, compared to the current situation, the trucks total travelled distance was reduced by 66%, whereas the collection time was reduced from 7 hours per truck-trip to 2.3 hours. The findings of this study is useful for all municipality policy makers that are responsible for solid waste collection.

Optimal routing of coordinated aircraft to Identify moving surface contacts

DTIC Science & Technology

2017-06-01

Time TAO Tactical Action Officer TSP Traveling Salesman Problem TSPTW TSP with Time Windows UAV unmanned aerial vehicle VRP Vehicle Routing...Orienteering Problem (OP), while the ORCA TI formulation follows the structure of a time dependent Traveling Salesman Problem (TSP), or a time dependent...Fox, Kenneth R., Bezalel Gavish, and Stephen C. Graves. 1980. “An n- Constraint Formulation of the ( Time Dependent) Traveling Salesman Problem

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

NASA Astrophysics Data System (ADS)

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.

Comparing genetic algorithm and particle swarm optimization for solving capacitated vehicle routing problem

NASA Astrophysics Data System (ADS)

Iswari, T.; Asih, A. M. S.

2018-04-01

In the logistics system, transportation plays an important role to connect every element in the supply chain, but it can produces the greatest cost. Therefore, it is important to make the transportation costs as minimum as possible. Reducing the transportation cost can be done in several ways. One of the ways to minimizing the transportation cost is by optimizing the routing of its vehicles. It refers to Vehicle Routing Problem (VRP). The most common type of VRP is Capacitated Vehicle Routing Problem (CVRP). In CVRP, the vehicles have their own capacity and the total demands from the customer should not exceed the capacity of the vehicle. CVRP belongs to the class of NP-hard problems. These NP-hard problems make it more complex to solve such that exact algorithms become highly time-consuming with the increases in problem sizes. Thus, for large-scale problem instances, as typically found in industrial applications, finding an optimal solution is not practicable. Therefore, this paper uses two kinds of metaheuristics approach to solving CVRP. Those are Genetic Algorithm and Particle Swarm Optimization. This paper compares the results of both algorithms and see the performance of each algorithm. The results show that both algorithms perform well in solving CVRP but still needs to be improved. From algorithm testing and numerical example, Genetic Algorithm yields a better solution than Particle Swarm Optimization in total distance travelled.

Genetic algorithms for the vehicle routing problem

NASA Astrophysics Data System (ADS)

Volna, Eva

2016-06-01

The Vehicle Routing Problem (VRP) is one of the most challenging combinatorial optimization tasks. This problem consists in designing the optimal set of routes for fleet of vehicles in order to serve a given set of customers. Evolutionary algorithms are general iterative algorithms for combinatorial optimization. These algorithms have been found to be very effective and robust in solving numerous problems from a wide range of application domains. This problem is known to be NP-hard; hence many heuristic procedures for its solution have been suggested. For such problems it is often desirable to obtain approximate solutions, so they can be found fast enough and are sufficiently accurate for the purpose. In this paper we have performed an experimental study that indicates the suitable use of genetic algorithms for the vehicle routing problem.

Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order.

PubMed

Xia, Yangkun; Fu, Zhuo; Pan, Lijun; Duan, Fenghua

2018-01-01

The vehicle routing problem (VRP) has a wide range of applications in the field of logistics distribution. In order to reduce the cost of logistics distribution, the distance-constrained and capacitated VRP with split deliveries by order (DCVRPSDO) was studied. We show that the customer demand, which can't be split in the classical VRP model, can only be discrete split deliveries by order. A model of double objective programming is constructed by taking the minimum number of vehicles used and minimum vehicle traveling cost as the first and the second objective, respectively. This approach contains a series of constraints, such as single depot, single vehicle type, distance-constrained and load capacity limit, split delivery by order, etc. DCVRPSDO is a new type of VRP. A new tabu search algorithm is designed to solve the problem and the examples testing show the efficiency of the proposed algorithm. This paper focuses on constructing a double objective mathematical programming model for DCVRPSDO and designing an adaptive tabu search algorithm (ATSA) with good performance to solving the problem. The performance of the ATSA is improved by adding some strategies into the search process, including: (a) a strategy of discrete split deliveries by order is used to split the customer demand; (b) a multi-neighborhood structure is designed to enhance the ability of global optimization; (c) two levels of evaluation objectives are set to select the current solution and the best solution; (d) a discriminating strategy of that the best solution must be feasible and the current solution can accept some infeasible solution, helps to balance the performance of the solution and the diversity of the neighborhood solution; (e) an adaptive penalty mechanism will help the candidate solution be closer to the neighborhood of feasible solution; (f) a strategy of tabu releasing is used to transfer the current solution into a new neighborhood of the better solution.

Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order

PubMed Central

Xia, Yangkun; Pan, Lijun; Duan, Fenghua

2018-01-01

The vehicle routing problem (VRP) has a wide range of applications in the field of logistics distribution. In order to reduce the cost of logistics distribution, the distance-constrained and capacitated VRP with split deliveries by order (DCVRPSDO) was studied. We show that the customer demand, which can’t be split in the classical VRP model, can only be discrete split deliveries by order. A model of double objective programming is constructed by taking the minimum number of vehicles used and minimum vehicle traveling cost as the first and the second objective, respectively. This approach contains a series of constraints, such as single depot, single vehicle type, distance-constrained and load capacity limit, split delivery by order, etc. DCVRPSDO is a new type of VRP. A new tabu search algorithm is designed to solve the problem and the examples testing show the efficiency of the proposed algorithm. This paper focuses on constructing a double objective mathematical programming model for DCVRPSDO and designing an adaptive tabu search algorithm (ATSA) with good performance to solving the problem. The performance of the ATSA is improved by adding some strategies into the search process, including: (a) a strategy of discrete split deliveries by order is used to split the customer demand; (b) a multi-neighborhood structure is designed to enhance the ability of global optimization; (c) two levels of evaluation objectives are set to select the current solution and the best solution; (d) a discriminating strategy of that the best solution must be feasible and the current solution can accept some infeasible solution, helps to balance the performance of the solution and the diversity of the neighborhood solution; (e) an adaptive penalty mechanism will help the candidate solution be closer to the neighborhood of feasible solution; (f) a strategy of tabu releasing is used to transfer the current solution into a new neighborhood of the better solution. PMID:29763419

Discrete Optimization Model for Vehicle Routing Problem with Scheduling Side Cosntraints

NASA Astrophysics Data System (ADS)

Juliandri, Dedy; Mawengkang, Herman; Bu'ulolo, F.

2018-01-01

Vehicle Routing Problem (VRP) is an important element of many logistic systems which involve routing and scheduling of vehicles from a depot to a set of customers node. This is a hard combinatorial optimization problem with the objective to find an optimal set of routes used by a fleet of vehicles to serve the demands a set of customers It is required that these vehicles return to the depot after serving customers’ demand. The problem incorporates time windows, fleet and driver scheduling, pick-up and delivery in the planning horizon. The goal is to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the overall costs of all routes over the planning horizon. We model the problem as a linear mixed integer program. We develop a combination of heuristics and exact method for solving the model.

Application of hybrid artificial fish swarm algorithm based on similar fragments in VRP

NASA Astrophysics Data System (ADS)

Che, Jinnuo; Zhou, Kang; Zhang, Xueyu; Tong, Xin; Hou, Lingyun; Jia, Shiyu; Zhen, Yiting

2018-03-01

Focused on the issue that the decrease of convergence speed and the precision of calculation at the end of the process in Artificial Fish Swarm Algorithm(AFSA) and instability of results, a hybrid AFSA based on similar fragments is proposed. Traditional AFSA enjoys a lot of obvious advantages in solving complex optimization problems like Vehicle Routing Problem(VRP). AFSA have a few limitations such as low convergence speed, low precision and instability of results. In this paper, two improvements are introduced. On the one hand, change the definition of the distance for artificial fish, as well as increase vision field of artificial fish, and the problem of speed and precision can be improved when solving VRP. On the other hand, mix artificial bee colony algorithm(ABC) into AFSA - initialize the population of artificial fish by the ABC, and it solves the problem of instability of results in some extend. The experiment results demonstrate that the optimal solution of the hybrid AFSA is easier to approach the optimal solution of the standard database than the other two algorithms. In conclusion, the hybrid algorithm can effectively solve the problem that instability of results and decrease of convergence speed and the precision of calculation at the end of the process.

Developing cross entropy genetic algorithm for solving Two-Dimensional Loading Heterogeneous Fleet Vehicle Routing Problem (2L-HFVRP)

NASA Astrophysics Data System (ADS)

Paramestha, D. L.; Santosa, B.

2018-04-01

Two-dimensional Loading Heterogeneous Fleet Vehicle Routing Problem (2L-HFVRP) is a combination of Heterogeneous Fleet VRP and a packing problem well-known as Two-Dimensional Bin Packing Problem (BPP). 2L-HFVRP is a Heterogeneous Fleet VRP in which these costumer demands are formed by a set of two-dimensional rectangular weighted item. These demands must be served by a heterogeneous fleet of vehicles with a fix and variable cost from the depot. The objective function 2L-HFVRP is to minimize the total transportation cost. All formed routes must be consistent with the capacity and loading process of the vehicle. Sequential and unrestricted scenarios are considered in this paper. We propose a metaheuristic which is a combination of the Genetic Algorithm (GA) and the Cross Entropy (CE) named Cross Entropy Genetic Algorithm (CEGA) to solve the 2L-HFVRP. The mutation concept on GA is used to speed up the algorithm CE to find the optimal solution. The mutation mechanism was based on local improvement (2-opt, 1-1 Exchange, and 1-0 Exchange). The probability transition matrix mechanism on CE is used to avoid getting stuck in the local optimum. The effectiveness of CEGA was tested on benchmark instance based 2L-HFVRP. The result of experiments shows a competitive result compared with the other algorithm.

Vehicle Routing Problem Using Genetic Algorithm with Multi Compartment on Vegetable Distribution

NASA Astrophysics Data System (ADS)

Kurnia, Hari; Gustri Wahyuni, Elyza; Cergas Pembrani, Elang; Gardini, Syifa Tri; Kurnia Aditya, Silfa

2018-03-01

The problem that is often gained by the industries of managing and distributing vegetables is how to distribute vegetables so that the quality of the vegetables can be maintained properly. The problems encountered include optimal route selection and little travel time or so-called TSP (Traveling Salesman Problem). These problems can be modeled using the Vehicle Routing Problem (VRP) algorithm with rating ranking, a cross order based crossing, and also order based mutation mutations on selected chromosomes. This study uses limitations using only 20 market points, 2 point warehouse (multi compartment) and 5 vehicles. It is determined that for one distribution, one vehicle can only distribute to 4 market points only from 1 particular warehouse, and also one such vehicle can only accommodate 100 kg capacity.

An Integer Programming Model For Solving Heterogeneous Vehicle Routing Problem With Hard Time Window considering Service Choice

NASA Astrophysics Data System (ADS)

Susilawati, Enny; Mawengkang, Herman; Efendi, Syahril

2018-01-01

Generally a Vehicle Routing Problem with time windows (VRPTW) can be defined as a problem to determine the optimal set of routes used by a fleet of vehicles to serve a given set of customers with service time restrictions; 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 address a variant of the VRPTW in which the fleet of vehicle is heterogenic due to the different size of demand from customers. The problem, called Heterogeneous VRP (HVRP) also includes service levels. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model.

Time Dependent Heterogeneous Vehicle Routing Problem for Catering Service Delivery Problem

NASA Astrophysics Data System (ADS)

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.

The Time Window Vehicle Routing Problem Considering Closed Route

NASA Astrophysics Data System (ADS)

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

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

NASA Astrophysics Data System (ADS)

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.

Optimization for Service Routes of Pallet Service Center Based on the Pallet Pool Mode

PubMed Central

He, Shiwei; Song, Rui

2016-01-01

Service routes optimization (SRO) of pallet service center should meet customers' demand firstly and then, through the reasonable method of lines organization, realize the shortest path of vehicle driving. The routes optimization of pallet service center is similar to the distribution problems of vehicle routing problem (VRP) and Chinese postman problem (CPP), but it has its own characteristics. Based on the relevant research results, the conditions of determining the number of vehicles, the one way of the route, the constraints of loading, and time windows are fully considered, and a chance constrained programming model with stochastic constraints is constructed taking the shortest path of all vehicles for a delivering (recycling) operation as an objective. For the characteristics of the model, a hybrid intelligent algorithm including stochastic simulation, neural network, and immune clonal algorithm is designed to solve the model. Finally, the validity and rationality of the optimization model and algorithm are verified by the case. PMID:27528865

A Meta-heuristic Approach for Variants of VRP in Terms of Generalized Saving Method

NASA Astrophysics Data System (ADS)

Shimizu, Yoshiaki

Global logistic design is becoming a keen interest to provide an essential infrastructure associated with modern societal provision. For examples, we can designate green and/or robust logistics in transportation systems, smart grids in electricity utilization systems, and qualified service in delivery systems, and so on. As a key technology for such deployments, we engaged in practical vehicle routing problem on a basis of the conventional saving method. This paper extends such idea and gives a general framework available for various real-world applications. It can cover not only delivery problems but also two kind of pick-up problems, i.e., straight and drop-by routings. Moreover, multi-depot problem is considered by a hybrid approach with graph algorithm and its solution method is realized in a hierarchical manner. Numerical experiments have been taken place to validate effectiveness of the proposed method.

A green vehicle routing problem with customer satisfaction criteria

NASA Astrophysics Data System (ADS)

Afshar-Bakeshloo, M.; Mehrabi, A.; Safari, H.; Maleki, M.; Jolai, F.

2016-12-01

This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers' satisfaction have been taken into account. Meanwhile, the introduced model prepares an effective dashboard for decision-makers that determines appropriate routes, the best mixed fleet, speed and idle time of vehicles. Additionally, some new factors evaluate the greening of each decision based on three criteria. This model applies piecewise linear functions (PLFs) to linearize a nonlinear fuzzy interval for incorporating customers' satisfaction into other linear objectives. We have presented a mixed integer linear programming formulation for the S-GVRP. This model enriches managerial insights by providing trade-offs between customers' satisfaction, total costs and emission levels. Finally, we have provided a numerical study for showing the applicability of the model.

Solving TSP problem with improved genetic algorithm

NASA Astrophysics Data System (ADS)

Fu, Chunhua; Zhang, Lijun; Wang, Xiaojing; Qiao, Liying

2018-05-01

The TSP is a typical NP problem. The optimization of vehicle routing problem (VRP) and city pipeline optimization can use TSP to solve; therefore it is very important to the optimization for solving TSP problem. The genetic algorithm (GA) is one of ideal methods in solving it. The standard genetic algorithm has some limitations. Improving the selection operator of genetic algorithm, and importing elite retention strategy can ensure the select operation of quality, In mutation operation, using the adaptive algorithm selection can improve the quality of search results and variation, after the chromosome evolved one-way evolution reverse operation is added which can make the offspring inherit gene of parental quality improvement opportunities, and improve the ability of searching the optimal solution algorithm.

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

PubMed

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.

A Fuzzy Goal Programming for a Multi-Depot Distribution Problem

NASA Astrophysics Data System (ADS)

Nunkaew, Wuttinan; Phruksaphanrat, Busaba

2010-10-01

A fuzzy goal programming model for solving a Multi-Depot Distribution Problem (MDDP) is proposed in this research. This effective proposed model is applied for solving in the first step of Assignment First-Routing Second (AFRS) approach. Practically, a basic transportation model is firstly chosen to solve this kind of problem in the assignment step. After that the Vehicle Routing Problem (VRP) model is used to compute the delivery cost in the routing step. However, in the basic transportation model, only depot to customer relationship is concerned. In addition, the consideration of customer to customer relationship should also be considered since this relationship exists in the routing step. Both considerations of relationships are solved using Preemptive Fuzzy Goal Programming (P-FGP). The first fuzzy goal is set by a total transportation cost and the second fuzzy goal is set by a satisfactory level of the overall independence value. A case study is used for describing the effectiveness of the proposed model. Results from the proposed model are compared with the basic transportation model that has previously been used in this company. The proposed model can reduce the actual delivery cost in the routing step owing to the better result in the assignment step. Defining fuzzy goals by membership functions are more realistic than crisps. Furthermore, flexibility to adjust goals and an acceptable satisfactory level for decision maker can also be increased and the optimal solution can be obtained.

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

PubMed Central

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

2015-01-01

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. PMID:26540055

A set-covering based heuristic algorithm for the periodic vehicle routing problem.

PubMed

Cacchiani, V; Hemmelmayr, V C; Tricoire, F

2014-01-30

We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011)  [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems.

A set-covering based heuristic algorithm for the periodic vehicle routing problem

PubMed Central

Cacchiani, V.; Hemmelmayr, V.C.; Tricoire, F.

2014-01-01

We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011)  [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems. PMID:24748696

Efficient distribution of toy products using ant colony optimization algorithm

NASA Astrophysics Data System (ADS)

Hidayat, S.; Nurpraja, C. A.

2017-12-01

CV Atham Toys (CVAT) produces wooden toys and furniture, comprises 13 small and medium industries. CVAT always attempt to deliver customer orders on time but delivery costs are high. This is because of inadequate infrastructure such that delivery routes are long, car maintenance costs are high, while fuel subsidy by the government is still temporary. This study seeks to minimize the cost of product distribution based on the shortest route using one of five Ant Colony Optimization (ACO) algorithms to solve the Vehicle Routing Problem (VRP). This study concludes that the best of the five is the Ant Colony System (ACS) algorithm. The best route in 1st week gave a total distance of 124.11 km at a cost of Rp 66,703.75. The 2nd week route gave a total distance of 132.27 km at a cost of Rp 71,095.13. The 3rd week best route gave a total distance of 122.70 km with a cost of Rp 65,951.25. While the 4th week gave a total distance of 132.27 km at a cost of Rp 74,083.63. Prior to this study there was no effort to calculate these figures.

Mucosal and systemic adjuvant activity of alphavirus replicon particles

NASA Astrophysics Data System (ADS)

Thompson, Joseph M.; Whitmore, Alan C.; Konopka, Jennifer L.; Collier, Martha L.; Richmond, Erin M. B.; Davis, Nancy L.; Staats, Herman F.; Johnston, Robert E.

2006-03-01

Vaccination represents the most effective control measure in the fight against infectious diseases. Local mucosal immune responses are critical for protection from, and resolution of, infection by numerous mucosal pathogens. Antigen processing across mucosal surfaces is the natural route by which mucosal immunity is generated, as peripheral antigen delivery typically fails to induce mucosal immune responses. However, we demonstrate in this article that mucosal immune responses are evident at multiple mucosal surfaces after parenteral delivery of Venezuelan equine encephalitis virus replicon particles (VRP). Moreover, coinoculation of null VRP (not expressing any transgene) with inactivated influenza virions, or ovalbumin, resulted in a significant increase in antigen-specific systemic IgG and fecal IgA antibodies, compared with antigen alone. Pretreatment of VRP with UV light largely abrogated this adjuvant effect. These results demonstrate that alphavirus replicon particles possess intrinsic systemic and mucosal adjuvant activity and suggest that VRP RNA replication is the trigger for this activity. We feel that these observations and the continued experimentation they stimulate will ultimately define the specific components of an alternative pathway for the induction of mucosal immunity, and if the activity is evident in humans, will enable new possibilities for safe and inexpensive subunit and inactivated vaccines. vaccine vector | Venezuelan equine encephalitis virus | viral immunology | RNA virus

Stress at Work and Its Subsequent Problems among Teachers of the Public Schools Which Operate the School-Based Violence Reduction Program (VRP) in Tulkarm Governorate

ERIC Educational Resources Information Center

Oteer, Rabee

2015-01-01

This study aimed to identify the work-related stress and its subsequent problems among teachers of the public schools which operated the school-based Violence Reduction Program (VRP) in the governorate of Tulkarm during the second semester of 2015-2016. Besides, it aimed to identify the effect of specific variables, such as gender, specialization,…

Optimization for routing vehicles of seafood product transportation

NASA Astrophysics Data System (ADS)

Soenandi, I. A.; Juan, Y.; Budi, M.

2017-12-01

Recently, increasing usage of marine products is creating new challenges for businesses of marine products in terms of transportation that used to carry the marine products like seafood to the main warehouse. This can be a problem if the carrier fleet is limited, and there are time constraints in terms of the freshness of the marine product. There are many ways to solve this problem, including the optimization of routing vehicles. In this study, this strategy is to implement in the marine product business in Indonesia with such an expected arrangement of the company to optimize routing problem in transportation with time and capacity windows. Until now, the company has not used the scientific method to manage the routing of their vehicle from warehouse to the location of marine products source. This study will solve a stochastic Vehicle Routing Problems (VRP) with time and capacity windows by using the comparison of six methods and looking the best results for the optimization, in this situation the company could choose the best method, in accordance with the existing condition. In this research, we compared the optimization with another method such as branch and bound, dynamic programming and Ant Colony Optimization (ACO). Finally, we get the best result after running ACO algorithm with existing travel time data. With ACO algorithm was able to reduce vehicle travel time by 3189.65 minutes, which is about 23% less than existing and based on consideration of the constraints of time within 2 days (including rest time for the driver) using 28 tons capacity of truck and the companies need two units of vehicles for transportation.

Waste management as an effort to improve urban area cleanliness and community income (journal review)

NASA Astrophysics Data System (ADS)

Kinantan, Bag; Rahim Matondang, A.; Hidayati, Juliza

2018-02-01

The problem of urban waste has reached a point of concern. Population and economic growth are thought to be the cause of increasing the waste generation. The major problem related to this condition is the increasing of waste production which is not balance with the increase of its management capacity. Based on the Law Number 18 of 2008 that waste management starts from the source by applying the 3R approach (Reduction, Reuse, Recycle). This regulation provides a way which expect the waste management can be better, so that, the level of waste service can be improved and load on landfills (TPA) can be reduced.The cost of garbage collection and transport are 85% of the total waste management cost, so if this is optimized, it will optimize the system as a whole. Subsequent research focuses on how to optimize the garbage collection and transport sub-systems by finding the shortest route of transportation to the landfill by developing a Vehicle Routing Problem (VRP) model. The development of an urban area leads to the preparation of the best route is no longer an optimal solution. The complexity of the waste problem is not only related to the technical matters, but also the social and economic problems of the community. So, it is necessary to develop a model of waste management which does not only pay attention to the technical aspects, but also the social and economic. Waste is expected to be no longer a burden, but can also be utilized economically to increase community income.

Minimization of municipal solid waste transportation route in West Jakarta using Tabu Search method

NASA Astrophysics Data System (ADS)

Chaerul, M.; Mulananda, A. M.

2018-04-01

Indonesia still adopts the concept of collect-haul-dispose for municipal solid waste handling and it leads to the queue of the waste trucks at final disposal site (TPA). The study aims to minimize the total distance of waste transportation system by applying a Transshipment model. In this case, analogous of transshipment point is a compaction facility (SPA). Small capacity of trucks collects the waste from waste temporary collection points (TPS) to the compaction facility which located near the waste generator. After compacted, the waste is transported using big capacity of trucks to the final disposal site which is located far away from city. Problem related with the waste transportation can be solved using Vehicle Routing Problem (VRP). In this study, the shortest distance of route from truck pool to TPS, TPS to SPA, and SPA to TPA was determined by using meta-heuristic methods, namely Tabu Search 2 Phases. TPS studied is the container type with total 43 units throughout the West Jakarta City with 38 units of Armroll truck with capacity of 10 m3 each. The result determines the assignment of each truck from the pool to the selected TPS, SPA and TPA with the total minimum distance of 2,675.3 KM. The minimum distance causing the total cost for waste transportation to be spent by the government also becomes minimal.

The Behavioral Effects of a Mixed Efficacy Antinociceptive Peptide, VRP26, Following Chronic Administration in Mice

PubMed Central

Anand, Jessica P.; Boyer, Brett T.; Mosberg, Henry I.; Jutkiewicz, Emily M.

2016-01-01

Rationale VRP26 displays mu opioid receptor agonist and delta opioid receptor antagonist activity in vitro, a pharmacological profile purported to produce reduced tolerance, dependence, and rewarding effects. We hypothesized that VRP26 would display reduced adverse effects after chronic administration as compared with the traditional opioid analgesic fentanyl. Objective To explore the development of tolerance, dependence and conditioned place preference of VRP26 as compared with the traditional opioid analgesic fentanyl. Methods The antinociceptive effects of VRP26 and fentanyl were assessed using the mouse warm water tail withdrawal (WWTW) assay. Measurement of antinociceptive tolerance and physical dependence occurred after seven days of continuous administration of either fentanyl (0.3 mg/kg/day) or VRP26 (10 mg/kg/day); tolerance was measured by a shift in the antinociceptive dose response curve in the WWTW assay. Physical dependence was determined by observation of withdrawal symptoms after precipitated withdrawal. Rewarding effects were measured by the ability of VRP26 or fentanyl to produce conditioned place preference. Results Fentanyl produced significant tolerance and dependence, as well as significant conditioned place preference. VRP26 produced neither tolerance nor physical dependence, nor did it produce significant conditioned place preference. Conclusions These results suggest that chronic treatment with VRP26 may produce less tolerance or physical dependence than chronic treatment with clinically available mu opioid analgesics such as fentanyl. Additionally, VRP26 produces less rewarding effects than fentanyl. This desirable in vivo profile may be due to the mixed efficacy nature of VRP26 and could provide the framework for safer opioid analgesics. PMID:27117141

PmVRP15, a novel viral responsive protein from the black tiger shrimp, Penaeus monodon, promoted white spot syndrome virus replication.

PubMed

Vatanavicharn, Tipachai; Prapavorarat, Adisak; Jaree, Phattarunda; Somboonwiwat, Kunlaya; Tassanakajon, Anchalee

2014-01-01

Suppression subtractive hybridization of Penaeus monodon hemocytes challenged with white spot syndrome virus (WSSV) has identified the viral responsive gene, PmVRP15, as the highest up-regulated gene ever reported in shrimps. Expression analysis by quantitative real time RT-PCR revealed 9410-fold up-regulated level at 48 h post WSSV injection. Tissue distribution analysis showed that PmVRP15 transcript was mainly expressed in the hemocytes of shrimp. The full-length cDNA of PmVRP15 transcript was obtained and showed no significant similarity to any known gene in the GenBank database. The predicted open reading frame of PmVRP15 encodes for a deduced 137 amino acid protein containing a putative transmembrane helix. Immunofluorescent localization of the PmVRP15 protein revealed it accumulated around the nuclear membrane in all three types of shrimp hemocytes and that the protein was highly up-regulated in WSSV-infected shrimps. Double-stranded RNA interference-mediated gene silencing of PmVRP15 in P. monodon significantly decreased WSSV propagation compared to the control shrimps (injected with GFP dsRNA). The significant decrease in cumulative mortality rate of WSSV-infected shrimp following PmVRP15 knockdown was observed. These results suggest that PmVRP15 is likely to be a nuclear membrane protein and that it acts as a part of WSSV propagation pathway.

Fourier descriptor analysis and unification of voice range profile contours: method and applications.

PubMed

Pabon, Peter; Ternström, Sten; Lamarche, Anick

2011-06-01

To describe a method for unified description, statistical modeling, and comparison of voice range profile (VRP) contours, even from diverse sources. A morphologic modeling technique, which is based on Fourier descriptors (FDs), is applied to the VRP contour. The technique, which essentially involves resampling of the curve of the contour, is assessed and also is compared to density-based VRP averaging methods that use the overlap count. VRP contours can be usefully described and compared using FDs. The method also permits the visualization of the local covariation along the contour average. For example, the FD-based analysis shows that the population variance for ensembles of VRP contours is usually smallest at the upper left part of the VRP. To illustrate the method's advantages and possible further application, graphs are given that compare the averaged contours from different authors and recording devices--for normal, trained, and untrained male and female voices as well as for child voices. The proposed technique allows any VRP shape to be brought to the same uniform base. On this uniform base, VRP contours or contour elements coming from a variety of sources may be placed within the same graph for comparison and for statistical analysis.

Antibody-mediated protection against mucosal simian-human immunodeficiency virus challenge of macaques immunized with alphavirus replicon particles and boosted with trimeric envelope glycoprotein in MF59 adjuvant.

PubMed

Barnett, Susan W; Burke, Brian; Sun, Yide; Kan, Elaine; Legg, Harold; Lian, Ying; Bost, Kristen; Zhou, Fengmin; Goodsell, Amanda; Zur Megede, Jan; Polo, John; Donnelly, John; Ulmer, Jeffrey; Otten, Gillis R; Miller, Christopher J; Vajdy, Michael; Srivastava, Indresh K

2010-06-01

We have previously shown that rhesus macaques were partially protected against high-dose intravenous challenge with simian-human immunodeficiency virus SHIV(SF162P4) following sequential immunization with alphavirus replicon particles (VRP) of a chimeric recombinant VEE/SIN alphavirus (derived from Venezuelan equine encephalitis virus [VEE] and the Sindbis virus [SIN]) encoding human immunodeficiency virus type 1 HIV-1(SF162) gp140DeltaV2 envelope (Env) and trimeric Env protein in MF59 adjuvant (R. Xu, I. K. Srivastava, C. E. Greer, I. Zarkikh, Z. Kraft, L. Kuller, J. M. Polo, S. W. Barnett, and L. Stamatatos, AIDS Res. Hum. Retroviruses 22:1022-1030, 2006). The protection did not require T-cell immune responses directed toward simian immunodeficiency virus (SIV) Gag. We extend those findings here to demonstrate antibody-mediated protection against mucosal challenge in macaques using prime-boost regimens incorporating both intramuscular and mucosal routes of delivery. The macaques in the vaccination groups were primed with VRP and then boosted with Env protein in MF59 adjuvant, or they were given VRP intramuscular immunizations alone and then challenged with SHIV(SF162P4) (intrarectal challenge). The results demonstrated that these vaccines were able to effectively protect the macaques to different degrees against subsequent mucosal SHIV challenge, but most noteworthy, all macaques that received the intramuscular VRP prime plus Env protein boost were completely protected. A statistically significant association was observed between the titer of virus neutralizing and binding antibodies as well as the avidity of anti-Env antibodies measured prechallenge and protection from infection. These results highlight the merit of the alphavirus replicon vector prime plus Env protein boost vaccine approach for the induction of protective antibody responses and are of particular relevance to advancing our understanding of the potential correlates of immune protection against HIV infection at a relevant mucosal portal of entry.

Multiagent vaccines vectored by Venezuelan equine encephalitis virus replicon elicits immune responses to Marburg virus and protection against anthrax and botulinum neurotoxin in mice.

PubMed

Lee, John S; Groebner, Jennifer L; Hadjipanayis, Angela G; Negley, Diane L; Schmaljohn, Alan L; Welkos, Susan L; Smith, Leonard A; Smith, Jonathan F

2006-11-17

The development of multiagent vaccines offers the advantage of eliciting protection against multiple diseases with minimal inoculations over a shorter time span. We report here the results of using formulations of individual Venezuelan equine encephalitis (VEE) virus replicon-vectored vaccines against a bacterial disease, anthrax; a viral disease, Marburg fever; and against a toxin-mediated disease, botulism. The individual VEE replicon particles (VRP) expressed mature 83-kDa protective antigen (MAT-PA) from Bacillus anthracis, the glycoprotein (GP) from Marburg virus (MBGV), or the H(C) fragment from botulinum neurotoxin (BoNT H(C)). CBA/J mice inoculated with a mixture of VRP expressing BoNT H(C) serotype C (BoNT/C H(C)) and MAT-PA were 80% protected from a B. anthracis (Sterne strain) challenge and then 100% protected from a sequential BoNT/C challenge. Swiss mice inoculated with individual VRP or with mixtures of VRP vaccines expressing BoNT H(C) serotype A (BoNT/A H(C)), MAT-PA, and MBGV-GP produced antibody responses specific to the corresponding replicon-expressed protein. Combination of the different VRP vaccines did not diminish the antibody responses measured for Swiss mice inoculated with formulations of two or three VRP vaccines as compared to mice that received only one VRP vaccine. Swiss mice inoculated with VRP expressing BoNT/A H(C) alone or in combination with VRP expressing MAT-PA and MBGV GP, were completely protected from a BoNT/A challenge. These studies demonstrate the utility of combining individual VRP vaccines into multiagent formulations for eliciting protective immune responses to various types of diseases.

PmVRP15, a Novel Viral Responsive Protein from the Black Tiger Shrimp, Penaeus monodon, Promoted White Spot Syndrome Virus Replication

PubMed Central

Vatanavicharn, Tipachai; Prapavorarat, Adisak; Jaree, Phattarunda; Somboonwiwat, Kunlaya; Tassanakajon, Anchalee

2014-01-01

Suppression subtractive hybridization of Penaeus monodon hemocytes challenged with white spot syndrome virus (WSSV) has identified the viral responsive gene, PmVRP15, as the highest up-regulated gene ever reported in shrimps. Expression analysis by quantitative real time RT-PCR revealed 9410–fold up-regulated level at 48 h post WSSV injection. Tissue distribution analysis showed that PmVRP15 transcript was mainly expressed in the hemocytes of shrimp. The full-length cDNA of PmVRP15 transcript was obtained and showed no significant similarity to any known gene in the GenBank database. The predicted open reading frame of PmVRP15 encodes for a deduced 137 amino acid protein containing a putative transmembrane helix. Immunofluorescent localization of the PmVRP15 protein revealed it accumulated around the nuclear membrane in all three types of shrimp hemocytes and that the protein was highly up-regulated in WSSV-infected shrimps. Double-stranded RNA interference-mediated gene silencing of PmVRP15 in P. monodon significantly decreased WSSV propagation compared to the control shrimps (injected with GFP dsRNA). The significant decrease in cumulative mortality rate of WSSV-infected shrimp following PmVRP15 knockdown was observed. These results suggest that PmVRP15 is likely to be a nuclear membrane protein and that it acts as a part of WSSV propagation pathway. PMID:24637711

Effects of the calcium channel blocker verapamil and sulphydryl reducing agent dithiothreitol on atractyloside toxicity in precision-cut rat renal cortical and liver slices.

PubMed

Obatomi, D K; Blackburn, R O; Bach, P H

2001-10-01

The effects of dithiothreitol (DTT), a sulfhydryl-containing agent and verapamil (VRP), a calcium channel blocker as possible cytoprotectants against the atractyloside-induced toxicity were characterized in rat kidney and liver slices in vitro using multiple markers of toxicity. Precision-cut slices (200 microM thick) were either incubated with atractyloside (2 mM) or initially preincubated with either DTT (5 mM) or VRP (100 microM) for 30 min followed by exposure to atractyloside (2 mM) for 3 h at 37 degrees C on a rocker platform rotated at approximately 3 rpm. All of the toxicity parameters were sensitive to exposure to atractyloside, but treatment with DTT or VRP alone did not provide any indication of damage to the tissues. Preincubation of slices containing either DTT or VRP for 30 min provided total protection against atractyloside-induced increase in LDH leakage in both kidney and liver slices. Increased induction of lipid peroxidation by atractyloside in liver slices was completely abolished by DTT and VRP. Both DTT and VRP provided partial protection against atractyloside-induced inhibition of gluconeogenesis in both kidney and liver slices. Atractyloside-induced ATP depletion in both kidney and liver slices was partially abolished by VRP but not DTT. The significant depletion of GSH in the kidney slices by atractyloside was completely reversed by DTT only, while VRP alone reversed the same process in liver slices. Decreased MTT reductive capacity and significant increase in ALT leakage caused by atractyloside in liver slices was partially reversed. Complete protection was achieved with both DTT and VRP against atractyloside-induced inhibition of PAH uptake in kidney slices. These findings suggest that both DTT and VRP exert cytoprotective effects in atractyloside-induced biochemical perturbation, effects that differ in liver and kidney. The effect of these agents on atractyloside has provided us with a further understanding of the molecular mechanism of its action.

Spermicidal efficacy of VRP, a synthetic cationic antimicrobial peptide, inducing apoptosis and membrane disruption.

PubMed

Ghosh, Prasanta; Bhoumik, Arpita; Saha, Sudipta; Mukherjee, Sandipan; Azmi, Sarfuddin; Ghosh, Jimut K; Dungdung, Sandhya R

2018-02-01

Presently available contraceptives are mostly hormonal or detergent in nature with numerous side effects like irritation, lesion, inflammation in vagina, alteration of body homeostasis, etc. Antimicrobial peptides with spermicidal activity but without adverse effects may be suitable alternatives. In the present study, spermicidal activity of a cationic antimicrobial peptide VRP on human spermatozoa has been elucidated. Progressive forward motility of human spermatozoa was instantly stopped after 100 μM VRP treatment and at 350 μM, all kinds of sperm motility ceased within 20 s as assessed by the Sander-Cramer assay. The spermicidal effect was confirmed by eosin-nigrosin assay and HOS test. VRP treatment (100 μM) in human spermatozoa induced both the intrinsic and extrinsic pathways of apoptosis. TUNEL assay showed VRP treatment significantly disrupted the DNA integrity and changed the mitochondrial membrane permeability as evident from MPTP assay. AFM and SEM results depicted ultra structural changes including disruption of the acrosomal cap and plasma membrane of the head and midpiece region after treatment with 350 μM VRP. MTT assay showed after treatments with 100 and 350 μM of VRP for 24 hr, a substantial amount of Lactobacillus acidophilus (about 90% and 75%, respectively) remained viable. Hence, VRP being a small synthetic peptide with antimicrobial and spermicidal activity but tolerable to normal vaginal microflora, may be a suitable target for elucidating its contraceptive potentiality. © 2017 Wiley Periodicals, Inc.

Venezuelan Equine Encephalitis Virus Replicon Particle Vaccine Protects Nonhuman Primates from Intramuscular and Aerosol Challenge with Ebolavirus

PubMed Central

Herbert, Andrew S.; Kuehne, Ana I.; Barth, James F.; Ortiz, Ramon A.; Nichols, Donald K.; Zak, Samantha E.; Stonier, Spencer W.; Muhammad, Majidat A.; Bakken, Russell R.; Prugar, Laura I.; Olinger, Gene G.; Groebner, Jennifer L.; Lee, John S.; Pratt, William D.; Custer, Max; Kamrud, Kurt I.; Smith, Jonathan F.; Hart, Mary Kate

2013-01-01

There are no vaccines or therapeutics currently approved for the prevention or treatment of ebolavirus infection. Previously, a replicon vaccine based on Venezuelan equine encephalitis virus (VEEV) demonstrated protective efficacy against Marburg virus in nonhuman primates. Here, we report the protective efficacy of Sudan virus (SUDV)- and Ebola virus (EBOV)-specific VEEV replicon particle (VRP) vaccines in nonhuman primates. VRP vaccines were developed to express the glycoprotein (GP) of either SUDV or EBOV. A single intramuscular vaccination of cynomolgus macaques with VRP expressing SUDV GP provided complete protection against intramuscular challenge with SUDV. Vaccination against SUDV and subsequent survival of SUDV challenge did not fully protect cynomolgus macaques against intramuscular EBOV back-challenge. However, a single simultaneous intramuscular vaccination with VRP expressing SUDV GP combined with VRP expressing EBOV GP did provide complete protection against intramuscular challenge with either SUDV or EBOV in cynomolgus macaques. Finally, intramuscular vaccination with VRP expressing SUDV GP completely protected cynomolgus macaques when challenged with aerosolized SUDV, although complete protection against aerosol challenge required two vaccinations with this vaccine. PMID:23408633

Venezuelan equine encephalitis virus replicon particle vaccine protects nonhuman primates from intramuscular and aerosol challenge with ebolavirus.

PubMed

Herbert, Andrew S; Kuehne, Ana I; Barth, James F; Ortiz, Ramon A; Nichols, Donald K; Zak, Samantha E; Stonier, Spencer W; Muhammad, Majidat A; Bakken, Russell R; Prugar, Laura I; Olinger, Gene G; Groebner, Jennifer L; Lee, John S; Pratt, William D; Custer, Max; Kamrud, Kurt I; Smith, Jonathan F; Hart, Mary Kate; Dye, John M

2013-05-01

There are no vaccines or therapeutics currently approved for the prevention or treatment of ebolavirus infection. Previously, a replicon vaccine based on Venezuelan equine encephalitis virus (VEEV) demonstrated protective efficacy against Marburg virus in nonhuman primates. Here, we report the protective efficacy of Sudan virus (SUDV)- and Ebola virus (EBOV)-specific VEEV replicon particle (VRP) vaccines in nonhuman primates. VRP vaccines were developed to express the glycoprotein (GP) of either SUDV or EBOV. A single intramuscular vaccination of cynomolgus macaques with VRP expressing SUDV GP provided complete protection against intramuscular challenge with SUDV. Vaccination against SUDV and subsequent survival of SUDV challenge did not fully protect cynomolgus macaques against intramuscular EBOV back-challenge. However, a single simultaneous intramuscular vaccination with VRP expressing SUDV GP combined with VRP expressing EBOV GP did provide complete protection against intramuscular challenge with either SUDV or EBOV in cynomolgus macaques. Finally, intramuscular vaccination with VRP expressing SUDV GP completely protected cynomolgus macaques when challenged with aerosolized SUDV, although complete protection against aerosol challenge required two vaccinations with this vaccine.

Integrated optimization of unmanned aerial vehicle task allocation and path planning under steady wind.

PubMed

Luo, He; Liang, Zhengzheng; Zhu, Moning; Hu, Xiaoxuan; Wang, Guoqiang

2018-01-01

Wind has a significant effect on the control of fixed-wing unmanned aerial vehicles (UAVs), resulting in changes in their ground speed and direction, which has an important influence on the results of integrated optimization of UAV task allocation and path planning. The objective of this integrated optimization problem changes from minimizing flight distance to minimizing flight time. In this study, the Euclidean distance between any two targets is expanded to the Dubins path length, considering the minimum turning radius of fixed-wing UAVs. According to the vector relationship between wind speed, UAV airspeed, and UAV ground speed, a method is proposed to calculate the flight time of UAV between targets. On this basis, a variable-speed Dubins path vehicle routing problem (VS-DP-VRP) model is established with the purpose of minimizing the time required for UAVs to visit all the targets and return to the starting point. By designing a crossover operator and mutation operator, the genetic algorithm is used to solve the model, the results of which show that an effective UAV task allocation and path planning solution under steady wind can be provided.

Integrated optimization of unmanned aerial vehicle task allocation and path planning under steady wind

PubMed Central

Liang, Zhengzheng; Zhu, Moning; Hu, Xiaoxuan; Wang, Guoqiang

2018-01-01

Wind has a significant effect on the control of fixed-wing unmanned aerial vehicles (UAVs), resulting in changes in their ground speed and direction, which has an important influence on the results of integrated optimization of UAV task allocation and path planning. The objective of this integrated optimization problem changes from minimizing flight distance to minimizing flight time. In this study, the Euclidean distance between any two targets is expanded to the Dubins path length, considering the minimum turning radius of fixed-wing UAVs. According to the vector relationship between wind speed, UAV airspeed, and UAV ground speed, a method is proposed to calculate the flight time of UAV between targets. On this basis, a variable-speed Dubins path vehicle routing problem (VS-DP-VRP) model is established with the purpose of minimizing the time required for UAVs to visit all the targets and return to the starting point. By designing a crossover operator and mutation operator, the genetic algorithm is used to solve the model, the results of which show that an effective UAV task allocation and path planning solution under steady wind can be provided. PMID:29561888

Molecular Smallpox Vaccine Delivered by Alphavirus Replicons Elicits Protective Immunity in Mice and Non-human Primates

PubMed Central

Hooper, Jay W.; Ferro, Anthony M.; Golden, Joseph W.; Silvera, Peter; Dudek, Jeanne; Alterson, Kim; Custer, Max; Rivers, Bryan; Morris, John; Owens, Gary; Smith, Jonathan F.; Kamrud, Kurt I.

2009-01-01

Naturally occurring smallpox was eradicated as a result of successful vaccination campaigns during the 1960s and 70s. Because of its highly contagious nature and high mortality rate, smallpox has significant potential as a biological weapon. Unfortunately, the current vaccine for orthopoxviruses is contraindicated for large portions of the population. Thus, there is a need for new, safe, and effective orthopoxvirus vaccines. Alphavirus replicon vectors, derived from strains of Venezuelan equine encephalitis virus, are being used to develop alternatives to the current smallpox vaccine. Here, we demonstrated that virus-like replicon particles (VRP) expressing the vaccinia virus A33R, B5R, A27L, and L1R genes elicited protective immunity in mice comparable to vaccination with live-vaccinia virus. Furthermore, cynomolgus macaques vaccinated with a combination of the four poxvirus VRPs (4pox-VRP) developed antibody responses to each antigen. These antibody responses were able to neutralize and inhibit the spread of both vaccinia virus and monkeypox virus. Macaques vaccinated with 4pox-VRP, flu HA VRP (negative control), or live-vaccinia virus (positive control) were challenged intravenously with 5 × 106 PFU of monkeypox virus 1 month after the second VRP vaccination. Four of the six negative control animals succumbed to monkeypox and the remaining two animals demonstrated either severe or grave disease. Importantly, all 10 macaques vaccinated with the 4pox-VRP vaccine survived without developing severe disease. These findings revealed that a single-boost VRP smallpox vaccine shows promise as a safe alternative to the currently licensed live-vaccinia virus smallpox vaccine. PMID:19833247

Physiologic volume of phosphorus during hemodialysis: predictions from a pseudo one-compartment model.

PubMed

Leypoldt, John K; Akonur, Alp; Agar, Baris U; Culleton, Bruce F

2012-10-01

The kinetics of plasma phosphorus concentrations during hemodialysis (HD) are complex and cannot be described by conventional one- or two-compartment kinetic models. It has recently been shown by others that the physiologic (or apparent distribution) volume for phosphorus (Vr-P) increases with increasing treatment time and shows a large variation among patients treated by thrice weekly and daily HD. Here, we describe the dependence of Vr-P on treatment time and predialysis plasma phosphorus concentration as predicted by a novel pseudo one-compartment model. The kinetics of plasma phosphorus during conventional and six times per week daily HD were simulated as a function of treatment time per session for various dialyzer phosphate clearances and patient-specific phosphorus mobilization clearances (K(M)). Vr-P normalized to extracellular volume from these simulations were reported and compared with previously published empirical findings. Simulated results were relatively independent of dialyzer phosphate clearance and treatment frequency. In contrast, Vr-P was strongly dependent on treatment time per session; the increase in Vr-P with treatment time was larger for higher values of K(M). Vr-P was inversely dependent on predialysis plasma phosphorus concentration. There was significant variation among predicted Vr-P values, depending largely on the value of K(M). We conclude that a pseudo one-compartment model can describe the empirical dependence of the physiologic volume of phosphorus on treatment time and predialysis plasma phosphorus concentration. Further, the variation in physiologic volume of phosphorus among HD patients is largely due to differences in patient-specific phosphorus mobilization clearance. © 2012 The Authors. Hemodialysis International © 2012 International Society for Hemodialysis.

Virus replicon particles expressing porcine reproductive and respiratory syndrome virus proteins elicit immune priming but do not confer protection from viremia in pigs.

PubMed

Eck, Melanie; Durán, Margarita García; Ricklin, Meret E; Locher, Samira; Sarraseca, Javier; Rodríguez, María José; McCullough, Kenneth C; Summerfield, Artur; Zimmer, Gert; Ruggli, Nicolas

2016-02-19

Porcine reproductive and respiratory syndrome virus (PRRSV) is the causative agent of one of the most devastating and economically significant viral disease of pigs worldwide. The vaccines currently available on the market elicit only limited protection. Recombinant vesicular stomatitis virus (VSV) replicon particles (VRP) have been used successfully to induce protection against influenza A virus (IAV) in chickens and bluetongue virus in sheep. In this study, VSV VRP expressing the PRRSV envelope proteins GP5, M, GP4, GP3, GP2 and the nucleocapsid protein N, individually or in combination, were generated and evaluated as a potential vector vaccine against PRRSV infection. High level expression of the recombinant PRRSV proteins was demonstrated in cell culture. However, none of the PRRSV antigens expressed from VRP, with the exception of the N protein, did induce any detectable antibody response in pigs before challenge infection with PRRSV. After challenge however, the antibody responses against GP5, GP4 and GP3 appeared in average 2 weeks earlier than in pigs vaccinated with the empty control VRP. No reduction of viremia was observed in the vaccinated group compared with the control group. When pigs were co-vaccinated with VRP expressing IAV antigens and VRP expressing PRRSV glycoproteins, only antibody responses to the IAV antigens were detectable. These data show that the VSV replicon vector can induce immune responses to heterologous proteins in pigs, but that the PRRSV envelope proteins expressed from VSV VRP are poorly immunogenic. Nevertheless, they prime the immune system for significantly earlier B-cell responses following PRRSV challenge infection.

Effects of vocal training on singing and speaking voice characteristics in vocally healthy adults and children based on choral and nonchoral data.

PubMed

Siupsinskiene, Nora; Lycke, Hugo

2011-07-01

This prospective cross-sectional study examines the effects of voice training on vocal capabilities in vocally healthy age and gender differentiated groups measured by voice range profile (VRP) and speech range profile (SRP). Frequency and intensity measurements of the VRP and SRP using standard singing and speaking voice protocols were derived from 161 trained choir singers (21 males, 59 females, and 81 prepubescent children) and from 188 nonsingers (38 males, 89 females, and 61 children). When compared with nonsingers, both genders of trained adult and child singers exhibited increased mean pitch range, highest frequency, and VRP area in high frequencies (P<0.05). Female singers and child singers also showed significantly increased mean maximum voice intensity, intensity range, and total VRP area. The logistic regression analysis showed that VRP pitch range, highest frequency, maximum voice intensity, and maximum-minimum intensity range, and SRP slope of speaking curve were the key predictors of voice training. Age, gender, and voice training differentiated norms of VRP and SRP parameters are presented. Significant positive effect of voice training on vocal capabilities, mostly singing voice, was confirmed. The presented norms for trained singers, with key parameters differentiated by gender and age, are suggested for clinical practice of otolaryngologists and speech-language pathologists. Copyright © 2011 The Voice Foundation. Published by Mosby, Inc. All rights reserved.

Co-delivery of docetaxel and verapamil by reduction-sensitive PEG-PLGA-SS-DTX conjugate micelles to reverse the multi-drug resistance of breast cancer.

PubMed

Guo, Yuanyuan; He, Wenxiu; Yang, Shengfeng; Zhao, Dujuan; Li, Zhonghao; Luan, Yuxia

2017-03-01

The clinical usage of docetaxel (DTX) has been blocked in the clinic because of its poor solubility and tumour multi-drug resistance (MDR). The dominating mechanism of MDR is the over-expression of p-gp on tumour cells. Traditional nano-medicines, such as nanoparticles and micelles, have been used to physically entrap DTX to improve their solubility, while the drug loading content was very low and the tumour resistance was neglected. In this study, the synthesized reduction-sensitive mPEG-PLGA-SS-DTX conjugate was utilized to load the p-gp inhibitor veraparmil (VRP) to prepare DTX and VRP co-delivered mPEG-PLGA-SS-DTX/VRP (PP-SS-DTX/VRP) multi-functional micelles to reverse MDR and enhance the anti-tumour effect of DTX. The micelles had a high drug loading content and showed an obvious reduction-sensitive release property for both DTX and VRP. In addition, an in vitro anti-tumour assay revealed that the micelles markedly inhibited the efflux activity of p-gp and accelerated cell apoptosis, resulting in the improvement of anti-tumour activity and reversal of MDR. The PP-SS-DTX micelles markedly enhanced the in vivo circulation time and increased the drug accumulation in tumour tissues. Therefore, the PP-SS-DTX/VRP micelle is a desirable drug delivery system for multi-drug resistance therapy of DTX and is very promising for clinical usage. Copyright © 2016 Elsevier B.V. All rights reserved.

PubMed Central

D'ALATRI, L.

2014-01-01

SUMMARY This study was carried out to compare the vocal limits obtained by speech range profile (SRP) with those of voice range profile (VRP) in untrained healthy and dysphonic females. Forty-six healthy voice volunteers (control group) and 148 dysphonic patients (dysphonic group) were evaluated using videolaryngostroboscopic assessment and phonetography for voice measurements. For VRP, subjects were asked to sustain the vowel /a/ as soft and as loud possible from the lowest to the highest frequencies using an automated procedure. The SRP was obtained by recording the speaking voice (SV) and the shouting voice (ShV) asking subjects to read a list of sentences aloud and to shout / ehi/ as loud as they could, respectively. All subjects in the control and dysphonic groups were able to perform SRP. fourty of 46 (85%) and 102 of 148 (68.91%) cases, respectively in control and dysphonic groups, were able to perform VRP. Most frequently, the VRP was not recorded because of the inability to perform or, especially in the dysphonic group, for inadequacy of the vocal signal. In the control group, there were no significant differences between the mean values of Fmin, Fmax, Imin and number of semitones (st) of the VRP and those of the SRP (p > 0.05). In the dysphonic group, the mean values of Fmin, Fmax and st SV+ShV for SRP were significantly higher than those of VRP. Our preliminary results suggest that the SRP may be a useful, alternative tool to assess vocal limits in both euphonic and dysphonic females. PMID:25210219

Vaccine Efficacy in Senescent Mice Challenged with Recombinant SARS-CoV Bearing Epidemic and Zoonotic Spike Variants

PubMed Central

Deming, Damon; Sheahan, Timothy; Heise, Mark; Yount, Boyd; Davis, Nancy; Sims, Amy; Suthar, Mehul; Harkema, Jack; Whitmore, Alan; Pickles, Raymond; West, Ande; Donaldson, Eric; Curtis, Kristopher; Johnston, Robert; Baric, Ralph

2006-01-01

Background In 2003, severe acute respiratory syndrome coronavirus (SARS-CoV) was identified as the etiological agent of severe acute respiratory syndrome, a disease characterized by severe pneumonia that sometimes results in death. SARS-CoV is a zoonotic virus that crossed the species barrier, most likely originating from bats or from other species including civets, raccoon dogs, domestic cats, swine, and rodents. A SARS-CoV vaccine should confer long-term protection, especially in vulnerable senescent populations, against both the 2003 epidemic strains and zoonotic strains that may yet emerge from animal reservoirs. We report the comprehensive investigation of SARS vaccine efficacy in young and senescent mice following homologous and heterologous challenge. Methods and Findings Using Venezuelan equine encephalitis virus replicon particles (VRP) expressing the 2003 epidemic Urbani SARS-CoV strain spike (S) glycoprotein (VRP-S) or the nucleocapsid (N) protein from the same strain (VRP-N), we demonstrate that VRP-S, but not VRP-N vaccines provide complete short- and long-term protection against homologous strain challenge in young and senescent mice. To test VRP vaccine efficacy against a heterologous SARS-CoV, we used phylogenetic analyses, synthetic biology, and reverse genetics to construct a chimeric virus (icGDO3-S) encoding a synthetic S glycoprotein gene of the most genetically divergent human strain, GDO3, which clusters among the zoonotic SARS-CoV. icGD03-S replicated efficiently in human airway epithelial cells and in the lungs of young and senescent mice, and was highly resistant to neutralization with antisera directed against the Urbani strain. Although VRP-S vaccines provided complete short-term protection against heterologous icGD03-S challenge in young mice, only limited protection was seen in vaccinated senescent animals. VRP-N vaccines not only failed to protect from homologous or heterologous challenge, but resulted in enhanced immunopathology with eosinophilic infiltrates within the lungs of SARS-CoV–challenged mice. VRP-N–induced pathology presented at day 4, peaked around day 7, and persisted through day 14, and was likely mediated by cellular immune responses. Conclusions This study identifies gaps and challenges in vaccine design for controlling future SARS-CoV zoonosis, especially in vulnerable elderly populations. The availability of a SARS-CoV virus bearing heterologous S glycoproteins provides a robust challenge inoculum for evaluating vaccine efficacy against zoonotic strains, the most likely source of future outbreaks. PMID:17194199

Economic assessment of biodiesel production from waste frying oils.

PubMed

Araujo, Victor Kraemer Wermelinger Sancho; Hamacher, Silvio; Scavarda, Luiz Felipe

2010-06-01

Waste frying oils (WFO) can be a good source for the production of biodiesel because this raw material is not part of the food chain, is low cost and can be used in a way that resolves environmental problems (i.e. WFO is no longer thrown into the sewage network). The goal of this article is to propose a method to evaluate the costs of biodiesel production from WFO to develop an economic assessment of this alternative. This method embraces a logistics perspective, as the cost of collection of oil from commercial producers and its delivery to biodiesel depots or plants can be relevant and is an issue that has been little explored in the academic literature. To determine the logistics cost, a mathematical programming model is proposed to solve the vehicle routing problem (VRP), which was applied in an important urban center in Brazil (Rio de Janeiro), a relevant and potential center for biodiesel production and consumption. Eighty-one biodiesel cost scenarios were compared with information on the commercialization of biodiesel in Brazil. The results obtained demonstrate the economic viability of biodiesel production from WFO in the urban center studied and the relevance of logistics in the total biodiesel production cost. (c) 2010 Elsevier Ltd. All rights reserved.

Should Title 24 Ventilation Requirements Be Amended to include an Indoor Air Quality Procedure?

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dutton, Spencer M.; Mendell, Mark J.; Chan, Wanyu R.

Minimum outdoor air ventilation rates (VRs) for buildings are specified in standards, including California?s Title 24 standards. The ASHRAE ventilation standard includes two options for mechanically-ventilated buildings ? a prescriptive ventilation rate procedure (VRP) that specifies minimum VRs that vary among occupancy classes, and a performance-based indoor air quality procedure (IAQP) that may result in lower VRs than the VRP, with associated energy savings, if IAQ meeting specified criteria can be demonstrated. The California Energy Commission has been considering the addition of an IAQP to the Title 24 standards. This paper, based on a review of prior data and newmore » analyses of the IAQP, evaluates four future options for Title 24: no IAQP; adding an alternate VRP, adding an equivalent indoor air quality procedure (EIAQP), and adding an improved ASHRAE-like IAQP. Criteria were established for selecting among options, and feedback was obtained in a workshop of stakeholders. Based on this review, the addition of an alternate VRP is recommended. This procedure would allow lower minimum VRs if a specified set of actions were taken to maintain acceptable IAQ. An alternate VRP could also be a valuable supplement to ASHRAE?s ventilation standard.« less

The speech range profile (SRP): an easy and useful tool to assess vocal limits.

PubMed

D'Alatri, L; Marchese, M R

2014-08-01

This study was carried out to compare the vocal limits obtained by speech range profile (SRP) with those of voice range profile (VRP) in untrained healthy and dysphonic females. Forty-six healthy voice volunteers (control group) and 148 dysphonic patients (dysphonic group) were evaluated using videolaryngostroboscopic assessment and phonetography for voice measurements. For VRP, subjects were asked to sustain the vowel /a/ as soft and as loud possible from the lowest to the highest frequencies using an automated procedure. The SRP was obtained by recording the speaking voice (SV) and the shouting voice (ShV) asking subjects to read a list of sentences aloud and to shout / ehi/ as loud as they could, respectively. All subjects in the control and dysphonic groups were able to perform SRP. fourty of 46 (85%) and 102 of 148 (68.91%) cases, respectively in control and dysphonic groups, were able to perform VRP. Most frequently, the VRP was not recorded because of the inability to perform or, especially in the dysphonic group, for inadequacy of the vocal signal. In the control group, there were no significant differences between the mean values of Fmin, Fmax, Imin and number of semitones (st) of the VRP and those of the SRP (p > 0.05). In the dysphonic group, the mean values of Fmin, Fmax and st SV+ShV for SRP were significantly higher than those of VRP. Our preliminary results suggest that the SRP may be a useful, alternative tool to assess vocal limits in both euphonic and dysphonic females.

Antitussive effect of carcainium chloride in patients with chronic cough and idiopathic interstitial pneumonias: A pilot study.

PubMed

Lavorini, Federico; Spina, Domenico; Walker, Michael J; Franciosi, Lui; Page, Clive P; Fontana, Giovanni A

2016-10-01

Cough is a common presenting symptom in patients with idiopathic interstitial pneumonia (IIP); it is often disabling, and lacks effective treatment. Studies in animals suggest that carcainium chloride, a quaternary derivative of the local anesthetic lidocaine, is able to inhibit experimentally induced cough by a mechanism of action distinct from that of lidocaine. To determine the effectiveness of aerosolised carcainium chloride (VRP700) in controlling cough in patients with IIP. Eight female patients (mean age 71 years) with IIP were investigated in a double blind, randomised, placebo controlled crossover, adaptive contingency study design (EudraCT Number 2010-021350-19). The study consisted of a screening visit to assess the eligibility of patients, and two separated (48-72 h) study days. On the two study days, patients were randomised to receive either nebulized VRP700 (1.0 mg/kg) on the first study visit followed by nebulised placebo (sodium chloride 0.9%) on the second visit, or placebo on the first visit followed by VRP700 on the second visit. The primary endpoint was cough frequency over a 4-h assessment period; secondary endpoints were subjective cough-related level of discomfort as assessed by a visual analogue scale (VAS) and the subjective response to treatment as assessed by a quality of life question. Safety (ECG, spirometry, urine and blood tests) and adverse events occurring during the trial were also investigated. In all patients both VRP700 and placebo decreased cough frequency; however, mean decreases in cough frequency after treatment with VRP700 were significantly (P < 0.001) higher than with placebo. Similarly, mean reductions in VAS score were significantly (P < 0.001) higher after treatment with VRP 700 compared with placebo. All but one patient indicated that they felt better after receiving VRP700. No adverse events were reported during the study, nor were any changes in ECG variables, spirometry, urine and blood tests noted. The results of this exploratory study indicate that nebulised VRP700 improved cough and quality of life in hospitalised IIP patients with no significant side effects. A larger trial is warranted to assess these promising results. Copyright © 2016 Elsevier Ltd. All rights reserved.

Voice Range Profiles of Singing Students: The Effects of Training Duration and Institution.

PubMed

Lycke, Hugo; Siupsinskiene, Nora

2016-01-01

The aim of the study was to assess differences in voice parameters measured by the physiological voice range profile (VRP) in groups of vocally healthy subjects differentiated by the duration of vocal training and the training institution. Six basic frequency- and intensity-related VRP parameters and the frequency dip of the register transition zone were determined from VRP recordings of 162 females studying in individual singing lessons (1st-5th level) in Dutch, Belgian, English, and French public or private training facilities. Sixty-seven nonsinging female students served as controls. Singing students in more advanced singing classes demonstrated a significantly greater frequency range, particularly at high frequencies, than did first-year students. Students with private training showed a significantly increased mean intensity range in comparison to those in group classes, while students with musical theater training exhibited significantly increased frequency- and intensity-related VRP parameters in comparison to the students with classical training. When compared to nonsingers, all singing student subgroups showed significant increases in all basic VRP parameters. However, the register transition parameter was not influenced by training duration or institution. Our study suggests that the extension of physiological vocal limits might depend on training duration and institution. © 2016 S. Karger AG, Basel.

Comparative speaking, shouting and singing voice range profile measurement: physiological and pathological aspects.

PubMed

Hacki, T

1996-01-01

The Voice Range Profile (VRP) measurement offers a method for the investigation of voice modalities i.e. speaking voice, shouting voice and singing voice in their mutual pitch and intensity relations. The parameters FO and SPL are evaluated by means of automatic pitch and SPL measurements from (1) sustained phonation /a:/ in the speaker's natural pitch and intensity range, (2) the continuous speaking voice beginning with Pianissimo up to Fortissimo, (3) the shouting voice. Vocal intensity is plotted vertically, vocal pitch horizontally. The displays of the vocal intensity versus fundamental frequency are defined as singing voice range profile (VRP), speaking VRP and shouting VRP. The VRPs are superimposed on the same plot. Their form, their shape and their position to each other are analysed. The physiological relationships between the VRPs of the different voice modalities to each other are defined. The pathological relationships between the VRPs (i.e. reduction, shifting) give information about etiology and pathomechanism of voice disorders.

Pelvic floor function following ventral rectopexy versus STARR in the treatment of obstructed defecation.

PubMed

Altomare, D F; Picciariello, A; Memeo, R; Fanelli, M; Digennaro, R; Chetta, N; De Fazio, M

2018-04-01

Obstructed defecation syndrome (ODS), most commonly found in females, can be treated by a transanal or abdominal approach with good success rate. Nevertheless, patients may experience de novo or persisting pelvic floor dysfunctions after surgery. The aim of this study was to compare the functional outcome of stapled transanal rectal resection (STARR) and ventral rectopexy (VRP) in a series of ODS patients. Forty-nine female patients who had surgery for ODS between 2006 and 2016 were retrospectively evaluated: 28 (median age 60 years, IQR 54-69 years) had VRP and 21 (median age 58 years, IQR 51-66 years) had STARR. ODS was scored with the ODS score while the overall pelvic floor function was assessed with the three axial perineal evaluation (TAPE) score. Quality-of-life was evaluated by the patient assessment of constipation quality-of-life (PAC-Qol) questionnaire administered preoperatively and after 1 year of follow-up. The preoperative median ODS score and TAPE score were comparable in both groups. After a median follow-up of 12 months (range 12-18 months), the median ODS score was 12 (range 10-20) in the STARR group and 9 (range 3-15) in the VRP one (p = 0.02), while the median TAPE score was 70.5 (IQR 60.6-77.3) in the former and 76.8 (IQR 70.2-89.7) in the latter (p = 0.01). Postoperatively the physical domain of the PAC-QoL score had a median value of 2.74 (IQR 1.7-3.75) in the STARR group compared to 1.5 (IQR 1-2.5) in the VRP group (p = 0.03). No major complications were recorded in either group. VRP and STARR can improve defecation in patients with ODS with minimal complications, but the overall pelvic wellness evaluated by the TAPE score improves significantly only after VRP, suggesting a better performance of VRP than STARR when overall pelvic floor function is concerned.

Importance of pressure reducing valves (PRVs) in water supply networks.

NASA Astrophysics Data System (ADS)

Signoreti, R. O. S.; Camargo, R. Z.; Canno, L. M.; Pires, M. S. G.; Ribeiro, L. C. L. J.

2016-08-01

Challenged with the high rate of leakage from water supply systems, these managers are committed to identify control mechanisms. In order to standardize and control the pressure Pressure Reducing Valves (VRP) are installed in the supply network, shown to be more effective and provide a faster return for the actual loss control measures. It is known that the control pressure is while controlling the occurrence of leakage. Usually the network is sectored in areas defined by pressure levels according to its topography, once inserted the VRP in the same system will limit the downstream pressure. This work aims to show the importance of VRP as loss reduction for tool.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mendell, Mark J.; Apte, Mike G.

This report considers the question of whether the California Energy Commission should incorporate the ASHRAE 62.1 ventilation standard into the Title 24 ventilation rate (VR) standards, thus allowing buildings to follow the Indoor Air Quality Procedure. This, in contrast to the current prescriptive standard, allows the option of using ventilation rate as one of several strategies, which might include source reduction and air cleaning, to meet specified targets of indoor air concentrations and occupant acceptability. The research findings reviewed in this report suggest that a revised approach to a ventilation standard for commercial buildings is necessary, because the current prescriptivemore » ASHRAE 62.1 Ventilation Rate Procedure (VRP) apparently does not provide occupants with either sufficiently acceptable or sufficiently healthprotective air quality. One possible solution would be a dramatic increase in the minimum ventilation rates (VRs) prescribed by a VRP. This solution, however, is not feasible for at least three reasons: the current need to reduce energy use rather than increase it further, the problem of polluted outdoor air in many cities, and the apparent limited ability of increasing VRs to reduce all indoor airborne contaminants of concern (per Hodgson (2003)). Any feasible solution is thus likely to include methods of pollutant reduction other than increased outdoor air ventilation; e.g., source reduction or air cleaning. The alternative 62.1 Indoor Air Quality Procedure (IAQP) offers multiple possible benefits in this direction over the VRP, but seems too limited by insufficient specifications and inadequate available data to provide adequate protection for occupants. Ventilation system designers rarely choose to use it, finding it too arbitrary and requiring use of much non-engineering judgment and information that is not readily available. This report suggests strategies to revise the current ASHRAE IAQP to reduce its current limitations. These strategies, however, would make it more complex and more prescriptive, and would require substantial research. One practical intermediate strategy to save energy would be an alternate VRP, allowing VRs lower than currently prescribed, as long as indoor VOC concentrations were no higher than with VRs prescribed under the current VRP. This kind of hybrid, with source reduction and use of air cleaning optional but permitted, could eventually evolve, as data, materials, and air-cleaning technology allowed gradual lowering of allowable concentrations, into a fully developed IAQP. Ultimately, it seems that VR standards must evolve to resemble the IAQP, especially in California, where buildings must achieve zero net energy use within 20 years.« less

Reproducibility of Dual-Microphone Voice Range Profile Equipment

ERIC Educational Resources Information Center

Printz, Trine; Pedersen, Ellen Raben; Juhl, Peter; Nielsen, Troels; Grøntved, Ågot Møller; Godballe, Christian

2017-01-01

Purpose: The aim of this study was to add further knowledge about the usefulness of the Voice Range Profile (VRP) assessment in clinical settings and research by analyzing VRP dual-microphone equipment precision, reliability, and room effect. Method: Test-retest studies were conducted in an anechoic chamber and an office: (a) comparing sound…

Outcomes from Job-Recruiting Efforts to Assist Black Veterans.

ERIC Educational Resources Information Center

Bradley, Loretta J.; Kennedy, R. Bryan

1987-01-01

Examined recruitment data from 3,112 participants to ascertain whether the Veteran's Readjustment Program (VRP) brought a significantly larger percentage of black Vietnam War veterans into the work force at the U.S. Army Missile Command Center than did traditional Office of Personnel Management recruitment procedures. Results indicated the VRP was…

33 CFR 155.5012 - Deviation from response plan.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 33 Navigation and Navigable Waters 2 2014-07-01 2014-07-01 false Deviation from response plan. 155... Response Plans § 155.5012 Deviation from response plan. The owner or operator of a nontank vessel required to have a vessel response plan (VRP) under this subpart may not deviate from the approved VRP unless...

Fourier Descriptor Analysis and Unification of Voice Range Profile Contours: Method and Applications

ERIC Educational Resources Information Center

Pabon, Peter; Ternstrom, Sten; Lamarche, Anick

2011-01-01

Purpose: To describe a method for unified description, statistical modeling, and comparison of voice range profile (VRP) contours, even from diverse sources. Method: A morphologic modeling technique, which is based on Fourier descriptors (FDs), is applied to the VRP contour. The technique, which essentially involves resampling of the curve of the…

[Vocal capabilities of nonprofessional singers evaluated by measurement and superimposition of their speaking, shouting and singing voice range profiles].

PubMed

Hacki, T

1999-09-01

Voice range profile(VRP) measurement (Phonetography) was used for the evaluation of the vocal capabilities of 41 female (F) and 50 male (M) members of a nonprofessional choir. By means of an automatic VPR measurement system F0 and SPL dB(A) were determined and displayed real time, two-dimensionally. The speaking voice (reading a standard passage as well as counting from the softest to the loudest intensity), the shouting voice (3-4 times shouting a standard sentence) and the singing voice (sustained phonation / la:/ at minimum and maximum intensity level) were measured. The VRPs of these voice modalities were superimposed on the screen and the plot. The averaged values for the speaking VRP: intensity range (F): 48 dB (range 46 soft to 94 dB loud phonation), (M): 52 dB (range 46-98). Pitch range (F): 15 semitones (ST) (Cis3, 138-E4, 329 Hz), (M): 19 ST (E2, 82 Hz-H3, 246 Hz). The average slope for the speaking voice (F): 0,31 ST/dB, (M): 0,36 ST/dB. Shouting VRP highest intensity (F): 106,5 dB, (M): 108,5 dB, highest pitch (F): between Ais4, 466 and H4, 493 Hz. (M): E4, 329 Hz. Average slope for speaking and shouting voice (F): 0,36 ST/dB, (M): 0,39 ST/dB. Singing VRP pitch range (F): 34,6 ST, (M): 37 ST, intensity range (F): 60 dB, (M): 58 dB. The pitch extension of the speaking VRP ranges from 2,9 to 46,2%, speaking and shouting VRPs together with 2,9 to 65% of the pitch range of the singing VRP (F), (M) 2,7-54% and 2,7-67,5% accordingly. The average values for nonprofessional singers reflect an effective but not special use of the phonatory system for the speaking, shouting and singing voice functions with respect to pitch and intensity.

Chimeric classical swine fever (CSF)-Japanese encephalitis (JE) viral replicon as a non-transmissible vaccine candidate against CSF and JE infections.

PubMed

Yang, Zhenhua; Wu, Rui; Li, Robert W; Li, Ling; Xiong, Zhongliang; Zhao, Haizhong; Guo, Deyin; Pan, Zishu

2012-04-01

A trans-complemented chimeric CSF-JE virus replicon was constructed using an infectious cDNA clone of the CSF virus (CSFV) Alfort/187 strain. The CSFV E2 gene was deleted, and a fragment containing the region encoding a truncated envelope protein (tE, amino acid 292-402, domain III) of JE virus (JEV) was inserted into the resultant plasmid, pA187delE2, to generate the recombinant cDNA clone pA187delE2/JEV-tE. Porcine kidney 15 (PK15) cells that constitutively express the CSFV E2p7 proteins were then transfected with in vitro-transcribed RNA from pA187delE2/JEV-tE. As a result, the chimeric CSF-JE virus replicon particle (VRP), rv187delE2/JEV-tE, was rescued. In a mouse model, immunization with the chimeric CSF-JE VRP induced strong production of JEV-specific antibody and conferred protection against a lethal JEV challenge. Pigs immunized with CSF-JE VRP displayed strong anti-CSFV and anti-JEV antibody responses and protection against CSFV and JEV challenge infections. Our evidence suggests that E2-complemented CSF-JE VRP not only has potential as a live-attenuated non-transmissible vaccine candidate against CSF and JE but also serves as a potential DIVA (Differentiating Infected from Vaccinated Animals) vaccine for CSF in pigs. Together, our data suggest that the non-transmissible chimeric VRP expressing foreign antigenic proteins may represent a promising strategy for bivalent DIVA vaccine design. Copyright © 2012 Elsevier B.V. All rights reserved.

Household food waste collection: Building service networks through neighborhood expansion.

PubMed

Armington, William R; Chen, Roger B

2018-04-17

In this paper we develop a residential food waste collection analysis and modeling framework that captures transportation costs faced by service providers in their initial stages of service provision. With this framework and model, we gain insights into network transportation costs and investigate possible service expansion scenarios faced by these organizations. We solve a vehicle routing problem (VRP) formulated for the residential neighborhood context using a heuristic approach developed. The scenarios considered follow a narrative where service providers start with an initial neighborhood or community and expands to incorporate other communities and their households. The results indicate that increasing household participation, decreases the travel time and cost per household, up to a critical threshold, beyond which we see marginal time and cost improvements. Additionally, the results indicate different outcomes in expansion scenarios depending on the household density of incorporated neighborhoods. As household participation and density increases, the travel time per household in the network decreases. However, at approximately 10-20 households per km 2 , the decrease in travel time per household is marginal, suggesting a lowerbound household density threshold. Finally, we show in food waste collection, networks share common scaling effects with respect to travel time and costs, regardless of the number of nodes and links. Copyright © 2018 Elsevier Ltd. All rights reserved.

Optimizing variable radius plot size and LiDAR resolution to model standing volume in conifer forests

Treesearch

Ram Kumar Deo; Robert E. Froese; Michael J. Falkowski; Andrew T. Hudak

2016-01-01

The conventional approach to LiDAR-based forest inventory modeling depends on field sample data from fixed-radius plots (FRP). Because FRP sampling is cost intensive, combining variable-radius plot (VRP) sampling and LiDAR data has the potential to improve inventory efficiency. The overarching goal of this study was to evaluate the integration of LiDAR and VRP data....

Potentiation of anthrax vaccines using protective antigen-expressing viral replicon vectors.

PubMed

Wang, Hai-Chao; An, Huai-Jie; Yu, Yun-Zhou; Xu, Qing

2015-02-01

DNA vaccines require improvement for human use because they are generally weak stimulators of the immune system in humans. The efficacy of DNA vaccines can be improved using a viral replicon as vector to administer antigen of pathogen. In this study, we comprehensively evaluated the conventional non-viral DNA, viral replicon DNA or viral replicon particles (VRP) vaccines encoding different forms of anthrax protective antigen (PA) for specific immunity and protective potency against anthrax. Our current results clearly suggested that these viral replicon DNA or VRP vaccines derived from Semliki Forest virus (SFV) induced stronger PA-specific immune responses than the conventional non-viral DNA vaccines when encoding the same antigen forms, which resulted in potent protection against challenge with the Bacillus anthracis strain A16R. Additionally, the naked PA-expressing SFV replicon DNA or VRP vaccines without the need for high doses or demanding particular delivery regimens elicited robust immune responses and afforded completely protective potencies, which indicated the potential of the SFV replicon as vector of anthrax vaccines for use in clinical application. Therefore, our results suggest that these PA-expressing SFV replicon DNA or VRP vaccines may be suitable as candidate vaccines against anthrax. Copyright © 2015 Elsevier B.V. All rights reserved.

The singer's voice range profile: female professional opera soloists.

PubMed

Lamarche, Anick; Ternström, Sten; Pabon, Peter

2010-07-01

This work concerns the collection of 30 voice range profiles (VRPs) of female operatic voice. We address the questions: Is there a need for a singer's protocol in VRP acquisition? Are physiological measurements sufficient or should the measurement of performance capabilities also be included? Can we address the female singing voice in general or is there a case for categorizing voices when studying phonetographic data? Subjects performed a series of structured tasks involving both standard speech voice protocols and additional singing tasks. Singers also completed an extensive questionnaire. Physiological VRPs differ from performance VRPs. Two new VRP metrics, the voice area above a defined level threshold and the dynamic range independent from the fundamental frequency (F(0)), were found to be useful in the analysis of singer VRPs. Task design had no effect on performance VRP outcomes. Voice category differences were mainly attributable to phonation frequency-based information. Results support the clinical importance of addressing the vocal instrument as it is used in performance. Equally important is the elaboration of a protocol suitable for the singing voice. The given context and instructions can be more important than task design for performance VRPs. Yet, for physiological VRP recordings, task design remains critical. Both types of VRPs are suggested for a singer's voice evaluation. Copyright (c) 2010 The Voice Foundation. Published by Mosby, Inc. All rights reserved.

Toxic effects of Pb2+ entering sperm through Ca2+ channels in the freshwater crab Sinopotamon henanense.

PubMed

Li, Na; Xu, Peng; Jing, Wei-Xin; Hwang, Jiang-Shiou; Wang, Lan

2017-11-01

Lead (Pb) is a heavy metal that can damage animal sperm. To study the effects of Pb on calcium homeostasis and calcium channel in the sperm of freshwater crab Sinopotamon henanense, the induction of acrosome reaction (AR) and acrosin activity were investigated when crabs were exposed to different Pb concentrations (0, 3.675, 7.35, 14.7, 29.4 and 58.8mg/L) for 3, 5 and 7 d separately. Fluorescent probe Fluo-3/AM was loaded into the sperm, and [Ca 2+ ] in the sperm was measured by fluorescence microscopy and using microplate reader. The calmodulin (CaM) concentration was measured by ELISA method. Verapamil (VRP), a calcium channel blocker, was used to evaluate whether Pb can enter the sperm through calcium channels leading to sperm damage. After sperm were exposed at 50μg/L VRP, 100μg/L Pb, 50μg/L VRP+100μg/L Pb, 1000μg/L Pb and 50μg/L VRP+1000μg/L Pb for 1h in vitro，sperm quality parameters (sperm survival and sperm DNA integrity) and levels of parameters indicating oxidative stress (protein carbonylation [PCO] and malondialdehyde [MDA]) were measured. Our data showed that Pb reduced the induction of acrosome reaction (AR), down-regulated the acrosin activity, decreased the intracellular concentration of Ca 2+ and elevated CaM concentration. Compared to controls, Pb alone induced significant stress, as reflected by decreasing sperm survival and sperm DNA integrity, and increasing PCO and MDA contents. In the presence of VRP, 100μg/L Pb-induced stresses were reduced, all the measured parameters in the sperm exposed at 100μg/L Pb returned to control levels. Our results indicate that Pb enters the sperm of the crab S. henanense through calcium channels, the inhibition of which blocks Pb-induced stresses such as sperm quality decline and oxidative damage. Copyright © 2017 Elsevier B.V. All rights reserved.

Effects on vocal range and voice quality of singing voice training: the classically trained female voice.

PubMed

Pabon, Peter; Stallinga, Rob; Södersten, Maria; Ternström, Sten

2014-01-01

A longitudinal study was performed on the acoustical effects of singing voice training under a given study program, using the voice range profile (VRP). Pretraining and posttraining recordings were made of students who participated in a 3-year bachelor singing study program. A questionnaire that included questions on optimal range, register use, classification, vocal health and hygiene, mixing technique, and training goals was used to rate and categorize self-assessed voice changes. Based on the responses, a subgroup of 10 classically trained female voices was selected, which was homogeneous enough for effects of training to be identified. The VRP perimeter contour was analyzed for effects of voice training. Also, a mapping within the VRP of voice quality, as expressed by the crest factor, was used to indicate the register boundaries and to monitor the acoustical consequences of the newly learned vocal technique of "mixed voice." VRPs were averaged across subjects. Findings were compared with the self-assessed vocal changes. Pre/post comparison of the average VRPs showed, in the midrange, (1) a decrease in the VRP area that was associated with the loud chest voice, (2) a reduction of the crest factor values, and (3) a reduction of maximum sound pressure level values. The students' self-evaluations of the voice changes appeared in some cases to contradict the VRP findings. VRPs of individual voices were seen to change over the course of a singing education. These changes were manifest also in the average group. High-resolution computerized recording, complemented with an acoustic register marker, allows a meaningful assessment of some effects of training, on an individual basis and for groups that comprise singers of a specific genre. It is argued that this kind of investigation is possible only within a focused training program, given by a faculty who has agreed on the goals. Copyright © 2014 The Voice Foundation. Published by Mosby, Inc. All rights reserved.

Sterile Protection against Plasmodium knowlesi in Rhesus Monkeys from a Malaria Vaccine: Comparison of Heterologous Prime Boost Strategies

PubMed Central

Jiang, George; Shi, Meng; Conteh, Solomon; Richie, Nancy; Banania, Glenna; Geneshan, Harini; Valencia, Anais; Singh, Priti; Aguiar, Joao; Limbach, Keith; Kamrud, Kurt I.; Rayner, Jonathan; Smith, Jonathan; Bruder, Joseph T.; King, C. Richter; Tsuboi, Takafumi; Takeo, Satoru; Endo, Yaeta; Doolan, Denise L.; Richie, Thomas L.; Weiss, Walter R.

2009-01-01

Using newer vaccine platforms which have been effective against malaria in rodent models, we tested five immunization regimens against Plasmodium knowlesi in rhesus monkeys. All vaccines included the same four P. knowlesi antigens: the pre-erythrocytic antigens CSP, SSP2, and erythrocytic antigens AMA1, MSP1. We used four vaccine platforms for prime or boost vaccinations: plasmids (DNA), alphavirus replicons (VRP), attenuated adenovirus serotype 5 (Ad), or attenuated poxvirus (Pox). These four platforms combined to produce five different prime/boost vaccine regimens: Pox alone, VRP/Pox, VRP/Ad, Ad/Pox, and DNA/Pox. Five rhesus monkeys were immunized with each regimen, and five Control monkeys received a mock vaccination. The time to complete vaccinations was 420 days. All monkeys were challenged twice with 100 P. knowlesi sporozoites given IV. The first challenge was given 12 days after the last vaccination, and the monkeys receiving the DNA/Pox vaccine were the best protected, with 3/5 monkeys sterilely protected and 1/5 monkeys that self-cured its parasitemia. There was no protection in monkeys that received Pox malaria vaccine alone without previous priming. The second sporozoite challenge was given 4 months after the first. All 4 monkeys that were protected in the first challenge developed malaria in the second challenge. DNA, VRP and Ad5 vaccines all primed monkeys for strong immune responses after the Pox boost. We discuss the high level but short duration of protection in this experiment and the possible benefits of the long interval between prime and boost. PMID:19668343

Design, synthesis and biological evaluation of LBM-A5 derivatives as potent P-glycoprotein-mediated multidrug resistance inhibitors.

PubMed

Wu, Yuxiang; Pan, Miaobo; Dai, Yuxuan; Liu, Baomin; Cui, Jian; Shi, Wei; Qiu, Qianqian; Huang, Wenlong; Qian, Hai

2016-05-15

A novel series of P-glycoprotein (P-gp)-mediated multidrug resistance (MDR) inhibitors with triazol-N-phenethyl-tetrahydroisoquinoline or triazol-N-ethyl-tetrahydroisoquinoline scaffold were designed and synthesized via click chemistry. Most of the synthesized compounds showed higher reversal activity than verapamil (VRP). Among them, the most potent compound 4 showed a comparable activity with the known potent P-gp inhibitor WK-X-34 with lower cytotoxicity toward K562 cells (IC50>100μM). Compared with VRP, compound 4 exhibited more potency in increasing drug accumulation in K562/A02 MDR cells. Moreover, compound 4 could significantly reverse MDR in a dose-dependent manner and also persist longer chemo-sensitizing effect than VRP with reversibility. Further mechanism studies revealed that compound 4 could remarkably increase the intracellular accumulation of Adriamycin (ADM) in K562/A02 cells as well as inhibit rhodamine-123 (Rh123) efflux from the cells. These results suggested that compound 4 may represent a promising candidate for developing P-gp-mediated MDR inhibitors. Copyright © 2016 Elsevier Ltd. All rights reserved.

A tetravalent alphavirus-vector based Dengue vaccine provides effective immunity in an early life mouse model

PubMed Central

Khalil, Syed Muaz; Tonkin, Daniel R.; Mattocks, Melissa D.; Snead, Andrew T.; Johnston, Robert E.; White, Laura J.

2014-01-01

Dengue viruses (DENV1-4) cause 390 million clinical infections every year, several hundred thousand of which progress to severe hemorrhagic and shock syndromes. Preexisting immunity resulting from a previous DENV infection is the major risk factor for severe dengue during secondary heterologous infections. During primary infections in infants, maternal antibodies pose an analogous risk. At the same time, maternal antibodies are likely to prevent induction of endogenous anti-DENV antibodies in response to current live, attenuated virus (LAV) vaccine candidates. Any effective early life dengue vaccine has to overcome maternal antibody interference (leading to ineffective vaccination) and poor induction of antibody responses (increasing the risk of severe dengue disease upon primary infection). In a previous study, we demonstrated that a non-propagating Venezuelan equine encephalitis virus replicon expression vector (VRP), expressing the ectodomain of DENV E protein (E85), overcomes maternal interference in a BALB/c mouse model. We report here that a single immunization with a tetravalent VRP vaccine induced NAb and T-cell responses to each serotype at a level equivalent to the monovalent vaccine components, suggesting that this vaccine modality can overcome serotype interference. Furthermore, neonatal immunization was durable and could be boosted later in life to further increase NAb and T-cell responses. Although the neonatal immune response was lower in magnitude than responses in adult BALB/c mice, we demonstrate that VRP vaccines generated protective immunity from a lethal challenge after a single neonatal immunization. In summary, VRP vaccines expressing DENV antigens were immunogenic and protective in neonates, and hence are promising candidates for safe and effective vaccination in early life. PMID:24882043

Normative voice range profiles in vocally trained and untrained children aged between 7 and 10 years.

PubMed

Schneider, Berit; Zumtobel, Michaela; Prettenhofer, Walter; Aichstill, Birgitta; Jocher, Werner

2010-03-01

Only limited data on normal vocal constitution and vocal capabilities in school-aged children are available. To take better care of children's voices, it might be helpful to know voice ranges and limits of not only vocally trained but also vocally untrained children. Goal of this study was the evaluation of singing voice capabilities of vocally healthy children with different social and vocal/musical backgrounds using voice range profile measurements (VRP). VRP percentiles that reflect constitutional aspects were suggested. In this cross-sectional study, 186 children (aged between seven and 10 years), attending five schools, were included. VRP measurements were performed under field conditions. Interviews and questionnaires regarding vocal strain and vocal training were applied; the answers were used for classification of singing activity and vocal training (KLASAK). All children reached a mean singing voice range of at least two octaves. By using the answers of interviews and questionnaires, the children could be classified according to vocal strain and vocal training. The groups showed no significant differences regarding VRP measurements. In the following step, percentiles were calculated. Twenty-five percent of all children (P25) reached a minimum voice range of almost two octaves, namely, 22 semitones (ST) from 220 to 784 Hz with soft and loud singing. Half of the children (P50) had a voice range of 24 ST (2 octaves), while soft singing and a larger voice range of 26 ST while loud singing. The measurements of third quartile (P75) revealed that 25% of children have even a larger voice range than 29 dB (from 196 Hz/g to 1047 Hz/c3) and can sing at most frequencies louder than 90 dB. P90 demonstrated that 10% of the children can sing even lower or higher than the frequency range between 196 Hz/g and 1319 Hz/e3 analyzed. The voice range seems not to be constrained by social but by voice/musical background: children of vocally/musically encouraged schools had wider voice ranges. This underlines the necessity of regular singing lessons already in primary schools. The percentile VRP introduced might help to evaluate the vocal constitution and vocal capabilities of a child. Copyright (c) 2010 The Voice Foundation. Published by Mosby, Inc. All rights reserved.

Rational design on controlled release ion-exchange polymeric microspheres and polymer-lipid hybrid nanoparticles for the delivery of water-soluble drugs through a multidisciplinary approach

NASA Astrophysics Data System (ADS)

Li, Yongqiang

Sulfopropyl dextran sulfate (SP-DS) microspheres and polymer-lipid hybrid nanoparticles (PLN) for the delivery of water-soluble anticancer drugs and P-glycoprotein inhibitors were developed by our group recently and demonstrated effectiveness in local chemotherapy. To optimize the delivery performance of these particulate systems, particularly PLN, an integrated multidisciplinary approach was developed, based on an in-depth understanding of drug-excipient interactions, internal structure, drug loading and release mechanisms, and application of advanced modeling/optimization techniques. An artificial neural networks (ANN) simulator capable of formulation optimization and drug release prediction was developed. In vitro drug release kinetics of SP-DS microspheres, with various drug loading and in different release media, were predicted by ANN. The effects of independent variables on drug release were evaluated. Good modeling performance suggested that ANN is a useful tool to predict drug release from ion-exchange microspheres. To further improve the performance of PLN, drug-polymer-lipid interactions were characterized theoretically and experimentally using verapamil hydrochloride (VRP) as a model drug and dextran sulfate sodium (DS) as a counter-ion polymer. VRP-DS complexation followed a stoichiometric rule and solid-state transformation of VRP were observed. Dodecanoic acid (DA) was identified as the lead lipid carrier material. Based upon the optimized drug-polymer-lipid interactions, PLN with high drug loading capacity (36%, w/w) and sustained release without initial burst release were achieved. VRP remained amorphous and was molecularly dispersed within PLN. H-bonding contributed to the miscibility between the VRP-DS complex and DA. Drug release from PLN was mainly controlled by diffusion and ion-exchange processes. Drug loading capacity and particle size of PLN depend on the formulation factors of the weight ratio of drug to lipid and concentrations of surfactants applied. A three-factor spherical composite experimental design was used to map the cause-and-effect relationship. PLN with high drug loading efficiency (92%) and small particle size (100 nm) were predicted by ANN and confirmed by experiment. The roles of various factors on the properties of PLN were also investigated. In summary, this thesis demonstrates that an integrated multidisciplinary strategy ranging from preformulation to formulation to optimization is suitable for the rational design of SP-DS microspheres and PLN with desired properties.

The impact of acute and chronic strenuous exercise on pelvic floor muscle strength and support in nulliparous healthy women.

PubMed

Middlekauff, Monique L; Egger, Marlene J; Nygaard, Ingrid E; Shaw, Janet M

2016-09-01

Strenuous physical activity, which is known to increase intraabdominal pressure and theoretically places stress on the pelvic floor, may affect pelvic support in nulliparous women. The aims of this study were to: (1) examine the differences in maximal vaginal descent (MVD), vaginal resting pressure (VRP), and pelvic floor muscle strength (PFMS) between women who habitually perform strenuous exercise vs women who refrain from performing strenuous exercise; and (2) compare MVD, VRP, and PFMS before and immediately following physical activity in the strenuous and nonstrenuous groups separately. Participants were healthy nulliparous women ages 18-35 years who were habitual strenuous or nonstrenuous exercisers. Women in the strenuous group participated in CrossFit (CrossFit, Inc., Washington, DC) at least 3 days per week for at least 6 months. We assessed anthropometric and body composition values using standardized procedures. Participants completed the Pelvic Organ Prolapse Quantification examination and pelvic muscle strength assessment before and again within 15 minutes of completing exercise (CrossFit for the strenuous group and self-paced walking for the nonstrenuous). A research nurse masked to study group assignment recorded MVD, defined as the greatest value of anterior, posterior, or apical support, and VRP and PFMS using a perineometer. Maximal PFMS was recorded as the highest pressure measured in 3 vaginal contraction trials. Data were analyzed using parametric and nonparametric tests as appropriate. P < .05 was considered significant. Seventy nulliparous women participated in the study, 35 in each group. The mean age was 24.77 ± 4.3 years. Compared to the nonstrenuous group, strenuous participants were heavier (64.70 ± 7.78 kg vs 60.6 ± 8.99 kg, P = .027), had lower percent body fat (23.36 ± 5.88% vs 27.55 ± 7.07%, P = .003), and had higher handgrip strength (20.78 ± 5.97 kg vs 16.04 ± 11.04 kg, P = .001). Before exercise, there were no significant differences in VRP (P = .167), MVD (P = .49), or maximal PFMS (P = .773) between the strenuous and nonstrenuous groups. Immediately following exercise, we observed significant increases in MVD in both the strenuous (P = .008) and nonstrenuous (P = .025) groups, indicating marginal decreases in support. VRP significantly decreased in both groups after exercise. Maximal PFMS did not change significantly in either group after exercise. After an exercise bout typical for each group, vaginal support and VRP decreased slightly in both groups. Based on preexercise measures, chronic strenuous exercise demonstrated neither beneficial nor deleterious effects on pelvic floor strength or support. While strenuous women had greater grip strength than nonstrenuous women, PFMS was not significantly greater, suggesting that targeted pelvic floor muscle strengthening, rather than general muscle fitness, is needed to maximize PFMS. Copyright © 2016 Elsevier Inc. All rights reserved.

Silver-halide sensitized gelatin (SHSG) processing method for pulse holograms recorded on VRP plates

NASA Astrophysics Data System (ADS)

Evstigneeva, Maria K.; Drozdova, Olga V.; Mikhailov, Viktor N.

2002-06-01

One of the most important area of holograph applications is display holography. In case of pulse recording the requirement for vibration stability is easier than compared to CW exposure. At the same time it is widely known that the behavior of sliver-halide holographic materials strongly depends on the exposure duration. In particular the exposure sensitivity drastically decreases under nanosecond pulse duration. One of the effective ways of the diffraction efficiency improvement is SHSG processing method. This processing scheme is based on high modulation of refractive index due to microvoids appearance inside emulsion layer. It should be mentioned that the SHSG method was used earlier only in the cases when the holograms were recorded by use of CW lasers. This work is devoted to the investigation of SHSG method for pulse hologram recording on VRP plates. We used a pulsed YLF:Nd laser with pulse duration of 25 nanoseconds and wavelength of 527 nm. Both transmission and reflection holograms were recorded. The different kinds of bleaching as well as developing solutions were investigated. Our final processing scheme includes the following stages: 1) development in non-tanning solution, 2) rehalogenating bleach, 3) intermediate alcohol drying, 4) uniform second exposure, 5) second development in diluted developer, 6) reverse bleaching, 7) fixing and 8) gradient drying in isopropyl alcohol. Diffraction efficiency of transmission holograms was of about 60 percent and reflection mirror holograms was of about 45 percent. Thus we have demonstrated the SHSG processing scheme for producing effective holograms on VRP plates under pulse exposure.

A hydrophobic residue in position 15 of the rP2X3 receptor slows desensitization and reveals properties beneficial for pharmacological analysis and high-throughput screening.

PubMed

Hausmann, Ralf; Bahrenberg, Gregor; Kuhlmann, Daniel; Schumacher, Michaela; Braam, Ursula; Bieler, Dagmar; Schlusche, Ilka; Schmalzing, Günther

2014-04-01

The homotrimeric P2X3 subtype, one of the seven members of the ATP-gated P2X receptor family, plays a role in sensory neurotransmission, including nociception. To overcome the bias resulting from fast desensitization of the P2X3 receptor in dose-response analyses, a non-desensitizing P2X2-X3 receptor chimera has been repeatedly used as a surrogate for the P2X3 receptor for functional analysis. Here, we show that only three of the P2X2-specific amino acid residues of the P2X2-X3 chimera, (19)P(21)V(22)I, are needed to confer a slowly desensitizing phenotype to the P2X3 receptor. The strongest delay in desensitization of the P2X3 receptor by a single residue was observed when (15)Ser was replaced by Val or another hydrophobic residue. Pharmacologically, the S(15)V-rP2X3 mutant behaved similarly to the wt-P2X3 receptor. Analysis of the S(15)V-rP2X3 receptor in 1321N1 astrocytoma cells by a common calcium-imaging-based assay showed 10-fold higher calcium transients relative to those of the wt-rP2X3 receptor. The S(15)V-rP2X3 cell line enabled reliable analysis of antagonistic potencies and correctly reported the mechanism of action of the P2X3 receptor antagonists A-317491 and TNP-ATP by a calcium-imaging assay. Together, these data suggest that the S(15)V-rP2X3 mutant may be suitable not only for automated fluorescence-based screening of molecule libraries for identification of lead compounds but also for facilitated pharmacological characterization of specific P2X3 receptor ligands. We suggest that the mechanism of desensitization of the P2X3 receptor may involve the movement of an N-terminal inactivation particle, in analogy to the "hinged-lid" or "ball and chain" mechanisms of voltage-gated NaV and Shaker KV channels, respectively. Copyright © 2014 Elsevier Ltd. All rights reserved.

Benchmark dataset for undirected and Mixed Capacitated Arc Routing Problems under Time restrictions with Intermediate Facilities.

PubMed

Willemse, Elias J; Joubert, Johan W

2016-09-01

In this article we present benchmark datasets for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities (MCARPTIF). The problem is a generalisation of the Capacitated Arc Routing Problem (CARP), and closely represents waste collection routing. Four different test sets are presented, each consisting of multiple instance files, and which can be used to benchmark different solution approaches for the MCARPTIF. An in-depth description of the datasets can be found in "Constructive heuristics for the Mixed Capacity Arc Routing Problem under Time Restrictions with Intermediate Facilities" (Willemseand Joubert, 2016) [2] and "Splitting procedures for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities" (Willemseand Joubert, in press) [4]. The datasets are publicly available from "Library of benchmark test sets for variants of the Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities" (Willemse and Joubert, 2016) [3].

Design, Synthesis and Evaluation of a Novel Series of Inhibitors Reversing P-Glycoprotein-Mediated Multidrug Resistance.

PubMed

Ghaleb, Hesham; Li, Huilan; Kairuki, Mutta; Qiu, Qianqian; Bi, Xinzhou; Liu, Chunxia; Liao, Chen; Li, Jieming; Hezam, Kamal; Huang, Wenlong; Qian, Hai

2018-05-22

Multidrug resistance (MDR) is still the main barrier to attaining effective results with chemotherapy. Discovery of new chemo-reversal agents is needed to overcome MDR. Our study focused on a better way to obtain novel drugs with triazole rings that have an MDR-reversal ability through click chemistry. Among 20 developed compounds, compound 19 had a minimal cytotoxic effect compared to tariquidar and verapamil (VRP) and showed a higher reversal activity than VRP through increased accumulation in K562/A02 cells. Compound 19 also played an important role in the P-gp efflux function of intracellular Rh123 and doxorubicin (DOX) accumulation in K562/A02 cells. Moreover, compound 19 exhibited a long lifetime of approximately 24 h. These results indicated that compound 19 is a potential lead compound for the design of new drugs to overcome cancer MDR. This article is protected by copyright. All rights reserved. This article is protected by copyright. All rights reserved.

Vehicle routing problem and capacitated vehicle routing problem frameworks in fund allocation problem

NASA Astrophysics Data System (ADS)

Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah@Rozita

2016-11-01

Two new methods adopted from methods commonly used in the field of transportation and logistics are proposed to solve a specific issue of investment allocation problem. Vehicle routing problem and capacitated vehicle routing methods are applied to optimize the fund allocation of a portfolio of investment assets. This is done by determining the sequence of the assets. As a result, total investment risk is minimized by this sequence.

Scheduling of an aircraft fleet

NASA Technical Reports Server (NTRS)

Paltrinieri, Massimo; Momigliano, Alberto; Torquati, Franco

1992-01-01

Scheduling is the task of assigning resources to operations. When the resources are mobile vehicles, they describe routes through the served stations. To emphasize such aspect, this problem is usually referred to as the routing problem. In particular, if vehicles are aircraft and stations are airports, the problem is known as aircraft routing. This paper describes the solution to such a problem developed in OMAR (Operative Management of Aircraft Routing), a system implemented by Bull HN for Alitalia. In our approach, aircraft routing is viewed as a Constraint Satisfaction Problem. The solving strategy combines network consistency and tree search techniques.

The thermal signature of Aso Volcano during unrest episodes detected from space and ground-based measurements

NASA Astrophysics Data System (ADS)

Cigolini, Corrado; Coppola, Diego; Yokoo, Akihiko; Laiolo, Marco

2018-04-01

The thermal signature of Aso Volcano (Nakadake) during unrest episodes has been analyzed by combining the MODIS-MIROVA data set (2000-2017) with high-resolution images (LANDSAT 8 OLI and Sentinel 2) and ground-based thermal observations (2013-2017). The site of major activity (crater 1) is located at the summit of the volcano and is composed by a fumarole field (located in the South Area) and an acidic lake (replaced by a Central Pit during Strombolian phases). The volcanic radiative power (VRP) obtained by nighttime satellite data during the reference period was mainly below 3 MW. This thermal threshold marks the transition from high fumarole activity (HFA) to Strombolian eruptions (SE). However, periods characterized by sporadic phreatic eruptions (PE, eventually bearing phreatomagmatic episodes), which is the prevalent phase during unrest episodes, exhibit very low VRP values, being around 0.5 MW, or below. The statistical analysis of satellite data shows that the transition from HFA to Strombolian activity (which started on August 2014 and ceased in May 2015) occurs when VRP values are above the cited 3 MW threshold. In particular during marked Strombolian phases (November-December 2014), the radiative power was higher than 4 MW, reaching peak values up to 15.6 MW (on December 7, 2014, i.e., 10 days after the major Strombolian explosion of November 27). Conversely, ground-based measurements show that heat fluxes recorded by FLIR T440 Thermo-camera on the fumarole field of the South Area has been relatively stable around 2 MW until February 2015. Their apparent temperatures were fluctuating around 490-575 °C before the major Strombolian explosive event, whereas those recorded at the active vent, named Central Pit, reached their maxima slightly above 600 °C; then both exhibited a decreasing trend in the following days. During the Strombolian activity, the crater lake dried out and was then replenished by early July, 2016. Then, volcanic activity shifted back to phreatic-phreatomagmatic and the eruptive cycle was completed. During this period, the MIROVA system detected very few thermal alerts and the ground-based measurements were fluctuating around 1 MW. The most violent explosion occurred on October 8, 2016, and within the following weeks measured VRP were moderately above 2 MW. This is coeval with a thermal increase at the fumarole field of the South Area, with temperatures well above 300 °C. Thermal monitoring at Aso Volcano is an additional tool in volcano surveillance that may contribute to near-real-time hazard assessment.[Figure not available: see fulltext.

Advances in optimal routing through computer networks

NASA Technical Reports Server (NTRS)

Paz, I. M.

1977-01-01

The optimal routing problem is defined. Progress in solving the problem during the previous decade is reviewed, with special emphasis on technical developments made during the last few years. The relationships between the routing, the throughput, and the switching technology used are discussed and their future trends are reviewed. Economic aspects are also briefly considered. Modern technical approaches for handling the routing problems and, more generally, the flow control problems are reviewed.

Visualizing Internet routing changes.

PubMed

Lad, Mohit; Massey, Dan; Zhang, Lixia

2006-01-01

Today's Internet provides a global data delivery service to millions of end users and routing protocols play a critical role in this service. It is important to be able to identify and diagnose any problems occurring in Internet routing. However, the Internet's sheer size makes this task difficult. One cannot easily extract out the most important or relevant routing information from the large amounts of data collected from multiple routers. To tackle this problem, we have developed Link-Rank, a tool to visualize Internet routing changes at the global scale. Link-Rank weighs links in a topological graph by the number of routes carried over each link and visually captures changes in link weights in the form of a topological graph with adjustable size. Using Link-Rank, network operators can easily observe important routing changes from massive amounts of routing data, discover otherwise unnoticed routing problems, understand the impact of topological events, and infer root causes of observed routing changes.

33 CFR 155.5060 - Exercises.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 33 Navigation and Navigable Waters 2 2014-07-01 2014-07-01 false Exercises. 155.5060 Section 155... § 155.5060 Exercises. (a) For nontank vessels with an oil capacity of 250 barrels or greater— (1) A... exercises as necessary to ensure that the VRP will function in an emergency. Vessel owners or operators must...

Observations of long delays to detonation in propellant for tests with marginal card gaps

NASA Technical Reports Server (NTRS)

Olinger, B.

1980-01-01

Using the large-scale card gap tests with pin and high-speed framing camera techniques, VRP propellant, and presumably others, were found to transit to detonation at marginal gaps after a long delay. In addition, manganin-constantan gauge measurements were made in the card gap stack.

On the impact of different volcanic hot spot detection methods on eruption energy quantification

NASA Astrophysics Data System (ADS)

Pergola, Nicola; Coviello, Irina; Falconieri, Alfredo; Lacava, Teodosio; Marchese, Francesco; Tramutoli, Valerio

2016-04-01

Several studies have shown that sensors like the Advanced Very High Resolution Radiometer (AVHRR) and the Moderate Resolution Imaging Spectroradiometer (MODIS) may be effectively used to identify volcanic hotspots. These sensors offer in fact some spectral channels in the Medium Infrared (MIR) and Thermal Infrared (TIR) bands together with a good compromise between spatial and temporal resolution suited to study and monitor thermal volcanic activity. Many algorithms were developed to identify volcanic thermal anomalies from space with some of them that were extensively tested in very different geographich areas. In this work, we analyze the volcanic radiative power (VRP) representing one of parameters of major interest for volcanologists that may be estimated by satellite. In particular, we compare the radiative power estimations driven by some well-established state of the art hotspot detection methods (e.g. RSTVOLC, MODVOLC, HOTSAT). Differences in terms of radiative power estimations achieved during recent Mt. Etna (Italy) eruptions will be evaluated, assessing how much the VRP retrieved during effusive eruptions is affected by the sensitivity of hotspot detection methods.

Quantitative analysis of professionally trained versus untrained voices.

PubMed

Siupsinskiene, Nora

2003-01-01

The aim of this study was to compare healthy trained and untrained voices as well as healthy and dysphonic trained voices in adults using combined voice range profile and aerodynamic tests, to define the normal range limiting values of quantitative voice parameters and to select the most informative quantitative voice parameters for separation between healthy and dysphonic trained voices. Three groups of persons were evaluated. One hundred eighty six healthy volunteers were divided into two groups according to voice training: non-professional speakers group consisted of 106 untrained voices persons (36 males and 70 females) and professional speakers group--of 80 trained voices persons (21 males and 59 females). Clinical group consisted of 103 dysphonic professional speakers (23 males and 80 females) with various voice disorders. Eighteen quantitative voice parameters from combined voice range profile (VRP) test were analyzed: 8 of voice range profile, 8 of speaking voice, overall vocal dysfunction degree and coefficient of sound, and aerodynamic maximum phonation time. Analysis showed that healthy professional speakers demonstrated expanded vocal abilities in comparison to healthy non-professional speakers. Quantitative voice range profile parameters- pitch range, high frequency limit, area of high frequencies and coefficient of sound differed significantly between healthy professional and non-professional voices, and were more informative than speaking voice or aerodynamic parameters in showing the voice training. Logistic stepwise regression revealed that VRP area in high frequencies was sufficient to discriminate between healthy and dysphonic professional speakers for male subjects (overall discrimination accuracy--81.8%) and combination of three quantitative parameters (VRP high frequency limit, maximum voice intensity and slope of speaking curve) for female subjects (overall model discrimination accuracy--75.4%). We concluded that quantitative voice assessment with selected parameters might be useful for evaluation of voice education for healthy professional speakers as well as for detection of vocal dysfunction and evaluation of rehabilitation effect in dysphonic professionals.

Coital incontinence and vaginal symptoms and the relationship to pelvic floor muscle function in primiparous women at 12 months postpartum: a cross-sectional study.

PubMed

Tennfjord, Merete Kolberg; Hilde, Gunvor; Stær-Jensen, Jette; Siafarikas, Franziska; Engh, Marie Ellström; Bø, Kari

2015-04-01

Symptoms related to sexual dysfunction postpartum are scarcely addressed in the literature, and the relationship to pelvic floor muscle (PFM) function is largely unknown. The aim of this study was to investigate primiparous women 12 months postpartum and study: (i) prevalence and bother of coital incontinence, vaginal symptoms, and sexual matters; and (ii) whether coital incontinence and vaginal symptoms were associated with vaginal resting pressure (VRP), PFM strength, and endurance. International Consultation on Incontinence Modular Questionnaire (ICIQ) sexual matters module and ICIQ-Vaginal Symptoms Questionnaire were used for questions on coital incontinence, vaginal symptoms, and sexual matters, respectively. PFM function was assessed by manometer (Camtech AS, Sandvika, Norway). Coital incontinence, vaginal symptoms, and PFM function were the main outcome measures. One hundred seventy-seven primiparous women, mean age 28.7 (standard deviation [SD] 4.3) participated. Of the 94% of women having sexual intercourse, coital incontinence was found for 1.2% whereas 34.5% reported at least one vaginal symptom interfering with the sexual life of primiparous women. Of the symptoms investigated, "vagina feels dry," "vagina feels sore," and "vagina feels loose or lax" were most prevalent, but the overall impact on the woman's sexual life was minimally bothersome, mean 1.4 out of 10 (SD 2.5). Women reporting "vagina feels loose or lax" had lower VRP, PFM strength, and endurance when compared with women without the symptom. Twelve-month postpartum coital incontinence was rare, whereas the prevalence of vaginal symptoms interfering with sexual life was more common. The large majority of primiparous women in our study had sexual intercourse at 12 months postpartum and the reported overall bother on sexual life was low. Women reporting "vagina feels loose or lax" had lower VRP, PFM strength, and endurance when compared with women without the symptom. © 2015 International Society for Sexual Medicine.

About some types of constraints in problems of routing

NASA Astrophysics Data System (ADS)

Petunin, A. A.; Polishuk, E. G.; Chentsov, A. G.; Chentsov, P. A.; Ukolov, S. S.

2016-12-01

Many routing problems arising in different applications can be interpreted as a discrete optimization problem with additional constraints. The latter include generalized travelling salesman problem (GTSP), to which task of tool routing for CNC thermal cutting machines is sometimes reduced. Technological requirements bound to thermal fields distribution during cutting process are of great importance when developing algorithms for this task solution. These requirements give rise to some specific constraints for GTSP. This paper provides a mathematical formulation for the problem of thermal fields calculating during metal sheet thermal cutting. Corresponding algorithm with its programmatic implementation is considered. The mathematical model allowing taking such constraints into account considering other routing problems is discussed either.

Assessing Women's Responses to Sexual Threat: Validity of a Virtual Role-Play Procedure

ERIC Educational Resources Information Center

Jouriles, Ernest N.; Rowe, Lorelei Simpson; McDonald, Renee; Platt, Cora G.; Gomez, Gabriella S.

2011-01-01

This study evaluated the validity of a role-play procedure that uses virtual reality technology to assess women's responses to sexual threat. Forty-eight female undergraduate students were randomly assigned to either a standard, face-to-face role-play (RP) or a virtual role-play (VRP) of a sexually coercive situation. A multimethod assessment…

The integrated model for solving the single-period deterministic inventory routing problem

NASA Astrophysics Data System (ADS)

Rahim, Mohd Kamarul Irwan Abdul; Abidin, Rahimi; Iteng, Rosman; Lamsali, Hendrik

2016-08-01

This paper discusses the problem of efficiently managing inventory and routing problems in a two-level supply chain system. Vendor Managed Inventory (VMI) policy is an integrating decisions between a supplier and his customers. We assumed that the demand at each customer is stationary and the warehouse is implementing a VMI. The objective of this paper is to minimize the inventory and the transportation costs of the customers for a two-level supply chain. The problem is to determine the delivery quantities, delivery times and routes to the customers for the single-period deterministic inventory routing problem (SP-DIRP) system. As a result, a linear mixed-integer program is developed for the solutions of the SP-DIRP problem.

On the multiple depots vehicle routing problem with heterogeneous fleet capacity and velocity

NASA Astrophysics Data System (ADS)

Hanum, F.; Hartono, A. P.; Bakhtiar, T.

2018-03-01

This current manuscript concerns with the optimization problem arising in a route determination of products distribution. The problem is formulated in the form of multiple depots and time windowed vehicle routing problem with heterogeneous capacity and velocity of fleet. Model includes a number of constraints such as route continuity, multiple depots availability and serving time in addition to generic constraints. In dealing with the unique feature of heterogeneous velocity, we generate a number of velocity profiles along the road segments, which then converted into traveling-time tables. An illustrative example of rice distribution among villages by bureau of logistics is provided. Exact approach is utilized to determine the optimal solution in term of vehicle routes and starting time of service.

Traffic routing for multicomputer networks with virtual cut-through capability

NASA Technical Reports Server (NTRS)

Kandlur, Dilip D.; Shin, Kang G.

1992-01-01

Consideration is given to the problem of selecting routes for interprocess communication in a network with virtual cut-through capability, while balancing the network load and minimizing the number of times that a message gets buffered. An approach is proposed that formulates the route selection problem as a minimization problem with a link cost function that depends upon the traffic through the link. The form of this cost function is derived using the probability of establishing a virtual cut-through route. The route selection problem is shown to be NP-hard, and an algorithm is developed to incrementally reduce the cost by rerouting the traffic. The performance of this algorithm is exemplified by two network topologies: the hypercube and the C-wrapped hexagonal mesh.

Research on the optimization of vehicle distribution routes in logistics enterprises

NASA Astrophysics Data System (ADS)

Fan, Zhigou; Ma, Mengkun

2018-01-01

With the rapid development of modern logistics, the vehicle routing problem has become one of the urgent problems in the logistics industry. The rationality of distribution route planning directly affects the efficiency and quality of logistics distribution. This paper first introduces the definition of logistics distribution and the three methods of optimizing the distribution routes, and then analyzes the current vehicle distribution route by using a representative example, finally puts forward the optimization schemes of logistics distribution route.

A novel methodology for determining low-cost fine particulate matter street sweeping routes.

PubMed

Blazquez, Carola A; Beghelli, Alejandra; Meneses, Veronica P

2012-02-01

This paper addresses the problem of low-cost PM10 (particulate matter with aerodynamic diameter < 10 microm) street sweeping route. In order to do so, only a subset of the streets of the urban area to be swept is selected for sweeping, based on their PM10 emission factor values. Subsequently, a low-cost route that visits each street in the set is computed. Unlike related problems of waste collection where streets must be visited once (Chinese or Rural Postman Problem, respectively), in this case, the sweeping vehicle route must visit each selected street exactly as many times as its number of street sides, since the vehicle can sweep only one street side at a time. Additionally, the route must comply with traffic flow and turn constraints. A novel transformation of the original arc routing problem into a node routing problem is proposed in this paper. This is accomplished by building a graph that represents the area to sweep in such a way that the problem can be solved by applying any known solution to the Traveling Salesman Problem (TSP). As a way of illustration, the proposed method was applied to the northeast area of the Municipality of Santiago (Chile). Results show that the proposed methodology achieved up to 37% savings in kilometers traveled by the sweeping vehicle when compared to the solution obtained by solving the TSP problem with Geographic Information Systems (GIS)--aware tools.

Periodic Heterogeneous Vehicle Routing Problem With Driver Scheduling

NASA Astrophysics Data System (ADS)

Mardiana Panggabean, Ellis; Mawengkang, Herman; Azis, Zainal; Filia Sari, Rina

2018-01-01

The paper develops a model for the optimal management of logistic delivery of a given commodity. The company has different type of vehicles with different capacity to deliver the commodity for customers. The problem is then called Periodic Heterogeneous Vehicle Routing Problem (PHVRP). The goal is to schedule the deliveries according to feasible combinations of delivery days and to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the sum of the costs of all routes over the planning horizon. We propose a combined approach of heuristic algorithm and exact method to solve the problem.

Antitumor Agents 293. Non-toxic Dimethyl-4,4′-dimethoxy-5,6,5′,6′-dimethylenedioxybiphenyl-2,2′-dicarboxylate (DDB) Analogs Chemosensitize Multidrug Resistant Cancer Cells to Clinical Anticancer Drugs

PubMed Central

Hung, Hsin-Yi; Ohkoshi, Emika; Goto, Masuo; Bastow, Kenneth F.; Nakagawa-Goto, Kyoko; Lee, Kuo-Hsiung

2012-01-01

Novel dimethyl-4,4′-dimethoxy-5,6,5′,6′-dimethylenedioxybiphenyl-2,2′-dicarboxylate (DDB) analogs were designed and synthesized to improve their chemosensitizing action on KBvin (vincristine resistant nasopharyngeal carcinoma) cells, a multi-drug resistant cell line over-expressing P-glycoprotein (P-gp). Structure-activity relationship analysis showed that aromatic and bulky aliphatic side chains at the 2,2′-positions effectively and significantly sensitized P-gp overexpressing multidrug resistant (MDR) cells to anticancer drugs, such as paclitaxel (TAX), vincristine (VCR), and doxorubicin (DOX). DDB derivatives 16 and 23 showed 5–10 times more effective reversal ability than verapamil (VRP) for TAX and VCR. Analog 6 also exhibited five times greater chemosensitizing effect against DOX than VRP. Importantly, no cytotoxicity was observed by the active DDB analogs against both non-MDR and MDR cells, suggesting that DDB analogs serve as the novel lead compounds for the development of chemosensitizers to overcome MDR phenotype. The mechanism of action studies demonstrated that effective inhibition of P-glycoprotein by DDB analogs dramatically elevated cellular concentration of anticancer drugs. PMID:22612652

Potent Immune Responses in Rhesus Macaques Induced by Nonviral Delivery of a Self-amplifying RNA Vaccine Expressing HIV Type 1 Envelope With a Cationic Nanoemulsion

PubMed Central

Bogers, Willy M.; Oostermeijer, Herman; Mooij, Petra; Koopman, Gerrit; Verschoor, Ernst J.; Davis, David; Ulmer, Jeffrey B.; Brito, Luis A.; Cu, Yen; Banerjee, Kaustuv; Otten, Gillis R.; Burke, Brian; Dey, Antu; Heeney, Jonathan L.; Shen, Xiaoying; Tomaras, Georgia D.; Labranche, Celia; Montefiori, David C.; Liao, Hua-Xin; Haynes, Barton; Geall, Andrew J.; Barnett, Susan W.

2015-01-01

Self-amplifying messenger RNA (mRNA) of positive-strand RNA viruses are effective vectors for in situ expression of vaccine antigens and have potential as a new vaccine technology platform well suited for global health applications. The SAM vaccine platform is based on a synthetic, self-amplifying mRNA delivered by a nonviral delivery system. The safety and immunogenicity of an HIV SAM vaccine encoding a clade C envelope glycoprotein formulated with a cationic nanoemulsion (CNE) delivery system was evaluated in rhesus macaques. The HIV SAM vaccine induced potent cellular immune responses that were greater in magnitude than those induced by self-amplifying mRNA packaged in a viral replicon particle (VRP) or by a recombinant HIV envelope protein formulated with MF59 adjuvant, anti-envelope binding (including anti-V1V2), and neutralizing antibody responses that exceeded those induced by the VRP vaccine. These studies provide the first evidence in nonhuman primates that HIV vaccination with a relatively low dose (50 µg) of formulated self-amplifying mRNA is safe and immunogenic. PMID:25234719

Inventory slack routing application in emergency logistics and relief distributions.

PubMed

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.

Inventory slack routing application in emergency logistics and relief distributions

PubMed Central

Yang, Xianfeng; 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. PMID:29902196

An Ant Colony Optimization and Hybrid Metaheuristics Algorithm to Solve the Split Delivery Vehicle Routing Problem

DTIC Science & Technology

2015-01-01

programming formulation of traveling salesman problems , Journal of the ACM, 7(4), 326-329. Montemanni, R., Gambardella, L. M., Rizzoli, A.E., Donati. A.V... salesman problem . BioSystem, 43(1), 73-81. Dror, M., Trudeau, P., 1989. Savings by split delivery routing. Transportation Science, 23, 141- 145. Dror, M...An Ant Colony Optimization and Hybrid Metaheuristics Algorithm to solve the Split Delivery Vehicle Routing Problem Authors: Gautham Rajappa

Using Ant Colony Optimization for Routing in VLSI Chips

NASA Astrophysics Data System (ADS)

Arora, Tamanna; Moses, Melanie

2009-04-01

Rapid advances in VLSI technology have increased the number of transistors that fit on a single chip to about two billion. A frequent problem in the design of such high performance and high density VLSI layouts is that of routing wires that connect such large numbers of components. Most wire-routing problems are computationally hard. The quality of any routing algorithm is judged by the extent to which it satisfies routing constraints and design objectives. Some of the broader design objectives include minimizing total routed wire length, and minimizing total capacitance induced in the chip, both of which serve to minimize power consumed by the chip. Ant Colony Optimization algorithms (ACO) provide a multi-agent framework for combinatorial optimization by combining memory, stochastic decision and strategies of collective and distributed learning by ant-like agents. This paper applies ACO to the NP-hard problem of finding optimal routes for interconnect routing on VLSI chips. The constraints on interconnect routing are used by ants as heuristics which guide their search process. We found that ACO algorithms were able to successfully incorporate multiple constraints and route interconnects on suite of benchmark chips. On an average, the algorithm routed with total wire length 5.5% less than other established routing algorithms.

Optimization of municipal waste collection scheduling and routing using vehicle assignment problem (case study of Surabaya city waste collection)

NASA Astrophysics Data System (ADS)

Ramdhani, M. N.; Baihaqi, I.; Siswanto, N.

2018-04-01

Waste collection and disposal become a major problem for many metropolitan cities. Growing population, limited vehicles, and increased road traffic make the waste transportation become more complex. Waste collection involves some key considerations, such as vehicle assignment, vehicle routes, and vehicle scheduling. In the scheduling process, each vehicle has a scheduled departure that serve each route. Therefore, vehicle’s assignments should consider the time required to finish one assigment on that route. The objective of this study is to minimize the number of vehicles needed to serve all routes by developing a mathematical model which uses assignment problem approach. The first step is to generated possible routes from the existing routes, followed by vehicle assignments for those certain routes. The result of the model shows fewer vehicles required to perform waste collection asa well as the the number of journeys that the vehicle to collect the waste to the landfill. The comparison of existing conditions with the model result indicates that the latter’s has better condition than the existing condition because each vehicle with certain route has an equal workload, all the result’s model has the maximum of two journeys for each route.

An Adaptive Clustering Approach Based on Minimum Travel Route Planning for Wireless Sensor Networks with a Mobile Sink.

PubMed

Tang, Jiqiang; Yang, Wu; Zhu, Lingyun; Wang, Dong; Feng, Xin

2017-04-26

In recent years, Wireless Sensor Networks with a Mobile Sink (WSN-MS) have been an active research topic due to the widespread use of mobile devices. However, how to get the balance between data delivery latency and energy consumption becomes a key issue of WSN-MS. In this paper, we study the clustering approach by jointly considering the Route planning for mobile sink and Clustering Problem (RCP) for static sensor nodes. We solve the RCP problem by using the minimum travel route clustering approach, which applies the minimum travel route of the mobile sink to guide the clustering process. We formulate the RCP problem as an Integer Non-Linear Programming (INLP) problem to shorten the travel route of the mobile sink under three constraints: the communication hops constraint, the travel route constraint and the loop avoidance constraint. We then propose an Imprecise Induction Algorithm (IIA) based on the property that the solution with a small hop count is more feasible than that with a large hop count. The IIA algorithm includes three processes: initializing travel route planning with a Traveling Salesman Problem (TSP) algorithm, transforming the cluster head to a cluster member and transforming the cluster member to a cluster head. Extensive experimental results show that the IIA algorithm could automatically adjust cluster heads according to the maximum hops parameter and plan a shorter travel route for the mobile sink. Compared with the Shortest Path Tree-based Data-Gathering Algorithm (SPT-DGA), the IIA algorithm has the characteristics of shorter route length, smaller cluster head count and faster convergence rate.

Procedures to handle inventory cluster plots that straddle two or more conditions

Treesearch

Jerold T. Hahn; Colin D. MacLean; Stanford L. Arner; William A. Bechtold

1995-01-01

We review the relative merits and field procedures for four basic plot designs to handle forest inventory plots that straddle two or more conditions, given that subplots will not be moved. A cluster design is recommended that combines fixed-area subplots and variable-radius plot (VRP) sampling. Each subplot in a cluster consists of a large fixed-area subplot for...

Optimization of OSPF Routing in IP Networks

NASA Astrophysics Data System (ADS)

Bley, Andreas; Fortz, Bernard; Gourdin, Eric; Holmberg, Kaj; Klopfenstein, Olivier; Pióro, Michał; Tomaszewski, Artur; Ümit, Hakan

The Internet is a huge world-wide packet switching network comprised of more than 13,000 distinct subnetworks, referred to as Autonomous Systems (ASs) autonomous system AS . They all rely on the Internet Protocol (IP) internet protocol IP for transport of packets across the network. And most of them use shortest path routing protocols shortest path routing!protocols , such as OSPF or IS-IS, to control the routing of IP packets routing!of IP packets within an AS. The idea of the routing is extremely simple — every packet is forwarded on IP links along the shortest route between its source and destination nodes of the AS. The AS network administrator can manage the routing of packets in the AS by supplying the so-called administrative weights of IP links, which specify the link lengths that are used by the routing protocols for their shortest path computations. The main advantage of the shortest path routing policy is its simplicity, allowing for little administrative overhead. From the network engineering perspective, however, shortest path routing can pose problems in achieving satisfactory traffic handling efficiency. As all routing paths depend on the same routing metric routing!metric , it is not possible to configure the routing paths for the communication demands between different pairs of nodes explicitly or individually; the routing can be controlled only indirectly and only as a whole by modifying the routing metric. Thus, one of the main tasks when planning such networks is to find administrative link weights that induce a globally efficient traffic routing traffic!routing configuration of an AS. It turns out that this task leads to very difficult mathematical optimization problems. In this chapter, we discuss and describe exact integer programming models and solution approaches as well as practically efficient smart heuristics for such shortest path routing problems shortest path routing!problems .

Using Approximate Dynamic Programming to Solve the Military Inventory Routing Problem with Direct Delivery

DTIC Science & Technology

2015-03-26

benefit by no longer having to allocate resources to inventory management . When the inventory routing problem is solved , three key decisions are made at...industries rely on the transportation and manage – ment of goods. To aid in understanding the formulation and techniques for solving the military inventory...Using Approximate Dynamic Programming to Solve the Military Inventory Routing Problem with Direct Delivery THESIS MARCH 2015 Rebekah S. McKenna

Improving the Air Mobility Command’s Air Refueler Route Building Capabilities

DTIC Science & Technology

2014-03-27

routing tool. Sundar and Rathinam [18] also study a traveling salesman version of the problem in the unmanned aerial vehicle realm. Their focus is on...constrained shortest path with fuel limitations. The objective is to minimize the distance traveled . Some aircraft routing problems involve...radius and network density their only limitations. 4 O’Rourke et al. [15] examine a traveling salesman version of aircraft routing in the unmanned aerial

An integer programming approach to a real-world recyclable waste collection problem in Argentina.

PubMed

Braier, Gustavo; Durán, Guillermo; Marenco, Javier; Wesner, Francisco

2017-05-01

This article reports on the use of mathematical programming techniques to optimise the routes of a recyclable waste collection system servicing Morón, a large municipality outside Buenos Aires, Argentina. The truck routing problem posed by the system is a particular case of the generalised directed open rural postman problem. An integer programming model is developed with a solving procedure built around a subtour-merging algorithm and the addition of subtour elimination constraints. The route solutions generated by the proposed methodology perform significantly better than the previously used, manually designed routes, the main improvement being that coverage of blocks within the municipality with the model solutions is 100% by construction, whereas with the manual routes as much as 16% of the blocks went unserviced. The model-generated routes were adopted by the municipality in 2014 and the national government is planning to introduce the methodology elsewhere in the country.

An Adaptive Clustering Approach Based on Minimum Travel Route Planning for Wireless Sensor Networks with a Mobile Sink

PubMed Central

Tang, Jiqiang; Yang, Wu; Zhu, Lingyun; Wang, Dong; Feng, Xin

2017-01-01

In recent years, Wireless Sensor Networks with a Mobile Sink (WSN-MS) have been an active research topic due to the widespread use of mobile devices. However, how to get the balance between data delivery latency and energy consumption becomes a key issue of WSN-MS. In this paper, we study the clustering approach by jointly considering the Route planning for mobile sink and Clustering Problem (RCP) for static sensor nodes. We solve the RCP problem by using the minimum travel route clustering approach, which applies the minimum travel route of the mobile sink to guide the clustering process. We formulate the RCP problem as an Integer Non-Linear Programming (INLP) problem to shorten the travel route of the mobile sink under three constraints: the communication hops constraint, the travel route constraint and the loop avoidance constraint. We then propose an Imprecise Induction Algorithm (IIA) based on the property that the solution with a small hop count is more feasible than that with a large hop count. The IIA algorithm includes three processes: initializing travel route planning with a Traveling Salesman Problem (TSP) algorithm, transforming the cluster head to a cluster member and transforming the cluster member to a cluster head. Extensive experimental results show that the IIA algorithm could automatically adjust cluster heads according to the maximum hops parameter and plan a shorter travel route for the mobile sink. Compared with the Shortest Path Tree-based Data-Gathering Algorithm (SPT-DGA), the IIA algorithm has the characteristics of shorter route length, smaller cluster head count and faster convergence rate. PMID:28445434

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

NASA Astrophysics Data System (ADS)

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.

Focusing on the golden ball metaheuristic: an extended study on a wider set of problems.

PubMed

Osaba, E; Diaz, F; Carballedo, R; Onieva, E; Perallos, A

2014-01-01

Nowadays, the development of new metaheuristics for solving optimization problems is a topic of interest in the scientific community. In the literature, a large number of techniques of this kind can be found. Anyway, there are many recently proposed techniques, such as the artificial bee colony and imperialist competitive algorithm. This paper is focused on one recently published technique, the one called Golden Ball (GB). The GB is a multiple-population metaheuristic based on soccer concepts. Although it was designed to solve combinatorial optimization problems, until now, it has only been tested with two simple routing problems: the traveling salesman problem and the capacitated vehicle routing problem. In this paper, the GB is applied to four different combinatorial optimization problems. Two of them are routing problems, which are more complex than the previously used ones: the asymmetric traveling salesman problem and the vehicle routing problem with backhauls. Additionally, one constraint satisfaction problem (the n-queen problem) and one combinatorial design problem (the one-dimensional bin packing problem) have also been used. The outcomes obtained by GB are compared with the ones got by two different genetic algorithms and two distributed genetic algorithms. Additionally, two statistical tests are conducted to compare these results.

Focusing on the Golden Ball Metaheuristic: An Extended Study on a Wider Set of Problems

PubMed Central

Osaba, E.; Diaz, F.; Carballedo, R.; Onieva, E.; Perallos, A.

2014-01-01

Nowadays, the development of new metaheuristics for solving optimization problems is a topic of interest in the scientific community. In the literature, a large number of techniques of this kind can be found. Anyway, there are many recently proposed techniques, such as the artificial bee colony and imperialist competitive algorithm. This paper is focused on one recently published technique, the one called Golden Ball (GB). The GB is a multiple-population metaheuristic based on soccer concepts. Although it was designed to solve combinatorial optimization problems, until now, it has only been tested with two simple routing problems: the traveling salesman problem and the capacitated vehicle routing problem. In this paper, the GB is applied to four different combinatorial optimization problems. Two of them are routing problems, which are more complex than the previously used ones: the asymmetric traveling salesman problem and the vehicle routing problem with backhauls. Additionally, one constraint satisfaction problem (the n-queen problem) and one combinatorial design problem (the one-dimensional bin packing problem) have also been used. The outcomes obtained by GB are compared with the ones got by two different genetic algorithms and two distributed genetic algorithms. Additionally, two statistical tests are conducted to compare these results. PMID:25165742

Switched Systems and Motion Coordination: Combinatorial Challenges

NASA Technical Reports Server (NTRS)

Sadovsky, Alexander V.

2016-01-01

Problems of routing commercial air traffic in a terminal airspace encounter different constraints: separation assurance, aircraft performance limitations, regulations. The general setting of these problems is that of a switched control system. Such a system combines the differentiable motion of the aircraft with the combinatorial choices of choosing precedence when traffic routes merge and choosing branches when the routes diverge. This presentation gives an overview of the problem, the ATM context, related literature, and directions for future research.

Using Grey Wolf Algorithm to Solve the Capacitated Vehicle Routing Problem

NASA Astrophysics Data System (ADS)

Korayem, L.; Khorsid, M.; Kassem, S. S.

2015-05-01

The capacitated vehicle routing problem (CVRP) is a class of the vehicle routing problems (VRPs). In CVRP a set of identical vehicles having fixed capacities are required to fulfill customers' demands for a single commodity. The main objective is to minimize the total cost or distance traveled by the vehicles while satisfying a number of constraints, such as: the capacity constraint of each vehicle, logical flow constraints, etc. One of the methods employed in solving the CVRP is the cluster-first route-second method. It is a technique based on grouping of customers into a number of clusters, where each cluster is served by one vehicle. Once clusters are formed, a route determining the best sequence to visit customers is established within each cluster. The recently bio-inspired grey wolf optimizer (GWO), introduced in 2014, has proven to be efficient in solving unconstrained, as well as, constrained optimization problems. In the current research, our main contributions are: combining GWO with the traditional K-means clustering algorithm to generate the ‘K-GWO’ algorithm, deriving a capacitated version of the K-GWO algorithm by incorporating a capacity constraint into the aforementioned algorithm, and finally, developing 2 new clustering heuristics. The resulting algorithm is used in the clustering phase of the cluster-first route-second method to solve the CVR problem. The algorithm is tested on a number of benchmark problems with encouraging results.

An improved least cost routing approach for WDM optical network without wavelength converters

NASA Astrophysics Data System (ADS)

Bonani, Luiz H.; Forghani-elahabad, Majid

2016-12-01

Routing and wavelength assignment (RWA) problem has been an attractive problem in optical networks, and consequently several algorithms have been proposed in the literature to solve this problem. The most known techniques for the dynamic routing subproblem are fixed routing, fixed-alternate routing, and adaptive routing methods. The first one leads to a high blocking probability (BP) and the last one includes a high computational complexity and requires immense backing from the control and management protocols. The second one suggests a trade-off between performance and complexity, and hence we consider it to improve in our work. In fact, considering the RWA problem in a wavelength routed optical network with no wavelength converter, an improved technique is proposed for the routing subproblem in order to decrease the BP of the network. Based on fixed-alternate approach, the first k shortest paths (SPs) between each node pair is determined. We then rearrange the SPs according to a newly defined cost for the links and paths. Upon arriving a connection request, the sorted paths are consecutively checked for an available wavelength according to the most-used technique. We implement our proposed algorithm and the least-hop fixed-alternate algorithm to show how the rearrangement of SPs contributes to a lower BP in the network. The numerical results demonstrate the efficiency of our proposed algorithm in comparison with the others, considering different number of available wavelengths.

Approximate solution of the multiple watchman routes problem with restricted visibility range.

PubMed

Faigl, Jan

2010-10-01

In this paper, a new self-organizing map (SOM) based adaptation procedure is proposed to address the multiple watchman route problem with the restricted visibility range in the polygonal domain W. A watchman route is represented by a ring of connected neuron weights that evolves in W, while obstacles are considered by approximation of the shortest path. The adaptation procedure considers a coverage of W by the ring in order to attract nodes toward uncovered parts of W. The proposed procedure is experimentally verified in a set of environments and several visibility ranges. Performance of the procedure is compared with the decoupled approach based on solutions of the art gallery problem and the consecutive traveling salesman problem. The experimental results show the suitability of the proposed procedure based on relatively simple supporting geometrical structures, enabling application of the SOM principles to watchman route problems in W.

Dynamic vehicle routing with time windows in theory and practice.

PubMed

Yang, Zhiwei; van Osta, Jan-Paul; van Veen, Barry; van Krevelen, Rick; van Klaveren, Richard; Stam, Andries; Kok, Joost; Bäck, Thomas; Emmerich, Michael

2017-01-01

The vehicle routing problem is a classical combinatorial optimization problem. This work is about a variant of the vehicle routing problem with dynamically changing orders and time windows. In real-world applications often the demands change during operation time. New orders occur and others are canceled. In this case new schedules need to be generated on-the-fly. Online optimization algorithms for dynamical vehicle routing address this problem but so far they do not consider time windows. Moreover, to match the scenarios found in real-world problems adaptations of benchmarks are required. In this paper, a practical problem is modeled based on the procedure of daily routing of a delivery company. New orders by customers are introduced dynamically during the working day and need to be integrated into the schedule. A multiple ant colony algorithm combined with powerful local search procedures is proposed to solve the dynamic vehicle routing problem with time windows. The performance is tested on a new benchmark based on simulations of a working day. The problems are taken from Solomon's benchmarks but a certain percentage of the orders are only revealed to the algorithm during operation time. Different versions of the MACS algorithm are tested and a high performing variant is identified. Finally, the algorithm is tested in situ: In a field study, the algorithm schedules a fleet of cars for a surveillance company. We compare the performance of the algorithm to that of the procedure used by the company and we summarize insights gained from the implementation of the real-world study. The results show that the multiple ant colony algorithm can get a much better solution on the academic benchmark problem and also can be integrated in a real-world environment.

Can Virtual Reality Increase the Realism of Role Plays Used to Teach College Women Sexual Coercion and Rape-Resistance Skills?

ERIC Educational Resources Information Center

Jouriles, Ernest N.; McDonald, Renee; Kullowatz, Antje; Rosenfield, David; Gomez, Gabriella S.; Cuevas, Anthony

2009-01-01

The present study evaluated whether virtual reality (VR) can enhance the realism of role plays designed to help college women resist sexual attacks. Sixty-two female undergraduate students were randomly assigned to either the Role Play (RP) or Virtual Role Play (VRP) conditions, which were differentiated only by the use of VR technology in the VRP…

Routing and Addressing Problems in Large Metropolitan-Scale Internetworks. ISI Research Report.

ERIC Educational Resources Information Center

Finn, Gregory G.

This report discusses some of the problems and limitations in existing internetwork design for the connection of packet-switching networks of different technologies and presents an algorithm that has been shown to be suitable for internetworks of unbounded size. Using a new form of address and a flat routing mechanism called Cartesian routing,…

Integer Optimization Model for a Logistic System based on Location-Routing Considering Distance and Chosen Route

NASA Astrophysics Data System (ADS)

Mulyasari, Joni; Mawengkang, Herman; Efendi, Syahril

2018-02-01

In a distribution network it is important to decide the locations of facilities that impacts not only the profitability of an organization but the ability to serve customers.Generally the location-routing problem is to minimize the overall cost by simultaneously selecting a subset of candidate facilities and constructing a set of delivery routes that satisfy some restrictions. In this paper we impose restriction on the route that should be passed for delivery. We use integer programming model to describe the problem. A feasible neighbourhood search is proposed to solve the result model.

Coordinated Platoon Routing in a Metropolitan Network

DOE Office of Scientific and Technical Information (OSTI.GOV)

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 themore » 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.« less

Improved artificial bee colony algorithm for vehicle routing problem with time windows

PubMed Central

Yan, Qianqian; Zhang, Mengjie; Yang, Yunong

2017-01-01

This paper investigates a well-known complex combinatorial problem known as the vehicle routing problem with time windows (VRPTW). Unlike the standard vehicle routing problem, each customer in the VRPTW is served within a given time constraint. This paper solves the VRPTW using an improved artificial bee colony (IABC) algorithm. The performance of this algorithm is improved by a local optimization based on a crossover operation and a scanning strategy. Finally, the effectiveness of the IABC is evaluated on some well-known benchmarks. The results demonstrate the power of IABC algorithm in solving the VRPTW. PMID:28961252

Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm.

PubMed

Hannan, M A; Akhtar, Mahmuda; Begum, R A; Basri, H; Hussain, A; Scavino, Edgar

2018-01-01

Waste collection widely depends on the route optimization problem that involves a large amount of expenditure in terms of capital, labor, and variable operational costs. Thus, the more waste collection route is optimized, the more reduction in different costs and environmental effect will be. This study proposes a modified particle swarm optimization (PSO) algorithm in a capacitated vehicle-routing problem (CVRP) model to determine the best waste collection and route optimization solutions. In this study, threshold waste level (TWL) and scheduling concepts are applied in the PSO-based CVRP model under different datasets. The obtained results from different datasets show that the proposed algorithmic CVRP model provides the best waste collection and route optimization in terms of travel distance, total waste, waste collection efficiency, and tightness at 70-75% of TWL. The obtained results for 1 week scheduling show that 70% of TWL performs better than all node consideration in terms of collected waste, distance, tightness, efficiency, fuel consumption, and cost. The proposed optimized model can serve as a valuable tool for waste collection and route optimization toward reducing socioeconomic and environmental impacts. Copyright © 2017 Elsevier Ltd. All rights reserved.

Simulated annealing with restart strategy for the blood pickup routing problem

NASA Astrophysics Data System (ADS)

Yu, V. F.; Iswari, T.; Normasari, N. M. E.; Asih, A. M. S.; Ting, H.

2018-04-01

This study develops a simulated annealing heuristic with restart strategy (SA_RS) for solving the blood pickup routing problem (BPRP). BPRP minimizes the total length of the routes for blood bag collection between a blood bank and a set of donation sites, each associated with a time window constraint that must be observed. The proposed SA_RS is implemented in C++ and tested on benchmark instances of the vehicle routing problem with time windows to verify its performance. The algorithm is then tested on some newly generated BPRP instances and the results are compared with those obtained by CPLEX. Experimental results show that the proposed SA_RS heuristic effectively solves BPRP.

Genetic Algorithm and Tabu Search for Vehicle Routing Problems with Stochastic Demand

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ismail, Zuhaimy, E-mail: zuhaimyi@yahoo.com, E-mail: irhamahn@yahoo.com; Irhamah, E-mail: zuhaimyi@yahoo.com, E-mail: irhamahn@yahoo.com

2010-11-11

This paper presents a problem of designing solid waste collection routes, involving scheduling of vehicles where each vehicle begins at the depot, visits customers and ends at the depot. It is modeled as a Vehicle Routing Problem with Stochastic Demands (VRPSD). A data set from a real world problem (a case) is used in this research. We developed Genetic Algorithm (GA) and Tabu Search (TS) procedure and these has produced the best possible result. The problem data are inspired by real case of VRPSD in waste collection. Results from the experiment show the advantages of the proposed algorithm that aremore » its robustness and better solution qualities.« less

VRP09 Objective Methods to Test Visual Dysfunction in the Presence of Cognitive Impairment

DTIC Science & Technology

2014-10-01

Football ...season,  we  also  re-­‐measured  any  players  that  were  taken  out  of   play  during  games  for   concussion ...after  the   concussion   and  then  returned  to  baseline  by  the  time  they  returned  to  play  (Figure

The Classification of E-Authentication Protocols for Targeted Applicability

DTIC Science & Technology

2009-12-01

that the secret is only known to the Claimant and either the Verifier or Relying Party (V/RP), and serves as a form of identifier to the... secret against unauthorized observation. The protection of the secret is critical to prevent potential impersonation attacks. The secret is usually...confident that the Claimant is who he claims, if he is able to prove possession of this secret. 1. Symmetric vs. Asymmetric Secret The secret used by

A Mixed Integer Linear Program for Solving a Multiple Route Taxi Scheduling Problem

NASA Technical Reports Server (NTRS)

Montoya, Justin Vincent; Wood, Zachary Paul; Rathinam, Sivakumar; Malik, Waqar Ahmad

2010-01-01

Aircraft movements on taxiways at busy airports often create bottlenecks. This paper introduces a mixed integer linear program to solve a Multiple Route Aircraft Taxi Scheduling Problem. The outputs of the model are in the form of optimal taxi schedules, which include routing decisions for taxiing aircraft. The model extends an existing single route formulation to include routing decisions. An efficient comparison framework compares the multi-route formulation and the single route formulation. The multi-route model is exercised for east side airport surface traffic at Dallas/Fort Worth International Airport to determine if any arrival taxi time savings can be achieved by allowing arrivals to have two taxi routes: a route that crosses an active departure runway and a perimeter route that avoids the crossing. Results indicate that the multi-route formulation yields reduced arrival taxi times over the single route formulation only when a perimeter taxiway is used. In conditions where the departure aircraft are given an optimal and fixed takeoff sequence, accumulative arrival taxi time savings in the multi-route formulation can be as high as 3.6 hours more than the single route formulation. If the departure sequence is not optimal, the multi-route formulation results in less taxi time savings made over the single route formulation, but the average arrival taxi time is significantly decreased.

Dynamic real-time routing for evacuation response planning and execution.

DOT National Transportation Integrated Search

2011-01-01

This study addresses the problem of dynamic routing operations in the emergency response context, primarily in terms : of the routing of response vehicles and evacuees. The study focuses on identifying the paths used for routing response : vehicles a...

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

NASA Technical Reports Server (NTRS)

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.

Context Analysis of Customer Requests using a Hybrid Adaptive Neuro Fuzzy Inference System and Hidden Markov Models in the Natural Language Call Routing Problem

NASA Astrophysics Data System (ADS)

Rustamov, Samir; Mustafayev, Elshan; Clements, Mark A.

2018-04-01

The context analysis of customer requests in a natural language call routing problem is investigated in the paper. One of the most significant problems in natural language call routing is a comprehension of client request. With the aim of finding a solution to this issue, the Hybrid HMM and ANFIS models become a subject to an examination. Combining different types of models (ANFIS and HMM) can prevent misunderstanding by the system for identification of user intention in dialogue system. Based on these models, the hybrid system may be employed in various language and call routing domains due to nonusage of lexical or syntactic analysis in classification process.

Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation.

PubMed

Bula, Gustavo Alfredo; Prodhon, Caroline; Gonzalez, Fabio Augusto; Afsar, H Murat; Velasco, Nubia

2017-02-15

This work focuses on the Heterogeneous Fleet Vehicle Routing problem (HFVRP) in the context of hazardous materials (HazMat) transportation. The objective is to determine a set of routes that minimizes the total expected routing risk. This is a nonlinear function, and it depends on the vehicle load and the population exposed when an incident occurs. Thus, a piecewise linear approximation is used to estimate it. For solving the problem, a variant of the Variable Neighborhood Search (VNS) algorithm is employed. To improve its performance, a post-optimization procedure is implemented via a Set Partitioning (SP) problem. The SP is solved on a pool of routes obtained from executions of the local search procedure embedded on the VNS. The algorithm is tested on two sets of HFVRP instances based on literature with up to 100 nodes, these instances are modified to include vehicle and arc risk parameters. The results are competitive in terms of computational efficiency and quality attested by a comparison with Mixed Integer Linear Programming (MILP) previously proposed. Copyright © 2016 Elsevier B.V. All rights reserved.

New optimization model for routing and spectrum assignment with nodes insecurity

NASA Astrophysics Data System (ADS)

Xuan, Hejun; Wang, Yuping; Xu, Zhanqi; Hao, Shanshan; Wang, Xiaoli

2017-04-01

By adopting the orthogonal frequency division multiplexing technology, elastic optical networks can provide the flexible and variable bandwidth allocation to each connection request and get higher spectrum utilization. The routing and spectrum assignment problem in elastic optical network is a well-known NP-hard problem. In addition, information security has received worldwide attention. We combine these two problems to investigate the routing and spectrum assignment problem with the guaranteed security in elastic optical network, and establish a new optimization model to minimize the maximum index of the used frequency slots, which is used to determine an optimal routing and spectrum assignment schemes. To solve the model effectively, a hybrid genetic algorithm framework integrating a heuristic algorithm into a genetic algorithm is proposed. The heuristic algorithm is first used to sort the connection requests and then the genetic algorithm is designed to look for an optimal routing and spectrum assignment scheme. In the genetic algorithm, tailor-made crossover, mutation and local search operators are designed. Moreover, simulation experiments are conducted with three heuristic strategies, and the experimental results indicate that the effectiveness of the proposed model and algorithm framework.

Reliable Adaptive Data Aggregation Route Strategy for a Trade-off between Energy and Lifetime in WSNs

PubMed Central

Guo, Wenzhong; Hong, Wei; Zhang, Bin; Chen, Yuzhong; Xiong, Naixue

2014-01-01

Mobile security is one of the most fundamental problems in Wireless Sensor Networks (WSNs). The data transmission path will be compromised for some disabled nodes. To construct a secure and reliable network, designing an adaptive route strategy which optimizes energy consumption and network lifetime of the aggregation cost is of great importance. In this paper, we address the reliable data aggregation route problem for WSNs. Firstly, to ensure nodes work properly, we propose a data aggregation route algorithm which improves the energy efficiency in the WSN. The construction process achieved through discrete particle swarm optimization (DPSO) saves node energy costs. Then, to balance the network load and establish a reliable network, an adaptive route algorithm with the minimal energy and the maximum lifetime is proposed. Since it is a non-linear constrained multi-objective optimization problem, in this paper we propose a DPSO with the multi-objective fitness function combined with the phenotype sharing function and penalty function to find available routes. Experimental results show that compared with other tree routing algorithms our algorithm can effectively reduce energy consumption and trade off energy consumption and network lifetime. PMID:25215944

Proposed definition of the term en route in en route aircraft noise

NASA Technical Reports Server (NTRS)

Garbell, Maurice A.

1990-01-01

The problem of en route aircraft noise was examined in a formal, dedicated, setting. Whereas the general meaning of the term en route might be intuitively understood, it is suggested that a precise formal definition of the term en route would be opportune from the outset, especially since the scientific and technical investigation of the problem of noise immissions on the ground from aircraft in flight away from the airspace of an airport may conceivably lead to administrative, regulatory, and legal consequences that would mandatorily require a precise definition of the term en route. Five flight segments, with their differing airframe configurations, engine thrusts, and airspeed management, should form the basis for the differential consideration of the noise immissions perceived on the ground underneath or near the defined segments of the flightpath in en route flight, from the end of the initial climb from an airport after takeoff until the final approach to an airport.

Multi-terminal pipe routing by Steiner minimal tree and particle swarm optimisation

NASA Astrophysics Data System (ADS)

Liu, Qiang; Wang, Chengen

2012-08-01

Computer-aided design of pipe routing is of fundamental importance for complex equipments' developments. In this article, non-rectilinear branch pipe routing with multiple terminals that can be formulated as a Euclidean Steiner Minimal Tree with Obstacles (ESMTO) problem is studied in the context of an aeroengine-integrated design engineering. Unlike the traditional methods that connect pipe terminals sequentially, this article presents a new branch pipe routing algorithm based on the Steiner tree theory. The article begins with a new algorithm for solving the ESMTO problem by using particle swarm optimisation (PSO), and then extends the method to the surface cases by using geodesics to meet the requirements of routing non-rectilinear pipes on the surfaces of aeroengines. Subsequently, the adaptive region strategy and the basic visibility graph method are adopted to increase the computation efficiency. Numeral computations show that the proposed routing algorithm can find satisfactory routing layouts while running in polynomial time.

Bees do not use nearest-neighbour rules for optimization of multi-location routes.

PubMed

Lihoreau, Mathieu; Chittka, Lars; Le Comber, Steven C; Raine, Nigel E

2012-02-23

Animals collecting patchily distributed resources are faced with complex multi-location routing problems. Rather than comparing all possible routes, they often find reasonably short solutions by simply moving to the nearest unvisited resources when foraging. Here, we report the travel optimization performance of bumble-bees (Bombus terrestris) foraging in a flight cage containing six artificial flowers arranged such that movements between nearest-neighbour locations would lead to a long suboptimal route. After extensive training (80 foraging bouts and at least 640 flower visits), bees reduced their flight distances and prioritized shortest possible routes, while almost never following nearest-neighbour solutions. We discuss possible strategies used during the establishment of stable multi-location routes (or traplines), and how these could allow bees and other animals to solve complex routing problems through experience, without necessarily requiring a sophisticated cognitive representation of space.

On the formulation and solution of an emergency routing problem.

DOT National Transportation Integrated Search

2007-10-01

In this work, we will identify important variables that contribute to : vehicular movement in an emergency environment. In particular, we for- : mulate and pose the Convoy Routing Problem (using far fewer variables : than other important models witho...

Better delivery/pick up routes in the presence of uncertainty.

DOT National Transportation Integrated Search

2007-08-01

We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with : time windows in which customers appear probabilistically and their service times are uncertain. : We use scenario-based stochastic optimization with recourse fo...

A Sharp methodology for VLSI layout

NASA Astrophysics Data System (ADS)

Bapat, Shekhar

1993-01-01

The layout problem for VLSI circuits is recognized as a very difficult problem and has been traditionally decomposed into the several seemingly independent sub-problems of placement, global routing, and detailed routing. Although this structure achieves a reduction in programming complexity, it is also typically accompanied by a reduction in solution quality. Most current placement research recognizes that the separation is artificial, and that the placement and routing problems should be solved ideally in tandem. We propose a new interconnection model, Sharp and an associated partitioning algorithm. The Sharp interconnection model uses a partitioning shape that roughly resembles the musical sharp 'number sign' and makes extensive use of pre-computed rectilinear Steiner trees. The model is designed to generate strategic routing information along with the partitioning results. Additionally, the Sharp model also generates estimates of the routing congestion. We also propose the Sharp layout heuristic that solves the layout problem in its entirety. The Sharp layout heuristic makes extensive use of the Sharp partitioning model. The use of precomputed Steiner tree forms enables the method to model accurately net characteristics. For example, the Steiner tree forms can model both the length of the net and more importantly its route. In fact, the tree forms are also appropriate for modeling the timing delays of nets. The Sharp heuristic works to minimize both the total layout area by minimizing total net length (thus reducing the total wiring area), and the congestion imbalances in the various channels (thus reducing the unused or wasted channel area). Our heuristic uses circuit element movements amongst the different partitioning blocks and selection of alternate minimal Steiner tree forms to achieve this goal. The objective function for the algorithm can be modified readily to include other important circuit constraints like propagation delays. The layout technique first computes a very high-level approximation of the layout solution (i.e., the positions of the circuit elements and the associated net routes). The approximate solution is alternately refined, objective function. The technique creates well defined sub-problems and offers intermediary steps that can be solved in parallel, as well as a parallel mechanism to merge the sub-problem solutions.

Simulation Model for Scenario Optimization of the Ready-Mix Concrete Delivery Problem

NASA Astrophysics Data System (ADS)

Galić, Mario; Kraus, Ivan

2016-12-01

This paper introduces a discrete simulation model for solving routing and network material flow problems in construction projects. Before the description of the model a detailed literature review is provided. The model is verified using a case study of solving the ready-mix concrete network flow and routing problem in metropolitan area in Croatia. Within this study real-time input parameters were taken into account. Simulation model is structured in Enterprise Dynamics simulation software and Microsoft Excel linked with Google Maps. The model is dynamic, easily managed and adjustable, but also provides good estimation for minimization of costs and realization time in solving discrete routing and material network flow problems.

What Is the Best Route? Route-Finding Strategies of Middle School Students Using GIS

ERIC Educational Resources Information Center

Wigglesivorth, John C.

2003-01-01

This paper summarizes a research project conducted to investigate the strategies developed by middle school students to solve a route-finding problem using Arc View GIS software. Three different types of route-finding strategies were identified. Some students were visual route-finders and used a highly visual strategy; others were logical route…

Branch-pipe-routing approach for ships using improved genetic algorithm

NASA Astrophysics Data System (ADS)

Sui, Haiteng; Niu, Wentie

2016-09-01

Branch-pipe routing plays fundamental and critical roles in ship-pipe design. The branch-pipe-routing problem is a complex combinatorial optimization problem and is thus difficult to solve when depending only on human experts. A modified genetic-algorithm-based approach is proposed in this paper to solve this problem. The simplified layout space is first divided into threedimensional (3D) grids to build its mathematical model. Branch pipes in layout space are regarded as a combination of several two-point pipes, and the pipe route between two connection points is generated using an improved maze algorithm. The coding of branch pipes is then defined, and the genetic operators are devised, especially the complete crossover strategy that greatly accelerates the convergence speed. Finally, simulation tests demonstrate the performance of proposed method.

An electro-optical and electron injection study of benzothiazole-based squaraine dyes as efficient dye-sensitized solar cell materials: a first principles study.

PubMed

Al-Fahdan, Najat Saeed; Asiri, Abdullah M; Irfan, Ahmad; Basaif, Salem A; El-Shishtawy, Reda M

2014-12-01

Squaraine dyes have attracted significant attention in many areas of daily life from biomedical imaging to semiconducting materials. Moreover, these dyes are used as photoactive materials in the field of solar cells. In the present study, we investigated the structural, electronic, photophysical, and charge transport properties of six benzothiazole-based squaraine dyes (Cis-SQ1-Cis-SQ3 and Trans-SQ1-Trans-SQ3). The effect of electron donating (-OCH3) and electron withdrawing (-COOH) groups was investigated intensively. Ground state geometry and frequency calculations were performed by applying density functional theory (DFT) at B3LYP/6-31G** level of theory. Absorption spectra were computed in chloroform at the time-dependent DFT/B3LYP/6-31G** level of theory. The driving force of electron injection (ΔG (inject)), relative driving force of electron injection (ΔG r (inject)), electronic coupling constants (|VRP|) and light harvesting efficiency (LHE) of all six compounds were calculated and compared with previously studied sensitizers. The ΔG (inject), ΔG r (inject) and |VRP| of all six compounds revealed that these sensitizers would be efficient dye-sensitized solar cell materials. Cis/Trans-SQ3 exhibited superior LHE as compared to other derivatives. The Cis/Trans geometric effect was studied and discussed with regard to electro-optical and charge transport properties.

Use of NK1 receptor antagonists in the exploration of physiological functions of substance P and neurokinin A.

PubMed

Otsuka, M; Yoshioka, K; Yanagisawa, M; Suzuki, H; Zhao, F Y; Guo, J Z; Hosoki, R; Kurihara, T

1995-07-01

Tachykinin NK1 receptor antagonists were used to explore the physiological functions of substance P (SP) and neurokinin A (NKA). Pharmacological profiles of three NK1 receptor antagonists, GR71251, GR82334, and RP 67580, were examined in the isolated spinal cord preparation of the neonatal rat. These tachykinin receptor antagonists exhibited considerable specificities and antagonized the actions of both SP and NKA to induce the depolarization of ventral roots. Electrical stimulation of the saphenous nerve with C-fiber strength evoked a depolarization lasting about 30 s of the ipsilateral L3 ventral root. This response, which is referred to as saphenous-nerve-evoked slow ventral root potential (VRP), was depressed by these NK1 receptor antagonists. In contrast, the saphenous-nerve-evoked slow VRP was potentiated by application of a mixture of peptidase inhibitors, including thiorphan, actinonin, and captopril in the presence of naloxone, but not after further addition of GR71251. Likewise, in the isolated coeliac ganglion of the guinea pig, electrical stimulation of the mesenteric nerves evoked in some ganglionic cells slow excitatory postsynaptic potentials (EPSPs), which were depressed by GR71251 and potentiated by peptidase inhibitors. These results further support the notion that SP and NKA serve as neurotransmitters producing slow EPSPs in the neonatal rat spinal cord and guinea pig prevertebral ganglia.

Optimization of controlled release nanoparticle formulation of verapamil hydrochloride using artificial neural networks with genetic algorithm and response surface methodology.

PubMed

Li, Yongqiang; Abbaspour, Mohammadreza R; Grootendorst, Paul V; Rauth, Andrew M; Wu, Xiao Yu

2015-08-01

This study was performed to optimize the formulation of polymer-lipid hybrid nanoparticles (PLN) for the delivery of an ionic water-soluble drug, verapamil hydrochloride (VRP) and to investigate the roles of formulation factors. Modeling and optimization were conducted based on a spherical central composite design. Three formulation factors, i.e., weight ratio of drug to lipid (X1), and concentrations of Tween 80 (X2) and Pluronic F68 (X3), were chosen as independent variables. Drug loading efficiency (Y1) and mean particle size (Y2) of PLN were selected as dependent variables. The predictive performance of artificial neural networks (ANN) and the response surface methodology (RSM) were compared. As ANN was found to exhibit better recognition and generalization capability over RSM, multi-objective optimization of PLN was then conducted based upon the validated ANN models and continuous genetic algorithms (GA). The optimal PLN possess a high drug loading efficiency (92.4%, w/w) and a small mean particle size (∼100nm). The predicted response variables matched well with the observed results. The three formulation factors exhibited different effects on the properties of PLN. ANN in coordination with continuous GA represent an effective and efficient approach to optimize the PLN formulation of VRP with desired properties. Copyright © 2015 Elsevier B.V. All rights reserved.

Practice makes proficient: pigeons (Columba livia) learn efficient routes on full-circuit navigational traveling salesperson problems.

PubMed

Baron, Danielle M; Ramirez, Alejandro J; Bulitko, Vadim; Madan, Christopher R; Greiner, Ariel; Hurd, Peter L; Spetch, Marcia L

2015-01-01

Visiting multiple locations and returning to the start via the shortest route, referred to as the traveling salesman (or salesperson) problem (TSP), is a valuable skill for both humans and non-humans. In the current study, pigeons were trained with increasing set sizes of up to six goals, with each set size presented in three distinct configurations, until consistency in route selection emerged. After training at each set size, the pigeons were tested with two novel configurations. All pigeons acquired routes that were significantly more efficient (i.e., shorter in length) than expected by chance selection of the goals. On average, the pigeons also selected routes that were more efficient than expected based on a local nearest-neighbor strategy and were as efficient as the average route generated by a crossing-avoidance strategy. Analysis of the routes taken indicated that they conformed to both a nearest-neighbor and a crossing-avoidance strategy significantly more often than expected by chance. Both the time taken to visit all goals and the actual distance traveled decreased from the first to the last trials of training in each set size. On the first trial with novel configurations, average efficiency was higher than chance, but was not higher than expected from a nearest-neighbor or crossing-avoidance strategy. These results indicate that pigeons can learn to select efficient routes on a TSP problem.

Values, Practice, Science, and AAC

ERIC Educational Resources Information Center

Mirenda, Pat

2017-01-01

The evolution of evidence-based practice in augmentative and alternative communication (AAC) has occurred via two different but related routes: the conventional research-to-practice route and the more common practice-to-research route. This article defines both routes with examples of each and discusses potential problems that may arise when…

Enhanced ant colony optimization for inventory routing problem

NASA Astrophysics Data System (ADS)

Wong, Lily; Moin, Noor Hasnah

2015-10-01

The inventory routing problem (IRP) integrates and coordinates two important components of supply chain management which are transportation and inventory management. We consider a one-to-many IRP network for a finite planning horizon. The demand for each product is deterministic and time varying as well as a fleet of capacitated homogeneous vehicles, housed at a depot/warehouse, delivers the products from the warehouse to meet the demand specified by the customers in each period. The inventory holding cost is product specific and is incurred at the customer sites. The objective is to determine the amount of inventory and to construct a delivery routing that minimizes both the total transportation and inventory holding cost while ensuring each customer's demand is met over the planning horizon. The problem is formulated as a mixed integer programming problem and is solved using CPLEX 12.4 to get the lower and upper bound (best integer) for each instance considered. We propose an enhanced ant colony optimization (ACO) to solve the problem and the built route is improved by using local search. The computational experiments demonstrating the effectiveness of our approach is presented.

A model for distribution centers location-routing problem on a multimodal transportation network with a meta-heuristic solving approach

NASA Astrophysics Data System (ADS)

Fazayeli, Saeed; Eydi, Alireza; Kamalabadi, Isa Nakhai

2017-07-01

Nowadays, organizations have to compete with different competitors in regional, national and international levels, so they have to improve their competition capabilities to survive against competitors. Undertaking activities on a global scale requires a proper distribution system which could take advantages of different transportation modes. Accordingly, the present paper addresses a location-routing problem on multimodal transportation network. The introduced problem follows four objectives simultaneously which form main contribution of the paper; determining multimodal routes between supplier and distribution centers, locating mode changing facilities, locating distribution centers, and determining product delivery tours from the distribution centers to retailers. An integer linear programming is presented for the problem, and a genetic algorithm with a new chromosome structure proposed to solve the problem. Proposed chromosome structure consists of two different parts for multimodal transportation and location-routing parts of the model. Based on published data in the literature, two numerical cases with different sizes generated and solved. Also, different cost scenarios designed to better analyze model and algorithm performance. Results show that algorithm can effectively solve large-size problems within a reasonable time which GAMS software failed to reach an optimal solution even within much longer times.

A model for distribution centers location-routing problem on a multimodal transportation network with a meta-heuristic solving approach

NASA Astrophysics Data System (ADS)

Fazayeli, Saeed; Eydi, Alireza; Kamalabadi, Isa Nakhai

2018-07-01

Nowadays, organizations have to compete with different competitors in regional, national and international levels, so they have to improve their competition capabilities to survive against competitors. Undertaking activities on a global scale requires a proper distribution system which could take advantages of different transportation modes. Accordingly, the present paper addresses a location-routing problem on multimodal transportation network. The introduced problem follows four objectives simultaneously which form main contribution of the paper; determining multimodal routes between supplier and distribution centers, locating mode changing facilities, locating distribution centers, and determining product delivery tours from the distribution centers to retailers. An integer linear programming is presented for the problem, and a genetic algorithm with a new chromosome structure proposed to solve the problem. Proposed chromosome structure consists of two different parts for multimodal transportation and location-routing parts of the model. Based on published data in the literature, two numerical cases with different sizes generated and solved. Also, different cost scenarios designed to better analyze model and algorithm performance. Results show that algorithm can effectively solve large-size problems within a reasonable time which GAMS software failed to reach an optimal solution even within much longer times.

On the improvement of blood sample collection at clinical laboratories

PubMed Central

2014-01-01

Background Blood samples are usually collected daily from different collection points, such hospitals and health centers, and transported to a core laboratory for testing. This paper presents a project to improve the collection routes of two of the largest clinical laboratories in Spain. These routes must be designed in a cost-efficient manner while satisfying two important constraints: (i) two-hour time windows between collection and delivery, and (ii) vehicle capacity. Methods A heuristic method based on a genetic algorithm has been designed to solve the problem of blood sample collection. The user enters the following information for each collection point: postal address, average collecting time, and average demand (in thermal containers). After implementing the algorithm using C programming, this is run and, in few seconds, it obtains optimal (or near-optimal) collection routes that specify the collection sequence for each vehicle. Different scenarios using various types of vehicles have been considered. Unless new collection points are added or problem parameters are changed substantially, routes need to be designed only once. Results The two laboratories in this study previously planned routes manually for 43 and 74 collection points, respectively. These routes were covered by an external carrier company. With the implementation of this algorithm, the number of routes could be reduced from ten to seven in one laboratory and from twelve to nine in the other, which represents significant annual savings in transportation costs. Conclusions The algorithm presented can be easily implemented in other laboratories that face this type of problem, and it is particularly interesting and useful as the number of collection points increases. The method designs blood collection routes with reduced costs that meet the time and capacity constraints of the problem. PMID:24406140

A novel heuristic algorithm for capacitated vehicle routing problem

NASA Astrophysics Data System (ADS)

Kır, Sena; Yazgan, Harun Reşit; Tüncel, Emre

2017-09-01

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic algorithm based on the tabu search and adaptive large neighborhood search (ALNS) with several specifically designed operators and features to solve the capacitated vehicle routing problem (CVRP). The effectiveness of the proposed algorithm was illustrated on the benchmark problems. The algorithm provides a better performance on large-scaled instances and gained advantage in terms of CPU time. In addition, we solved a real-life CVRP using the proposed algorithm and found the encouraging results by comparison with the current situation that the company is in.

A Two-Echelon Cooperated Routing Problem for a Ground Vehicle and Its Carried Unmanned Aerial Vehicle.

PubMed

Luo, Zhihao; Liu, Zhong; Shi, Jianmai

2017-05-17

In this paper, a two-echelon cooperated routing problem for the ground vehicle (GV) and its carried unmanned aerial vehicle (UAV) is investigated, where the GV travels on the road network and its UAV travels in areas beyond the road to visit a number of targets unreached by the GV. In contrast to the classical two-echelon routing problem, the UAV has to launch and land on the GV frequently to change or charge its battery while the GV is moving on the road network. A new 0-1 integer programming model is developed to formulate the problem, where the constraints on the spatial and temporal cooperation of GV and UAV routes are included. Two heuristics are proposed to solve the model: the first heuristic (H1) constructs a complete tour for all targets and splits it by GV routes, while the second heuristic (H2) constructs the GV tour and assigns UAV flights to it. Random instances with six different sizes (25-200 targets, 12-80 rendezvous nodes) are used to test the algorithms. Computational results show that H1 performs slightly better than H2, while H2 uses less time and is more stable.

Solving a four-destination traveling salesman problem using Escherichia coli cells as biocomputers.

PubMed

Esau, Michael; Rozema, Mark; Zhang, Tuo Huang; Zeng, Dawson; Chiu, Stephanie; Kwan, Rachel; Moorhouse, Cadence; Murray, Cameron; Tseng, Nien-Tsu; Ridgway, Doug; Sauvageau, Dominic; Ellison, Michael

2014-12-19

The Traveling Salesman Problem involves finding the shortest possible route visiting all destinations on a map only once before returning to the point of origin. The present study demonstrates a strategy for solving Traveling Salesman Problems using modified E. coli cells as processors for massively parallel computing. Sequential, combinatorial DNA assembly was used to generate routes, in the form of plasmids made up of marker genes, each representing a path between destinations, and short connecting linkers, each representing a given destination. Upon growth of the population of modified E. coli, phenotypic selection was used to eliminate invalid routes, and statistical analysis was performed to successfully identify the optimal solution. The strategy was successfully employed to solve a four-destination test problem.

A hybrid genetic-simulated annealing algorithm for the location-inventory-routing problem considering returns under e-supply chain environment.

PubMed

Li, Yanhui; Guo, Hao; Wang, Lin; Fu, Jing

2013-01-01

Facility location, inventory control, and vehicle routes scheduling are critical and highly related problems in the design of logistics system for e-business. Meanwhile, the return ratio in Internet sales was significantly higher than in the traditional business. Many of returned merchandise have no quality defects, which can reenter sales channels just after a simple repackaging process. Focusing on the existing problem in e-commerce logistics system, we formulate a location-inventory-routing problem model with no quality defects returns. To solve this NP-hard problem, an effective hybrid genetic simulated annealing algorithm (HGSAA) is proposed. Results of numerical examples show that HGSAA outperforms GA on computing time, optimal solution, and computing stability. The proposed model is very useful to help managers make the right decisions under e-supply chain environment.

VRP09 Reduction of Corneal Scarring Following Blast and Burn Injuries to Cornea Using siRNAs Targeting TGFb and CTGF

DTIC Science & Technology

2013-03-01

oligonucleotide-based drug approaches (better than ribozymes, antisense oligonucleotides ( ASO ), or microRNAs). (4) To accomplish these objectives, we...negative control scrambled ASO (designated NC). The combination of siRNAs T1 and R1 produced a knockdown of ~80% of TGFb1 protein in the conditioned...sequences (antisense oligonucleotides, ASOs ) into rabbit corneal cells and found that technique was very effective in delivering ASOs into the stroma and

VRP09 Reduction of Corneal Scarring Following Blast and Burn Injuries to Cornea Using siRNAs Targeting TGFb and CTGF

DTIC Science & Technology

2012-10-01

selective of all gene-targeted, oligonucleotide-based drug approaches (better than ribozymes, antisense oligonucleotides ( ASO ), or microRNAs).(4) We will...respect to a scrambled siRNA control. For the migration assay, a circular region in the middle of the well was removed using a gel removal solution...oligonucleotides, ASOs ) into rabbit corneal cells and found that technique was very effective in delivering ASOs into the stroma and even into the endothelial cell

Enterprise Analysis of Strategic Airlift to Obtain Competitive Advantage Through Fuel Efficiency

DTIC Science & Technology

2014-09-18

Single Dimension Value Function SFC Specific Fuel Consumption TRANSCAP Transportation System Capability TSP Travelling Salesman Problem VFT...the value posed by limiting intermediate nodes and en route stops. According to Flood (1955), the Travelling Salesman Problem (TSP) was first...B. (1954). The Problem of Routing Aircraft, a Mathematical Solution. (No. P-561). RAND CORP SANTA MONICA CALIF. Flood, M. M. (1956). The Traveling

ZERO: probabilistic routing for deploy and forget Wireless Sensor Networks.

PubMed

Vilajosana, Xavier; Llosa, Jordi; Pacho, Jose Carlos; Vilajosana, Ignasi; Juan, Angel A; Vicario, Jose Lopez; Morell, Antoni

2010-01-01

As Wireless Sensor Networks are being adopted by industry and agriculture for large-scale and unattended deployments, the need for reliable and energy-conservative protocols become critical. Physical and Link layer efforts for energy conservation are not mostly considered by routing protocols that put their efforts on maintaining reliability and throughput. Gradient-based routing protocols route data through most reliable links aiming to ensure 99% packet delivery. However, they suffer from the so-called "hot spot" problem. Most reliable routes waste their energy fast, thus partitioning the network and reducing the area monitored. To cope with this "hot spot" problem we propose ZERO a combined approach at Network and Link layers to increase network lifespan while conserving reliability levels by means of probabilistic load balancing techniques.

Adaptive routing in wireless communication networks using swarm intelligence

NASA Technical Reports Server (NTRS)

Arabshahi, P.; Gray, A.; Kassabalidis, I.; Das, A.; Narayanan, S.; Sharkawi, M. El; Marks, R. J.

2001-01-01

In this paper we focus on the network routing problem, and survey swarm intelligent approaches for its efficient solution, after a brief overview of power-aware routing schemes, which are important in the network examples outlined above.

Heuristic algorithms for solving of the tool routing problem for CNC cutting machines

NASA Astrophysics Data System (ADS)

Chentsov, P. A.; Petunin, A. A.; Sesekin, A. N.; Shipacheva, E. N.; Sholohov, A. E.

2015-11-01

The article is devoted to the problem of minimizing the path of the cutting tool to shape cutting machines began. This problem can be interpreted as a generalized traveling salesman problem. Earlier version of the dynamic programming method to solve this problem was developed. Unfortunately, this method allows to process an amount not exceeding thirty circuits. In this regard, the task of constructing quasi-optimal route becomes relevant. In this paper we propose options for quasi-optimal greedy algorithms. Comparison of the results of exact and approximate algorithms is given.

A Hybrid Genetic-Simulated Annealing Algorithm for the Location-Inventory-Routing Problem Considering Returns under E-Supply Chain Environment

PubMed Central

Guo, Hao; Fu, Jing

2013-01-01

Facility location, inventory control, and vehicle routes scheduling are critical and highly related problems in the design of logistics system for e-business. Meanwhile, the return ratio in Internet sales was significantly higher than in the traditional business. Many of returned merchandise have no quality defects, which can reenter sales channels just after a simple repackaging process. Focusing on the existing problem in e-commerce logistics system, we formulate a location-inventory-routing problem model with no quality defects returns. To solve this NP-hard problem, an effective hybrid genetic simulated annealing algorithm (HGSAA) is proposed. Results of numerical examples show that HGSAA outperforms GA on computing time, optimal solution, and computing stability. The proposed model is very useful to help managers make the right decisions under e-supply chain environment. PMID:24489489

Re-Purposing Google Maps Visualisation for Teaching Logistics Systems

ERIC Educational Resources Information Center

Cheong, France; Cheong, Christopher; Jie, Ferry

2012-01-01

Routing is the process of selecting appropriate paths and ordering waypoints in a network. It plays an important part in logistics and supply chain management as choosing the optimal route can minimise distribution costs. Routing optimisation, however, is a difficult problem to solve and computer software is often used to determine the best route.…

Peninsula transportation district commission route deviation feasibility study.

DOT National Transportation Integrated Search

1998-11-01

Many urban transit providers are faced with the problem of declining ridership on traditional fixed route services in low density suburban areas. As a result, many fixed route services in such areas are not economically viable for the transit provide...

A Two-Echelon Cooperated Routing Problem for a Ground Vehicle and Its Carried Unmanned Aerial Vehicle

PubMed Central

Luo, Zhihao; Liu, Zhong; Shi, Jianmai

2017-01-01

In this paper, a two-echelon cooperated routing problem for the ground vehicle (GV) and its carried unmanned aerial vehicle (UAV) is investigated, where the GV travels on the road network and its UAV travels in areas beyond the road to visit a number of targets unreached by the GV. In contrast to the classical two-echelon routing problem, the UAV has to launch and land on the GV frequently to change or charge its battery while the GV is moving on the road network. A new 0–1 integer programming model is developed to formulate the problem, where the constraints on the spatial and temporal cooperation of GV and UAV routes are included. Two heuristics are proposed to solve the model: the first heuristic (H1) constructs a complete tour for all targets and splits it by GV routes, while the second heuristic (H2) constructs the GV tour and assigns UAV flights to it. Random instances with six different sizes (25–200 targets, 12–80 rendezvous nodes) are used to test the algorithms. Computational results show that H1 performs slightly better than H2, while H2 uses less time and is more stable. PMID:28513552

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

NASA Astrophysics Data System (ADS)

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.

Vervet monkeys use paths consistent with context-specific spatial movement heuristics.

PubMed

Teichroeb, Julie A

2015-10-01

Animal foraging routes are analogous to the computationally demanding "traveling salesman problem" (TSP), where individuals must find the shortest path among several locations before returning to the start. Humans approximate solutions to TSPs using simple heuristics or "rules of thumb," but our knowledge of how other animals solve multidestination routing problems is incomplete. Most nonhuman primate species have shown limited ability to route plan. However, captive vervets were shown to solve a TSP for six sites. These results were consistent with either planning three steps ahead or a risk-avoidance strategy. I investigated how wild vervet monkeys (Chlorocebus pygerythrus) solved a path problem with six, equally rewarding food sites; where site arrangement allowed assessment of whether vervets found the shortest route and/or used paths consistent with one of three simple heuristics to navigate. Single vervets took the shortest possible path in fewer than half of the trials, usually in ways consistent with the most efficient heuristic (the convex hull). When in competition, vervets' paths were consistent with different, more efficient heuristics dependent on their dominance rank (a cluster strategy for dominants and the nearest neighbor rule for subordinates). These results suggest that, like humans, vervets may solve multidestination routing problems by applying simple, adaptive, context-specific "rules of thumb." The heuristics that were consistent with vervet paths in this study are the same as some of those asserted to be used by humans. These spatial movement strategies may have common evolutionary roots and be part of a universal mental navigational toolkit. Alternatively, they may have emerged through convergent evolution as the optimal way to solve multidestination routing problems.

strange beta: An assistance system for indoor rock climbing route setting

NASA Astrophysics Data System (ADS)

Phillips, C.; Becker, L.; Bradley, E.

2012-03-01

This paper applies the mathematics of chaos to the task of designing indoor rock-climbing routes. Chaotic variation has been used to great advantage on music and dance, but the challenges here are quite different, beginning with the representation. We present a formalized system for transcribing rock climbing problems and then describe a variation generator that is designed to support human route-setters in designing new and interesting climbing problems. This variation generator, termed strange beta, uses chaos to introduce novelty. We validated this approach with a large blinded study in a commercial climbing gym, in cooperation with experienced climbers and expert route setters. The results show that strange beta can help a human setter produce routes that are at least as good as, and in some cases better than, those produced in the traditional manner.

A network flow model for load balancing in circuit-switched multicomputers

NASA Technical Reports Server (NTRS)

Bokhari, Shahid H.

1990-01-01

In multicomputers that utilize circuit switching or wormhole routing, communication overhead depends largely on link contention - the variation due to distance between nodes is negligible. This has a major impact on the load balancing problem. In this case, there are some nodes with excess load (sources) and others with deficit load (sinks) and it is required to find a matching of sources to sinks that avoids contention. The problem is made complex by the hardwired routing on currently available machines: the user can control only which nodes communicate but not how the messages are routed. Network flow models of message flow in the mesh and the hypercube were developed to solve this problem. The crucial property of these models is the correspondence between minimum cost flows and correctly routed messages. To solve a given load balancing problem, a minimum cost flow algorithm is applied to the network. This permits one to determine efficiently a maximum contention free matching of sources to sinks which, in turn, tells one how much of the given imbalance can be eliminated without contention.

Development of the child's voice: premutation, mutation.

PubMed

Hacki, T; Heitmüller, S

1999-10-05

Voice range profile (VRP) measurement was used to evaluate the vocal capabilities of 180 children aged between 4 and 12 years without voice pathology. There were 10 boys and 10 girls in each age group. Using an automatic VRP measurement system, F0 and SPL dB (lin) were determined and displayed two-dimensionally in real time. The speaking voice, the shouting voice and the singing voice were investigated. The results show that vocal capabilities grow with advancing age, but not continuously. The lowering of the habitual pitch of the speaking voice as well as of the entire speaking pitch range occurs for girls between the ages of 7 and 8, for boys between 8 and 9. A temporary restriction of the minimum vocal intensity of the speaking voice (the ability to speak softly) as well as of the singing voice occurs for girls and for boys at the age of 7-8. A decrease of the maximum speech intensity is found for girls at the age of between 7 and 8, for boys between 8 and 9. A lowering of the pitch as well as of the intensity of the shouting voice occurs for both sexes from the age of 10. In contrast to earlier general opinion we note for girls a stage of premutation (between the age of 7 and 8) with essentially the same changes seen among boys, but 1 year earlier. The beginning of the mutation can be fixed at the age of 10-11 years.

A review on the modelling of collection and distribution of blood donation based on vehicle routing problem

NASA Astrophysics Data System (ADS)

Azezan, Nur Arif; Ramli, Mohammad Fadzli; Masran, Hafiz

2017-11-01

In this paper, we discussed a literature on blood collection-distribution that based on vehicle routing problem. This problem emergence when the process from collection to stock up must be completed in timely manner. We also modified the mathematical model so that it will suited to general collection of blood. A discussion on its algorithm and solution methods are also pointed out briefly in this paper.

Using real time traveler demand data to optimize commuter rail feeder systems.

DOT National Transportation Integrated Search

2012-08-01

"This report focuses on real time optimization of the Commuter Rail Circulator Route Network Design Problem (CRCNDP). The route configuration of the circulator system where to stop and the route among the stops is determined on a real-time ba...

Road Risk Modeling and Cloud-Aided Safety-Based Route Planning.

PubMed

Li, Zhaojian; Kolmanovsky, Ilya; Atkins, Ella; Lu, Jianbo; Filev, Dimitar P; Michelini, John

2016-11-01

This paper presents a safety-based route planner that exploits vehicle-to-cloud-to-vehicle (V2C2V) connectivity. Time and road risk index (RRI) are considered as metrics to be balanced based on user preference. To evaluate road segment risk, a road and accident database from the highway safety information system is mined with a hybrid neural network model to predict RRI. Real-time factors such as time of day, day of the week, and weather are included as correction factors to the static RRI prediction. With real-time RRI and expected travel time, route planning is formulated as a multiobjective network flow problem and further reduced to a mixed-integer programming problem. A V2C2V implementation of our safety-based route planning approach is proposed to facilitate access to real-time information and computing resources. A real-world case study, route planning through the city of Columbus, Ohio, is presented. Several scenarios illustrate how the "best" route can be adjusted to favor time versus safety metrics.

Robust Dynamic Multi-objective Vehicle Routing Optimization Method.

PubMed

Guo, Yi-Nan; Cheng, Jian; Luo, Sha; Gong, Dun-Wei

2017-03-21

For dynamic multi-objective vehicle routing problems, the waiting time of vehicle, the number of serving vehicles, the total distance of routes were normally considered as the optimization objectives. Except for above objectives, fuel consumption that leads to the environmental pollution and energy consumption was focused on in this paper. Considering the vehicles' load and the driving distance, corresponding carbon emission model was built and set as an optimization objective. Dynamic multi-objective vehicle routing problems with hard time windows and randomly appeared dynamic customers, subsequently, were modeled. In existing planning methods, when the new service demand came up, global vehicle routing optimization method was triggered to find the optimal routes for non-served customers, which was time-consuming. Therefore, robust dynamic multi-objective vehicle routing method with two-phase is proposed. Three highlights of the novel method are: (i) After finding optimal robust virtual routes for all customers by adopting multi-objective particle swarm optimization in the first phase, static vehicle routes for static customers are formed by removing all dynamic customers from robust virtual routes in next phase. (ii)The dynamically appeared customers append to be served according to their service time and the vehicles' statues. Global vehicle routing optimization is triggered only when no suitable locations can be found for dynamic customers. (iii)A metric measuring the algorithms' robustness is given. The statistical results indicated that the routes obtained by the proposed method have better stability and robustness, but may be sub-optimum. Moreover, time-consuming global vehicle routing optimization is avoided as dynamic customers appear.

A Formal Algorithm for Routing Traces on a Printed Circuit Board

NASA Technical Reports Server (NTRS)

Hedgley, David R., Jr.

1996-01-01

This paper addresses the classical problem of printed circuit board routing: that is, the problem of automatic routing by a computer other than by brute force that causes the execution time to grow exponentially as a function of the complexity. Most of the present solutions are either inexpensive but not efficient and fast, or efficient and fast but very costly. Many solutions are proprietary, so not much is written or known about the actual algorithms upon which these solutions are based. This paper presents a formal algorithm for routing traces on a print- ed circuit board. The solution presented is very fast and efficient and for the first time speaks to the question eloquently by way of symbolic statements.

A set-covering formulation for a drayage problem with single and double container loads

NASA Astrophysics Data System (ADS)

Ghezelsoflu, A.; Di Francesco, M.; Frangioni, A.; Zuddas, P.

2018-01-01

This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality by a commercial solver, significantly outperforming a previously proposed node-arc formulation. Moreover, the model can be effectively used to evaluate a new distribution policy, which results in an enlarged set of feasible routes and can increase savings w.r.t. the policy currently employed by the carrier.

A game theory-based obstacle avoidance routing protocol for wireless sensor networks.

PubMed

Guan, Xin; Wu, Huayang; Bi, Shujun

2011-01-01

The obstacle avoidance problem in geographic forwarding is an important issue for location-based routing in wireless sensor networks. The presence of an obstacle leads to several geographic routing problems such as excessive energy consumption and data congestion. Obstacles are hard to avoid in realistic environments. To bypass obstacles, most routing protocols tend to forward packets along the obstacle boundaries. This leads to a situation where the nodes at the boundaries exhaust their energy rapidly and the obstacle area is diffused. In this paper, we introduce a novel routing algorithm to solve the obstacle problem in wireless sensor networks based on a game-theory model. Our algorithm forms a concave region that cannot forward packets to achieve the aim of improving the transmission success rate and decreasing packet transmission delays. We consider the residual energy, out-degree and forwarding angle to determine the forwarding probability and payoff function of forwarding candidates. This achieves the aim of load balance and reduces network energy consumption. Simulation results show that based on the average delivery delay, energy consumption and packet delivery ratio performances our protocol is superior to other traditional schemes.

Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

PubMed

Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

2016-07-14

Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption.

Analysis of the single-vehicle cyclic inventory routing problem

NASA Astrophysics Data System (ADS)

Aghezzaf, El-Houssaine; Zhong, Yiqing; Raa, Birger; Mateo, Manel

2012-11-01

The single-vehicle cyclic inventory routing problem (SV-CIRP) consists of a repetitive distribution of a product from a single depot to a selected subset of customers. For each customer, selected for replenishments, the supplier collects a corresponding fixed reward. The objective is to determine the subset of customers to replenish, the quantity of the product to be delivered to each and to design the vehicle route so that the resulting profit (difference between the total reward and the total logistical cost) is maximised while preventing stockouts at each of the selected customers. This problem appears often as a sub-problem in many logistical problems. In this article, the SV-CIRP is formulated as a mixed-integer program with a nonlinear objective function. After a thorough analysis of the structure of the problem and its features, an exact algorithm for its solution is proposed. This exact algorithm requires only solutions of linear mixed-integer programs. Values of a savings-based heuristic for this problem are compared to the optimal values obtained for a set of some test problems. In general, the gap may get as large as 25%, which justifies the effort to continue exploring and developing exact and approximation algorithms for the SV-CIRP.

Determination of optimal self-drive tourism route using the orienteering problem method

NASA Astrophysics Data System (ADS)

Hashim, Zakiah; Ismail, Wan Rosmanira; Ahmad, Norfaieqah

2013-04-01

This paper was conducted to determine the optimal travel routes for self-drive tourism based on the allocation of time and expense by maximizing the amount of attraction scores assigned to each city involved. Self-drive tourism represents a type of tourism where tourists hire or travel by their own vehicle. It only involves a tourist destination which can be linked with a network of roads. Normally, the traveling salesman problem (TSP) and multiple traveling salesman problems (MTSP) method were used in the minimization problem such as determination the shortest time or distance traveled. This paper involved an alternative approach for maximization method which is maximize the attraction scores and tested on tourism data for ten cities in Kedah. A set of priority scores are used to set the attraction score at each city. The classical approach of the orienteering problem was used to determine the optimal travel route. This approach is extended to the team orienteering problem and the two methods were compared. These two models have been solved by using LINGO12.0 software. The results indicate that the model involving the team orienteering problem provides a more appropriate solution compared to the orienteering problem model.

Generation and Characterization of Protective Antibodies to Marburg Virus

DTIC Science & Technology

2017-04-03

of cells following viral replication of the complex. The macaque developed increasing anti-GP Ab titers as evaluated by ELISA with a titer of 1:12800...those of the author and are not necessarily endorsed by the U.S. Army. SUPPLEMENTAL DATA: Table S-1. ELISA serum titer response following each...x 400 µL at 0.9x109 VRP/mL ELISA Titer (GP) NT >1/316,000 1/500,000 NT ELISA Titer (Live Virus) NT >1/316,000 1/450,000 NT Table S-2

A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack-From a Green Operation Perspective.

PubMed

Xia, Yangkun; Fu, Zhuo; Tsai, Sang-Bing; Wang, Jiangtao

2018-05-10

In order to promote the development of low-carbon logistics and economize logistics distribution costs, the vehicle routing problem with split deliveries by backpack is studied. With the help of the model of classical capacitated vehicle routing problem, in this study, a form of discrete split deliveries was designed in which the customer demand can be split only by backpack. A double-objective mathematical model and the corresponding adaptive tabu search (TS) algorithm were constructed for solving this problem. By embedding the adaptive penalty mechanism, and adopting the random neighborhood selection strategy and reinitialization principle, the global optimization ability of the new algorithm was enhanced. Comparisons with the results in the literature show the effectiveness of the proposed algorithm. The proposed method can save the costs of low-carbon logistics and reduce carbon emissions, which is conducive to the sustainable development of low-carbon logistics.

An Effective Evolutionary Approach for Bicriteria Shortest Path Routing Problems

NASA Astrophysics Data System (ADS)

Lin, Lin; Gen, Mitsuo

Routing problem is one of the important research issues in communication network fields. In this paper, we consider a bicriteria shortest path routing (bSPR) model dedicated to calculating nondominated paths for (1) the minimum total cost and (2) the minimum transmission delay. To solve this bSPR problem, we propose a new multiobjective genetic algorithm (moGA): (1) an efficient chromosome representation using the priority-based encoding method; (2) a new operator of GA parameters auto-tuning, which is adaptively regulation of exploration and exploitation based on the change of the average fitness of parents and offspring which is occurred at each generation; and (3) an interactive adaptive-weight fitness assignment mechanism is implemented that assigns weights to each objective and combines the weighted objectives into a single objective function. Numerical experiments with various scales of network design problems show the effectiveness and the efficiency of our approach by comparing with the recent researches.

Travel optimization by foraging bumblebees through readjustments of traplines after discovery of new feeding locations.

PubMed

Lihoreau, Mathieu; Chittka, Lars; Raine, Nigel E

2010-12-01

Animals collecting resources that replenish over time often visit patches in predictable sequences called traplines. Despite the widespread nature of this strategy, we still know little about how spatial memory develops and guides individuals toward suitable routes. Here, we investigate whether flower visitation sequences by bumblebees Bombus terrestris simply reflect the order in which flowers were discovered or whether they result from more complex navigational strategies enabling bees to optimize their foraging routes. We analyzed bee flight movements in an array of four artificial flowers maximizing interfloral distances. Starting from a single patch, we sequentially added three new patches so that if bees visited them in the order in which they originally encountered flowers, they would follow a long (suboptimal) route. Bees' tendency to visit patches in their discovery order decreased with experience. Instead, they optimized their flight distances by rearranging flower visitation sequences. This resulted in the development of a primary route (trapline) and two or three less frequently used secondary routes. Bees consistently used these routes after overnight breaks while occasionally exploring novel possibilities. We discuss how maintaining some level of route flexibility could allow traplining animals to cope with dynamic routing problems, analogous to the well-known traveling salesman problem.

A Food Chain Algorithm for Capacitated Vehicle Routing Problem with Recycling in Reverse Logistics

NASA Astrophysics Data System (ADS)

Song, Qiang; Gao, Xuexia; Santos, Emmanuel T.

2015-12-01

This paper introduces the capacitated vehicle routing problem with recycling in reverse logistics, and designs a food chain algorithm for it. Some illustrative examples are selected to conduct simulation and comparison. Numerical results show that the performance of the food chain algorithm is better than the genetic algorithm, particle swarm optimization as well as quantum evolutionary algorithm.

Operations management in distribution networks within a smart city framework.

PubMed

Cerulli, Raffaele; Dameri, Renata Paola; Sciomachen, Anna

2017-02-20

This article studies a vehicle routing problem with environmental constraints that are motivated by the requirements for sustainable urban transport. The empirical research presents a fleet planning problem that takes into consideration both minimum cost vehicle routes and minimum pollution. The problem is formulated as a mixed integer linear programming model and experimentally validated using data collected from a real situation: a grocery company delivering goods ordered via e-channels to customers spread in the urban and metropolitan area of Genoa smart city. The proposed model is a variant of the vehicle routing problem tailored to include environmental issues and street limitations. Its novelty regards also the use of real data instances provided by the B2C grocery company. Managerial implications are the choice of both the routes and the number and type of vehicles. Results show that commercial distribution strategies achieve better results in term of both business and environmental performance, provided the smart mobility goals and constraints are included into the distribution model from the beginning. © The authors 2017. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.

Reverse Flood Routing with the Lag-and-Route Storage Model

NASA Astrophysics Data System (ADS)

Mazi, K.; Koussis, A. D.

2010-09-01

This work presents a method for reverse routing of flood waves in open channels, which is an inverse problem of the signal identification type. Inflow determination from outflow measurements is useful in hydrologic forensics and in optimal reservoir control, but has been seldom studied. Such problems are ill posed and their solution is sensitive to small perturbations present in the data, or to any related uncertainty. Therefore the major difficulty in solving this inverse problem consists in controlling the amplification of errors that inevitably befall flow measurements, from which the inflow signal is to be determined. The lag-and-route model offers a convenient framework for reverse routing, because not only is formal deconvolution not required, but also reverse routing is through a single linear reservoir. In addition, this inversion degenerates to calculating the intermediate inflow (prior to the lag step) simply as the sum of the outflow and of its time derivative multiplied by the reservoir’s time constant. The remaining time shifting (lag) of the intermediate, reversed flow presents no complications, as pure translation causes no error amplification. Note that reverse routing with the inverted Muskingum scheme (Koussis et al., submitted to the 12th Plinius Conference) fails when that scheme is specialised to the Kalinin-Miljukov model (linear reservoirs in series). The principal functioning of the reverse routing procedure was verified first with perfect field data (outflow hydrograph generated by forward routing of a known inflow hydrograph). The field data were then seeded with random error. To smooth the oscillations caused by the imperfect (measured) outflow data, we applied a multipoint Savitzky-Golay low-pass filter. The combination of reverse routing and filtering achieved an effective recovery of the inflow signal extremely efficiently. Specifically, we compared the reverse routing results of the inverted lag-and-route model and of the inverted Kalinin-Miljukov model. The latter applies the lag-and-route model’s single-reservoir inversion scheme sequentially to its cascade of linear reservoirs, the number of which is related to the stream's hydromorphology. For this purpose, we used the example of Bruen & Dooge (2007), who back-routed flow hydrographs in a 100-km long prismatic channel using a scheme for the reverse solution of the St. Venant equations of flood wave motion. The lag-and-route reverse routing model recovered the inflow hydrograph with comparable accuracy to that of the multi-reservoir, inverted Kalinin-Miljukov model, both performing as well as the box-scheme for reverse routing with the St. Venant equations. In conclusion, the success in the regaining of the inflow signal by the devised single-reservoir reverse routing procedure, with multipoint low-pass filtering, can be attributed to its simple computational structure that endows it with remarkable robustness and exceptional efficiency.

Enhanced method of fast re-routing with load balancing in software-defined networks

NASA Astrophysics Data System (ADS)

Lemeshko, Oleksandr; Yeremenko, Oleksandra

2017-11-01

A two-level method of fast re-routing with load balancing in a software-defined network (SDN) is proposed. The novelty of the method consists, firstly, in the introduction of a two-level hierarchy of calculating the routing variables responsible for the formation of the primary and backup paths, and secondly, in ensuring a balanced load of the communication links of the network, which meets the requirements of the traffic engineering concept. The method provides implementation of link, node, path, and bandwidth protection schemes for fast re-routing in SDN. The separation in accordance with the interaction prediction principle along two hierarchical levels of the calculation functions of the primary (lower level) and backup (upper level) routes allowed to abandon the initial sufficiently large and nonlinear optimization problem by transiting to the iterative solution of linear optimization problems of half the dimension. The analysis of the proposed method confirmed its efficiency and effectiveness in terms of obtaining optimal solutions for ensuring balanced load of communication links and implementing the required network element protection schemes for fast re-routing in SDN.

On Intelligent Design and Planning Method of Process Route Based on Gun Breech Machining Process

NASA Astrophysics Data System (ADS)

Hongzhi, Zhao; Jian, Zhang

2018-03-01

The paper states an approach of intelligent design and planning of process route based on gun breech machining process, against several problems, such as complex machining process of gun breech, tedious route design and long period of its traditional unmanageable process route. Based on gun breech machining process, intelligent design and planning system of process route are developed by virtue of DEST and VC++. The system includes two functional modules--process route intelligent design and its planning. The process route intelligent design module, through the analysis of gun breech machining process, summarizes breech process knowledge so as to complete the design of knowledge base and inference engine. And then gun breech process route intelligently output. On the basis of intelligent route design module, the final process route is made, edited and managed in the process route planning module.

Bi-Objective Modelling for Hazardous Materials Road–Rail Multimodal Routing Problem with Railway Schedule-Based Space–Time Constraints

PubMed Central

Sun, Yan; Lang, Maoxiang; Wang, Danzhu

2016-01-01

The transportation of hazardous materials is always accompanied by considerable risk that will impact public and environment security. As an efficient and reliable transportation organization, a multimodal service should participate in the transportation of hazardous materials. In this study, we focus on transporting hazardous materials through the multimodal service network and explore the hazardous materials multimodal routing problem from the operational level of network planning. To formulate this problem more practicably, minimizing the total generalized costs of transporting the hazardous materials and the social risk along the planned routes are set as the optimization objectives. Meanwhile, the following formulation characteristics will be comprehensively modelled: (1) specific customer demands; (2) multiple hazardous material flows; (3) capacitated schedule-based rail service and uncapacitated time-flexible road service; and (4) environmental risk constraint. A bi-objective mixed integer nonlinear programming model is first built to formulate the routing problem that combines the formulation characteristics above. Then linear reformations are developed to linearize and improve the initial model so that it can be effectively solved by exact solution algorithms on standard mathematical programming software. By utilizing the normalized weighted sum method, we can generate the Pareto solutions to the bi-objective optimization problem for a specific case. Finally, a large-scale empirical case study from the Beijing–Tianjin–Hebei Region in China is presented to demonstrate the feasibility of the proposed methods in dealing with the practical problem. Various scenarios are also discussed in the case study. PMID:27483294

A method for joint routing, wavelength dimensioning and fault tolerance for any set of simultaneous failures on dynamic WDM optical networks

NASA Astrophysics Data System (ADS)

Jara, Nicolás; Vallejos, Reinaldo; Rubino, Gerardo

2017-11-01

The design of optical networks decomposes into different tasks, where the engineers must basically organize the way the main system's resources are used, minimizing the design and operation costs and respecting critical performance constraints. More specifically, network operators face the challenge of solving routing and wavelength dimensioning problems while aiming to simultaneously minimize the network cost and to ensure that the network performance meets the level established in the Service Level Agreement (SLA). We call this the Routing and Wavelength Dimensioning (R&WD) problem. Another important problem to be solved is how to deal with failures of links when the network is operating. When at least one link fails, a high rate of data loss may occur. To avoid it, the network must be designed in such a manner that upon one or multiple failures, the affected connections can still communicate using alternative routes, a mechanism known as Fault Tolerance (FT). When the mechanism allows to deal with an arbitrary number of faults, we speak about Multiple Fault Tolerance (MFT). The different tasks before mentioned are usually solved separately, or in some cases by pairs, leading to solutions that are not necessarily close to optimal ones. This paper proposes a novel method to simultaneously solve all of them, that is, the Routing, the Wavelength Dimensioning, and the Multiple Fault Tolerance problems. The method allows to obtain: a) all the primary routes by which each connection normally transmits its information, b) the additional routes, called secondary routes, used to keep each user connected in cases where one or more simultaneous failures occur, and c) the number of wavelengths available at each link of the network, calculated such that the blocking probability of each connection is lower than a pre-determined threshold (which is a network design parameter), despite the occurrence of simultaneous link failures. The solution obtained by the new algorithm is significantly more efficient than current methods, its implementation is notably simple and its on-line operation is very fast. In the paper, different examples illustrate the results provided by the proposed technique.

Vertical radar profiles for the calibration of unsaturated flow models under dynamic water table conditions

NASA Astrophysics Data System (ADS)

Cassiani, G.; Gallotti, L.; Ventura, V.; Andreotti, G.

2003-04-01

The identification of flow and transport characteristics in the vadose zone is a fundamental step towards understanding the dynamics of contaminated sites and the resulting risk of groundwater pollution. Borehole radar has gained popularity for the monitoring of moisture content changes, thanks to its apparent simplicity and its high resolution characteristics. However, cross-hole radar requires closely spaced (a few meters), plastic-cased boreholes, that are rarely available as a standard feature in sites of practical interest. Unlike cross-hole applications, Vertical Radar Profiles (VRP) require only one borehole, with practical and financial benefits. High-resolution, time-lapse VRPs have been acquired at a crude oil contaminated site in Trecate, Northern Italy, on a few existing boreholes originally developed for remediation via bioventing. The dynamic water table conditions, with yearly oscillations of roughly 5 m from 6 to 11 m bgl, offers a good opportunity to observe via VRP a field scale drainage-imbibition process. Arrival time inversion has been carried out using a regularized tomographic algorithm, in order to overcome the noise introduced by first arrival picking. Interpretation of the vertical profiles in terms of moisture content has been based on standard models (Topp et al., 1980; Roth et al., 1990). The sedimentary sequence manifests itself as a cyclic pattern in moisture content over most of the profiles. We performed preliminary Richards' equation simulations with time varying later table boundary conditions, in order to estimate the unsaturated flow parameters, and the results have been compared with laboratory evidence from cores.

Expression of LIGHT/TNFSF14 Combined with Vaccination against Human Papillomavirus Type 16 E7 Induces Significant Tumor Regression

PubMed Central

Kanodia, Shreya; Da Silva, Diane M.; Karamanukyan, Tigran; Bogaert, Lies; Fu, Yang-Xin; Kast, W. Martin

2010-01-01

LIGHT, a ligand for the lymphotoxin-beta receptor, establishes lymphoid-like tissues inside tumor sites and recruits naïve T-cells into the tumor. However, whether these infiltrating T-cells are specific for tumor antigens is not known. We hypothesized that therapy with LIGHT can expand functional tumor-specific CD8+ T-cells that can be boosted using HPV16E6E7-Venezuelan Equine Encephalitis Virus Replicon Particles (HPV16-VRP) and that this combined therapy can eradicate HPV16-induced tumors. Our data show that forced expression of LIGHT in tumors results in an increase in expression of interferon gamma (IFNg) and chemottractant cytokines such as IL-1a, MIG and MIP-2 within the tumor and that this tumor microenvironment correlates with an increase in frequency of tumor-infiltrating CD8+ T-cells. Forced expression of LIGHT also results in the expansion of functional T-cells that recognize multiple tumor-antigens, including HPV16 E7, and these T-cells prevent the outgrowth of tumors upon secondary challenge. Subsequent boosting of E7-specific T-cells by vaccination with HPV16-VRP significantly increases their frequency in both the periphery and the tumor, and leads to the eradication of large well-established tumors, for which either treatment alone is not successful. These data establish the safety of Ad-LIGHT as a therapeutic intervention in pre-clinical studies and suggest that patients with HPV16+ tumors may benefit from combined immunotherapy with LIGHT and antigen-specific vaccination. PMID:20460520

Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks

PubMed Central

Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

2016-01-01

Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle’s position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption. PMID:27428971

Strange Beta: Chaotic Variations for Indoor Rock Climbing Route Setting

NASA Astrophysics Data System (ADS)

Phillips, Caleb; Bradley, Elizabeth

2011-04-01

In this paper we apply chaotic systems to the task of sequence variation for the purpose of aiding humans in setting indoor rock climbing routes. This work expands on prior work where similar variations were used to assist in dance choreography and music composition. We present a formalization for transcription of rock climbing problems and a variation generator that is tuned for this domain and addresses some confounding problems, including a new approach to automatic selection of initial conditions. We analyze our system with a large blinded study in a commercial climbing gym in cooperation with experienced climbers and expert route setters. Our results show that our system is capable of assisting a human setter in producing routes that are at least as good as, and in some cases better than, those produced traditionally.

A Mathematical Model and Algorithm for Routing Air Traffic Under Weather Uncertainty

NASA Technical Reports Server (NTRS)

Sadovsky, Alexander V.

2016-01-01

A central challenge in managing today's commercial en route air traffic is the task of routing the aircraft in the presence of adverse weather. Such weather can make regions of the airspace unusable, so all affected flights must be re-routed. Today this task is carried out by conference and negotiation between human air traffic controllers (ATC) responsible for the involved sectors of the airspace. One can argue that, in so doing, ATC try to solve an optimization problem without giving it a precise quantitative formulation. Such a formulation gives the mathematical machinery for constructing and verifying algorithms that are aimed at solving the problem. This paper contributes one such formulation and a corresponding algorithm. The algorithm addresses weather uncertainty and has closed form, which allows transparent analysis of correctness, realism, and computational costs.

Operations Research Applied to Libraries.

ERIC Educational Resources Information Center

Nussbaum, Harvey

This report discusses the seven basic types of problems found in business and industry as they apply to library institutions. These seven basic types are: (1) inventory problems, (2) allocation problems, (3) queueing problems, (4) sequencing problems, (5) routing problems, (6) replacement problems and (7) search problems. (MF)

Formal Approach For Resilient Reachability based on End-System Route Agility

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rauf, Usman; Gillani, Fida; Al-Shaer, Ehab

The deterministic nature of existing routing protocols has resulted into an ossified Internet with static and predictable network routes. This gives persistent attackers (e.g. eavesdroppers and DDoS attackers) plenty of time to study the network and identify the vulnerable links (critical) to plan a devastating and stealthy attack. Recently, route mutation approaches have been proposed to address such issues. However, these approaches incur significantly high overhead and depend upon the availability of disjoint routes in the network, which inherently limit their use for mission critical services. To cope with these issues, we extend the current routing architecture to consider end-hostsmore » as routing elements, and present a formal method based agile defense mechanism to increase resiliency of the existing cyber infrastructure. The major contributions of this paper include: (1) formalization of efficient and resilient End to End (E2E) reachability problem as a constraint satisfaction problem, which identifies the potential end-hosts to reach a destination while satisfying resilience and QoS constraints, (2) design and implementation of a novel decentralized End Point Route Mutation (EPRM) protocol, and (3) design and implementation of planning algorithm to minimize the overlap between multiple flows, for the sake of maximizing the agility in the system. Our implementation and evaluation validates the correctness, effectiveness and scalability of the proposed approach.« less

Optimal routing of IP packets to multi-homed servers

NASA Astrophysics Data System (ADS)

Swartz, K. L.

1992-08-01

Multi-homing, or direct attachment to multiple networks, offers both performance and availability benefits for important servers on busy networks. Exploiting these benefits to their fullest requires a modicum of routing knowledge in the clients. Careful policy control must also be reflected in the routing used within the network to make best use of specialized and often scarce resources. While relatively straightforward in theory, this problem becomes much more difficult to solve in a real network containing often intractable implementations from a variety of vendors. This paper presents an analysis of the problem and proposes a useful solution for a typical campus network. Application of this solution at the Stanford Linear Accelerator Center is studied and the problems and pitfalls encountered are discussed, as are the workarounds used to make the system work in the real world.

Nonlinear relative-proportion-based route adjustment process for day-to-day traffic dynamics: modeling, equilibrium and stability analysis

NASA Astrophysics Data System (ADS)

Zhu, Wenlong; Ma, Shoufeng; Tian, Junfang; Li, Geng

2016-11-01

Travelers' route adjustment behaviors in a congested road traffic network are acknowledged as a dynamic game process between them. Existing Proportional-Switch Adjustment Process (PSAP) models have been extensively investigated to characterize travelers' route choice behaviors; PSAP has concise structure and intuitive behavior rule. Unfortunately most of which have some limitations, i.e., the flow over adjustment problem for the discrete PSAP model, the absolute cost differences route adjustment problem, etc. This paper proposes a relative-Proportion-based Route Adjustment Process (rePRAP) maintains the advantages of PSAP and overcomes these limitations. The rePRAP describes the situation that travelers on higher cost route switch to those with lower cost at the rate that is unilaterally depended on the relative cost differences between higher cost route and its alternatives. It is verified to be consistent with the principle of the rational behavior adjustment process. The equivalence among user equilibrium, stationary path flow pattern and stationary link flow pattern is established, which can be applied to judge whether a given network traffic flow has reached UE or not by detecting the stationary or non-stationary state of link flow pattern. The stability theorem is proved by the Lyapunov function approach. A simple example is tested to demonstrate the effectiveness of the rePRAP model.

Optical slotted circuit switched network: a bandwidth efficient alternative to wavelength-routed network

NASA Astrophysics Data System (ADS)

Li, Yan; Collier, Martin

2007-11-01

Wavelength-routed networks have received enormous attention due to the fact that they are relatively simple to implement and implicitly offer Quality of Service (QoS) guarantees. However, they suffer from a bandwidth inefficiency problem and require complex Routing and Wavelength Assignment (RWA). Most attempts to address the above issues exploit the joint use of WDM and TDM technologies. The resultant TDM-based wavelength-routed networks partition the wavelength bandwidth into fixed-length time slots organized as a fixed-length frame. Multiple connections can thus time-share a wavelength and the grooming of their traffic leads to better bandwidth utilization. The capability of switching in both wavelength and time domains in such networks also mitigates the RWA problem. However, TMD-based wavelength-routed networks work in synchronous mode and strict synchronization among all network nodes is required. Global synchronization for all-optical networks which operate at extremely high speed is technically challenging, and deploying an optical synchronizer for each wavelength involves considerable cost. An Optical Slotted Circuit Switching (OSCS) architecture is proposed in this paper. In an OSCS network, slotted circuits are created to better utilize the wavelength bandwidth than in classic wavelength-routed networks. The operation of the protocol is such as to avoid the need for global synchronization required by TDM-based wavelength-routed networks.

A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack—From a Green Operation Perspective

PubMed Central

Fu, Zhuo; Wang, Jiangtao

2018-01-01

In order to promote the development of low-carbon logistics and economize logistics distribution costs, the vehicle routing problem with split deliveries by backpack is studied. With the help of the model of classical capacitated vehicle routing problem, in this study, a form of discrete split deliveries was designed in which the customer demand can be split only by backpack. A double-objective mathematical model and the corresponding adaptive tabu search (TS) algorithm were constructed for solving this problem. By embedding the adaptive penalty mechanism, and adopting the random neighborhood selection strategy and reinitialization principle, the global optimization ability of the new algorithm was enhanced. Comparisons with the results in the literature show the effectiveness of the proposed algorithm. The proposed method can save the costs of low-carbon logistics and reduce carbon emissions, which is conducive to the sustainable development of low-carbon logistics. PMID:29747469

Problems With Deployment of Multi-Domained, Multi-Homed Mobile Networks

NASA Technical Reports Server (NTRS)

Ivancic, William D.

2008-01-01

This document describes numerous problems associated with deployment of multi-homed mobile platforms consisting of multiple networks and traversing large geographical areas. The purpose of this document is to provide insight to real-world deployment issues and provide information to groups that are addressing many issues related to multi-homing, policy-base routing, route optimization and mobile security - particularly those groups within the Internet Engineering Task Force.

Forwarding techniques for IP fragmented packets in a real 6LoWPAN network.

PubMed

Ludovici, Alessandro; Calveras, Anna; Casademont, Jordi

2011-01-01

Wireless Sensor Networks (WSNs) are attracting more and more interest since they offer a low-cost solution to the problem of providing a means to deploy large sensor networks in a number of application domains. We believe that a crucial aspect to facilitate WSN diffusion is to make them interoperable with external IP networks. This can be achieved by using the 6LoWPAN protocol stack. 6LoWPAN enables the transmission of IPv6 packets over WSNs based on the IEEE 802.15.4 standard. IPv6 packet size is considerably larger than that of IEEE 802.15.4 data frame. To overcome this problem, 6LoWPAN introduces an adaptation layer between the network and data link layers, allowing IPv6 packets to be adapted to the lower layer constraints. This adaptation layer provides fragmentation and header compression of IP packets. Furthermore, it also can be involved in routing decisions. Depending on which layer is responsible for routing decisions, 6LoWPAN divides routing in two categories: mesh under if the layer concerned is the adaptation layer and route over if it is the network layer. In this paper we analyze different routing solutions (route over, mesh under and enhanced route over) focusing on how they forward fragments. We evaluate their performance in terms of latency and energy consumption when transmitting IP fragmented packets. All the tests have been performed in a real 6LoWPAN implementation. After consideration of the main problems in forwarding of mesh frames in WSN, we propose and analyze a new alternative scheme based on mesh under, which we call controlled mesh under.

Forwarding Techniques for IP Fragmented Packets in a Real 6LoWPAN Network

PubMed Central

Ludovici, Alessandro; Calveras, Anna; Casademont, Jordi

2011-01-01

Wireless Sensor Networks (WSNs) are attracting more and more interest since they offer a low-cost solution to the problem of providing a means to deploy large sensor networks in a number of application domains. We believe that a crucial aspect to facilitate WSN diffusion is to make them interoperable with external IP networks. This can be achieved by using the 6LoWPAN protocol stack. 6LoWPAN enables the transmission of IPv6 packets over WSNs based on the IEEE 802.15.4 standard. IPv6 packet size is considerably larger than that of IEEE 802.15.4 data frame. To overcome this problem, 6LoWPAN introduces an adaptation layer between the network and data link layers, allowing IPv6 packets to be adapted to the lower layer constraints. This adaptation layer provides fragmentation and header compression of IP packets. Furthermore, it also can be involved in routing decisions. Depending on which layer is responsible for routing decisions, 6LoWPAN divides routing in two categories: mesh under if the layer concerned is the adaptation layer and route over if it is the network layer. In this paper we analyze different routing solutions (route over, mesh under and enhanced route over) focusing on how they forward fragments. We evaluate their performance in terms of latency and energy consumption when transmitting IP fragmented packets. All the tests have been performed in a real 6LoWPAN implementation. After consideration of the main problems in forwarding of mesh frames in WSN, we propose and analyze a new alternative scheme based on mesh under, which we call controlled mesh under. PMID:22346615

What is the optimal architecture for visual information routing?

PubMed

Wolfrum, Philipp; von der Malsburg, Christoph

2007-12-01

Analyzing the design of networks for visual information routing is an underconstrained problem due to insufficient anatomical and physiological data. We propose here optimality criteria for the design of routing networks. For a very general architecture, we derive the number of routing layers and the fanout that minimize the required neural circuitry. The optimal fanout l is independent of network size, while the number k of layers scales logarithmically (with a prefactor below 1), with the number n of visual resolution units to be routed independently. The results are found to agree with data of the primate visual system.

How Prepared Do Newly-Qualified Teachers Feel? Differences between Routes and Settings

ERIC Educational Resources Information Center

Gorard, Stephen

2017-01-01

Does it matter whether teachers are trained in schools or universities? In England, there is an ongoing change in the balance of routes to becoming a newly qualified teacher (NQT). Given this, and widely-reported problems with teacher supply, it is important to consider whether there are discernible differences between the routes in terms of their…

Entanglement-Gradient Routing for Quantum Networks.

PubMed

Gyongyosi, Laszlo; Imre, Sandor

2017-10-27

We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant measures of entanglement distribution in quantum networks. The method allows a moderate complexity decentralized routing in quantum repeater networks. The results can be applied in experimental quantum networking, future quantum Internet, and long-distance quantum communications.

A memetic optimization algorithm for multi-constrained multicast routing in ad hoc networks.

PubMed

Ramadan, Rahab M; Gasser, Safa M; El-Mahallawy, Mohamed S; Hammad, Karim; El Bakly, Ahmed M

2018-01-01

A mobile ad hoc network is a conventional self-configuring network where the routing optimization problem-subject to various Quality-of-Service (QoS) constraints-represents a major challenge. Unlike previously proposed solutions, in this paper, we propose a memetic algorithm (MA) employing an adaptive mutation parameter, to solve the multicast routing problem with higher search ability and computational efficiency. The proposed algorithm utilizes an updated scheme, based on statistical analysis, to estimate the best values for all MA parameters and enhance MA performance. The numerical results show that the proposed MA improved the delay and jitter of the network, while reducing computational complexity as compared to existing algorithms.

Wavelength converter placement for different RWA algorithms in wavelength-routed all-optical networks

NASA Astrophysics Data System (ADS)

Chu, Xiaowen; Li, Bo; Chlamtac, Imrich

2002-07-01

Sparse wavelength conversion and appropriate routing and wavelength assignment (RWA) algorithms are the two key factors in improving the blocking performance in wavelength-routed all-optical networks. It has been shown that the optimal placement of a limited number of wavelength converters in an arbitrary mesh network is an NP complete problem. There have been various heuristic algorithms proposed in the literature, in which most of them assume that a static routing and random wavelength assignment RWA algorithm is employed. However, the existing work shows that fixed-alternate routing and dynamic routing RWA algorithms can achieve much better blocking performance. Our study in this paper further demonstrates that the wavelength converter placement and RWA algorithms are closely related in the sense that a well designed wavelength converter placement mechanism for a particular RWA algorithm might not work well with a different RWA algorithm. Therefore, the wavelength converter placement and the RWA have to be considered jointly. The objective of this paper is to investigate the wavelength converter placement problem under fixed-alternate routing algorithm and least-loaded routing algorithm. Under the fixed-alternate routing algorithm, we propose a heuristic algorithm called Minimum Blocking Probability First (MBPF) algorithm for wavelength converter placement. Under the least-loaded routing algorithm, we propose a heuristic converter placement algorithm called Weighted Maximum Segment Length (WMSL) algorithm. The objective of the converter placement algorithm is to minimize the overall blocking probability. Extensive simulation studies have been carried out over three typical mesh networks, including the 14-node NSFNET, 19-node EON and 38-node CTNET. We observe that the proposed algorithms not only outperform existing wavelength converter placement algorithms by a large margin, but they also can achieve almost the same performance comparing with full wavelength conversion under the same RWA algorithm.

On using multiple routing metrics with destination sequenced distance vector protocol for MultiHop wireless ad hoc networks

NASA Astrophysics Data System (ADS)

Mehic, M.; Fazio, P.; Voznak, M.; Partila, P.; Komosny, D.; Tovarek, J.; Chmelikova, Z.

2016-05-01

A mobile ad hoc network is a collection of mobile nodes which communicate without a fixed backbone or centralized infrastructure. Due to the frequent mobility of nodes, routes connecting two distant nodes may change. Therefore, it is not possible to establish a priori fixed paths for message delivery through the network. Because of its importance, routing is the most studied problem in mobile ad hoc networks. In addition, if the Quality of Service (QoS) is demanded, one must guarantee the QoS not only over a single hop but over an entire wireless multi-hop path which may not be a trivial task. In turns, this requires the propagation of QoS information within the network. The key to the support of QoS reporting is QoS routing, which provides path QoS information at each source. To support QoS for real-time traffic one needs to know not only minimum delay on the path to the destination but also the bandwidth available on it. Therefore, throughput, end-to-end delay, and routing overhead are traditional performance metrics used to evaluate the performance of routing protocol. To obtain additional information about the link, most of quality-link metrics are based on calculation of the lost probabilities of links by broadcasting probe packets. In this paper, we address the problem of including multiple routing metrics in existing routing packets that are broadcasted through the network. We evaluate the efficiency of such approach with modified version of DSDV routing protocols in ns-3 simulator.

Effective bandwidth guaranteed routing schemes for MPLS traffic engineering

NASA Astrophysics Data System (ADS)

Wang, Bin; Jain, Nidhi

2001-07-01

In this work, we present online algorithms for dynamic routing bandwidth guaranteed label switched paths (LSPs) where LSP set-up requests (in terms of a pair of ingress and egress routers as well as its bandwidth requirement) arrive one by one and there is no a priori knowledge regarding future LSP set-up requests. In addition, we consider rerouting of LSPs in this work. Rerouting of LSPs has not been well studied in previous work on LSP routing. The need of LSP rerouting arises in a number of ways: occurrence of faults (link and/or node failures), re-optimization of existing LSPs' routes to accommodate traffic fluctuation, requests with higher priorities, and so on. We formulate the bandwidth guaranteed LSP routing with rerouting capability as a multi-commodity flow problem. The solution to this problem is used as the benchmark for comparing other computationally less costly algorithms studied in this paper. Furthermore, to more efficiently utilize the network resources, we propose online routing algorithms which route bandwidth demands over multiple paths at the ingress router to satisfy the customer requests while providing better service survivability. Traffic splitting and distribution over the multiple paths are carefully handled using table-based hashing schemes while the order of packets within a flow is preserved. Preliminary simulations are conducted to show the performance of different design choices and the effectiveness of the rerouting and multi-path routing algorithms in terms of LSP set-up request rejection probability and bandwidth blocking probability.

Research in Network Management Techniques for Tactical Data Communications Network.

DTIC Science & Technology

1982-09-01

the control period. Research areas include Packet Network modelling, adaptive network routing, network design algorithms, network design techniques...contro!lers are designed to perform their limited tasks optimally. For the dynamic routing problem considered here, the local controllers are node...feedback to finding in optimum stead-o-state routing (static strategies) under non - control which can be easily implemented in real time. congested

Randomized shortest-path problems: two related models.

PubMed

Saerens, Marco; Achbany, Youssef; Fouss, François; Yen, Luh

2009-08-01

This letter addresses the problem of designing the transition probabilities of a finite Markov chain (the policy) in order to minimize the expected cost for reaching a destination node from a source node while maintaining a fixed level of entropy spread throughout the network (the exploration). It is motivated by the following scenario. Suppose you have to route agents through a network in some optimal way, for instance, by minimizing the total travel cost-nothing particular up to now-you could use a standard shortest-path algorithm. Suppose, however, that you want to avoid pure deterministic routing policies in order, for instance, to allow some continual exploration of the network, avoid congestion, or avoid complete predictability of your routing strategy. In other words, you want to introduce some randomness or unpredictability in the routing policy (i.e., the routing policy is randomized). This problem, which will be called the randomized shortest-path problem (RSP), is investigated in this work. The global level of randomness of the routing policy is quantified by the expected Shannon entropy spread throughout the network and is provided a priori by the designer. Then, necessary conditions to compute the optimal randomized policy-minimizing the expected routing cost-are derived. Iterating these necessary conditions, reminiscent of Bellman's value iteration equations, allows computing an optimal policy, that is, a set of transition probabilities in each node. Interestingly and surprisingly enough, this first model, while formulated in a totally different framework, is equivalent to Akamatsu's model ( 1996 ), appearing in transportation science, for a special choice of the entropy constraint. We therefore revisit Akamatsu's model by recasting it into a sum-over-paths statistical physics formalism allowing easy derivation of all the quantities of interest in an elegant, unified way. For instance, it is shown that the unique optimal policy can be obtained by solving a simple linear system of equations. This second model is therefore more convincing because of its computational efficiency and soundness. Finally, simulation results obtained on simple, illustrative examples show that the models behave as expected.

Optimal route discovery for soft QOS provisioning in mobile ad hoc multimedia networks

NASA Astrophysics Data System (ADS)

Huang, Lei; Pan, Feng

2007-09-01

In this paper, we propose an optimal routing discovery algorithm for ad hoc multimedia networks whose resource keeps changing, First, we use stochastic models to measure the network resource availability, based on the information about the location and moving pattern of the nodes, as well as the link conditions between neighboring nodes. Then, for a certain multimedia packet flow to be transmitted from a source to a destination, we formulate the optimal soft-QoS provisioning problem as to find the best route that maximize the probability of satisfying its desired QoS requirements in terms of the maximum delay constraints. Based on the stochastic network resource model, we developed three approaches to solve the formulated problem: A centralized approach serving as the theoretical reference, a distributed approach that is more suitable to practical real-time deployment, and a distributed dynamic approach that utilizes the updated time information to optimize the routing for each individual packet. Examples of numerical results demonstrated that using the route discovered by our distributed algorithm in a changing network environment, multimedia applications could achieve better QoS statistically.

A new approach on auxiliary vehicle assignment in capacitated location routing problem

NASA Astrophysics Data System (ADS)

Bashiri, Mahdi; Rasoulinejad, Zeinab; Fallahzade, Ehsan

2016-03-01

The location routing problem (LRP) considers locating depots and vehicle routing decisions simultaneously. In classic LRP the number of customers in each route depends on the capacity of the vehicle. In this paper a capacitated LRP model with auxiliary vehicle assignment is presented in which the length of each route is not restricted by main vehicle capacity. Two kinds of vehicles are considered: main vehicles with higher capacity and fixed cost and auxiliary vehicles with lower capacity and fixed cost. The auxiliary vehicles can be added to the transportation system as an alternative strategy to cover the capacity limitations and they are just used to transfer goods from depots to vehicles and cannot serve the customers by themselves. To show the applicability of the proposed model, some numerical examples derived from the well-known instances are used. Moreover the model has been solved by some meta-heuristics for large sized instances. The results show the efficiency of the proposed model and the solution approach, considering the classic model and the exact solution approach, respectively.

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

PubMed Central

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

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

PubMed

Zhang, Dezhi; Wang, Xin; Li, Shuangyan; 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.

Improving delivery routes using combined heuristic and optimization in a consumer goods distribution company

NASA Astrophysics Data System (ADS)

Wibisono, E.; Santoso, A.; Sunaryo, M. A.

2017-11-01

XYZ is a distributor of various consumer goods products. The company plans its delivery routes daily and in order to obtain route construction in a short amount of time, it simplifies the process by assigning drivers based on geographic regions. This approach results in inefficient use of vehicles leading to imbalance workloads. In this paper, we propose a combined method involving heuristic and optimization to obtain better solutions in acceptable computation time. The heuristic is based on a time-oriented, nearest neighbor (TONN) to form clusters if the number of locations is higher than a certain value. The optimization part uses a mathematical modeling formulation based on vehicle routing problem that considers heterogeneous vehicles, time windows, and fixed costs (HVRPTWF) and is used to solve routing problem in clusters. A case study using data from one month of the company’s operations is analyzed, and data from one day of operations are detailed in this paper. The analysis shows that the proposed method results in 24% cost savings on that month, but it can be as high as 54% in a day.

Covariance versus correlation in capacitated vehicle routing problem-investment fund allocation problem

NASA Astrophysics Data System (ADS)

Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah@Rozita

2017-04-01

Capacitated Vehicle Routing Problem-Investment Fund Allocation Problem (CVRP-IFAP) provides investors with a sequence of assets to allocate their funds into. To minimize total risks of investment in CVRP-IFAP covariance values measure the risks between two assets. Another measure of risks are correlation values between returns. The correlation values can be used to diversify the risk of investment loss in order to optimize expected return against a certain level of risk. This study compares the total risk obtained from CVRP-IFAP when using covariance values and correlation values. Results show that CVRP-IFAP with covariance values provides lesser total risks and a significantly better measure of risk.

A Multi-Attribute Pheromone Ant Secure Routing Algorithm Based on Reputation Value for Sensor Networks

PubMed Central

Zhang, Lin; Yin, Na; Fu, Xiong; Lin, Qiaomin; Wang, Ruchuan

2017-01-01

With the development of wireless sensor networks, certain network problems have become more prominent, such as limited node resources, low data transmission security, and short network life cycles. To solve these problems effectively, it is important to design an efficient and trusted secure routing algorithm for wireless sensor networks. Traditional ant-colony optimization algorithms exhibit only local convergence, without considering the residual energy of the nodes and many other problems. This paper introduces a multi-attribute pheromone ant secure routing algorithm based on reputation value (MPASR). This algorithm can reduce the energy consumption of a network and improve the reliability of the nodes’ reputations by filtering nodes with higher coincidence rates and improving the method used to update the nodes’ communication behaviors. At the same time, the node reputation value, the residual node energy and the transmission delay are combined to formulate a synthetic pheromone that is used in the formula for calculating the random proportion rule in traditional ant-colony optimization to select the optimal data transmission path. Simulation results show that the improved algorithm can increase both the security of data transmission and the quality of routing service. PMID:28282894

A Hybrid Ant Colony Optimization Algorithm for the Extended Capacitated Arc Routing Problem.

PubMed

Li-Ning Xing; Rohlfshagen, P; Ying-Wu Chen; Xin Yao

2011-08-01

The capacitated arc routing problem (CARP) is representative of numerous practical applications, and in order to widen its scope, we consider an extended version of this problem that entails both total service time and fixed investment costs. We subsequently propose a hybrid ant colony optimization (ACO) algorithm (HACOA) to solve instances of the extended CARP. This approach is characterized by the exploitation of heuristic information, adaptive parameters, and local optimization techniques: Two kinds of heuristic information, arc cluster information and arc priority information, are obtained continuously from the solutions sampled to guide the subsequent optimization process. The adaptive parameters ease the burden of choosing initial values and facilitate improved and more robust results. Finally, local optimization, based on the two-opt heuristic, is employed to improve the overall performance of the proposed algorithm. The resulting HACOA is tested on four sets of benchmark problems containing a total of 87 instances with up to 140 nodes and 380 arcs. In order to evaluate the effectiveness of the proposed method, some existing capacitated arc routing heuristics are extended to cope with the extended version of this problem; the experimental results indicate that the proposed ACO method outperforms these heuristics.

Security-Oriented and Load-Balancing Wireless Data Routing Game in the Integration of Advanced Metering Infrastructure Network in Smart Grid

DOE Office of Scientific and Technical Information (OSTI.GOV)

He, Fulin; Cao, Yang; Zhang, Jun Jason

Ensuring flexible and reliable data routing is indispensable for the integration of Advanced Metering Infrastructure (AMI) networks, we propose a secure-oriented and load-balancing wireless data routing scheme. A novel utility function is designed based on security routing scheme. Then, we model the interactive security-oriented routing strategy among meter data concentrators or smart grid meters as a mixed-strategy network formation game. Finally, such problem results in a stable probabilistic routing scheme with proposed distributed learning algorithm. One contributions is that we studied that different types of applications affect the routing selection strategy and the strategy tendency. Another contributions is that themore » chosen strategy of our mixed routing can adaptively to converge to a new mixed strategy Nash equilibrium (MSNE) during the learning process in the smart grid.« less

Dock mediates Scar- and WASp-dependent actin polymerization through interaction with cell adhesion molecules in founder cells and fusion-competent myoblasts.

PubMed

Kaipa, Balasankara Reddy; Shao, Huanjie; Schäfer, Gritt; Trinkewitz, Tatjana; Groth, Verena; Liu, Jianqi; Beck, Lothar; Bogdan, Sven; Abmayr, Susan M; Önel, Susanne-Filiz

2013-01-01

The formation of the larval body wall musculature of Drosophila depends on the asymmetric fusion of two myoblast types, founder cells (FCs) and fusion-competent myoblasts (FCMs). Recent studies have established an essential function of Arp2/3-based actin polymerization during myoblast fusion, formation of a dense actin focus at the site of fusion in FCMs, and a thin sheath of actin in FCs and/or growing muscles. The formation of these actin structures depends on recognition and adhesion of myoblasts that is mediated by cell surface receptors of the immunoglobulin superfamily. However, the connection of the cell surface receptors with Arp2/3-based actin polymerization is poorly understood. To date only the SH2-SH3 adaptor protein Crk has been suggested to link cell adhesion with Arp2/3-based actin polymerization in FCMs. Here, we propose that the SH2-SH3 adaptor protein Dock, like Crk, links cell adhesion with actin polymerization. We show that Dock is expressed in FCs and FCMs and colocalizes with the cell adhesion proteins Sns and Duf at cell-cell contact points. Biochemical data in this study indicate that different domains of Dock are involved in binding the cell adhesion molecules Duf, Rst, Sns and Hbs. We emphasize the importance of these interactions by quantifying the enhanced myoblast fusion defects in duf dock, sns dock and hbs dock double mutants. Additionally, we show that Dock interacts biochemically and genetically with Drosophila Scar, Vrp1 and WASp. Based on these data, we propose that Dock links cell adhesion in FCs and FCMs with either Scar- or Vrp1-WASp-dependent Arp2/3 activation.

Longitudinal and retrospective study has demonstrated morphometric variations in the fingerprints of elderly individuals.

PubMed

Silva, Lara Rosana Vieira; Mizokami, Leila Lopes; Vieira, Paola Rabello; Kuckelhaus, Selma Aparecida Souza

2016-02-01

Dermatoglyphics can be found in the thick skin of both hands and feet which make the identification process possible, however morphological changes throughout life can affect identification in elderly individuals. Considering that dermatoglyphics is an important biometric method, due to it being practical and inexpensive, this longitudinal and retrospective study was aimed to evaluate the morphological variations in fingerprints obtained from men and women (n=20) during their adult and elderly stages of life; the time between obtaining the two fingerprints was 33.5±9.4 years. For the morphometric analysis, an area of 1 cm(2) was selected to quantify the visible friction ridges, minutiae, interpapillary and white lines, and later side-by-side confrontation was used to determine the identity of the individuals. Our results showed a reduction of friction ridges, an increase in the number of white lines for the group (men and women) and a decrease in the number of interpapillary lines in the group of women. It also showed that the selection of compatible fingerprints by the automated AFIS/VRP system allowed the identification of 23 individuals (57.5%), but when the identification was made by the automated AFIS/VRP system, followed by the analysis of archived patterns to eliminate incompatible fingerprints, determination of the identity of 28 individuals (70.0%) was possible. The dermatoglyphics of the elderly suffered morphometric changes that prevented the identification of 30% of them, probably due to the aging process, and pointed to the importance of improving the methods of obtaining fingerprints to clarify issues related to the identification of the elderly. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

Fabrication Routes for Continuous Fiber-Reinforced Ceramic Composites (CFCC)

NASA Technical Reports Server (NTRS)

DiCarlo, James A.; Bansal, Narottam P.

1998-01-01

The primary approaches used for fabrication of continuous fiber-reinforced ceramic composite (CFCC) components have been reviewed. The CFCC fabrication issues related to fiber, interface, and matrix have been analyzed. The capabilities, advantages and limitations of the five matrix-infiltration routes have been compared and discussed. Today, the best fabrication route for the CFCC end-user is not clear and compromises need to be made depending on the details of the CFCC application. However, with time, this problem should be reduced as research continues to develop advanced CFCC constituents and fabrication routes.

Fabrication Routes for Continuous Fiber-Reinforced Ceramic Composites (CFCC)

NASA Technical Reports Server (NTRS)

DiCarlo, James A.; Bansal, Narottam P.

1998-01-01

The primary approaches used for fabrication of continuous fiber-reinforced ceramic composite (CFCC) components have been reviewed. The CFCC fabrication issues related to fiber, interface, and matrix have been analyzed. The capabilities. advantages and limitations of the five matrix-infiltration routes have been compared and discussed. Today. the best fabrication route for the CFCC end-user is not clear and compromises need to be made depending on the details of the CFCC application. However, with time, this problem should be reduced as research continues to develop advanced CFCC constituents and fabrication routes.

Unintentional Infusion of Phenylephrine into the Epidural Space.

PubMed

Townley, Kress R; Lane, Jason; Packer, Robyn; Gupta, Rajnish K

2016-03-01

We describe a patient who received an unintentionally prolonged epidural infusion of phenylephrine. The patient experienced no major morbidity. However, this case highlights the continuing problem of wrong-route drug administration and the urgent need to adopt route-specific connections.

Efficiencies in freight & passenger routing & scheduling.

DOT National Transportation Integrated Search

2015-08-01

The problem we study concerns routing a fleet of capacitated vehicles in real time to collect : shipment orders placed by a known set of customers. On each day of operation, only a subset of : all customers request service. Some of these requests are...

Multisensor signal processing techniques (hybrid GPS Loran-C with RAIM)

DOT National Transportation Integrated Search

1991-09-01

One of the major elements in alleviating existing problems in en route airspace is : to allow more aircraft to traverse a given volume of airspace. Recent developments : in navigation systems will support this effort by enabling user preferred routes...

Dynamic Routing for Delay-Tolerant Networking in Space Flight Operations

NASA Technical Reports Server (NTRS)

Burleigh, Scott

2008-01-01

Computational self-sufficiency - the making of communication decisions on the basis of locally available information that is already in place, rather than on the basis of information residing at other entities - is a fundamental principle of Delay-Tolerant Networking. Contact Graph Routing is an attempt to apply this principle to the problem of dynamic routing in an interplanetary DTN. Testing continues, but preliminary results are promising.

Developing teaching process for enhancing students' mathematical problem solving in the 21st century through STEM education

NASA Astrophysics Data System (ADS)

Prawvichien, Sutthaporn; Siripun, Kulpatsorn; Yuenyong, Chokchai

2018-01-01

The STEM education could provide the context for students' learning in the 21st century. The Mathematical problem solving requires a context which simulates real life in order to give students experience of the power of mathematics in the world around them. This study aimed to develop the teaching process for enhancing students' mathematical problem solving in the 21st century through STEM education. The paper will clarify the STEM learning activities about graph theories regarding on the 6 steps of engineering design process. These include identify a challenge, exploring ideas, designing and planning, doing and developing, test and evaluate, and present the solution. The learning activities will start from the Identify a challenge stage which provides the northern part of Thailand flooding situation in order to set the students' tasks of develop the solutions of providing the routes of fastest moving people away from the flooding areas. The explore ideas stage will provide activities for enhance students to learn some knowledge based for designing the possible solutions. This knowledge based could focus on measuring, geometry, graph theory, and mathematical process. The design and plan stage will ask students to model the city based on the map and then provide the possible routes. The doing and development stage will ask students to develop the routes based on their possible model. The test and evaluating will ask students to clarify how to test and evaluate the possible routes, and then test it. The present solution stage will ask students to present the whole process of designing routes. Then, the paper will discuss how these learning activities could enhance students' mathematical problem solving. The paper may have implication for STEM education in school setting.

Distributed multiple path routing in complex networks

NASA Astrophysics Data System (ADS)

Chen, Guang; Wang, San-Xiu; Wu, Ling-Wei; Mei, Pan; Yang, Xu-Hua; Wen, Guang-Hui

2016-12-01

Routing in complex transmission networks is an important problem that has garnered extensive research interest in the recent years. In this paper, we propose a novel routing strategy called the distributed multiple path (DMP) routing strategy. For each of the O-D node pairs in a given network, the DMP routing strategy computes and stores multiple short-length paths that overlap less with each other in advance. And during the transmission stage, it rapidly selects an actual routing path which provides low transmission cost from the pre-computed paths for each transmission task, according to the real-time network transmission status information. Computer simulation results obtained for the lattice, ER random, and scale-free networks indicate that the strategy can significantly improve the anti-congestion ability of transmission networks, as well as provide favorable routing robustness against partial network failures.

Case Study on Optimal Routing in Logistics Network by Priority-based Genetic Algorithm

NASA Astrophysics Data System (ADS)

Wang, Xiaoguang; Lin, Lin; Gen, Mitsuo; Shiota, Mitsushige

Recently, research on logistics caught more and more attention. One of the important issues on logistics system is to find optimal delivery routes with the least cost for products delivery. Numerous models have been developed for that reason. However, due to the diversity and complexity of practical problem, the existing models are usually not very satisfying to find the solution efficiently and convinently. In this paper, we treat a real-world logistics case with a company named ABC Co. ltd., in Kitakyusyu Japan. Firstly, based on the natures of this conveyance routing problem, as an extension of transportation problem (TP) and fixed charge transportation problem (fcTP) we formulate the problem as a minimum cost flow (MCF) model. Due to the complexity of fcTP, we proposed a priority-based genetic algorithm (pGA) approach to find the most acceptable solution to this problem. In this pGA approach, a two-stage path decoding method is adopted to develop delivery paths from a chromosome. We also apply the pGA approach to this problem, and compare our results with the current logistics network situation, and calculate the improvement of logistics cost to help the management to make decisions. Finally, in order to check the effectiveness of the proposed method, the results acquired are compared with those come from the two methods/ software, such as LINDO and CPLEX.

Optimization of location routing inventory problem with transshipment

NASA Astrophysics Data System (ADS)

Ghani, Nor Edayu Abd; Shariff, S. Sarifah Radiah; Zahari, Siti Meriam

2015-05-01

Location Routing Inventory Problem (LRIP) is a collaboration of the three components in the supply chain. It is confined by location-allocation, vehicle routing and inventory management. The aim of the study is to minimize the total system cost in the supply chain. Transshipment is introduced in order to allow the products to be shipped to a customer who experiences a shortage, either directly from the supplier or from another customer. In the study, LRIP is introduced with the transshipment (LRIPT) and customers act as the transshipment points. We select the transshipment point by using the p-center and we present the results in two divisions of cases. Based on the analysis, the results indicated that LRIPT performed well compared to LRIP.

Does Calculation or Word-Problem Instruction Provide A Stronger Route to Pre-Algebraic Knowledge?

PubMed Central

Fuchs, Lynn S.; Powell, Sarah R.; Cirino, Paul T.; Schumacher, Robin F.; Marrin, Sarah; Hamlett, Carol L.; Fuchs, Douglas; Compton, Donald L.; Changas, Paul C.

2014-01-01

The focus of this study was connections among 3 aspects of mathematical cognition at 2nd grade: calculations, word problems, and pre-algebraic knowledge. We extended the literature, which is dominated by correlational work, by examining whether intervention conducted on calculations or word problems contributes to improved performance in the other domain and whether intervention in either or both domains contributes to pre-algebraic knowledge. Participants were 1102 children in 127 2nd-grade classrooms in 25 schools. Teachers were randomly assigned to 3 conditions: calculation intervention, word-problem intervention, and business-as-usual control. Intervention, which lasted 17 weeks, was designed to provide research-based linkages between arithmetic calculations or arithmetic word problems (depending on condition) to pre-algebraic knowledge. Multilevel modeling suggested calculation intervention improved calculation but not word-problem outcomes; word-problem intervention enhanced word-problem but not calculation outcomes; and word-problem intervention provided a stronger route than calculation intervention to pre-algebraic knowledge. PMID:25541565

Research and application of genetic algorithm in path planning of logistics distribution vehicle

NASA Astrophysics Data System (ADS)

Wang, Yong; Zhou, Heng; Wang, Ying

2017-08-01

The core of the logistics distribution system is the vehicle routing planning, research path planning problem, provide a better solution has become an important issue. In order to provide the decision support for logistics and distribution operations, this paper studies the problem of vehicle routing with capacity constraints (CVRP). By establishing a mathematical model, the genetic algorithm is used to plan the path of the logistics vehicle to meet the minimum logistics and transportation costs.

Strategic planning for disaster recovery with stochastic last mile distribution

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bent, Russell Whitford; Van Hentenryck, Pascal; Coffrin, Carleton

2010-01-01

This paper considers the single commodity allocation problem (SCAP) for disaster recovery, a fundamental problem faced by all populated areas. SCAPs are complex stochastic optimization problems that combine resource allocation, warehouse routing, and parallel fleet routing. Moreover, these problems must be solved under tight runtime constraints to be practical in real-world disaster situations. This paper formalizes the specification of SCAPs and introduces a novel multi-stage hybrid-optimization algorithm that utilizes the strengths of mixed integer programming, constraint programming, and large neighborhood search. The algorithm was validated on hurricane disaster scenarios generated by Los Alamos National Laboratory using state-of-the-art disaster simulation toolsmore » and is deployed to aid federal organizations in the US.« less

The effect of model uncertainty on some optimal routing problems

NASA Technical Reports Server (NTRS)

Mohanty, Bibhu; Cassandras, Christos G.

1991-01-01

The effect of model uncertainties on optimal routing in a system of parallel queues is examined. The uncertainty arises in modeling the service time distribution for the customers (jobs, packets) to be served. For a Poisson arrival process and Bernoulli routing, the optimal mean system delay generally depends on the variance of this distribution. However, as the input traffic load approaches the system capacity the optimal routing assignment and corresponding mean system delay are shown to converge to a variance-invariant point. The implications of these results are examined in the context of gradient-based routing algorithms. An example of a model-independent algorithm using online gradient estimation is also included.

A Novel Joint Problem of Routing, Scheduling, and Variable-Width Channel Allocation in WMNs

PubMed Central

Liu, Wan-Yu; Chou, Chun-Hung

2014-01-01

This paper investigates a novel joint problem of routing, scheduling, and channel allocation for single-radio multichannel wireless mesh networks in which multiple channel widths can be adjusted dynamically through a new software technology so that more concurrent transmissions and suppressed overlapping channel interference can be achieved. Although the previous works have studied this joint problem, their linear programming models for the problem were not incorporated with some delicate constraints. As a result, this paper first constructs a linear programming model with more practical concerns and then proposes a simulated annealing approach with a novel encoding mechanism, in which the configurations of multiple time slots are devised to characterize the dynamic transmission process. Experimental results show that our approach can find the same or similar solutions as the optimal solutions for smaller-scale problems and can efficiently find good-quality solutions for a variety of larger-scale problems. PMID:24982990

Flutist produces four resonances with a single bottle

NASA Astrophysics Data System (ADS)

Ruiz, Michael J.; Boysen, Erika

2017-03-01

In a dramatic physics demonstration, a professional flutist produces four resonances with a 12 ounce Boylan soda bottle solely through her breath control. The 22 cm bottle acts like a Helmholtz resonator for the lowest pitch. The three higher pitches fall near the 3rd, 5th, and 7th harmonics for a 22 cm closed pipe. A video of this remarkable feat is provided (Ruiz 2016 YouTube: Four Resonances with a 12-ounce Soda Bottle (https://youtu.be/ibtVrp2NF_k)). The video also reveals that a flutist can bend resonance pitches by as much as 10% through control of air speed.

Evaluation of rate of swelling and erosion of verapamil (VRP) sustained-release matrix tablets.

PubMed

Khamanga, Sandile M; Walker, Roderick B

2006-01-01

Tablets manufactured in-house were compared to a marketed sustained-release product of verapamil to investigate the rate of hydration, erosion, and drug-release mechanism by measuring the wet and subsequent dry weights of the products. Swelling and erosion rates depended on the polymer and granulating fluid used, which ultimately pointed to their permeability characteristics. Erosion rate of the marketed product was highest, which suggests that the gel layer that formed around these tablets was weak as opposed to the robust and resistant layers of test products. Anomalous and near zero-order transport mechanisms were dominant in tests and commercial product, respectively.

Busing and Redistricting in the 'Down-Up' Era.

ERIC Educational Resources Information Center

Freeman, David N.

1987-01-01

Besides redistricting problems engendered by higher elementary school enrollments (and decreasing secondary enrollments), school administrators face student transport challenges. Acquiring new routes and larger buses could be costly. This article advances computerized systems as the most cost-effective way to optimize routes and manage…

Some factors affecting performance of rats in the traveling salesman problem.

PubMed

Bellizzi, C; Goldsteinholm, K; Blaser, R E

2015-11-01

The traveling salesman problem (TSP) is used to measure the efficiency of spatial route selection. Among researchers in cognitive psychology and neuroscience, it has been utilized to examine the mechanisms of decision making, planning, and spatial navigation. While both human and non-human animals produce good solutions to the TSP, the solution strategies engaged by non-human species are not well understood. We conducted two experiments on the TSP using Long-Evans laboratory rats as subjects. The first experiment examined the role of arena walls in route selection. Rats tend to display thigmotaxis in testing conditions comparable to the TSP, which could produce results similar to a convex hull type strategy suggested for humans. The second experiment examined the role of turn angle between targets along the optimal route, to determine whether rats exhibit a preferential turning bias. Our results indicated that both thigmotaxis and preferential turn angles do affect performance in the TSP, but neither is sufficient as a predictor of route choice in this task.

A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem

NASA Astrophysics Data System (ADS)

Chen, Xianshun; Feng, Liang; Ong, Yew Soon

2012-07-01

In this article, we proposed a self-adaptive memeplex robust search (SAMRS) for finding robust and reliable solutions that are less sensitive to stochastic behaviours of customer demands and have low probability of route failures, respectively, in vehicle routing problem with stochastic demands (VRPSD). In particular, the contribution of this article is three-fold. First, the proposed SAMRS employs the robust solution search scheme (RS 3) as an approximation of the computationally intensive Monte Carlo simulation, thus reducing the computation cost of fitness evaluation in VRPSD, while directing the search towards robust and reliable solutions. Furthermore, a self-adaptive individual learning based on the conceptual modelling of memeplex is introduced in the SAMRS. Finally, SAMRS incorporates a gene-meme co-evolution model with genetic and memetic representation to effectively manage the search for solutions in VRPSD. Extensive experimental results are then presented for benchmark problems to demonstrate that the proposed SAMRS serves as an efficable means of generating high-quality robust and reliable solutions in VRPSD.

Mathematical simulation for compensation capacities area of pipeline routes in ship systems

NASA Astrophysics Data System (ADS)

Ngo, G. V.; Sakhno, K. N.

2018-05-01

In this paper, the authors considered the problem of manufacturability’s enhancement of ship systems pipeline at the designing stage. The analysis of arrangements and possibilities for compensation of deviations for pipeline routes has been carried out. The task was set to produce the “fit pipe” together with the rest of the pipes in the route. It was proposed to compensate for deviations by movement of the pipeline route during pipe installation and to calculate maximum values of these displacements in the analyzed path. Theoretical bases of deviation compensation for pipeline routes using rotations of parallel section pairs of pipes are assembled. Mathematical and graphical simulations of compensation area capacities of pipeline routes with various configurations are completed. Prerequisites have been created for creating an automated program that will allow one to determine values of the compensatory capacities area for pipeline routes and to assign quantities of necessary allowances.

Efficient Secure and Privacy-Preserving Route Reporting Scheme for VANETs

NASA Astrophysics Data System (ADS)

Zhang, Yuanfei; Pei, Qianwen; Dai, Feifei; Zhang, Lei

2017-10-01

Vehicular ad-hoc network (VANET) is a core component of intelligent traffic management system which could provide various of applications such as accident prediction, route reporting, etc. Due to the problems caused by traffic congestion, route reporting becomes a prospective application which can help a driver to get optimal route to save her travel time. Before enjoying the convenience of route reporting, security and privacy-preserving issues need to be concerned. In this paper, we propose a new secure and privacy-preserving route reporting scheme for VANETs. In our scheme, only an authenticated vehicle can use the route reporting service provided by the traffic management center. Further, a vehicle may receive the response from the traffic management center with low latency and without violating the privacy of the vehicle. Experiment results show that our scheme is much more efficiency than the existing one.

Key management schemes using routing information frames in secure wireless sensor networks

NASA Astrophysics Data System (ADS)

Kamaev, V. A.; Finogeev, A. G.; Finogeev, A. A.; Parygin, D. S.

2017-01-01

The article considers the problems and objectives of key management for data encryption in wireless sensor networks (WSN) of SCADA systems. The structure of the key information in the ZigBee network and methods of keys obtaining are discussed. The use of a hybrid key management schemes is most suitable for WSN. The session symmetric key is used to encrypt the sensor data, asymmetric keys are used to encrypt the session key transmitted from the routing information. Three algorithms of hybrid key management using routing information frames determined by routing methods and the WSN topology are presented.

Routing Protocols for Underwater Wireless Sensor Networks: Taxonomy, Research Challenges, Routing Strategies and Future Directions.

PubMed

Khan, Anwar; Ali, Ihsan; Ghani, Abdullah; Khan, Nawsher; Alsaqer, Mohammed; Rahman, Atiq Ur; Mahmood, Hasan

2018-05-18

Recent research in underwater wireless sensor networks (UWSNs) has gained the attention of researchers in academia and industry for a number of applications. They include disaster and earthquake prediction, water quality and environment monitoring, leakage and mine detection, military surveillance and underwater navigation. However, the aquatic medium is associated with a number of limitations and challenges: long multipath delay, high interference and noise, harsh environment, low bandwidth and limited battery life of the sensor nodes. These challenges demand research techniques and strategies to be overcome in an efficient and effective fashion. The design of routing protocols for UWSNs is one of the promising solutions to cope with these challenges. This paper presents a survey of the routing protocols for UWSNs. For the ease of description, the addressed routing protocols are classified into two groups: localization-based and localization-free protocols. These groups are further subdivided according to the problems they address or the major parameters they consider during routing. Unlike the existing surveys, this survey considers only the latest and state-of-the-art routing protocols. In addition, every protocol is described in terms of its routing strategy and the problem it addresses and solves. The merit(s) of each protocol is (are) highlighted along with the cost. A description of the protocols in this fashion has a number of advantages for researchers, as compared to the existing surveys. Firstly, the description of the routing strategy of each protocol makes its routing operation easily understandable. Secondly, the demerit(s) of a protocol provides (provide) insight into overcoming its flaw(s) in future investigation. This, in turn, leads to the foundation of new protocols that are more intelligent, robust and efficient with respect to the desired parameters. Thirdly, a protocol can be selected for the appropriate application based on its described merit(s). Finally, open challenges and research directions are presented for future investigation.

Routing Protocols for Underwater Wireless Sensor Networks: Taxonomy, Research Challenges, Routing Strategies and Future Directions

PubMed Central

Ghani, Abdullah; Alsaqer, Mohammed; Rahman, Atiq Ur; Mahmood, Hasan

2018-01-01

Recent research in underwater wireless sensor networks (UWSNs) has gained the attention of researchers in academia and industry for a number of applications. They include disaster and earthquake prediction, water quality and environment monitoring, leakage and mine detection, military surveillance and underwater navigation. However, the aquatic medium is associated with a number of limitations and challenges: long multipath delay, high interference and noise, harsh environment, low bandwidth and limited battery life of the sensor nodes. These challenges demand research techniques and strategies to be overcome in an efficient and effective fashion. The design of routing protocols for UWSNs is one of the promising solutions to cope with these challenges. This paper presents a survey of the routing protocols for UWSNs. For the ease of description, the addressed routing protocols are classified into two groups: localization-based and localization-free protocols. These groups are further subdivided according to the problems they address or the major parameters they consider during routing. Unlike the existing surveys, this survey considers only the latest and state-of-the-art routing protocols. In addition, every protocol is described in terms of its routing strategy and the problem it addresses and solves. The merit(s) of each protocol is (are) highlighted along with the cost. A description of the protocols in this fashion has a number of advantages for researchers, as compared to the existing surveys. Firstly, the description of the routing strategy of each protocol makes its routing operation easily understandable. Secondly, the demerit(s) of a protocol provides (provide) insight into overcoming its flaw(s) in future investigation. This, in turn, leads to the foundation of new protocols that are more intelligent, robust and efficient with respect to the desired parameters. Thirdly, a protocol can be selected for the appropriate application based on its described merit(s). Finally, open challenges and research directions are presented for future investigation. PMID:29783686

An energy efficient multiple mobile sinks based routing algorithm for wireless sensor networks

NASA Astrophysics Data System (ADS)

Zhong, Peijun; Ruan, Feng

2018-03-01

With the fast development of wireless sensor networks (WSNs), more and more energy efficient routing algorithms have been proposed. However, one of the research challenges is how to alleviate the hot spot problem since nodes close to static sink (or base station) tend to die earlier than other sensors. The introduction of mobile sink node can effectively alleviate this problem since sink node can move along certain trajectories, causing hot spot nodes more evenly distributed. In this paper, we mainly study the energy efficient routing method with multiple mobile sinks support. We divide the whole network into several clusters and study the influence of mobile sink number on network lifetime. Simulation results show that the best network performance appears when mobile sink number is about 3 under our simulation environment.

Incorporating location, routing, and inventory decisions in a bi-objective supply chain design problem with risk-pooling

NASA Astrophysics Data System (ADS)

Tavakkoli-Moghaddam, Reza; Forouzanfar, Fateme; Ebrahimnejad, Sadoullah

2013-07-01

This paper considers a single-sourcing network design problem for a three-level supply chain. For the first time, a novel mathematical model is presented considering risk-pooling, the inventory existence at distribution centers (DCs) under demand uncertainty, the existence of several alternatives to transport the product between facilities, and routing of vehicles from distribution centers to customer in a stochastic supply chain system, simultaneously. This problem is formulated as a bi-objective stochastic mixed-integer nonlinear programming model. The aim of this model is to determine the number of located distribution centers, their locations, and capacity levels, and allocating customers to distribution centers and distribution centers to suppliers. It also determines the inventory control decisions on the amount of ordered products and the amount of safety stocks at each opened DC, selecting a type of vehicle for transportation. Moreover, it determines routing decisions, such as determination of vehicles' routes starting from an opened distribution center to serve its allocated customers and returning to that distribution center. All are done in a way that the total system cost and the total transportation time are minimized. The Lingo software is used to solve the presented model. The computational results are illustrated in this paper.

Route selection by rats and humans in a navigational traveling salesman problem.

PubMed

Blaser, Rachel E; Ginchansky, Rachel R

2012-03-01

Spatial cognition is typically examined in non-human animals from the perspective of learning and memory. For this reason, spatial tasks are often constrained by the time necessary for training or the capacity of the animal's short-term memory. A spatial task with limited learning and memory demands could allow for more efficient study of some aspects of spatial cognition. The traveling salesman problem (TSP), used to study human visuospatial problem solving, is a simple task with modifiable learning and memory requirements. In the current study, humans and rats were characterized in a navigational version of the TSP. Subjects visited each of 10 baited targets in any sequence from a set starting location. Unlike similar experiments, the roles of learning and memory were purposely minimized; all targets were perceptually available, no distracters were used, and each configuration was tested only once. The task yielded a variety of behavioral measures, including target revisits and omissions, route length, and frequency of transitions between each pair of targets. Both humans and rats consistently chose routes that were more efficient than chance, but less efficient than optimal, and generally less efficient than routes produced by the nearest-neighbor strategy. We conclude that the TSP is a useful and flexible task for the study of spatial cognition in human and non-human animals.

Bee Inspired Novel Optimization Algorithm and Mathematical Model for Effective and Efficient Route Planning in Railway System

PubMed Central

Leong, Kah Huo; Abdul-Rahman, Hamzah; Wang, Chen; Onn, Chiu Chuen

2016-01-01

Railway and metro transport systems (RS) are becoming one of the popular choices of transportation among people, especially those who live in urban cities. Urbanization and increasing population due to rapid development of economy in many cities are leading to a bigger demand for urban rail transit. Despite being a popular variant of Traveling Salesman Problem (TSP), it appears that the universal formula or techniques to solve the problem are yet to be found. This paper aims to develop an optimization algorithm for optimum route selection to multiple destinations in RS before returning to the starting point. Bee foraging behaviour is examined to generate a reliable algorithm in railway TSP. The algorithm is then verified by comparing the results with the exact solutions in 10 test cases, and a numerical case study is designed to demonstrate the application with large size sample. It is tested to be efficient and effective in railway route planning as the tour can be completed within a certain period of time by using minimal resources. The findings further support the reliability of the algorithm and capability to solve the problems with different complexity. This algorithm can be used as a method to assist business practitioners making better decision in route planning. PMID:27930659

Bee Inspired Novel Optimization Algorithm and Mathematical Model for Effective and Efficient Route Planning in Railway System.

PubMed

Leong, Kah Huo; Abdul-Rahman, Hamzah; Wang, Chen; Onn, Chiu Chuen; Loo, Siaw-Chuing

2016-01-01

Railway and metro transport systems (RS) are becoming one of the popular choices of transportation among people, especially those who live in urban cities. Urbanization and increasing population due to rapid development of economy in many cities are leading to a bigger demand for urban rail transit. Despite being a popular variant of Traveling Salesman Problem (TSP), it appears that the universal formula or techniques to solve the problem are yet to be found. This paper aims to develop an optimization algorithm for optimum route selection to multiple destinations in RS before returning to the starting point. Bee foraging behaviour is examined to generate a reliable algorithm in railway TSP. The algorithm is then verified by comparing the results with the exact solutions in 10 test cases, and a numerical case study is designed to demonstrate the application with large size sample. It is tested to be efficient and effective in railway route planning as the tour can be completed within a certain period of time by using minimal resources. The findings further support the reliability of the algorithm and capability to solve the problems with different complexity. This algorithm can be used as a method to assist business practitioners making better decision in route planning.

An Ant Colony Optimization algorithm for solving the fixed destination multi-depot multiple traveling salesman problem with non-random parameters

NASA Astrophysics Data System (ADS)

Ramadhani, T.; Hertono, G. F.; Handari, B. D.

2017-07-01

The Multiple Traveling Salesman Problem (MTSP) is the extension of the Traveling Salesman Problem (TSP) in which the shortest routes of m salesmen all of which start and finish in a single city (depot) will be determined. If there is more than one depot and salesmen start from and return to the same depot, then the problem is called Fixed Destination Multi-depot Multiple Traveling Salesman Problem (MMTSP). In this paper, MMTSP will be solved using the Ant Colony Optimization (ACO) algorithm. ACO is a metaheuristic optimization algorithm which is derived from the behavior of ants in finding the shortest route(s) from the anthill to a form of nourishment. In solving the MMTSP, the algorithm is observed with respect to different chosen cities as depots and non-randomly three parameters of MMTSP: m, K, L, those represents the number of salesmen, the fewest cities that must be visited by a salesman, and the most number of cities that can be visited by a salesman, respectively. The implementation is observed with four dataset from TSPLIB. The results show that the different chosen cities as depots and the three parameters of MMTSP, in which m is the most important parameter, affect the solution.

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

NASA Astrophysics Data System (ADS)

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.

Speedy routing recovery protocol for large failure tolerance in wireless sensor networks.

PubMed

Lee, Joa-Hyoung; Jung, In-Bum

2010-01-01

Wireless sensor networks are expected to play an increasingly important role in data collection in hazardous areas. However, the physical fragility of a sensor node makes reliable routing in hazardous areas a challenging problem. Because several sensor nodes in a hazardous area could be damaged simultaneously, the network should be able to recover routing after node failures over large areas. Many routing protocols take single-node failure recovery into account, but it is difficult for these protocols to recover the routing after large-scale failures. In this paper, we propose a routing protocol, referred to as ARF (Adaptive routing protocol for fast Recovery from large-scale Failure), to recover a network quickly after failures over large areas. ARF detects failures by counting the packet losses from parent nodes, and upon failure detection, it decreases the routing interval to notify the neighbor nodes of the failure. Our experimental results indicate that ARF could provide recovery from large-area failures quickly with less packets and energy consumption than previous protocols.

Routing channels in VLSI layout

NASA Astrophysics Data System (ADS)

Cai, Hong

A number of algorithms for the automatic routing of interconnections in Very Large Scale Integration (VLSI) building-block layouts are presented. Algorithms for the topological definition of channels, the global routing and the geometrical definition of channels are presented. In contrast to traditional approaches the definition and ordering of the channels is done after the global routing. This approach has the advantage that global routing information can be taken into account to select the optimal channel structure. A polynomial algorithm for the channel definition and ordering problem is presented. The existence of a conflict-free channel structure is guaranteed by enforcing a sliceable placement. Algorithms for finding the shortest connection path are described. A separate algorithm is developed for the power net routing, because the two power nets must be planarly routed with variable wire width. An integrated placement and routing system for generating building-block layout is briefly described. Some experimental results and design experiences in using the system are also presented. Very good results are obtained.

Relationships Between Measures of the Ability to Perform Vision-Related Activities, Vision-Related Quality of Life, and Clinical Findings in Patients With Glaucoma.

PubMed

Ekici, Feyzahan; Loh, Rebecca; Waisbourd, Michael; Sun, Yi; Martinez, Patricia; Nayak, Natasha; Wizov, Sheryl S; Hegarty, Sarah; Hark, Lisa A; Spaeth, George L

2015-12-01

To our knowledge, few studies have combined an objective measure of vision-related performance (VRP) and subjective measures of vision-related quality of life (VRQoL) with clinically related visual parameters, particularly in a large, prospective, cohort study setting. To examine the relationships between clinical visual assessments and both a VRP and 2 self-reported VRQoL measurements. Patients (N = 161) with moderate-stage glaucoma recruited from the Glaucoma Service at Wills Eye Hospital, Philadelphia, Pennsylvania, were enrolled from May 2012 to May 2014 in an ongoing prospective, 4-year longitudinal observational study. This report includes cross-sectional results from the baseline visit. Patients received a complete ocular examination, automated visual field (VF) test and Cirrus optical coherence tomographic scan. Contrast sensitivity was measured with the Pelli-Robson and the Spaeth-Richman Contrast Sensitivity (SPARCS) tests. Vision-related performance was assessed by the Compressed Assessment of Ability Related to Vision (CAARV) test. Vision-related QoL was assessed by the National Eye Institute Visual Function Questionnaire 25 (NEI-VFQ-25) and a modified Glaucoma Symptom Scale (MGSS). Correlations between clinical measures and CAARV, NEI-VFQ-25, and MGSS scores. A total of 161 patients were enrolled in the study. The strongest correlation was found between SPARCS score in the better eye and total CAARV score (r = 0.398; 95% CI, 0.235-0.537; P < .001). The CAARV score also correlated with the Pelli-Robson score (r = 0.353; 95% CI, 0.186-0.499; P = .001), VF mean deviation (r = 0.366; 95% CI, 0.200-0.510; P < .001), and VA (r = -0.326, 95% CI = -0.476 to -0.157; P = .003) in the better eye. There were more statistically significant correlations between contrast sensitivity tests and VF mean deviation with VRQoL measurements than with other clinical measures (visual acuity, intraocular pressure, Disc Damage Likelihood Scale, and mean retinal nerve fiber layer thickness). The MGSS scores were lower (worse) in women compared with men (P = .03 for binocular, P = .01 for better eye, and P = .05 for the worse eye). Structural measures (eg, Disc Damage Likelihood Scale, and retinal nerve fiber layer thickness) were generally not informative with respect to VRP or VRQoL. Contrast sensitivity tests and VF mean deviation were associated with both objective measures of the ability to act and subjective measurements of VRQoL. The strongest correlation was between SPARCS score (contrast sensitivity) in the better eye and total CAARV score. Therefore, measurement of contrast sensitivity should be considered when evaluating patients' VRQoL. The results of this study were limited by the patient population and apply only within the bounds of the tested cohort.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

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

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. Severalmore » 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.« less

A patient with aphasia using the nonsemantic lexical route for Kanji reading.

PubMed

Hashimoto, Kosei; Uno, Akira; Sambai, Ami; Mizumoto, Go

We report a patient with aphasia, caused by cerebral hemorrhage, who probably used the nonsemantic lexical route when reading words aloud. To investigate the mechanisms underlying her reading dysfunction, we analyzed her reading abilities using the Dual-Route Cascaded Model. Language tests resulted in low correct percentages for both reading comprehension and reading nonwords aloud, suggesting problems in the semantic system and the nonlexical route. Conversely, the patient showed high scores on the reading words aloud task. Although she failed to understand many inconsistent-atypical words in the reading comprehension test, she correctly read most words aloud, suggesting that she used the nonsemantic lexical route. In addition, the lexical reading route was analyzed in detail by using inconsistent-atypical Kanji words as stimuli. Finally, we analyzed her reading dysfunction compared with previous cases.

Cost-aware request routing in multi-geography cloud data centres using software-defined networking

NASA Astrophysics Data System (ADS)

Yuan, Haitao; Bi, Jing; Li, Bo Hu; Tan, Wei

2017-03-01

Current geographically distributed cloud data centres (CDCs) require gigantic energy and bandwidth costs to provide multiple cloud applications to users around the world. Previous studies only focus on energy cost minimisation in distributed CDCs. However, a CDC provider needs to deliver gigantic data between users and distributed CDCs through internet service providers (ISPs). Geographical diversity of bandwidth and energy costs brings a highly challenging problem of how to minimise the total cost of a CDC provider. With the recently emerging software-defined networking, we study the total cost minimisation problem for a CDC provider by exploiting geographical diversity of energy and bandwidth costs. We formulate the total cost minimisation problem as a mixed integer non-linear programming (MINLP). Then, we develop heuristic algorithms to solve the problem and to provide a cost-aware request routing for joint optimisation of the selection of ISPs and the number of servers in distributed CDCs. Besides, to tackle the dynamic workload in distributed CDCs, this article proposes a regression-based workload prediction method to obtain future incoming workload. Finally, this work evaluates the cost-aware request routing by trace-driven simulation and compares it with the existing approaches to demonstrate its effectiveness.

Routing in Networks with Random Topologies

NASA Technical Reports Server (NTRS)

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.

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

PubMed

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.

A chance-constrained stochastic approach to intermodal container routing problems

PubMed Central

Zhao, Yi; 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. PMID:29438389

Routing Algorithm based on Minimum Spanning Tree and Minimum Cost Flow for Hybrid Wireless-optical Broadband Access Network

NASA Astrophysics Data System (ADS)

Le, Zichun; Suo, Kaihua; Fu, Minglei; Jiang, Ling; Dong, Wen

2012-03-01

In order to minimize the average end to end delay for data transporting in hybrid wireless optical broadband access network, a novel routing algorithm named MSTMCF (minimum spanning tree and minimum cost flow) is devised. The routing problem is described as a minimum spanning tree and minimum cost flow model and corresponding algorithm procedures are given. To verify the effectiveness of MSTMCF algorithm, extensively simulations based on OWNS have been done under different types of traffic source.

Understanding Route Aggregation

DTIC Science & Technology

2010-03-09

routing anomalies, and is fingered to be the cause of many reported loops and blackholes . In this paper, we posit that the problem arises from a lack of...Route aggre- gation can also result in blackholes [18], which are surprisingly prevalent in the Internet [11]. We illustrate these known anomalies with...advertisement Forwarding paths A B C 10.1.30.0/24 10.1.16.0/22 10.1.16.0/2010.1.16.0/20 Figure 4: Illustration of a blackhole . forwards the packet to Y

More arrows in the quiver: new pathways and old problems with heavy alkaline earth metal diphenylmethanides.

PubMed

Alexander, Jacob S; Ruhlandt-Senge, Karin

2004-03-05

Progress in the field of sigma-bonded alkaline earth organometallics has been handicapped by numerous complications, such as high reactivity, low solubility, and the limited availability of suitable starting materials. Here we present two synthetic methods, hydrocarbon elimination and desilylation, as alternative routes into this chemistry. A novel barium diphenylmethanide was prepared using these routes delineating that both methods provide a powerful, versatile synthetic access route to an extended library of organometallic alkaline earth derivatives.

Route Prediction on Tracking Data to Location-Based Services

NASA Astrophysics Data System (ADS)

Petróczi, Attila István; Gáspár-Papanek, Csaba

Wireless networks have become so widespread, it is beneficial to determine the ability of cellular networks for localization. This property enables the development of location-based services, providing useful information. These services can be improved by route prediction under the condition of using simple algorithms, because of the limited capabilities of mobile stations. This study gives alternative solutions for this problem of route prediction based on a specific graph model. Our models provide the opportunity to reach our destinations with less effort.

Analog Processor To Solve Optimization Problems

NASA Technical Reports Server (NTRS)

Duong, Tuan A.; Eberhardt, Silvio P.; Thakoor, Anil P.

1993-01-01

Proposed analog processor solves "traveling-salesman" problem, considered paradigm of global-optimization problems involving routing or allocation of resources. Includes electronic neural network and auxiliary circuitry based partly on concepts described in "Neural-Network Processor Would Allocate Resources" (NPO-17781) and "Neural Network Solves 'Traveling-Salesman' Problem" (NPO-17807). Processor based on highly parallel computing solves problem in significantly less time.

An emergency-adaptive routing scheme for wireless sensor networks for building fire hazard monitoring.

PubMed

Zeng, Yuanyuan; Sreenan, Cormac J; Sitanayah, Lanny; Xiong, Naixue; Park, Jong Hyuk; Zheng, Guilin

2011-01-01

Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work.

Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks

NASA Technical Reports Server (NTRS)

Dudukovich, Rachel; Raible, Daniel E.

2016-01-01

The challenges of data processing, transmission scheduling and routing within a space network present a multi-criteria optimization problem. Long delays, intermittent connectivity, asymmetric data rates and potentially high error rates make traditional networking approaches unsuitable. The delay tolerant networking architecture and protocols attempt to mitigate many of these issues, yet transmission scheduling is largely manually configured and routes are determined by a static contact routing graph. A high level of variability exists among the requirements and environmental characteristics of different missions, some of which may allow for the use of more opportunistic routing methods. In all cases, resource allocation and constraints must be balanced with the optimization of data throughput and quality of service. Much work has been done researching routing techniques for terrestrial-based challenged networks in an attempt to optimize contact opportunities and resource usage. This paper examines several popular methods to determine their potential applicability to space networks.

An Emergency-Adaptive Routing Scheme for Wireless Sensor Networks for Building Fire Hazard Monitoring

PubMed Central

Zeng, Yuanyuan; Sreenan, Cormac J.; Sitanayah, Lanny; Xiong, Naixue; Park, Jong Hyuk; Zheng, Guilin

2011-01-01

Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work. PMID:22163774

The Route Analysis Based On Flight Plan

NASA Astrophysics Data System (ADS)

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.

Relationship among Environmental Pointing Accuracy, Mental Rotation, Sex, and Hormones

ERIC Educational Resources Information Center

Bell, Scott; Saucier, Deborah

2004-01-01

Humans rely on internal representations to solve a variety of spatial problems including navigation. Navigation employs specific information to compose a representation of space that is distinct from that obtained through static bird's-eye or horizontal perspectives. The ability to point to on-route locations, off-route locations, and the route…

Some principles governing the establishment of meteorological stations along air routes

NASA Technical Reports Server (NTRS)

Aujames, P

1922-01-01

The organization of a meteorological service for an air route involves the solution of two distinct problems: distribution and grouping of meteorological stations and communications. Experience gained in the establishment of two lines, Paris-Warsaw and Constantinople-Bucharest enables us to establish certain principles, which may be of interest to note here.

Location and Routing of the Defense Courier Service Aerial Network

DTIC Science & Technology

1991-03-01

12 Coefficient Determinatior .................... . .15 Heuristic Solution Techniques ................... 16 Space Filling Curves ...178 V List of Figures Figure Page I. Space Filling Curves ............................. 2. The Sweep Heuristic...frequency associated with the most served site within a given depot’s route system (18). Approach to the Problem The research involves several phases . In

Methodology of mixed load customized bus lines and adjustment based on time windows

PubMed Central

Song, Rui

2018-01-01

Custom bus routes need to be optimized to meet the needs of a customized bus for personalized trips of different passengers. This paper introduced a customized bus routing problem in which trips for each depot are given, and each bus stop has a fixed time window within which trips should be completed. Treating a trip as a virtual stop was the first consideration in solving the school bus routing problem (SBRP). Then, the mixed load custom bus routing model was established with a time window that satisfies its requirement and the result were solved by Cplex software. Finally, a simple network diagram with three depots, four pickup stops, and five delivery stops was structured to verify the correctness of the model, and based on the actual example, the result is that all the buses ran 124.42 kilometers, the sum of kilometers was 10.35 kilometers less than before. The paths and departure times of the different busses that were provided by the model were evaluated to meet the needs of the given conditions, thus providing valuable information for actual work. PMID:29320505

Defence against Black Hole and Selective Forwarding Attacks for Medical WSNs in the IoT †

PubMed Central

Mathur, Avijit; Newe, Thomas; Rao, Muzaffar

2016-01-01

Wireless sensor networks (WSNs) are being used to facilitate monitoring of patients in hospital and home environments. These systems consist of a variety of different components/sensors and many processes like clustering, routing, security, and self-organization. Routing is necessary for medical-based WSNs because it allows remote data delivery and it facilitates network scalability in large hospitals. However, routing entails several problems, mainly due to the open nature of wireless networks, and these need to be addressed. This paper looks at two of the problems that arise due to wireless routing between the nodes and access points of a medical WSN (for IoT use): black hole and selective forwarding (SF) attacks. A solution to the former can readily be provided through the use of cryptographic hashes, while the latter makes use of a neighbourhood watch and threshold-based analysis to detect and correct SF attacks. The scheme proposed here is capable of detecting a selective forwarding attack with over 96% accuracy and successfully identifying the malicious node with 83% accuracy. PMID:26797620

IJS: An Intelligent Junction Selection Based Routing Protocol for VANET to Support ITS Services.

PubMed

Bhoi, Sourav Kumar; Khilar, Pabitra Mohan

2014-01-01

Selecting junctions intelligently for data transmission provides better intelligent transportation system (ITS) services. The main problem in vehicular communication is high disturbances of link connectivity due to mobility and less density of vehicles. If link conditions are predicted earlier, then there is a less chance of performance degradation. In this paper, an intelligent junction selection based routing protocol (IJS) is proposed to transmit the data in a quickest path, in which the vehicles are mostly connected and have less link connectivity problem. In this protocol, a helping vehicle is set at every junction to control the communication by predicting link failures or network gaps in a route. Helping vehicle at the junction produces a score for every neighboring junction to forward the data to the destination by considering the current traffic information and selects that junction which has minimum score. IJS protocol is implemented and compared with GyTAR, A-STAR, and GSR routing protocols. Simulation results show that IJS performs better in terms of average end-to-end delay, network gap encounter, and number of hops.

Municipal solid waste transportation optimisation with vehicle routing approach: case study of Pontianak City, West Kalimantan

NASA Astrophysics Data System (ADS)

Kamal, M. A.; Youlla, D.

2018-03-01

Municipal solid waste (MSW) transportation in Pontianak City becomes an issue that need to be tackled by the relevant agencies. The MSW transportation service in Pontianak City currently requires very high resources especially in vehicle usage. Increasing the number of fleets has not been able to increase service levels while garbage volume is growing every year along with population growth. In this research, vehicle routing optimization approach was used to find optimal and efficient routes of vehicle cost in transporting garbage from several Temporary Garbage Dump (TGD) to Final Garbage Dump (FGD). One of the problems of MSW transportation is that there is a TGD which exceed the the vehicle capacity and must be visited more than once. The optimal computation results suggest that the municipal authorities only use 3 vehicles from 5 vehicles provided with the total minimum cost of IDR. 778,870. The computation time to search optimal route and minimal cost is very time consuming. This problem is influenced by the number of constraints and decision variables that have are integer value.

IJS: An Intelligent Junction Selection Based Routing Protocol for VANET to Support ITS Services

PubMed Central

Khilar, Pabitra Mohan

2014-01-01

Selecting junctions intelligently for data transmission provides better intelligent transportation system (ITS) services. The main problem in vehicular communication is high disturbances of link connectivity due to mobility and less density of vehicles. If link conditions are predicted earlier, then there is a less chance of performance degradation. In this paper, an intelligent junction selection based routing protocol (IJS) is proposed to transmit the data in a quickest path, in which the vehicles are mostly connected and have less link connectivity problem. In this protocol, a helping vehicle is set at every junction to control the communication by predicting link failures or network gaps in a route. Helping vehicle at the junction produces a score for every neighboring junction to forward the data to the destination by considering the current traffic information and selects that junction which has minimum score. IJS protocol is implemented and compared with GyTAR, A-STAR, and GSR routing protocols. Simulation results show that IJS performs better in terms of average end-to-end delay, network gap encounter, and number of hops. PMID:27433485

Defence against Black Hole and Selective Forwarding Attacks for Medical WSNs in the IoT.

PubMed

Mathur, Avijit; Newe, Thomas; Rao, Muzaffar

2016-01-19

Wireless sensor networks (WSNs) are being used to facilitate monitoring of patients in hospital and home environments. These systems consist of a variety of different components/sensors and many processes like clustering, routing, security, and self-organization. Routing is necessary for medical-based WSNs because it allows remote data delivery and it facilitates network scalability in large hospitals. However, routing entails several problems, mainly due to the open nature of wireless networks, and these need to be addressed. This paper looks at two of the problems that arise due to wireless routing between the nodes and access points of a medical WSN (for IoT use): black hole and selective forwarding (SF) attacks. A solution to the former can readily be provided through the use of cryptographic hashes, while the latter makes use of a neighbourhood watch and threshold-based analysis to detect and correct SF attacks. The scheme proposed here is capable of detecting a selective forwarding attack with over 96% accuracy and successfully identifying the malicious node with 83% accuracy.

Intelligent routing protocol for ad hoc wireless network

NASA Astrophysics Data System (ADS)

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 mechanisms, which are used to control active route and reduce the traffic amount in the route discovery procedure. Finial, the numerical experiments are given to show the effectiveness of IRP routing protocol.

Application of modern control theory to scheduling and path-stretching maneuvers of aircraft in the near terminal area

NASA Technical Reports Server (NTRS)

Athans, M.

1974-01-01

A design concept of the dynamic control of aircraft in the near terminal area is discussed. An arbitrary set of nominal air routes, with possible multiple merging points, all leading to a single runway, is considered. The system allows for the automated determination of acceleration/deceleration of aircraft along the nominal air routes, as well as for the automated determination of path-stretching delay maneuvers. In addition to normal operating conditions, the system accommodates: (1) variable commanded separations over the outer marker to allow for takeoffs and between successive landings and (2) emergency conditions under which aircraft in distress have priority. The system design is based on a combination of three distinct optimal control problems involving a standard linear-quadratic problem, a parameter optimization problem, and a minimum-time rendezvous problem.

Routing design and fleet allocation optimization of freeway service patrol: Improved results using genetic algorithm

NASA Astrophysics Data System (ADS)

Sun, Xiuqiao; Wang, Jian

2018-07-01

Freeway service patrol (FSP), is considered to be an effective method for incident management and can help transportation agency decision-makers alter existing route coverage and fleet allocation. This paper investigates the FSP problem of patrol routing design and fleet allocation, with the objective of minimizing the overall average incident response time. While the simulated annealing (SA) algorithm and its improvements have been applied to solve this problem, they often become trapped in local optimal solution. Moreover, the issue of searching efficiency remains to be further addressed. In this paper, we employ the genetic algorithm (GA) and SA to solve the FSP problem. To maintain population diversity and avoid premature convergence, niche strategy is incorporated into the traditional genetic algorithm. We also employ elitist strategy to speed up the convergence. Numerical experiments have been conducted with the help of the Sioux Falls network. Results show that the GA slightly outperforms the dual-based greedy (DBG) algorithm, the very large-scale neighborhood searching (VLNS) algorithm, the SA algorithm and the scenario algorithm.

Spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bent, Russell W

This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive decomposition scheme which iteratively decouples a routing problem based on the current solution. Earlier work considered vehicle-based decompositions that partitions the vehicles across the subproblems. The subproblems can then be optimized independently and merged easily. This paper argues that vehicle-based decompositions, although very effective on various problem classes also have limitations. In particular, they do not accommodate temporal decompositions and may produce spatial decompositions that are not focused enough. This paper then proposes customer-based decompositionsmore » which generalize vehicle-based decouplings and allows for focused spatial and temporal decompositions. Experimental results on class R2 of the extended Solomon benchmarks demonstrates the benefits of the customer-based adaptive decomposition scheme and its spatial, temporal, and hybrid instantiations. In particular, they show that customer-based decompositions bring significant benefits over large neighborhood search in contrast to vehicle-based decompositions.« less

MODFLOW-based coupled surface water routing and groundwater-flow simulation

USGS Publications Warehouse

Hughes, Joseph D.; Langevin, Christian D.; White, Jeremy T.

2015-01-01

In this paper, we present a flexible approach for simulating one- and two-dimensional routing of surface water using a numerical surface water routing (SWR) code implicitly coupled to the groundwater-flow process in MODFLOW. Surface water routing in SWR can be simulated using a diffusive-wave approximation of the Saint-Venant equations and/or a simplified level-pool approach. SWR can account for surface water flow controlled by backwater conditions caused by small water-surface gradients or surface water control structures. A number of typical surface water control structures, such as culverts, weirs, and gates, can be represented, and it is possible to implement operational rules to manage surface water stages and streamflow. The nonlinear system of surface water flow equations formulated in SWR is solved by using Newton methods and direct or iterative solvers. SWR was tested by simulating the (1) Lal axisymmetric overland flow, (2) V-catchment, and (3) modified Pinder-Sauer problems. Simulated results for these problems compare well with other published results and indicate that SWR provides accurate results for surface water-only and coupled surface water/groundwater problems. Results for an application of SWR and MODFLOW to the Snapper Creek area of Miami-Dade County, Florida, USA are also presented and demonstrate the value of coupled surface water and groundwater simulation in managed, low-relief coastal settings.

Facilitating the 3D Indoor Search and Rescue Problem: An Overview of the Problem and an Ant Colony Solution Approach

NASA Astrophysics Data System (ADS)

Tashakkori, H.; Rajabifard, A.; Kalantari, M.

2016-10-01

Search and rescue procedures for indoor environments are quite complicated due to the fact that much of the indoor information is unavailable to rescuers before physical entrance to the incident scene. Thus, decision making regarding the number of crew required and the way they should be dispatched in the building considering the various access points and complexities in the buildings in order to cover the search area in minimum time is dependent on prior knowledge and experience of the emergency commanders. Hence, this paper introduces the Search and Rescue Problem (SRP) which aims at finding best search and rescue routes that minimize the overall search time in the buildings. 3D BIM-oriented indoor GIS is integrated in the indoor route graph to find accurate routes based on the building geometric and semantic information. An Ant Colony Based Algorithm is presented that finds the number of first responders required and their individual routes to search all rooms and points of interest inside the building to minimize the overall time spent by all rescuers inside the disaster area. The evaluation of the proposed model for a case study building shows a significant improve in search and rescue time which will lead to a higher chance of saving lives and less exposure of emergency crew to danger.

Human Norovirus Detection and Production, Quantification, and Storage of Virus-Like Particles

PubMed Central

Debbink, Kari; Costantini, Veronica; Swanstrom, Jesica; Agnihothram, Sudhakar; Vinjé, Jan; Baric, Ralph

2014-01-01

Human noroviruses constitute a significant worldwide disease burden. Each year noroviruses cause over 267 million infections, deaths in over 200,000 children under the age of five, and over 50% of U.S. food borne illness. Due to the absence of a tissue culture model or small animal model to study human norovirus, virus-like particles (VLPs) and ELISA-based biological assays have been used to answer questions about norovirus evolution and immunity as well provide a potential vaccine platform. This chapter outlines the protocols on norovirus detection in stool and norovirus VLP design, production, purification, and storage using a Venezuelan equine encephalitis virus (VEE)-based VRP expression system. PMID:24510290

Multicasting for all-optical multifiber networks

NASA Astrophysics Data System (ADS)

Kã¶Ksal, Fatih; Ersoy, Cem

2007-02-01

All-optical wavelength-routed WDM WANs can support the high bandwidth and the long session duration requirements of the application scenarios such as interactive distance learning or on-line diagnosis of patients simultaneously in different hospitals. However, multifiber and limited sparse light splitting and wavelength conversion capabilities of switches result in a difficult optimization problem. We attack this problem using a layered graph model. The problem is defined as a k-edge-disjoint degree-constrained Steiner tree problem for routing and fiber and wavelength assignment of k multicasts. A mixed integer linear programming formulation for the problem is given, and a solution using CPLEX is provided. However, the complexity of the problem grows quickly with respect to the number of edges in the layered graph, which depends on the number of nodes, fibers, wavelengths, and multicast sessions. Hence, we propose two heuristics layered all-optical multicast algorithm [(LAMA) and conservative fiber and wavelength assignment (C-FWA)] to compare with CPLEX, existing work, and unicasting. Extensive computational experiments show that LAMA's performance is very close to CPLEX, and it is significantly better than existing work and C-FWA for nearly all metrics, since LAMA jointly optimizes routing and fiber-wavelength assignment phases compared with the other candidates, which attack the problem by decomposing two phases. Experiments also show that important metrics (e.g., session and group blocking probability, transmitter wavelength, and fiber conversion resources) are adversely affected by the separation of two phases. Finally, the fiber-wavelength assignment strategy of C-FWA (Ex-Fit) uses wavelength and fiber conversion resources more effectively than the First Fit.

a New Multimodal Multi-Criteria Route Planning Model by Integrating a Fuzzy-Ahp Weighting Method and a Simulated Annealing Algorithm

NASA Astrophysics Data System (ADS)

Ghaderi, F.; Pahlavani, P.

2015-12-01

A multimodal multi-criteria route planning (MMRP) system provides an optimal multimodal route from an origin point to a destination point considering two or more criteria in a way this route can be a combination of public and private transportation modes. In this paper, the simulate annealing (SA) and the fuzzy analytical hierarchy process (fuzzy AHP) were combined in order to find this route. In this regard, firstly, the effective criteria that are significant for users in their trip were determined. Then the weight of each criterion was calculated using the fuzzy AHP weighting method. The most important characteristic of this weighting method is the use of fuzzy numbers that aids the users to consider their uncertainty in pairwise comparison of criteria. After determining the criteria weights, the proposed SA algorithm were used for determining an optimal route from an origin to a destination. One of the most important problems in a meta-heuristic algorithm is trapping in local minima. In this study, five transportation modes, including subway, bus rapid transit (BRT), taxi, walking, and bus were considered for moving between nodes. Also, the fare, the time, the user's bother, and the length of the path were considered as effective criteria for solving the problem. The proposed model was implemented in an area in centre of Tehran in a GUI MATLAB programming language. The results showed a high efficiency and speed of the proposed algorithm that support our analyses.

A proposal to improve e-waste collection efficiency in urban mining: Container loading and vehicle routing problems - A case study of Poland.

PubMed

Nowakowski, Piotr

2017-02-01

Waste electrical and electronic equipment (WEEE), also known as e-waste, is one of the most important waste streams with high recycling potential. Materials used in these products are valuable, but some of them are hazardous. The urban mining approach attempts to recycle as many materials as possible, so efficiency in collection is vital. There are two main methods used to collect WEEE: stationary and mobile, each with different variants. The responsibility of WEEE organizations and waste collection companies is to assure all resources required for these activities - bins, containers, collection vehicles and staff - are available, taking into account cost minimization. Therefore, it is necessary to correctly determine the capacity of containers and number of collection vehicles for an area where WEEE need to be collected. There are two main problems encountered in collection, storage and transportation of WEEE: container loading problems and vehicle routing problems. In this study, an adaptation of these two models for packing and collecting WEEE is proposed, along with a practical implementation plan designed to be useful for collection companies' guidelines for container loading and route optimization. The solutions are presented in the case studies of real-world conditions for WEEE collection companies in Poland. Copyright © 2016 Elsevier Ltd. All rights reserved.

Energy-Efficient Routing and Spectrum Assignment Algorithm with Physical-Layer Impairments Constraint in Flexible Optical Networks

NASA Astrophysics Data System (ADS)

Zhao, Jijun; Zhang, Nawa; Ren, Danping; Hu, Jinhua

2017-12-01

The recently proposed flexible optical network can provide more efficient accommodation of multiple data rates than the current wavelength-routed optical networks. Meanwhile, the energy efficiency has also been a hot topic because of the serious energy consumption problem. In this paper, the energy efficiency problem of flexible optical networks with physical-layer impairments constraint is studied. We propose a combined impairment-aware and energy-efficient routing and spectrum assignment (RSA) algorithm based on the link availability, in which the impact of power consumption minimization on signal quality is considered. By applying the proposed algorithm, the connection requests are established on a subset of network topology, reducing the number of transitions from sleep to active state. The simulation results demonstrate that our proposed algorithm can improve the energy efficiency and spectrum resources utilization with the acceptable blocking probability and average delay.

Degree-constrained multicast routing for multimedia communications

NASA Astrophysics Data System (ADS)

Wang, Yanlin; Sun, Yugeng; Li, Guidan

2005-02-01

Multicast services have been increasingly used by many multimedia applications. As one of the key techniques to support multimedia applications, the rational and effective multicast routing algorithms are very important to networks performance. When switch nodes in networks have different multicast capability, multicast routing problem is modeled as the degree-constrained Steiner problem. We presented two heuristic algorithms, named BMSTA and BSPTA, for the degree-constrained case in multimedia communications. Both algorithms are used to generate degree-constrained multicast trees with bandwidth and end to end delay bound. Simulations over random networks were carried out to compare the performance of the two proposed algorithms. Experimental results show that the proposed algorithms have advantages in traffic load balancing, which can avoid link blocking and enhance networks performance efficiently. BMSTA has better ability in finding unsaturated links and (or) unsaturated nodes to generate multicast trees than BSPTA. The performance of BMSTA is affected by the variation of degree constraints.

Integrated optimization of planetary rover layout and exploration routes

NASA Astrophysics Data System (ADS)

Lee, Dongoo; Ahn, Jaemyung

2018-01-01

This article introduces an optimization framework for the integrated design of a planetary surface rover and its exploration route that is applicable to the initial phase of a planetary exploration campaign composed of multiple surface missions. The scientific capability and the mobility of a rover are modelled as functions of the science weight fraction, a key parameter characterizing the rover. The proposed problem is formulated as a mixed-integer nonlinear program that maximizes the sum of profits obtained through a planetary surface exploration mission by simultaneously determining the science weight fraction of the rover, the sites to visit and their visiting sequences under resource consumption constraints imposed on each route and collectively on a mission. A solution procedure for the proposed problem composed of two loops (the outer loop and the inner loop) is developed. The results of test cases demonstrating the effectiveness of the proposed framework are presented.

Algorithms for Data Sharing, Coordination, and Communication in Dynamic Network Settings

DTIC Science & Technology

2007-12-03

problems in dynamic networks, focusing on mobile networks with wireless communication. Problems studied include data management, time synchronization ...The discovery of a fundamental limitation in capabilities for time synchronization in large networks. (2) The identification and development of the...Problems studied include data management, time synchronization , communication problems (broadcast, geocast, and point-to-point routing), distributed

Cognitive Task Analysis of En Route Air Traffic Control: Model Extension and Validation.

ERIC Educational Resources Information Center

Redding, Richard E.; And Others

Phase II of a project extended data collection and analytic procedures to develop a model of expertise and skill development for en route air traffic control (ATC). New data were collected by recording the Dynamic Simulator (DYSIM) performance of five experts with a work overload problem. Expert controllers were interviewed in depth for mental…

COOPERATIVE ROUTING FOR DYNAMIC AERIAL LAYER NETWORKS

DTIC Science & Technology

2018-03-01

Advisor, Computing & Communications Division Information Directorate This report is published in the interest of scientific and technical...information accumulation at the physical layer, and study the cooperative routing and resource allocation problems associated with such SU networks...interference power constraint is studied . In [Shi2012Joint], an optimal power and sub-carrier allocation strategy to maximize SUs’ throughput subject to

Automation--planning to implementation; the problems en route.

PubMed Central

Pizer, I H

1976-01-01

Once the major decision to automate library processes is made, there are a variety of problems which may be encountered before the planned system becomes operational. These include problems of personnel, budget, procurement of adjunct services, institutional priorities, and manufacturing uncertainties. Actual and potential difficulties are discussed. PMID:1247703

The production route selection algorithm in virtual manufacturing networks

NASA Astrophysics Data System (ADS)

Krenczyk, D.; Skolud, B.; Olender, M.

2017-08-01

The increasing requirements and competition in the global market are challenges for the companies profitability in production and supply chain management. This situation became the basis for construction of virtual organizations, which are created in response to temporary needs. The problem of the production flow planning in virtual manufacturing networks is considered. In the paper the algorithm of the production route selection from the set of admissible routes, which meets the technology and resource requirements and in the context of the criterion of minimum cost is proposed.

Unstructured grids on SIMD torus machines

NASA Technical Reports Server (NTRS)

Bjorstad, Petter E.; Schreiber, Robert

1994-01-01

Unstructured grids lead to unstructured communication on distributed memory parallel computers, a problem that has been considered difficult. Here, we consider adaptive, offline communication routing for a SIMD processor grid. Our approach is empirical. We use large data sets drawn from supercomputing applications instead of an analytic model of communication load. The chief contribution of this paper is an experimental demonstration of the effectiveness of certain routing heuristics. Our routing algorithm is adaptive, nonminimal, and is generally designed to exploit locality. We have a parallel implementation of the router, and we report on its performance.

Exploiting Elementary Landscapes for TSP, Vehicle Routing and Scheduling

DTIC Science & Technology

2015-09-03

Traveling Salesman Problem (TSP) and Graph Coloring are elementary. Problems such as MAX-kSAT are a superposition of k elementary landscapes. This...search space. Problems such as the Traveling Salesman Problem (TSP), Graph Coloring, the Frequency Assignment Problem , as well as Min-Cut and Max-Cut...echoing our earlier esults on the Traveling Salesman Problem . Using two locally optimal solutions as “parent” solutions, we have developed a

Intersection negotiation problems of older drivers. Volume 1

DOT National Transportation Integrated Search

1998-09-01

This project included a background literature synthesis and observational field study. The research goals were to document driving problems and errors at intersections, for older drivers using their own cars to travel familiar and unfamiliar routes, ...

Multi-trip vehicle routing and scheduling problem with time window in real life

NASA Astrophysics Data System (ADS)

Sze, San-Nah; Chiew, Kang-Leng; Sze, Jeeu-Fong

2012-09-01

This paper studies a manpower scheduling problem with multiple maintenance operations and vehicle routing considerations. Service teams located at a common service centre are required to travel to different customer sites. All customers must be served within given time window, which are known in advance. The scheduling process must take into consideration complex constraints such as a meal break during the team's shift, multiple travelling trips, synchronisation of service teams and working shifts. The main objective of this study is to develop a heuristic that can generate high quality solution in short time for large problem instances. A Two-stage Scheduling Heuristic is developed for different variants of the problem. Empirical results show that the proposed solution performs effectively and efficiently. In addition, our proposed approximation algorithm is very flexible and can be easily adapted to different scheduling environments and operational requirements.

Neural Network Solves "Traveling-Salesman" Problem

NASA Technical Reports Server (NTRS)

Thakoor, Anilkumar P.; Moopenn, Alexander W.

1990-01-01

Experimental electronic neural network solves "traveling-salesman" problem. Plans round trip of minimum distance among N cities, visiting every city once and only once (without backtracking). This problem is paradigm of many problems of global optimization (e.g., routing or allocation of resources) occuring in industry, business, and government. Applied to large number of cities (or resources), circuits of this kind expected to solve problem faster and more cheaply.

Continuing Treatment with Salvia miltiorrhiza Injection Attenuates Myocardial Fibrosis in Chronic Iron-Overloaded Mice

PubMed Central

Zhang, Ying; Wang, Hao; Cui, Lijing; Zhang, Yuanyuan; Liu, Yang; Chu, Xi; Liu, Zhenyi; Zhang, Jianping; Chu, Li

2015-01-01

Iron overload cardiomyopathy results from iron accumulation in the myocardium that is closely linked to iron-mediated myocardial fibrosis. Salvia miltiorrhiza (SM, also known as Danshen), a traditional Chinese medicinal herb, has been widely used for hundreds of years to treat cardiovascular diseases. Here, we investigated the effect and potential mechanism of SM on myocardial fibrosis induced by chronic iron overload (CIO) in mice. Kunming male mice (8 weeks old) were randomized to six groups of 10 animals each: control (CONT), CIO, low-dose SM (L-SM), high-dose SM (H-SM), verapamil (VRP) and deferoxamine (DFO) groups. Normal saline was injected in the CONT group. Mice in the other five groups were treated with iron dextran at 50 mg/kg per day intraperitoneally for 7 weeks, and those in the latter four groups also received corresponding daily treatments, including 3 g/kg or 6 g/kg of SM, 100 mg/kg of VRP, or 100 mg/kg of DFO. The iron deposition was estimated histologically using Prussian blue staining. Myocardial fibrosis was determined by Masson’s trichrome staining and hydroxyproline (Hyp) quantitative assay. Superoxide dismutase (SOD) activity, malondialdehyde (MDA) content and protein expression levels of type I collagen (COL I), type I collagen (COL III), transforming growth factor-β1 (TGF-β1) and matrix metalloproteinase-9 (MMP-9) were analyzed to investigate the mechanisms underlying the effects of SM against iron-overloaded fibrosis. Treatment of chronic iron-overloaded mice with SM dose-dependently reduced iron deposition levels, fibrotic area percentage, Hyp content, expression levels of COL I and COL III, as well as upregulated the expression of TGF- β1 and MMP-9 proteins in the heart. Moreover, SM treatment decreased MDA content and increased SOD activity. In conclusion, SM exerted activities against cardiac fibrosis induced by CIO, which may be attributed to its inhibition of iron deposition, as well as collagen metabolism and oxidative stress. PMID:25850001

Intelligent emission-sensitive routing for plugin hybrid electric vehicles.

PubMed

Sun, Zhonghao; Zhou, Xingshe

2016-01-01

The existing transportation sector creates heavily environmental impacts and is a prime cause for the current climate change. The need to reduce emissions from this sector has stimulated efforts to speed up the application of electric vehicles (EVs). A subset of EVs, called plug-in hybrid electric vehicles (PHEVs), backup batteries with combustion engine, which makes PHEVs have a comparable driving range to conventional vehicles. However, this hybridization comes at a cost of higher emissions than all-electric vehicles. This paper studies the routing problem for PHEVs to minimize emissions. The existing shortest-path based algorithms cannot be applied to solving this problem, because of the several new challenges: (1) an optimal route may contain circles caused by detour for recharging; (2) emissions of PHEVs not only depend on the driving distance, but also depend on the terrain and the state of charge (SOC) of batteries; (3) batteries can harvest energy by regenerative braking, which makes some road segments have negative energy consumption. To address these challenges, this paper proposes a green navigation algorithm (GNA) which finds the optimal strategies: where to go and where to recharge. GNA discretizes the SOC, then makes the PHEV routing problem to satisfy the principle of optimality. Finally, GNA adopts dynamic programming to solve the problem. We evaluate GNA using synthetic maps generated by the delaunay triangulation. The results show that GNA can save more than 10 % energy and reduce 10 % emissions when compared to the shortest path algorithm. We also observe that PHEVs with the battery capacity of 10-15 KWh detour most and nearly no detour when larger than 30 KWh. This observation gives some insights when developing PHEVs.

Polynomial Size Formulations for the Distance and Capacity Constrained Vehicle Routing Problem

NASA Astrophysics Data System (ADS)

Kara, Imdat; Derya, Tusan

2011-09-01

The Distance and Capacity Constrained Vehicle Routing Problem (DCVRP) is an extension of the well known Traveling Salesman Problem (TSP). DCVRP arises in distribution and logistics problems. It would be beneficial to construct new formulations, which is the main motivation and contribution of this paper. We focused on two indexed integer programming formulations for DCVRP. One node based and one arc (flow) based formulation for DCVRP are presented. Both formulations have O(n2) binary variables and O(n2) constraints, i.e., the number of the decision variables and constraints grows with a polynomial function of the nodes of the underlying graph. It is shown that proposed arc based formulation produces better lower bound than the existing one (this refers to the Water's formulation in the paper). Finally, various problems from literature are solved with the node based and arc based formulations by using CPLEX 8.0. Preliminary computational analysis shows that, arc based formulation outperforms the node based formulation in terms of linear programming relaxation.

Approximability of the d-dimensional Euclidean capacitated vehicle routing problem

NASA Astrophysics Data System (ADS)

Khachay, Michael; Dubinin, Roman

2016-10-01

Capacitated Vehicle Routing Problem (CVRP) is the well known intractable combinatorial optimization problem, which remains NP-hard even in the Euclidean plane. Since the introduction of this problem in the middle of the 20th century, many researchers were involved into the study of its approximability. Most of the results obtained in this field are based on the well known Iterated Tour Partition heuristic proposed by M. Haimovich and A. Rinnoy Kan in their celebrated paper, where they construct the first Polynomial Time Approximation Scheme (PTAS) for the single depot CVRP in ℝ2. For decades, this result was extended by many authors to numerous useful modifications of the problem taking into account multiple depots, pick up and delivery options, time window restrictions, etc. But, to the best of our knowledge, almost none of these results go beyond the Euclidean plane. In this paper, we try to bridge this gap and propose a EPTAS for the Euclidean CVRP for any fixed dimension.

Parallel algorithms for placement and routing in VLSI design. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Brouwer, Randall Jay

1991-01-01

The computational requirements for high quality synthesis, analysis, and verification of very large scale integration (VLSI) designs have rapidly increased with the fast growing complexity of these designs. Research in the past has focused on the development of heuristic algorithms, special purpose hardware accelerators, or parallel algorithms for the numerous design tasks to decrease the time required for solution. Two new parallel algorithms are proposed for two VLSI synthesis tasks, standard cell placement and global routing. The first algorithm, a parallel algorithm for global routing, uses hierarchical techniques to decompose the routing problem into independent routing subproblems that are solved in parallel. Results are then presented which compare the routing quality to the results of other published global routers and which evaluate the speedups attained. The second algorithm, a parallel algorithm for cell placement and global routing, hierarchically integrates a quadrisection placement algorithm, a bisection placement algorithm, and the previous global routing algorithm. Unique partitioning techniques are used to decompose the various stages of the algorithm into independent tasks which can be evaluated in parallel. Finally, results are presented which evaluate the various algorithm alternatives and compare the algorithm performance to other placement programs. Measurements are presented on the parallel speedups available.

Self-adaptive trust based ABR protocol for MANETs using Q-learning.

PubMed

Kumar, Anitha Vijaya; Jeyapal, Akilandeswari

2014-01-01

Mobile ad hoc networks (MANETs) are a collection of mobile nodes with a dynamic topology. MANETs work under scalable conditions for many applications and pose different security challenges. Due to the nomadic nature of nodes, detecting misbehaviour is a complex problem. Nodes also share routing information among the neighbours in order to find the route to the destination. This requires nodes to trust each other. Thus we can state that trust is a key concept in secure routing mechanisms. A number of cryptographic protection techniques based on trust have been proposed. Q-learning is a recently used technique, to achieve adaptive trust in MANETs. In comparison to other machine learning computational intelligence techniques, Q-learning achieves optimal results. Our work focuses on computing a score using Q-learning to weigh the trust of a particular node over associativity based routing (ABR) protocol. Thus secure and stable route is calculated as a weighted average of the trust value of the nodes in the route and associativity ticks ensure the stability of the route. Simulation results show that Q-learning based trust ABR protocol improves packet delivery ratio by 27% and reduces the route selection time by 40% over ABR protocol without trust calculation.

Self-Adaptive Trust Based ABR Protocol for MANETs Using Q-Learning

PubMed Central

Jeyapal, Akilandeswari

2014-01-01

Mobile ad hoc networks (MANETs) are a collection of mobile nodes with a dynamic topology. MANETs work under scalable conditions for many applications and pose different security challenges. Due to the nomadic nature of nodes, detecting misbehaviour is a complex problem. Nodes also share routing information among the neighbours in order to find the route to the destination. This requires nodes to trust each other. Thus we can state that trust is a key concept in secure routing mechanisms. A number of cryptographic protection techniques based on trust have been proposed. Q-learning is a recently used technique, to achieve adaptive trust in MANETs. In comparison to other machine learning computational intelligence techniques, Q-learning achieves optimal results. Our work focuses on computing a score using Q-learning to weigh the trust of a particular node over associativity based routing (ABR) protocol. Thus secure and stable route is calculated as a weighted average of the trust value of the nodes in the route and associativity ticks ensure the stability of the route. Simulation results show that Q-learning based trust ABR protocol improves packet delivery ratio by 27% and reduces the route selection time by 40% over ABR protocol without trust calculation. PMID:25254243

Acquisition of business intelligence from human experience in route planning

NASA Astrophysics Data System (ADS)

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.

Vehicle routing for the eco-efficient collection of household plastic waste.

PubMed

Bing, Xiaoyun; de Keizer, Marlies; Bloemhof-Ruwaard, Jacqueline M; van der Vorst, Jack G A J

2014-04-01

Plastic waste is a special category of municipal solid waste. Plastic waste collection is featured with various alternatives of collection methods (curbside/drop-off) and separation methods (source-/post-separation). In the Netherlands, the collection routes of plastic waste are the same as those of other waste, although plastic is different than other waste in terms of volume to weight ratio. This paper aims for redesigning the collection routes and compares the collection options of plastic waste using eco-efficiency as performance indicator. Eco-efficiency concerns the trade-off between environmental impacts, social issues and costs. The collection problem is modeled as a vehicle routing problem. A tabu search heuristic is used to improve the routes. Collection alternatives are compared by a scenario study approach. Real distances between locations are calculated with MapPoint. The scenario study is conducted based on real case data of the Dutch municipality Wageningen. Scenarios are designed according to the collection alternatives with different assumptions in collection method, vehicle type, collection frequency and collection points, etc. Results show that the current collection routes can be improved in terms of eco-efficiency performance by using our method. The source-separation drop-off collection scenario has the best performance for plastic collection assuming householders take the waste to the drop-off points in a sustainable manner. The model also shows to be an efficient decision support tool to investigate the impacts of future changes such as alternative vehicle type and different response rates. Crown Copyright © 2014. Published by Elsevier Ltd. All rights reserved.

Backtracking search algorithm in CVRP models for efficient solid waste collection and route optimization.

PubMed

Akhtar, Mahmuda; Hannan, M A; Begum, R A; Basri, Hassan; Scavino, Edgar

2017-03-01

Waste collection is an important part of waste management that involves different issues, including environmental, economic, and social, among others. Waste collection optimization can reduce the waste collection budget and environmental emissions by reducing the collection route distance. This paper presents a modified Backtracking Search Algorithm (BSA) in capacitated vehicle routing problem (CVRP) models with the smart bin concept to find the best optimized waste collection route solutions. The objective function minimizes the sum of the waste collection route distances. The study introduces the concept of the threshold waste level (TWL) of waste bins to reduce the number of bins to be emptied by finding an optimal range, thus minimizing the distance. A scheduling model is also introduced to compare the feasibility of the proposed model with that of the conventional collection system in terms of travel distance, collected waste, fuel consumption, fuel cost, efficiency and CO 2 emission. The optimal TWL was found to be between 70% and 75% of the fill level of waste collection nodes and had the maximum tightness value for different problem cases. The obtained results for four days show a 36.80% distance reduction for 91.40% of the total waste collection, which eventually increases the average waste collection efficiency by 36.78% and reduces the fuel consumption, fuel cost and CO 2 emission by 50%, 47.77% and 44.68%, respectively. Thus, the proposed optimization model can be considered a viable tool for optimizing waste collection routes to reduce economic costs and environmental impacts. Copyright © 2017 Elsevier Ltd. All rights reserved.

Optimal traffic resource allocation and management.

DOT National Transportation Integrated Search

2010-05-01

"In this paper, we address the problem of determining the patrol routes of state troopers for maximum coverage of : highway spots with high frequencies of crashes (hot spots). We develop a mixed integer linear programming model : for this problem und...

Selective epidemic vaccination under the performant routing algorithms

NASA Astrophysics Data System (ADS)

Bamaarouf, O.; Alweimine, A. Ould Baba; Rachadi, A.; EZ-Zahraouy, H.

2018-04-01

Despite the extensive research on traffic dynamics and epidemic spreading, the effect of the routing algorithms strategies on the traffic-driven epidemic spreading has not received an adequate attention. It is well known that more performant routing algorithm strategies are used to overcome the congestion problem. However, our main result shows unexpectedly that these algorithms favor the virus spreading more than the case where the shortest path based algorithm is used. In this work, we studied the virus spreading in a complex network using the efficient path and the global dynamic routing algorithms as compared to shortest path strategy. Some previous studies have tried to modify the routing rules to limit the virus spreading, but at the expense of reducing the traffic transport efficiency. This work proposed a solution to overcome this drawback by using a selective vaccination procedure instead of a random vaccination used often in the literature. We found that the selective vaccination succeeded in eradicating the virus better than a pure random intervention for the performant routing algorithm strategies.

Generalized networking engineering: optimal pricing and routing in multiservice networks

NASA Astrophysics Data System (ADS)

Mitra, Debasis; Wang, Qiong

2002-07-01

One of the functions of network engineering is to allocate resources optimally to forecasted demand. We generalize the mechanism by incorporating price-demand relationships into the problem formulation, and optimizing pricing and routing jointly to maximize total revenue. We consider a network, with fixed topology and link bandwidths, that offers multiple services, such as voice and data, each having characteristic price elasticity of demand, and quality of service and policy requirements on routing. Prices, which depend on service type and origin-destination, determine demands, that are routed, subject to their constraints, so as to maximize revenue. We study the basic properties of the optimal solution and prove that link shadow costs provide the basis for both optimal prices and optimal routing policies. We investigate the impact of input parameters, such as link capacities and price elasticities, on prices, demand growth, and routing policies. Asymptotic analyses, in which network bandwidth is scaled to grow, give results that are noteworthy for their qualitative insights. Several numerical examples illustrate the analyses.

Kleinberg Complex Networks

DTIC Science & Technology

2014-10-21

linear combinations of paths. This project featured research on two classes of routing problems , namely traveling salesman problems and multicommodity...flows. One highlight of this research was our discovery of a polynomial-time algorithm for the metric traveling salesman s-t path problem whose...metric TSP would resolve one of the most venerable open problems in the theory of approximation algorithms. Our research on traveling salesman

MODFLOW-Based Coupled Surface Water Routing and Groundwater-Flow Simulation.

PubMed

Hughes, J D; Langevin, C D; White, J T

2015-01-01

In this paper, we present a flexible approach for simulating one- and two-dimensional routing of surface water using a numerical surface water routing (SWR) code implicitly coupled to the groundwater-flow process in MODFLOW. Surface water routing in SWR can be simulated using a diffusive-wave approximation of the Saint-Venant equations and/or a simplified level-pool approach. SWR can account for surface water flow controlled by backwater conditions caused by small water-surface gradients or surface water control structures. A number of typical surface water control structures, such as culverts, weirs, and gates, can be represented, and it is possible to implement operational rules to manage surface water stages and streamflow. The nonlinear system of surface water flow equations formulated in SWR is solved by using Newton methods and direct or iterative solvers. SWR was tested by simulating the (1) Lal axisymmetric overland flow, (2) V-catchment, and (3) modified Pinder-Sauer problems. Simulated results for these problems compare well with other published results and indicate that SWR provides accurate results for surface water-only and coupled surface water/groundwater problems. Results for an application of SWR and MODFLOW to the Snapper Creek area of Miami-Dade County, Florida, USA are also presented and demonstrate the value of coupled surface water and groundwater simulation in managed, low-relief coastal settings. Published 2014. This article is a U.S. Government work and is in the public domain in the USA.

Manycast routing, modulation level and spectrum assignment over elastic optical networks

NASA Astrophysics Data System (ADS)

Luo, Xiao; Zhao, Yang; Chen, Xue; Wang, Lei; Zhang, Min; Zhang, Jie; Ji, Yuefeng; Wang, Huitao; Wang, Taili

2017-07-01

Manycast is a point to multi-point transmission framework that requires a subset of destination nodes successfully reached. It is particularly applicable for dealing with large amounts of data simultaneously in bandwidth-hungry, dynamic and cloud-based applications. As rapid increasing of traffics in these applications, the elastic optical networks (EONs) may be relied on to achieve high throughput manycast. In terms of finer spectrum granularity, the EONs could reach flexible accessing to network spectrum and efficient providing exact spectrum resource to demands. In this paper, we focus on the manycast routing, modulation level and spectrum assignment (MA-RMLSA) problem in EONs. Both EONs planning with static manycast traffic and EONs provisioning with dynamic manycast traffic are investigated. An integer linear programming (ILP) model is formulated to derive MA-RMLSA problem in static manycast scenario. Then corresponding heuristic algorithm called manycast routing, modulation level and spectrum assignment genetic algorithm (MA-RMLSA-GA) is proposed to adapt for both static and dynamic manycast scenarios. The MA-RMLSA-GA optimizes MA-RMLSA problem in destination nodes selection, routing light-tree constitution, modulation level allocation and spectrum resource assignment jointly, to achieve an effective improvement in network performance. Simulation results reveal that MA-RMLSA strategies offered by MA-RMLSA-GA have slightly disparity from the optimal solutions provided by ILP model in static scenario. Moreover, the results demonstrate that MA-RMLSA-GA realizes a highly efficient MA-RMLSA strategy with the lowest blocking probability in dynamic scenario compared with benchmark algorithms.

Lead Exposure Hazard Management Guide

DTIC Science & Technology

1993-12-01

that may pose chemical or physical problems . Make this section specific to your base or location. b. Exposure Routes. The potential routes of...Pregnant Mother ........ 14 nstallatio (Base) Lead Te xicity Investigations . Team Makeup and Duties ............ 15 Lead Toxicity Investigation...occurring in tradesmen who used lead in their occupations. The favorable physical and chemical properties of lead accounted for its extensive use. Lead can

Zone-Based Routing Protocol for Wireless Sensor Networks

PubMed Central

Venkateswarlu Kumaramangalam, Muni; Adiyapatham, Kandasamy; Kandasamy, Chandrasekaran

2014-01-01

Extensive research happening across the globe witnessed the importance of Wireless Sensor Network in the present day application world. In the recent past, various routing algorithms have been proposed to elevate WSN network lifetime. Clustering mechanism is highly successful in conserving energy resources for network activities and has become promising field for researches. However, the problem of unbalanced energy consumption is still open because the cluster head activities are tightly coupled with role and location of a particular node in the network. Several unequal clustering algorithms are proposed to solve this wireless sensor network multihop hot spot problem. Current unequal clustering mechanisms consider only intra- and intercluster communication cost. Proper organization of wireless sensor network into clusters enables efficient utilization of limited resources and enhances lifetime of deployed sensor nodes. This paper considers a novel network organization scheme, energy-efficient edge-based network partitioning scheme, to organize sensor nodes into clusters of equal size. Also, it proposes a cluster-based routing algorithm, called zone-based routing protocol (ZBRP), for elevating sensor network lifetime. Experimental results show that ZBRP out-performs interims of network lifetime and energy conservation with its uniform energy consumption among the cluster heads. PMID:27437455

Zone-Based Routing Protocol for Wireless Sensor Networks.

PubMed

Venkateswarlu Kumaramangalam, Muni; Adiyapatham, Kandasamy; Kandasamy, Chandrasekaran

2014-01-01

Extensive research happening across the globe witnessed the importance of Wireless Sensor Network in the present day application world. In the recent past, various routing algorithms have been proposed to elevate WSN network lifetime. Clustering mechanism is highly successful in conserving energy resources for network activities and has become promising field for researches. However, the problem of unbalanced energy consumption is still open because the cluster head activities are tightly coupled with role and location of a particular node in the network. Several unequal clustering algorithms are proposed to solve this wireless sensor network multihop hot spot problem. Current unequal clustering mechanisms consider only intra- and intercluster communication cost. Proper organization of wireless sensor network into clusters enables efficient utilization of limited resources and enhances lifetime of deployed sensor nodes. This paper considers a novel network organization scheme, energy-efficient edge-based network partitioning scheme, to organize sensor nodes into clusters of equal size. Also, it proposes a cluster-based routing algorithm, called zone-based routing protocol (ZBRP), for elevating sensor network lifetime. Experimental results show that ZBRP out-performs interims of network lifetime and energy conservation with its uniform energy consumption among the cluster heads.

Reinforcement learning for resource allocation in LEO satellite networks.

PubMed

Usaha, Wipawee; Barria, Javier A

2007-06-01

In this paper, we develop and assess online decision-making algorithms for call admission and routing for low Earth orbit (LEO) satellite networks. It has been shown in a recent paper that, in a LEO satellite system, a semi-Markov decision process formulation of the call admission and routing problem can achieve better performance in terms of an average revenue function than existing routing methods. However, the conventional dynamic programming (DP) numerical solution becomes prohibited as the problem size increases. In this paper, two solution methods based on reinforcement learning (RL) are proposed in order to circumvent the computational burden of DP. The first method is based on an actor-critic method with temporal-difference (TD) learning. The second method is based on a critic-only method, called optimistic TD learning. The algorithms enhance performance in terms of requirements in storage, computational complexity and computational time, and in terms of an overall long-term average revenue function that penalizes blocked calls. Numerical studies are carried out, and the results obtained show that the RL framework can achieve up to 56% higher average revenue over existing routing methods used in LEO satellite networks with reasonable storage and computational requirements.

Energy Efficient Probabilistic Broadcasting for Mobile Ad-Hoc Network

NASA Astrophysics Data System (ADS)

Kumar, Sumit; Mehfuz, Shabana

2017-06-01

In mobile ad-hoc network (MANETs) flooding method is used for broadcasting route request (RREQ) packet from one node to another node for route discovery. This is the simplest method of broadcasting of RREQ packets but it often results in broadcast storm problem, originating collisions and congestion of packets in the network. A probabilistic broadcasting is one of the widely used broadcasting scheme for route discovery in MANETs and provides solution for broadcasting storm problem. But it does not consider limited energy of the battery of the nodes. In this paper, a new energy efficient probabilistic broadcasting (EEPB) is proposed in which probability of broadcasting RREQs is calculated with respect to remaining energy of nodes. The analysis of simulation results clearly indicate that an EEPB route discovery scheme in ad-hoc on demand distance vector (AODV) can increase the network lifetime with a decrease in the average power consumption and RREQ packet overhead. It also decreases the number of dropped packets in the network, in comparison to other EEPB schemes like energy constraint gossip (ECG), energy aware gossip (EAG), energy based gossip (EBG) and network lifetime through energy efficient broadcast gossip (NEBG).

A neural networks-based hybrid routing protocol for wireless mesh networks.

PubMed

Kojić, Nenad; Reljin, Irini; Reljin, Branimir

2012-01-01

The networking infrastructure of wireless mesh networks (WMNs) is decentralized and relatively simple, but they can display reliable functioning performance while having good redundancy. WMNs provide Internet access for fixed and mobile wireless devices. Both in urban and rural areas they provide users with high-bandwidth networks over a specific coverage area. The main problems affecting these networks are changes in network topology and link quality. In order to provide regular functioning, the routing protocol has the main influence in WMN implementations. In this paper we suggest a new routing protocol for WMN, based on good results of a proactive and reactive routing protocol, and for that reason it can be classified as a hybrid routing protocol. The proposed solution should avoid flooding and creating the new routing metric. We suggest the use of artificial logic-i.e., neural networks (NNs). This protocol is based on mobile agent technologies controlled by a Hopfield neural network. In addition to this, our new routing metric is based on multicriteria optimization in order to minimize delay and blocking probability (rejected packets or their retransmission). The routing protocol observes real network parameters and real network environments. As a result of artificial logic intelligence, the proposed routing protocol should maximize usage of network resources and optimize network performance.

A Neural Networks-Based Hybrid Routing Protocol for Wireless Mesh Networks

PubMed Central

Kojić, Nenad; Reljin, Irini; Reljin, Branimir

2012-01-01

The networking infrastructure of wireless mesh networks (WMNs) is decentralized and relatively simple, but they can display reliable functioning performance while having good redundancy. WMNs provide Internet access for fixed and mobile wireless devices. Both in urban and rural areas they provide users with high-bandwidth networks over a specific coverage area. The main problems affecting these networks are changes in network topology and link quality. In order to provide regular functioning, the routing protocol has the main influence in WMN implementations. In this paper we suggest a new routing protocol for WMN, based on good results of a proactive and reactive routing protocol, and for that reason it can be classified as a hybrid routing protocol. The proposed solution should avoid flooding and creating the new routing metric. We suggest the use of artificial logic—i.e., neural networks (NNs). This protocol is based on mobile agent technologies controlled by a Hopfield neural network. In addition to this, our new routing metric is based on multicriteria optimization in order to minimize delay and blocking probability (rejected packets or their retransmission). The routing protocol observes real network parameters and real network environments. As a result of artificial logic intelligence, the proposed routing protocol should maximize usage of network resources and optimize network performance. PMID:22969360

Energy consumption and control response evaluations of AODV routing in WSANs for building-temperature control.

PubMed

Booranawong, Apidet; Teerapabkajorndet, Wiklom; Limsakul, Chusak

2013-06-27

The main objective of this paper is to investigate the effects of routing protocols on wireless sensor and actuator networks (WSANs), focusing on the control system response and the energy consumption of nodes in a network. We demonstrate that routing algorithms designed without considering the relationship between communication and control cannot be appropriately used in wireless networked control applications. For this purpose, an ad-hoc on-demand distance vector (AODV) routing, an IEEE 802.15.4, and a building-temperature control system are employed for this exploration. The findings from our scenarios show that the AODV routing can select a path with a high traffic load for data transmission. It takes a long time before deciding to change a new route although it experiences the unsuccessful transmission of packets. As a result, the desirable control target cannot be achieved in time, and nodes consume more energy due to frequent packet collisions and retransmissions. Consequently, we propose a simple routing solution to alleviate these research problems by modifying the original AODV routing protocol. The delay-threshold is considered to avoid any congested connection during routing procedures. The simulation results demonstrate that our solution can be appropriately applied in WSANs. Both the energy consumption and the control system response are improved.

Introducing the MCHF/OVRP/SDMP: Multicapacitated/Heterogeneous Fleet/Open Vehicle Routing Problems with Split Deliveries and Multiproducts

PubMed Central

Yilmaz Eroglu, Duygu; Caglar Gencosman, Burcu; Cavdur, Fatih; Ozmutlu, H. Cenk

2014-01-01

In this paper, we analyze a real-world OVRP problem for a production company. Considering real-world constrains, we classify our problem as multicapacitated/heterogeneous fleet/open vehicle routing problem with split deliveries and multiproduct (MCHF/OVRP/SDMP) which is a novel classification of an OVRP. We have developed a mixed integer programming (MIP) model for the problem and generated test problems in different size (10–90 customers) considering real-world parameters. Although MIP is able to find optimal solutions of small size (10 customers) problems, when the number of customers increases, the problem gets harder to solve, and thus MIP could not find optimal solutions for problems that contain more than 10 customers. Moreover, MIP fails to find any feasible solution of large-scale problems (50–90 customers) within time limits (7200 seconds). Therefore, we have developed a genetic algorithm (GA) based solution approach for large-scale problems. The experimental results show that the GA based approach reaches successful solutions with 9.66% gap in 392.8 s on average instead of 7200 s for the problems that contain 10–50 customers. For large-scale problems (50–90 customers), GA reaches feasible solutions of problems within time limits. In conclusion, for the real-world applications, GA is preferable rather than MIP to reach feasible solutions in short time periods. PMID:25045735

Does Calculation or Word-Problem Instruction Provide a Stronger Route to Prealgebraic Knowledge?

ERIC Educational Resources Information Center

Fuchs, Lynn S.; Powell, Sarah R.; Cirino, Paul T.; Schumacher, Robin F.; Marrin, Sarah; Hamlett, Carol L.; Fuchs, Douglas; Compton, Donald L.; Changas, Paul C.

2014-01-01

The focus of this study was connections among 3 aspects of mathematical cognition at 2nd grade: calculations, word problems, and prealgebraic knowledge. We extended the literature, which is dominated by correlational work, by examining whether intervention conducted on calculations or word problems contributes to improved performance in the other…

Modelling Problem-Solving Situations into Number Theory Tasks: The Route towards Generalisation

ERIC Educational Resources Information Center

Papadopoulos, Ioannis; Iatridou, Maria

2010-01-01

This paper examines the way two 10th graders cope with a non-standard generalisation problem that involves elementary concepts of number theory (more specifically linear Diophantine equations) in the geometrical context of a rectangle's area. Emphasis is given on how the students' past experience of problem solving (expressed through interplay…

A Formal Approach for Milk-Run Transport Logistics

NASA Astrophysics Data System (ADS)

Satoh, Ichiro

A formal approach for specifying and reasoning about earth-friendly logistics management systems is presented. To reduce fossil fuel consumption and carbon dioxide emissions resulting from transport, we must enhance the transport efficiency of trucks, which play an essential role as carriers in modern logistics services. This paper addresses the milk-run approach. It is one of the most effective and popular solutions to this problem, but it makes it be complicated to implement in a logistics management system. We propose a language for specifying the routes of trucks and an order relation between the requirements of routes and the possible routes of trucks. The former is formulated as process calculus and the latter selects suitable trucks according to their routes.

An Improved Multi-Objective Programming with Augmented ε-Constraint Method for Hazardous Waste Location-Routing Problems

PubMed Central

Yu, Hao; Solvang, Wei Deng

2016-01-01

Hazardous waste location-routing problems are of importance due to the potential risk for nearby residents and the environment. In this paper, an improved mathematical formulation is developed based upon a multi-objective mixed integer programming approach. The model aims at assisting decision makers in selecting locations for different facilities including treatment plants, recycling plants and disposal sites, providing appropriate technologies for hazardous waste treatment, and routing transportation. In the model, two critical factors are taken into account: system operating costs and risk imposed on local residents, and a compensation factor is introduced to the risk objective function in order to account for the fact that the risk level imposed by one type of hazardous waste or treatment technology may significantly vary from that of other types. Besides, the policy instruments for promoting waste recycling are considered, and their influence on the costs and risk of hazardous waste management is also discussed. The model is coded and calculated in Lingo optimization solver, and the augmented ε-constraint method is employed to generate the Pareto optimal curve of the multi-objective optimization problem. The trade-off between different objectives is illustrated in the numerical experiment. PMID:27258293

Flexible Job-Shop Scheduling with Dual-Resource Constraints to Minimize Tardiness Using Genetic Algorithm

NASA Astrophysics Data System (ADS)

Paksi, A. B. N.; Ma'ruf, A.

2016-02-01

In general, both machines and human resources are needed for processing a job on production floor. However, most classical scheduling problems have ignored the possible constraint caused by availability of workers and have considered only machines as a limited resource. In addition, along with production technology development, routing flexibility appears as a consequence of high product variety and medium demand for each product. Routing flexibility is caused by capability of machines that offers more than one machining process. This paper presents a method to address scheduling problem constrained by both machines and workers, considering routing flexibility. Scheduling in a Dual-Resource Constrained shop is categorized as NP-hard problem that needs long computational time. Meta-heuristic approach, based on Genetic Algorithm, is used due to its practical implementation in industry. Developed Genetic Algorithm uses indirect chromosome representative and procedure to transform chromosome into Gantt chart. Genetic operators, namely selection, elitism, crossover, and mutation are developed to search the best fitness value until steady state condition is achieved. A case study in a manufacturing SME is used to minimize tardiness as objective function. The algorithm has shown 25.6% reduction of tardiness, equal to 43.5 hours.

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

PubMed

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.

An Improved Multi-Objective Programming with Augmented ε-Constraint Method for Hazardous Waste Location-Routing Problems.

PubMed

Yu, Hao; Solvang, Wei Deng

2016-05-31

Hazardous waste location-routing problems are of importance due to the potential risk for nearby residents and the environment. In this paper, an improved mathematical formulation is developed based upon a multi-objective mixed integer programming approach. The model aims at assisting decision makers in selecting locations for different facilities including treatment plants, recycling plants and disposal sites, providing appropriate technologies for hazardous waste treatment, and routing transportation. In the model, two critical factors are taken into account: system operating costs and risk imposed on local residents, and a compensation factor is introduced to the risk objective function in order to account for the fact that the risk level imposed by one type of hazardous waste or treatment technology may significantly vary from that of other types. Besides, the policy instruments for promoting waste recycling are considered, and their influence on the costs and risk of hazardous waste management is also discussed. The model is coded and calculated in Lingo optimization solver, and the augmented ε-constraint method is employed to generate the Pareto optimal curve of the multi-objective optimization problem. The trade-off between different objectives is illustrated in the numerical experiment.

The Dynamic Multi-objective Multi-vehicle Covering Tour Problem

DTIC Science & Technology

2013-06-01

AI Artificial Intelligence AUV Autonomous Underwater Vehicle CLP Clover Leaf Problem CSP Covering Salesman Problem CTP Covering Tour Problem CVRP...introduces a new formalization - the DMOMCTP. Related works from routing problems, Artificial Intelligence ( AI ), and MOPs are discussed briefly. As a...the rest of that framework being replaced. The codebase differs from jMetal 4.2 in that it can handle the time and DM dependent nature of the DMOMCTP

Automatic Extraction of Destinations, Origins and Route Parts from Human Generated Route Directions

NASA Astrophysics Data System (ADS)

Zhang, Xiao; Mitra, Prasenjit; Klippel, Alexander; Maceachren, Alan

Researchers from the cognitive and spatial sciences are studying text descriptions of movement patterns in order to examine how humans communicate and understand spatial information. In particular, route directions offer a rich source of information on how cognitive systems conceptualize movement patterns by segmenting them into meaningful parts. Route directions are composed using a plethora of cognitive spatial organization principles: changing levels of granularity, hierarchical organization, incorporation of cognitively and perceptually salient elements, and so forth. Identifying such information in text documents automatically is crucial for enabling machine-understanding of human spatial language. The benefits are: a) creating opportunities for large-scale studies of human linguistic behavior; b) extracting and georeferencing salient entities (landmarks) that are used by human route direction providers; c) developing methods to translate route directions to sketches and maps; and d) enabling queries on large corpora of crawled/analyzed movement data. In this paper, we introduce our approach and implementations that bring us closer to the goal of automatically processing linguistic route directions. We report on research directed at one part of the larger problem, that is, extracting the three most critical parts of route directions and movement patterns in general: origin, destination, and route parts. We use machine-learning based algorithms to extract these parts of routes, including, for example, destination names and types. We prove the effectiveness of our approach in several experiments using hand-tagged corpora.

Dynamic Hierarchical Energy-Efficient Method Based on Combinatorial Optimization for Wireless Sensor Networks.

PubMed

Chang, Yuchao; Tang, Hongying; Cheng, Yongbo; Zhao, Qin; Yuan, Baoqing Li andXiaobing

2017-07-19

Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum-minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms.

Energy optimization in mobile sensor networks

NASA Astrophysics Data System (ADS)

Yu, Shengwei

Mobile sensor networks are considered to consist of a network of mobile robots, each of which has computation, communication and sensing capabilities. Energy efficiency is a critical issue in mobile sensor networks, especially when mobility (i.e., locomotion control), routing (i.e., communications) and sensing are unique characteristics of mobile robots for energy optimization. This thesis focuses on the problem of energy optimization of mobile robotic sensor networks, and the research results can be extended to energy optimization of a network of mobile robots that monitors the environment, or a team of mobile robots that transports materials from stations to stations in a manufacturing environment. On the energy optimization of mobile robotic sensor networks, our research focuses on the investigation and development of distributed optimization algorithms to exploit the mobility of robotic sensor nodes for network lifetime maximization. In particular, the thesis studies these five problems: 1. Network-lifetime maximization by controlling positions of networked mobile sensor robots based on local information with distributed optimization algorithms; 2. Lifetime maximization of mobile sensor networks with energy harvesting modules; 3. Lifetime maximization using joint design of mobility and routing; 4. Optimal control for network energy minimization; 5. Network lifetime maximization in mobile visual sensor networks. In addressing the first problem, we consider only the mobility strategies of the robotic relay nodes in a mobile sensor network in order to maximize its network lifetime. By using variable substitutions, the original problem is converted into a convex problem, and a variant of the sub-gradient method for saddle-point computation is developed for solving this problem. An optimal solution is obtained by the method. Computer simulations show that mobility of robotic sensors can significantly prolong the lifetime of the whole robotic sensor network while consuming negligible amount of energy for mobility cost. For the second problem, the problem is extended to accommodate mobile robotic nodes with energy harvesting capability, which makes it a non-convex optimization problem. The non-convexity issue is tackled by using the existing sequential convex approximation method, based on which we propose a novel procedure of modified sequential convex approximation that has fast convergence speed. For the third problem, the proposed procedure is used to solve another challenging non-convex problem, which results in utilizing mobility and routing simultaneously in mobile robotic sensor networks to prolong the network lifetime. The results indicate that joint design of mobility and routing has an edge over other methods in prolonging network lifetime, which is also the justification for the use of mobility in mobile sensor networks for energy efficiency purpose. For the fourth problem, we include the dynamics of the robotic nodes in the problem by modeling the networked robotic system using hybrid systems theory. A novel distributed method for the networked hybrid system is used to solve the optimal moving trajectories for robotic nodes and optimal network links, which are not answered by previous approaches. Finally, the fact that mobility is more effective in prolonging network lifetime for a data-intensive network leads us to apply our methods to study mobile visual sensor networks, which are useful in many applications. We investigate the joint design of mobility, data routing, and encoding power to help improving the video quality while maximizing the network lifetime. This study leads to a better understanding of the role mobility can play in data-intensive surveillance sensor networks.

Adaptive MANET multipath routing algorithm based on the simulated annealing approach.

PubMed

Kim, Sungwook

2014-01-01

Mobile ad hoc network represents a system of wireless mobile nodes that can freely and dynamically self-organize network topologies without any preexisting communication infrastructure. Due to characteristics like temporary topology and absence of centralized authority, routing is one of the major issues in ad hoc networks. In this paper, a new multipath routing scheme is proposed by employing simulated annealing approach. The proposed metaheuristic approach can achieve greater and reciprocal advantages in a hostile dynamic real world network situation. Therefore, the proposed routing scheme is a powerful method for finding an effective solution into the conflict mobile ad hoc network routing problem. Simulation results indicate that the proposed paradigm adapts best to the variation of dynamic network situations. The average remaining energy, network throughput, packet loss probability, and traffic load distribution are improved by about 10%, 10%, 5%, and 10%, respectively, more than the existing schemes.

The roles of gender, age and cognitive development in children's pedestrian route selection.

PubMed

Barton, B K; Ulrich, T; Lyday, B

2012-03-01

Thousands of American children under the age of 10 years are injured annually as pedestrians. Despite the scope of this public health problem, knowledge about behavioural control and developmental factors involved in the aetiology of child pedestrian safety is limited. The present study examined the roles of gender, age and two aspects of cognitive development (visual search and efficiency of processing) in children's safe pedestrian route selection. Measures of cognitive functioning (visual search and efficiency) and selections of risky pedestrian routes were collected from 65 children aged 5-9 years. Boys, younger children and those with less developed cognitive functioning selected riskier pedestrian routes. Cognitive functioning also subsumed age as a predictor of risky route selections. Our findings suggest developmental differences, specifically less developed cognitive functioning, play important roles in children's pedestrian decision making. Directions for future examination are discussed. © 2011 Blackwell Publishing Ltd.

A Coal-Use Economics Methodology for Navy Bases. Phase I of Engineering Services for Coal Conversion Guidance.

DTIC Science & Technology

1984-02-01

ull 4 4: PI) IL .0, so 11 of It it 11 it La W) wl) OQ:222, r,104:01ir Zlow vrp-r- gel Q. I z I ;e z " 0 1.- SIC 44U 14 . I W I C L. Gh vi OZ. I to...0i-a m g U~Nl9a4 q 0 a 2 Cof- aSO JaS4W 4S %I P-2 4S. MS S. I-.U 497 2 a-CS asee v .~A4- N 4 ~ O d C Amea 4-4 2 A =5 .4 -6 .4 C* .Ae-8 - 4 .0 d bAI Iw

Energy efficient motion control of the electric bus on route

NASA Astrophysics Data System (ADS)

Kotiev, G. O.; Butarovich, D. O.; Kositsyn, B. B.

2018-02-01

At present, the urgent problem is the reduction of energy costs of urban motor transport. The article proposes a method of solving this problem by developing an energy-efficient law governing the movement of an electric bus along a city route. To solve this problem, an algorithm is developed based on the dynamic programming method. The proposed method allows you to take into account the constraints imposed on the phase coordinates, control action, as well as on the time of the route. In the course of solving the problem, the model of rectilinear motion of an electric bus on a horizontal reference surface is considered, taking into account the assumptions that allow it to be adapted for the implementation of the method. For the formation of a control action in the equations of motion dynamics, an algorithm for changing the traction / braking torque on the wheels of an electric bus is considered, depending on the magnitude of the control parameter and the speed of motion. An optimal phase trajectory was obtained on a selected section of the road for the prototype of an electric bus. The article presents the comparison of simulation results obtained with the optimal energy efficient control law with the results obtained by a test driver. The comparison proved feasibility of the energy efficient control law for the automobile city electric transport.

A memory structure adapted simulated annealing algorithm for a green vehicle routing problem.

PubMed

Küçükoğlu, İlker; Ene, Seval; Aksoy, Aslı; Öztürk, Nursel

2015-03-01

Currently, reduction of carbon dioxide (CO2) emissions and fuel consumption has become a critical environmental problem and has attracted the attention of both academia and the industrial sector. Government regulations and customer demands are making environmental responsibility an increasingly important factor in overall supply chain operations. Within these operations, transportation has the most hazardous effects on the environment, i.e., CO2 emissions, fuel consumption, noise and toxic effects on the ecosystem. This study aims to construct vehicle routes with time windows that minimize the total fuel consumption and CO2 emissions. The green vehicle routing problem with time windows (G-VRPTW) is formulated using a mixed integer linear programming model. A memory structure adapted simulated annealing (MSA-SA) meta-heuristic algorithm is constructed due to the high complexity of the proposed problem and long solution times for practical applications. The proposed models are integrated with a fuel consumption and CO2 emissions calculation algorithm that considers the vehicle technical specifications, vehicle load, and transportation distance in a green supply chain environment. The proposed models are validated using well-known instances with different numbers of customers. The computational results indicate that the MSA-SA heuristic is capable of obtaining good G-VRPTW solutions within a reasonable amount of time by providing reductions in fuel consumption and CO2 emissions.

Supplementary subsurface investigation, section E004B, Greenbelt Route. Report No. 5

DOE Office of Scientific and Technical Information (OSTI.GOV)

Not Available

1992-11-25

Results are summarized herein of six deep borings to investigate conditions in the area of the planned tunnels under Rock Creek Cemetery located between Stations 214+77 and 245+80 in Section E004b of Greenbelt Route. The report contains geological sections which summarize information from the test borings, photographs of typical soil samples and text describing design and construction problems.

AVQS: attack route-based vulnerability quantification scheme for smart grid.

PubMed

Ko, Jongbin; Lim, Hyunwoo; Lee, Seokjun; Shon, Taeshik

2014-01-01

A smart grid is a large, consolidated electrical grid system that includes heterogeneous networks and systems. Based on the data, a smart grid system has a potential security threat in its network connectivity. To solve this problem, we develop and apply a novel scheme to measure the vulnerability in a smart grid domain. Vulnerability quantification can be the first step in security analysis because it can help prioritize the security problems. However, existing vulnerability quantification schemes are not suitable for smart grid because they do not consider network vulnerabilities. We propose a novel attack route-based vulnerability quantification scheme using a network vulnerability score and an end-to-end security score, depending on the specific smart grid network environment to calculate the vulnerability score for a particular attack route. To evaluate the proposed approach, we derive several attack scenarios from the advanced metering infrastructure domain. The experimental results of the proposed approach and the existing common vulnerability scoring system clearly show that we need to consider network connectivity for more optimized vulnerability quantification.

Non-injection routes for allergen immunotherapy: focus on sublingual immunotherapy.

PubMed

Passalacqua, Giovanni; Guerra, Laura; Pasquali, Mercedes; Canonica, Giorgio Walter

2006-01-01

Allergen specific immunotherapy, together with drugs and allergen avoidance, is a cornerstone in the management of respiratory allergy. The non-injection or local routes were developed with the main goal of improving the safety and minimizing the risk of those side effects, which can accompany the injection route. The pure oral route and the bronchial route showed, in the clinical trials, only a marginal efficacy with not negligible side effects. Therefore, these routes are no longer recommended for clinical use. The nasal route proved effective and safe, but its efficacy is strictly limited to the nose. Moreover, the practical problems with administration have made the use of nasal immunotherapy progressively declining. The efficacy of the sublingual route is confirmed by numerous controlled trials, and a meta analysis (in allergic rhinitis). The safety profile, as derived from clinical trials and post marketing surveillance studies, is satisfactory, with mild gastrointestinal complaints being the more frequent side effect reported. Recent studies have also demonstrated that SLIT has a long-lasting effect and a preventive effect on the onset of new skin sensitizations, and interesting data on adherence and mechanisms of action have become recently available. Based on these experimental data, SLIT is now officially accepted as a viable alternative to the subcutaneous route in adults and children. Several points still need to be elucidated, including: mechanisms of action, optimal dosages, and indications in pediatric patients.

U-Access: a web-based system for routing pedestrians of differing abilities

NASA Astrophysics Data System (ADS)

Sobek, Adam D.; Miller, Harvey J.

2006-09-01

For most people, traveling through urban and built environments is straightforward. However, for people with physical disabilities, even a short trip can be difficult and perhaps impossible. This paper provides the design and implementation of a web-based system for the routing and prescriptive analysis of pedestrians with different physical abilities within built environments. U-Access, as a routing tool, provides pedestrians with the shortest feasible route with respect to one of three differing ability levels, namely, peripatetic (unaided mobility), aided mobility (mobility with the help of a cane, walker or crutches) and wheelchair users. U-Access is also an analytical tool that can help identify obstacles in built environments that create routing discrepancies among pedestrians with different physical abilities. This paper discusses the system design, including database, algorithm and interface specifications, and technologies for efficiently delivering results through the World Wide Web (WWW). This paper also provides an illustrative example of a routing problem and an analytical evaluation of the existing infrastructure which identifies the obstacles that pose the greatest discrepancies between physical ability levels. U-Access was evaluated by wheelchair users and route experts from the Center for Disability Services at The University of Utah, USA.

Intersection negotiation problems of older drivers. Volume 2, Background synthesis on age and intersection driving difficulties

DOT National Transportation Integrated Search

1998-09-01

This project included a background literature synthesis and observational field study. The research goals were to document driving problems and errors at intersections, for older drivers using their own cars to travel familiar and unfamiliar routes, ...

Dynamic Hierarchical Energy-Efficient Method Based on Combinatorial Optimization for Wireless Sensor Networks

PubMed Central

Tang, Hongying; Cheng, Yongbo; Zhao, Qin; Li, Baoqing; Yuan, Xiaobing

2017-01-01

Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum–minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms. PMID:28753962

A Review of Function Allocation and En Route Separation Assurance

NASA Technical Reports Server (NTRS)

Lewis, Timothy A.; Aweiss, Arwa S.; Guerreiro, Nelson M.; Daiker, Ronald J.

2016-01-01

Today's air traffic control system has reached a limit to the number of aircraft that can be safely managed at the same time. This air traffic capacity bottleneck is a critical problem along the path to modernization for air transportation. The design of the next separation assurance system to address this problem is a cornerstone of air traffic management research today. This report reviews recent work by NASA and others in the areas of function allocation and en route separation assurance. This includes: separation assurance algorithms and technology prototypes; concepts of operations and designs for advanced separation assurance systems; and specific investigations into air-ground and human-automation function allocation.

Information Switching Processor (ISP) contention analysis and control

NASA Technical Reports Server (NTRS)

Inukai, Thomas

1995-01-01

In designing a satellite system with on-board processing, the selection of a switching architecture is often critical. The on-board switching function can be implemented by circuit switching or packet switching. Destination-directed packet switching has several attractive features, such as self-routing without on-board switch reconfiguration, no switch control memory requirement, efficient bandwidth utilization for packet switched traffic, and accommodation of circuit switched traffic. Destination-directed packet switching, however, has two potential concerns: (1) contention and (2) congestion. And this report specifically deals with the first problem. It includes a description and analysis of various self-routing switch structures, the nature of contention problems, and contention and resolution techniques.

Efficient data communication protocols for wireless networks

NASA Astrophysics Data System (ADS)

Zeydan, Engin

In this dissertation, efficient decentralized algorithms are investigated for cost minimization problems in wireless networks. For wireless sensor networks, we investigate both the reduction in the energy consumption and throughput maximization problems separately using multi-hop data aggregation for correlated data in wireless sensor networks. The proposed algorithms exploit data redundancy using a game theoretic framework. For energy minimization, routes are chosen to minimize the total energy expended by the network using best response dynamics to local data. The cost function used in routing takes into account distance, interference and in-network data aggregation. The proposed energy-efficient correlation-aware routing algorithm significantly reduces the energy consumption in the network and converges in a finite number of steps iteratively. For throughput maximization, we consider both the interference distribution across the network and correlation between forwarded data when establishing routes. Nodes along each route are chosen to minimize the interference impact in their neighborhood and to maximize the in-network data aggregation. The resulting network topology maximizes the global network throughput and the algorithm is guaranteed to converge with a finite number of steps using best response dynamics. For multiple antenna wireless ad-hoc networks, we present distributed cooperative and regret-matching based learning schemes for joint transmit beanformer and power level selection problem for nodes operating in multi-user interference environment. Total network transmit power is minimized while ensuring a constant received signal-to-interference and noise ratio at each receiver. In cooperative and regret-matching based power minimization algorithms, transmit beanformers are selected from a predefined codebook to minimize the total power. By selecting transmit beamformers judiciously and performing power adaptation, the cooperative algorithm is shown to converge to pure strategy Nash equilibrium with high probability throughout the iterations in the interference impaired network. On the other hand, the regret-matching learning algorithm is noncooperative and requires minimum amount of overhead. The proposed cooperative and regret-matching based distributed algorithms are also compared with centralized solutions through simulation results.

CCS-DTN: clustering and network coding-based efficient routing in social DTNs.

PubMed

Zhang, Zhenjing; Ma, Maode; Jin, Zhigang

2014-12-25

With the development of mobile Internet, wireless communication via mobile devices has become a hot research topic, which is typically in the form of Delay Tolerant Networks (DTNs). One critical issue in the development of DTNs is routing. Although there is a lot research work addressing routing issues in DTNs, they cannot produce an advanced solution to the comprehensive challenges since only one or two aspects (nodes' movements, clustering, centricity and so on) are considered when the routing problem is handled. In view of these defects in the existing works, we propose a novel solution to address the routing issue in social DTNs. By this solution, mobile nodes are divided into different clusters. The scheme, Spray and Wait, is used for the intra-cluster communication while a new forwarding mechanism is designed for the inter-cluster version. In our solution, the characteristics of nodes and the relation between nodes are fully considered. The simulation results show that our proposed scheme can significantly improve the performance of the routing scheme in social DTNs.

Optimal routing and buffer allocation for a class of finite capacity queueing systems

NASA Technical Reports Server (NTRS)

Towsley, Don; Sparaggis, Panayotis D.; Cassandras, Christos G.

1992-01-01

The problem of routing jobs to K parallel queues with identical exponential servers and unequal finite buffer capacities is considered. Routing decisions are taken by a controller which has buffering space available to it and may delay routing of a customer to a queue. Using ideas from weak majorization, it is shown that the shorter nonfull queue delayed (SNQD) policy minimizes both the total number of customers in the system at any time and the number of customers that are rejected by that time. The SNQD policy always delays routing decisions as long as all servers are busy. Only when all the buffers at the controller are occupied is a customer routed to the queue with the shortest queue length that is not at capacity. Moreover, it is shown that, if a fixed number of buffers is to be distributed among the K queues, then the optimal allocation scheme is the one in which the difference between the maximum and minimum queue capacities is minimized, i.e., becomes either 0 or 1.

Nearest greedy for solving the waste collection vehicle routing problem: A case study

NASA Astrophysics Data System (ADS)

Mat, Nur Azriati; Benjamin, Aida Mauziah; Abdul-Rahman, Syariza; Wibowo, Antoni

2017-11-01

This paper presents a real case study pertaining to an issue related to waste collection in the northern part of Malaysia by using a constructive heuristic algorithm known as the Nearest Greedy (NG) technique. This technique has been widely used to devise initial solutions for issues concerning vehicle routing. Basically, the waste collection cycle involves the following steps: i) each vehicle starts from a depot, ii) visits a number of customers to collect waste, iii) unloads waste at the disposal site, and lastly, iv) returns to the depot. Moreover, the sample data set used in this paper consisted of six areas, where each area involved up to 103 customers. In this paper, the NG technique was employed to construct an initial route for each area. The solution proposed from the technique was compared with the present vehicle routes implemented by a waste collection company within the city. The comparison results portrayed that NG offered better vehicle routes with a 11.07% reduction of the total distance traveled, in comparison to the present vehicle routes.

CCS-DTN: Clustering and Network Coding-Based Efficient Routing in Social DTNs

PubMed Central

Zhang, Zhenjing; Ma, Maode; Jin, Zhigang

2015-01-01

With the development of mobile Internet, wireless communication via mobile devices has become a hot research topic, which is typically in the form of Delay Tolerant Networks (DTNs). One critical issue in the development of DTNs is routing. Although there is a lot research work addressing routing issues in DTNs, they cannot produce an advanced solution to the comprehensive challenges since only one or two aspects (nodes' movements, clustering, centricity and so on) are considered when the routing problem is handled. In view of these defects in the existing works, we propose a novel solution to address the routing issue in social DTNs. By this solution, mobile nodes are divided into different clusters. The scheme, Spray and Wait, is used for the intra-cluster communication while a new forwarding mechanism is designed for the inter-cluster version. In our solution, the characteristics of nodes and the relation between nodes are fully considered. The simulation results show that our proposed scheme can significantly improve the performance of the routing scheme in social DTNs. PMID:25609047

High-Temperature Metal Matrix Composites

DTIC Science & Technology

1990-06-01

Graduate Student, PhD Candidate Oct 1986 - August 1989. H. Henein: Principal Investigator of Blending Task. Productivity : Papers - J.O.G. Parent, J. Iyengar...the powder metallurgy route provides a better controlled means of forming the product . An overview of the P/M processing route is shown in Figure 1...This approach has its inherent problems. The requirement of a uniform distrihution of the reinforcement material is not always readily achieved. In P/M

A Model of Onion Routing With Provable Anonymity

DTIC Science & Technology

2006-08-30

Lysyanskaya. “A Formal Treatment of Onion Routing.” CRYPTO 2005, pp. 169.187, 2005. [4] David Chaum . “The dining cryptographers problem...1988. [5] David Chaum . “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms.” Communi- cations of the ACM, 24(2), pp. 84-88, 1981...network layer.” ACM Conference on Computer and Communications Security, pp. 193-206, 2002. [11] David Goldschlag, Michael Reed, and Paul Syverson

Sarsen Stones of Stonehenge: How and by what route were the stones transported? What is the significance of their markings?

PubMed

Hill, P A

1961-04-21

A route via Lockeridge and the Avon Valley, involving a slide down the chalk escarpment, is postulated for the sarsen stones of Stonehenge. The transportation problem would have been greatly simplified if the stones had been relayed from point to point over snow or slush during successive winters. Markings on the stones hitherto undescribed are interpreted.

Simulation of product distribution at PT Anugrah Citra Boga by using capacitated vehicle routing problem method

NASA Astrophysics Data System (ADS)

Lamdjaya, T.; Jobiliong, E.

2017-01-01

PT Anugrah Citra Boga is a food processing industry that produces meatballs as their main product. The distribution system of the products must be considered, because it needs to be more efficient in order to reduce the shipment cost. The purpose of this research is to optimize the distribution time by simulating the distribution channels with capacitated vehicle routing problem method. Firstly, the distribution route is observed in order to calculate the average speed, time capacity and shipping costs. Then build the model using AIMMS software. A few things that are required to simulate the model are customer locations, distances, and the process time. Finally, compare the total distribution cost obtained by the simulation and the historical data. It concludes that the company can reduce the shipping cost around 4.1% or Rp 529,800 per month. By using this model, the utilization rate can be more optimal. The current value for the first vehicle is 104.6% and after the simulation it becomes 88.6%. Meanwhile, the utilization rate of the second vehicle is increase from 59.8% to 74.1%. The simulation model is able to produce the optimal shipping route with time restriction, vehicle capacity, and amount of vehicle.

Cooperative vehicles for robust traffic congestion reduction: An analysis based on algorithmic, environmental and agent behavioral factors

PubMed Central

Desai, Prajakta; Desai, Aniruddha

2017-01-01

Traffic congestion continues to be a persistent problem throughout the world. As vehicle-to-vehicle communication develops, there is an opportunity of using cooperation among close proximity vehicles to tackle the congestion problem. The intuition is that if vehicles could cooperate opportunistically when they come close enough to each other, they could, in effect, spread themselves out among alternative routes so that vehicles do not all jam up on the same roads. Our previous work proposed a decentralized multiagent based vehicular congestion management algorithm entitled Congestion Avoidance and Route Allocation using Virtual Agent Negotiation (CARAVAN), wherein the vehicles acting as intelligent agents perform cooperative route allocation using inter-vehicular communication. This paper focuses on evaluating the practical applicability of this approach by testing its robustness and performance (in terms of travel time reduction), across variations in: (a) environmental parameters such as road network topology and configuration; (b) algorithmic parameters such as vehicle agent preferences and route cost/preference multipliers; and (c) agent-related parameters such as equipped/non-equipped vehicles and compliant/non-compliant agents. Overall, the results demonstrate the adaptability and robustness of the decentralized cooperative vehicles approach to providing global travel time reduction using simple local coordination strategies. PMID:28792513

Cooperative vehicles for robust traffic congestion reduction: An analysis based on algorithmic, environmental and agent behavioral factors.

PubMed

Desai, Prajakta; Loke, Seng W; Desai, Aniruddha

2017-01-01

Traffic congestion continues to be a persistent problem throughout the world. As vehicle-to-vehicle communication develops, there is an opportunity of using cooperation among close proximity vehicles to tackle the congestion problem. The intuition is that if vehicles could cooperate opportunistically when they come close enough to each other, they could, in effect, spread themselves out among alternative routes so that vehicles do not all jam up on the same roads. Our previous work proposed a decentralized multiagent based vehicular congestion management algorithm entitled Congestion Avoidance and Route Allocation using Virtual Agent Negotiation (CARAVAN), wherein the vehicles acting as intelligent agents perform cooperative route allocation using inter-vehicular communication. This paper focuses on evaluating the practical applicability of this approach by testing its robustness and performance (in terms of travel time reduction), across variations in: (a) environmental parameters such as road network topology and configuration; (b) algorithmic parameters such as vehicle agent preferences and route cost/preference multipliers; and (c) agent-related parameters such as equipped/non-equipped vehicles and compliant/non-compliant agents. Overall, the results demonstrate the adaptability and robustness of the decentralized cooperative vehicles approach to providing global travel time reduction using simple local coordination strategies.

Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks

PubMed Central

Robinson, Y. Harold; Rajaram, M.

2015-01-01

Mobile ad hoc network (MANET) is a collection of autonomous mobile nodes forming an ad hoc network without fixed infrastructure. Dynamic topology property of MANET may degrade the performance of the network. However, multipath selection is a great challenging task to improve the network lifetime. We proposed an energy-aware multipath routing scheme based on particle swarm optimization (EMPSO) that uses continuous time recurrent neural network (CTRNN) to solve optimization problems. CTRNN finds the optimal loop-free paths to solve link disjoint paths in a MANET. The CTRNN is used as an optimum path selection technique that produces a set of optimal paths between source and destination. In CTRNN, particle swarm optimization (PSO) method is primly used for training the RNN. The proposed scheme uses the reliability measures such as transmission cost, energy factor, and the optimal traffic ratio between source and destination to increase routing performance. In this scheme, optimal loop-free paths can be found using PSO to seek better link quality nodes in route discovery phase. PSO optimizes a problem by iteratively trying to get a better solution with regard to a measure of quality. The proposed scheme discovers multiple loop-free paths by using PSO technique. PMID:26819966

Application of cellular automatons and ant algorithms in avionics

NASA Astrophysics Data System (ADS)

Kuznetsov, A. V.; Selvesiuk, N. I.; Platoshin, G. A.; Semenova, E. V.

2018-03-01

The paper considers two algorithms for searching quasi-optimal solutions of discrete optimization problems with regard to the tasks of avionics placing. The first one solves the problem of optimal placement of devices by installation locations, the second one is for the problem of finding the shortest route between devices. Solutions are constructed using a cellular automaton and the ant colony algorithm.

Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows

PubMed Central

Jawarneh, Sana; Abdullah, Salwani

2015-01-01

This paper presents a bee colony optimisation (BCO) algorithm to tackle the vehicle routing problem with time window (VRPTW). The VRPTW involves recovering an ideal set of routes for a fleet of vehicles serving a defined number of customers. The BCO algorithm is a population-based algorithm that mimics the social communication patterns of honeybees in solving problems. The performance of the BCO algorithm is dependent on its parameters, so the online (self-adaptive) parameter tuning strategy is used to improve its effectiveness and robustness. Compared with the basic BCO, the adaptive BCO performs better. Diversification is crucial to the performance of the population-based algorithm, but the initial population in the BCO algorithm is generated using a greedy heuristic, which has insufficient diversification. Therefore the ways in which the sequential insertion heuristic (SIH) for the initial population drives the population toward improved solutions are examined. Experimental comparisons indicate that the proposed adaptive BCO-SIH algorithm works well across all instances and is able to obtain 11 best results in comparison with the best-known results in the literature when tested on Solomon’s 56 VRPTW 100 customer instances. Also, a statistical test shows that there is a significant difference between the results. PMID:26132158

Cloud-based large-scale air traffic flow optimization

NASA Astrophysics Data System (ADS)

Cao, Yi

The ever-increasing traffic demand makes the efficient use of airspace an imperative mission, and this paper presents an effort in response to this call. Firstly, a new aggregate model, called Link Transmission Model (LTM), is proposed, which models the nationwide traffic as a network of flight routes identified by origin-destination pairs. The traversal time of a flight route is assumed to be the mode of distribution of historical flight records, and the mode is estimated by using Kernel Density Estimation. As this simplification abstracts away physical trajectory details, the complexity of modeling is drastically decreased, resulting in efficient traffic forecasting. The predicative capability of LTM is validated against recorded traffic data. Secondly, a nationwide traffic flow optimization problem with airport and en route capacity constraints is formulated based on LTM. The optimization problem aims at alleviating traffic congestions with minimal global delays. This problem is intractable due to millions of variables. A dual decomposition method is applied to decompose the large-scale problem such that the subproblems are solvable. However, the whole problem is still computational expensive to solve since each subproblem is an smaller integer programming problem that pursues integer solutions. Solving an integer programing problem is known to be far more time-consuming than solving its linear relaxation. In addition, sequential execution on a standalone computer leads to linear runtime increase when the problem size increases. To address the computational efficiency problem, a parallel computing framework is designed which accommodates concurrent executions via multithreading programming. The multithreaded version is compared with its monolithic version to show decreased runtime. Finally, an open-source cloud computing framework, Hadoop MapReduce, is employed for better scalability and reliability. This framework is an "off-the-shelf" parallel computing model that can be used for both offline historical traffic data analysis and online traffic flow optimization. It provides an efficient and robust platform for easy deployment and implementation. A small cloud consisting of five workstations was configured and used to demonstrate the advantages of cloud computing in dealing with large-scale parallelizable traffic problems.

Communications network design and costing model technical manual

NASA Technical Reports Server (NTRS)

Logan, K. P.; Somes, S. S.; Clark, C. A.

1983-01-01

This computer model provides the capability for analyzing long-haul trunking networks comprising a set of user-defined cities, traffic conditions, and tariff rates. Networks may consist of all terrestrial connectivity, all satellite connectivity, or a combination of terrestrial and satellite connectivity. Network solutions provide the least-cost routes between all cities, the least-cost network routing configuration, and terrestrial and satellite service cost totals. The CNDC model allows analyses involving three specific FCC-approved tariffs, which are uniquely structured and representative of most existing service connectivity and pricing philosophies. User-defined tariffs that can be variations of these three tariffs are accepted as input to the model and allow considerable flexibility in network problem specification. The resulting model extends the domain of network analysis from traditional fixed link cost (distance-sensitive) problems to more complex problems involving combinations of distance and traffic-sensitive tariffs.

All-Optical Implementation of the Ant Colony Optimization Algorithm

PubMed Central

Hu, Wenchao; Wu, Kan; Shum, Perry Ping; Zheludev, Nikolay I.; Soci, Cesare

2016-01-01

We report all-optical implementation of the optimization algorithm for the famous “ant colony” problem. Ant colonies progressively optimize pathway to food discovered by one of the ants through identifying the discovered route with volatile chemicals (pheromones) secreted on the way back from the food deposit. Mathematically this is an important example of graph optimization problem with dynamically changing parameters. Using an optical network with nonlinear waveguides to represent the graph and a feedback loop, we experimentally show that photons traveling through the network behave like ants that dynamically modify the environment to find the shortest pathway to any chosen point in the graph. This proof-of-principle demonstration illustrates how transient nonlinearity in the optical system can be exploited to tackle complex optimization problems directly, on the hardware level, which may be used for self-routing of optical signals in transparent communication networks and energy flow in photonic systems. PMID:27222098

Departure Trajectory Synthesis and the Intercept Problem

NASA Technical Reports Server (NTRS)

Bolender, Michael A.; Slater, G. L.

1997-01-01

Two areas of the departure problem in air traffic control are discussed. The first topic is the generation of climb-out trajectories to a fix. The trajectories would be utilized by a scheduling algorithm to allocate runways, sequence the proposed departures, and assign a departure time. The second area is concerned with finding horizontal trajectories to merge aircraft from the TRACON to an open slot in the en-route environment. Solutions are presented for the intercept problem for two cases: (1) the aircraft is traveling at the speed of the aircraft in the jetway; (2) the merging aircraft has to accelerate to reach the speed of the aircraft in the en-route stream. An algorithm is given regarding the computation of a solution for the latter case. For the former, a set of equations is given that allows us to numerically solve for the coordinate where the merge will occur.

Parallel optimization algorithm for drone inspection in the building industry

NASA Astrophysics Data System (ADS)

Walczyński, Maciej; BoŻejko, Wojciech; Skorupka, Dariusz

2017-07-01

In this paper we present an approach for Vehicle Routing Problem with Drones (VRPD) in case of building inspection from the air. In autonomic inspection process there is a need to determine of the optimal route for inspection drone. This is especially important issue because of the very limited flight time of modern multicopters. The method of determining solutions for Traveling Salesman Problem(TSP), described in this paper bases on Parallel Evolutionary Algorithm (ParEA)with cooperative and independent approach for communication between threads. This method described first by Bożejko and Wodecki [1] bases on the observation that if exists some number of elements on certain positions in a number of permutations which are local minima, then those elements will be in the same position in the optimal solution for TSP problem. Numerical experiments were made on BEM computational cluster with using MPI library.

Multicast Routing and Wavelength Assignment with Shared Protection in Multi-Fiber WDM Mesh Networks: Optimal and Heuristic Solutions

NASA Astrophysics Data System (ADS)

Woradit, Kampol; Guyot, Matthieu; Vanichchanunt, Pisit; Saengudomlert, Poompat; Wuttisittikulkij, Lunchakorn

While the problem of multicast routing and wavelength assignment (MC-RWA) in optical wavelength division multiplexing (WDM) networks has been investigated, relatively few researchers have considered network survivability for multicasting. This paper provides an optimization framework to solve the MC-RWA problem in a multi-fiber WDM network that can recover from a single-link failure with shared protection. Using the light-tree (LT) concept to support multicast sessions, we consider two protection strategies that try to reduce service disruptions after a link failure. The first strategy, called light-tree reconfiguration (LTR) protection, computes a new multicast LT for each session affected by the failure. The second strategy, called optical branch reconfiguration (OBR) protection, tries to restore a logical connection between two adjacent multicast members disconnected by the failure. To solve the MC-RWA problem optimally, we propose an integer linear programming (ILP) formulation that minimizes the total number of fibers required for both working and backup traffic. The ILP formulation takes into account joint routing of working and backup traffic, the wavelength continuity constraint, and the limited splitting degree of multicast-capable optical cross-connects (MC-OXCs). After showing some numerical results for optimal solutions, we propose heuristic algorithms that reduce the computational complexity and make the problem solvable for large networks. Numerical results suggest that the proposed heuristic yields efficient solutions compared to optimal solutions obtained from exact optimization.

Assessing green waste route by using Network Analysis

NASA Astrophysics Data System (ADS)

Hasmantika, I. H.; Maryono, M.

2018-02-01

Green waste, such as waste from park need treat proper. One of the main problems of green waste management is how to design optimum collection. This research aims to determine the optimum green waste collection by determining optimum route among park. The route optimum was assessed by using network analysis method. And the region five of Semarang city’s park within 20 parks in chose as case study. To enhancing recycle of green waste, three scenarios of treatment are proposed. Scenario 1 used one integrated treatment facility as terminal for enhancing recycle of green waste, Scenario 2 used two sites and scenario 3 used three sites. According to the assessment, the length of route of scenario 1 is 36.126 km and the time for collection estimated is 46 minutes. In scenario 2, the length of route is 36.471 km with a travel time is 47 minutes. The length of scenario three is 46.934 km and the time of collection is 60 minutes.

Text chat as a tool for referential questioning in Asperger syndrome.

PubMed

Rajendran, Gnanathusharan; Mitchell, Peter

2006-02-01

This article reports a study in which referential communication in 11 individuals with Asperger syndrome (AS) and 11 controls was compared between text chat and telephone, using a route-solving task. Participants deduced routes by asking closed questions, and the dependent variables were (a) accuracy in working out the route, (b) number of questions posed (turns taken), and (c) time taken to complete the task. Generally, individuals with AS were equally competent in solving the task in both media but less efficient than the typically developing comparison group. Individuals with AS who had higher measured executive ability adopted a similar approach to the comparison group, asking about landmarks on the map to deduce the route taken. In contrast, AS participants with lower executive ability used an inefficient left/right questioning strategy, which occupied more time, required more conversational turns, and was associated with a higher rate of error. Individuals with AS, who also have problems of executive functioning, may have difficulty communicating with others to use a route-solving task.

Joint Power Charging and Routing in Wireless Rechargeable Sensor Networks.

PubMed

Jia, Jie; Chen, Jian; Deng, Yansha; Wang, Xingwei; Aghvami, Abdol-Hamid

2017-10-09

The development of wireless power transfer (WPT) technology has inspired the transition from traditional battery-based wireless sensor networks (WSNs) towards wireless rechargeable sensor networks (WRSNs). While extensive efforts have been made to improve charging efficiency, little has been done for routing optimization. In this work, we present a joint optimization model to maximize both charging efficiency and routing structure. By analyzing the structure of the optimization model, we first decompose the problem and propose a heuristic algorithm to find the optimal charging efficiency for the predefined routing tree. Furthermore, by coding the many-to-one communication topology as an individual, we further propose to apply a genetic algorithm (GA) for the joint optimization of both routing and charging. The genetic operations, including tree-based recombination and mutation, are proposed to obtain a fast convergence. Our simulation results show that the heuristic algorithm reduces the number of resident locations and the total moving distance. We also show that our proposed algorithm achieves a higher charging efficiency compared with existing algorithms.

Joint Power Charging and Routing in Wireless Rechargeable Sensor Networks

PubMed Central

Jia, Jie; Chen, Jian; Deng, Yansha; Wang, Xingwei; Aghvami, Abdol-Hamid

2017-01-01

The development of wireless power transfer (WPT) technology has inspired the transition from traditional battery-based wireless sensor networks (WSNs) towards wireless rechargeable sensor networks (WRSNs). While extensive efforts have been made to improve charging efficiency, little has been done for routing optimization. In this work, we present a joint optimization model to maximize both charging efficiency and routing structure. By analyzing the structure of the optimization model, we first decompose the problem and propose a heuristic algorithm to find the optimal charging efficiency for the predefined routing tree. Furthermore, by coding the many-to-one communication topology as an individual, we further propose to apply a genetic algorithm (GA) for the joint optimization of both routing and charging. The genetic operations, including tree-based recombination and mutation, are proposed to obtain a fast convergence. Our simulation results show that the heuristic algorithm reduces the number of resident locations and the total moving distance. We also show that our proposed algorithm achieves a higher charging efficiency compared with existing algorithms. PMID:28991200

Integrated consensus-based frameworks for unmanned vehicle routing and targeting assignment

NASA Astrophysics Data System (ADS)

Barnawi, Waleed T.

Unmanned aerial vehicles (UAVs) are increasingly deployed in complex and dynamic environments to perform multiple tasks cooperatively with other UAVs that contribute to overarching mission effectiveness. Studies by the Department of Defense (DoD) indicate future operations may include anti-access/area-denial (A2AD) environments which limit human teleoperator decision-making and control. This research addresses the problem of decentralized vehicle re-routing and task reassignments through consensus-based UAV decision-making. An Integrated Consensus-Based Framework (ICF) is formulated as a solution to the combined single task assignment problem and vehicle routing problem. The multiple assignment and vehicle routing problem is solved with the Integrated Consensus-Based Bundle Framework (ICBF). The frameworks are hierarchically decomposed into two levels. The bottom layer utilizes the renowned Dijkstra's Algorithm. The top layer addresses task assignment with two methods. The single assignment approach is called the Caravan Auction Algorithm (CarA) Algorithm. This technique extends the Consensus-Based Auction Algorithm (CBAA) to provide awareness for task completion by agents and adopt abandoned tasks. The multiple assignment approach called the Caravan Auction Bundle Algorithm (CarAB) extends the Consensus-Based Bundle Algorithm (CBBA) by providing awareness for lost resources, prioritizing remaining tasks, and adopting abandoned tasks. Research questions are investigated regarding the novelty and performance of the proposed frameworks. Conclusions regarding the research questions will be provided through hypothesis testing. Monte Carlo simulations will provide evidence to support conclusions regarding the research hypotheses for the proposed frameworks. The approach provided in this research addresses current and future military operations for unmanned aerial vehicles. However, the general framework implied by the proposed research is adaptable to any unmanned vehicle. Civil applications that involve missions where human observability would be limited could benefit from the independent UAV task assignment, such as exploration and fire surveillance are also notable uses for this approach.

Optimization-based channel constrained data aggregation routing algorithms in multi-radio wireless sensor networks.

PubMed

Yen, Hong-Hsu

2009-01-01

In wireless sensor networks, data aggregation routing could reduce the number of data transmissions so as to achieve energy efficient transmission. However, data aggregation introduces data retransmission that is caused by co-channel interference from neighboring sensor nodes. This kind of co-channel interference could result in extra energy consumption and significant latency from retransmission. This will jeopardize the benefits of data aggregation. One possible solution to circumvent data retransmission caused by co-channel interference is to assign different channels to every sensor node that is within each other's interference range on the data aggregation tree. By associating each radio with a different channel, a sensor node could receive data from all the children nodes on the data aggregation tree simultaneously. This could reduce the latency from the data source nodes back to the sink so as to meet the user's delay QoS. Since the number of radios on each sensor node and the number of non-overlapping channels are all limited resources in wireless sensor networks, a challenging question here is to minimize the total transmission cost under limited number of non-overlapping channels in multi-radio wireless sensor networks. This channel constrained data aggregation routing problem in multi-radio wireless sensor networks is an NP-hard problem. I first model this problem as a mixed integer and linear programming problem where the objective is to minimize the total transmission subject to the data aggregation routing, channel and radio resources constraints. The solution approach is based on the Lagrangean relaxation technique to relax some constraints into the objective function and then to derive a set of independent subproblems. By optimally solving these subproblems, it can not only calculate the lower bound of the original primal problem but also provide useful information to get the primal feasible solutions. By incorporating these Lagrangean multipliers as the link arc weight, the optimization-based heuristics are proposed to get energy-efficient data aggregation tree with better resource (channel and radio) utilization. From the computational experiments, the proposed optimization-based approach is superior to existing heuristics under all tested cases.

Scheduling and control strategies for the departure problem in air traffic control

NASA Astrophysics Data System (ADS)

Bolender, Michael Alan

Two problems relating to the departure problem in air traffic control automation are examined. The first problem that is addressed is the scheduling of aircraft for departure. The departure operations at a major US hub airport are analyzed, and a discrete event simulation of the departure operations is constructed. Specifically, the case where there is a single departure runway is considered. The runway is fed by two queues of aircraft. Each queue, in turn, is fed by a single taxiway. Two salient areas regarding scheduling are addressed. The first is the construction of optimal departure sequences for the aircraft that are queued. Several greedy search algorithms are designed to minimize the total time to depart a set of queued aircraft. Each algorithm has a different set of heuristic rules to resolve situations within the search space whenever two branches of the search tree with equal edge costs are encountered. These algorithms are then compared and contrasted with a genetic search algorithm in order to assess the performance of the heuristics. This is done in the context of a static departure problem where the length of the departure queue is fixed. A greedy algorithm which deepens the search whenever two branches of the search tree with non-unique costs are encountered is shown to outperform the other heuristic algorithms. This search strategy is then implemented in the discrete event simulation. A baseline performance level is established, and a sensitivity analysis is performed by implementing changes in traffic mix, routing, and miles-in-trail restrictions for comparison. It is concluded that to minimize the average time spent in the queue for different traffic conditions, a queue assignment algorithm is needed to maintain an even balance of aircraft in the queues. A necessary consideration is to base queue assignment upon traffic management restrictions such as miles-in-trail constraints. The second problem addresses the technical challenges associated with merging departure aircraft onto their filed routes in a congested airspace environment. Conflicts between departures and en route aircraft within the Center airspace are analyzed. Speed control, holding the aircraft; at an intermediate altitude, re-routing, and vectoring are posed as possible deconfliction maneuvers. A cost assessment of these merge strategies, which are based upon 4D fight management and conflict detection and resolution principles, is given. Several merge conflicts are studied and a cost for each resolution is computed. It is shown that vectoring tends to be the most expensive resolution technique. Altitude hold is simple, costs less than vectoring, but may require a long time for the aircraft to achieve separation. Re-routing is the simplest, and provides the most cost benefit since the aircraft flies a shorter distance than if it had followed its filed route. Speed control is shown to be ineffective as a means of increasing separation, but is effective for maintaining separation between aircraft. In addition, the affects of uncertainties on the cost are assessed. The analysis shows that cost is invariant with the decision time.

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

DOT National Transportation Integrated Search

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...

Coastal sedimentation

NASA Technical Reports Server (NTRS)

Schubel, J. R.

1980-01-01

Several important coastal sedimentation problems are identified. Application of existing or anticipated remote sensing techniques to examine these problems is considered. Specifically, coastal fine particle sediment systems, floods and hy hurricanes and sedimentation f of coastal systems, routes and rates of sediment transport on continental shelves, and dredging and dredged material disposal are discussed.

Using Approximate Dynamic Programming to Solve the Stochastic Demand Military Inventory Routing Problem with Direct Delivery

DTIC Science & Technology

due to the dangers of utilizing convoy operations. However, enemy actions, austere conditions, and inclement weather pose a significant risk to a...squares temporal differencing for policy evaluation. We construct a representative problem instance based on an austere combat environment in order to

Adapting the traveling salesman problem to an adiabatic quantum computer

NASA Astrophysics Data System (ADS)

Warren, Richard H.

2013-04-01

We show how to guide a quantum computer to select an optimal tour for the traveling salesman. This is significant because it opens a rapid solution method for the wide range of applications of the traveling salesman problem, which include vehicle routing, job sequencing and data clustering.

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

PubMed

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.

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

PubMed Central

Tseng, Chinyang Henry

2016-01-01

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. PMID:27258297

Analysis and Algorithms for Imperfect Sensor Deployment and Operations

DTIC Science & Technology

2016-05-23

fortification-interdiction-routing games that take place over the traveling salesman problem (TSP) in reference 16. This study reveals that a straightforward...Journal on Optimization. 16. Lozano, L., Smith, J.C., and Kurz, M.E., Solving the Traveling Salesman Problem with Interdiction and Fortification...the Traveling Salesman Problem with Interdiction and Fortification, submitted to Operations Research Letters. Tadayon, B. and Smith, J.C., A Survey of

Optimizing integrated airport surface and terminal airspace operations under uncertainty

NASA Astrophysics Data System (ADS)

Bosson, Christabelle S.

In airports and surrounding terminal airspaces, the integration of surface, arrival and departure scheduling and routing have the potential to improve the operations efficiency. Moreover, because both the airport surface and the terminal airspace are often altered by random perturbations, the consideration of uncertainty in flight schedules is crucial to improve the design of robust flight schedules. Previous research mainly focused on independently solving arrival scheduling problems, departure scheduling problems and surface management scheduling problems and most of the developed models are deterministic. This dissertation presents an alternate method to model the integrated operations by using a machine job-shop scheduling formulation. A multistage stochastic programming approach is chosen to formulate the problem in the presence of uncertainty and candidate solutions are obtained by solving sample average approximation problems with finite sample size. The developed mixed-integer-linear-programming algorithm-based scheduler is capable of computing optimal aircraft schedules and routings that reflect the integration of air and ground operations. The assembled methodology is applied to a Los Angeles case study. To show the benefits of integrated operations over First-Come-First-Served, a preliminary proof-of-concept is conducted for a set of fourteen aircraft evolving under deterministic conditions in a model of the Los Angeles International Airport surface and surrounding terminal areas. Using historical data, a representative 30-minute traffic schedule and aircraft mix scenario is constructed. The results of the Los Angeles application show that the integration of air and ground operations and the use of a time-based separation strategy enable both significant surface and air time savings. The solution computed by the optimization provides a more efficient routing and scheduling than the First-Come-First-Served solution. Additionally, a data driven analysis is performed for the Los Angeles environment and probabilistic distributions of pertinent uncertainty sources are obtained. A sensitivity analysis is then carried out to assess the methodology performance and find optimal sampling parameters. Finally, simulations of increasing traffic density in the presence of uncertainty are conducted first for integrated arrivals and departures, then for integrated surface and air operations. To compare the optimization results and show the benefits of integrated operations, two aircraft separation methods are implemented that offer different routing options. The simulations of integrated air operations and the simulations of integrated air and surface operations demonstrate that significant traveling time savings, both total and individual surface and air times, can be obtained when more direct routes are allowed to be traveled even in the presence of uncertainty. The resulting routings induce however extra take off delay for departing flights. As a consequence, some flights cannot meet their initial assigned runway slot which engenders runway position shifting when comparing resulting runway sequences computed under both deterministic and stochastic conditions. The optimization is able to compute an optimal runway schedule that represents an optimal balance between total schedule delays and total travel times.

Location-allocation models and new solution methodologies in telecommunication networks

NASA Astrophysics Data System (ADS)

Dinu, S.; Ciucur, V.

2016-08-01

When designing a telecommunications network topology, three types of interdependent decisions are combined: location, allocation and routing, which are expressed by the following design considerations: how many interconnection devices - consolidation points/concentrators should be used and where should they be located; how to allocate terminal nodes to concentrators; how should the voice, video or data traffic be routed and what transmission links (capacitated or not) should be built into the network. Including these three components of the decision into a single model generates a problem whose complexity makes it difficult to solve. A first method to address the overall problem is the sequential one, whereby the first step deals with the location-allocation problem and based on this solution the subsequent sub-problem (routing the network traffic) shall be solved. The issue of location and allocation in a telecommunications network, called "The capacitated concentrator location- allocation - CCLA problem" is based on one of the general location models on a network in which clients/demand nodes are the terminals and facilities are the concentrators. Like in a location model, each client node has a demand traffic, which must be served, and the facilities can serve these demands within their capacity limit. In this study, the CCLA problem is modeled as a single-source capacitated location-allocation model whose optimization objective is to determine the minimum network cost consisting of fixed costs for establishing the locations of concentrators, costs for operating concentrators and costs for allocating terminals to concentrators. The problem is known as a difficult combinatorial optimization problem for which powerful algorithms are required. Our approach proposes a Fuzzy Genetic Algorithm combined with a local search procedure to calculate the optimal values of the location and allocation variables. To confirm the efficiency of the proposed algorithm with respect to the quality of solutions, significant size test problems were considered: up to 100 terminal nodes and 50 concentrators on a 100 × 100 square grid. The performance of this hybrid intelligent algorithm was evaluated by measuring the quality of its solutions with respect to the following statistics: the standard deviation and the ratio of the best solution obtained.

Nudging socially isolated people towards well-being with the 'Happiness Route': design of a randomized controlled trial for the evaluation of a happiness-based intervention.

PubMed

Weiss, Laura A; Westerhof, Gerben J; Bohlmeijer, Ernst T

2013-09-20

The Happiness Route is an innovative intervention that uses a happiness-based approach for people with an accumulation of risk factors for low well-being: socially isolated people with health impairments and a low socioeconomic status. The goal of this intervention is to improve well-being by engaging participants in intrinsically motivated activities with methods from positive psychology. We hypothesize that the primary outcome measure, emotional, social and psychological well-being of participants of the Happiness Route, will increase in comparison to the traditional and commonly-used problem-based approach. Secondary outcome measures are health-related quality of life, psychosocial functioning and health care consumption. Participants will be socially isolated people with health problems and a low socioeconomic status. Participants will be recruited in ten Dutch communities and candidates will be signed up by intermediaries, professionals from the health and social sector. Randomly assigned, half of the participants will follow the Happiness Route and half of the participants will follow the active, problem-focused control group 'Customized Care'. In total, 256 participants will be included. In both conditions, participants will receive counseling sessions from trained counselors. In the control group, participants will talk about their problems and the care they get and counselors help to optimize their care. In the Happiness Route, the counselor ask questions such as "How do you want to live your life?". The intervention helps people to find their 'passion', i.e., a positive goal-engaged and intrinsically motivated activity. It enables them to follow their passion through by a once-only personal happiness budget (maximal €500). We use well-validated and reliable questionnaires to measure primary and secondary outcome measures at baseline, directly after the intervention and at a nine-month follow-up. Shortcomings of earlier intervention studies in positive psychology will be tackled with this study, such as having a target group who is especially vulnerable for low well-being. The practice-based setting is especially interesting, as it can give valuable insights in how positive psychology interventions work in practice, but can also give rise to several challenges. Dutch Trial Register, trial registration number TC=3377NTR.http://www.trialregister.nl/trialreg/admin/rctview.asp?TC=3377.

A social activity and physical contact-based routing algorithm in mobile opportunistic networks for emergency response to sudden disasters

NASA Astrophysics Data System (ADS)

Wang, Xiaoming; Lin, Yaguang; Zhang, Shanshan; Cai, Zhipeng

2017-05-01

Sudden disasters such as earthquake, flood and hurricane necessitate the employment of communication networks to carry out emergency response activities. Routing has a significant impact on the functionality, performance and flexibility of communication networks. In this article, the routing problem is studied considering the delivery ratio of messages, the overhead ratio of messages and the average delay of messages in mobile opportunistic networks (MONs) for enterprise-level emergency response communications in sudden disaster scenarios. Unlike the traditional routing methods for MONS, this article presents a new two-stage spreading and forwarding dynamic routing algorithm based on the proposed social activity degree and physical contact factor for mobile customers. A new modelling method for describing a dynamic evolving process of the topology structure of a MON is first proposed. Then a multi-copy spreading strategy based on the social activity degree of nodes and a single-copy forwarding strategy based on the physical contact factor between nodes are designed. Compared with the most relevant routing algorithms such as Epidemic, Prophet, Labelled-sim, Dlife-comm and Distribute-sim, the proposed routing algorithm can significantly increase the delivery ratio of messages, and decrease the overhead ratio and average delay of messages.

Distributed Efficient Similarity Search Mechanism in Wireless Sensor Networks

PubMed Central

Ahmed, Khandakar; Gregory, Mark A.

2015-01-01

The Wireless Sensor Network similarity search problem has received considerable research attention due to sensor hardware imprecision and environmental parameter variations. Most of the state-of-the-art distributed data centric storage (DCS) schemes lack optimization for similarity queries of events. In this paper, a DCS scheme with metric based similarity searching (DCSMSS) is proposed. DCSMSS takes motivation from vector distance index, called iDistance, in order to transform the issue of similarity searching into the problem of an interval search in one dimension. In addition, a sector based distance routing algorithm is used to efficiently route messages. Extensive simulation results reveal that DCSMSS is highly efficient and significantly outperforms previous approaches in processing similarity search queries. PMID:25751081

Achieving network level privacy in Wireless Sensor Networks.

PubMed

Shaikh, Riaz Ahmed; Jameel, Hassan; d'Auriol, Brian J; Lee, Heejo; Lee, Sungyoung; Song, Young-Jae

2010-01-01

Full network level privacy has often been categorized into four sub-categories: Identity, Route, Location and Data privacy. Achieving full network level privacy is a critical and challenging problem due to the constraints imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility and topology) and QoS issues (e.g., packet reach-ability and timeliness). In this paper, we proposed two new identity, route and location privacy algorithms and data privacy mechanism that addresses this problem. The proposed solutions provide additional trustworthiness and reliability at modest cost of memory and energy. Also, we proved that our proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks.

Achieving Network Level Privacy in Wireless Sensor Networks†

PubMed Central

Shaikh, Riaz Ahmed; Jameel, Hassan; d’Auriol, Brian J.; Lee, Heejo; Lee, Sungyoung; Song, Young-Jae

2010-01-01

Full network level privacy has often been categorized into four sub-categories: Identity, Route, Location and Data privacy. Achieving full network level privacy is a critical and challenging problem due to the constraints imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility and topology) and QoS issues (e.g., packet reach-ability and timeliness). In this paper, we proposed two new identity, route and location privacy algorithms and data privacy mechanism that addresses this problem. The proposed solutions provide additional trustworthiness and reliability at modest cost of memory and energy. Also, we proved that our proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks. PMID:22294881

Separation-Compliant, Optimal Routing and Control of Scheduled Arrivals in a Terminal Airspace

NASA Technical Reports Server (NTRS)

Sadovsky, Alexander V.; Davis, Damek; Isaacson, Douglas R.

2013-01-01

We address the problem of navigating a set (fleet) of aircraft in an aerial route network so as to bring each aircraft to its destination at a specified time and with minimal distance separation assured between all aircraft at all times. The speed range, initial position, required destination, and required time of arrival at destination for each aircraft are assumed provided. Each aircraft's movement is governed by a controlled differential equation (state equation). The problem consists in choosing for each aircraft a path in the route network and a control strategy so as to meet the constraints and reach the destination at the required time. The main contribution of the paper is a model that allows to recast this problem as a decoupled collection of problems in classical optimal control and is easily generalized to the case when inertia cannot be neglected. Some qualitative insight into solution behavior is obtained using the Pontryagin Maximum Principle. Sample numerical solutions are computed using a numerical optimal control solver. The proposed model is first step toward increasing the fidelity of continuous time control models of air traffic in a terminal airspace. The Pontryagin Maximum Principle implies the polygonal shape of those portions of the state trajectories away from those states in which one or more aircraft pair are at minimal separation. The model also confirms the intuition that, the narrower the allowed speed ranges of the aircraft, the smaller the space of optimal solutions, and that an instance of the optimal control problem may not have a solution at all (i.e., no control strategy that meets the separation requirement and other constraints).

Combined Simulated Annealing and Genetic Algorithm Approach to Bus Network Design

NASA Astrophysics Data System (ADS)

Liu, Li; Olszewski, Piotr; Goh, Pong-Chai

A new method - combined simulated annealing (SA) and genetic algorithm (GA) approach is proposed to solve the problem of bus route design and frequency setting for a given road network with fixed bus stop locations and fixed travel demand. The method involves two steps: a set of candidate routes is generated first and then the best subset of these routes is selected by the combined SA and GA procedure. SA is the main process to search for a better solution to minimize the total system cost, comprising user and operator costs. GA is used as a sub-process to generate new solutions. Bus demand assignment on two alternative paths is performed at the solution evaluation stage. The method was implemented on four theoretical grid networks of different size and a benchmark network. Several GA operators (crossover and mutation) were utilized and tested for their effectiveness. The results show that the proposed method can efficiently converge to the optimal solution on a small network but computation time increases significantly with network size. The method can also be used for other transport operation management problems.

Energy Aware Cluster-Based Routing in Flying Ad-Hoc Networks.

PubMed

Aadil, Farhan; Raza, Ali; Khan, Muhammad Fahad; Maqsood, Muazzam; Mehmood, Irfan; Rho, Seungmin

2018-05-03

Flying ad-hoc networks (FANETs) are a very vibrant research area nowadays. They have many military and civil applications. Limited battery energy and the high mobility of micro unmanned aerial vehicles (UAVs) represent their two main problems, i.e., short flight time and inefficient routing. In this paper, we try to address both of these problems by means of efficient clustering. First, we adjust the transmission power of the UAVs by anticipating their operational requirements. Optimal transmission range will have minimum packet loss ratio (PLR) and better link quality, which ultimately save the energy consumed during communication. Second, we use a variant of the K-Means Density clustering algorithm for selection of cluster heads. Optimal cluster heads enhance the cluster lifetime and reduce the routing overhead. The proposed model outperforms the state of the art artificial intelligence techniques such as Ant Colony Optimization-based clustering algorithm and Grey Wolf Optimization-based clustering algorithm. The performance of the proposed algorithm is evaluated in term of number of clusters, cluster building time, cluster lifetime and energy consumption.

On the preventive management of sediment-related sewer blockages: a combined maintenance and routing optimization approach.

PubMed

Fontecha, John E; Akhavan-Tabatabaei, Raha; Duque, Daniel; Medaglia, Andrés L; Torres, María N; Rodríguez, Juan Pablo

In this work we tackle the problem of planning and scheduling preventive maintenance (PM) of sediment-related sewer blockages in a set of geographically distributed sites that are subject to non-deterministic failures. To solve the problem, we extend a combined maintenance and routing (CMR) optimization approach which is a procedure based on two components: (a) first a maintenance model is used to determine the optimal time to perform PM operations for each site and second (b) a mixed integer program-based split procedure is proposed to route a set of crews (e.g., sewer cleaners, vehicles equipped with winches or rods and dump trucks) in order to perform PM operations at a near-optimal minimum expected cost. We applied the proposed CMR optimization approach to two (out of five) operative zones in the city of Bogotá (Colombia), where more than 100 maintenance operations per zone must be scheduled on a weekly basis. Comparing the CMR against the current maintenance plan, we obtained more than 50% of cost savings in 90% of the sites.

Nanocarriers as pulmonary drug delivery systems to treat and to diagnose respiratory and non respiratory diseases

PubMed Central

Smola, Malgorzata; Vandamme, Thierry; Sokolowski, Adam

2008-01-01

The purpose of this review is to discuss the impact of nanocarriers administered by pulmonary route to treat and to diagnose respiratory and non respiratory diseases. Indeed, during the past 10 years, the removal of chlorofluorocarbon propellants from industrial and household products intended for the pulmonary route has lead to the developments of new alternative products. Amongst these ones, on one hand, a lot of attention has been focused to improve the bioavailability of marketed drugs intended for respiratory diseases and to develop new concepts for pulmonary administration of drugs and, on the other hand, to use the pulmonary route to administer drugs for systemic diseases. This has led to some marketed products through the last decade. Although the introduction of nanotechnology permitted to step over numerous problems and to improve the bioavailability of drugs, there are, however, unresolved delivery problems to be still addressed. These scientific and industrial innovations and challenges are discussed along this review together with an analysis of the current situation concerning the industrial developments. PMID:18488412

AVQS: Attack Route-Based Vulnerability Quantification Scheme for Smart Grid

PubMed Central

Lim, Hyunwoo; Lee, Seokjun; Shon, Taeshik

2014-01-01

A smart grid is a large, consolidated electrical grid system that includes heterogeneous networks and systems. Based on the data, a smart grid system has a potential security threat in its network connectivity. To solve this problem, we develop and apply a novel scheme to measure the vulnerability in a smart grid domain. Vulnerability quantification can be the first step in security analysis because it can help prioritize the security problems. However, existing vulnerability quantification schemes are not suitable for smart grid because they do not consider network vulnerabilities. We propose a novel attack route-based vulnerability quantification scheme using a network vulnerability score and an end-to-end security score, depending on the specific smart grid network environment to calculate the vulnerability score for a particular attack route. To evaluate the proposed approach, we derive several attack scenarios from the advanced metering infrastructure domain. The experimental results of the proposed approach and the existing common vulnerability scoring system clearly show that we need to consider network connectivity for more optimized vulnerability quantification. PMID:25152923

A memetic optimization algorithm for multi-constrained multicast routing in ad hoc networks

PubMed Central

Hammad, Karim; El Bakly, Ahmed M.

2018-01-01

A mobile ad hoc network is a conventional self-configuring network where the routing optimization problem—subject to various Quality-of-Service (QoS) constraints—represents a major challenge. Unlike previously proposed solutions, in this paper, we propose a memetic algorithm (MA) employing an adaptive mutation parameter, to solve the multicast routing problem with higher search ability and computational efficiency. The proposed algorithm utilizes an updated scheme, based on statistical analysis, to estimate the best values for all MA parameters and enhance MA performance. The numerical results show that the proposed MA improved the delay and jitter of the network, while reducing computational complexity as compared to existing algorithms. PMID:29509760

Population resizing on fitness improvement genetic algorithm to optimize promotion visit route based on android and google maps API

NASA Astrophysics Data System (ADS)

Listyorini, Tri; Muzid, Syafiul

2017-06-01

The promotion team of Muria Kudus University (UMK) has done annual promotion visit to several senior high schools in Indonesia. The visits were done to numbers of schools in Kudus, Jepara, Demak, Rembang and Purwodadi. To simplify the visit, each visit round is limited to 15 (fifteen) schools. However, the team frequently faces some obstacles during the visit, particularly in determining the route that they should take toward the targeted school. It is due to the long distance or the difficult route to reach the targeted school that leads to elongated travel duration and inefficient fuel cost. To solve these problems, the development of a certain application using heuristic genetic algorithm method based on the dynamic of population size or Population Resizing on Fitness lmprovement Genetic Algorithm (PRoFIGA), was done. This android-based application was developed to make the visit easier and to determine a shorter route for the team, hence, the visiting period will be effective and efficient. The result of this research was an android-based application to determine the shortest route by combining heuristic method and Google Maps Application Programming lnterface (API) that display the route options for the team.

Sigma Routing Metric for RPL Protocol.

PubMed

Sanmartin, Paul; Rojas, Aldo; Fernandez, Luis; Avila, Karen; Jabba, Daladier; Valle, Sebastian

2018-04-21

This paper presents the adaptation of a specific metric for the RPL protocol in the objective function MRHOF. Among the functions standardized by IETF, we find OF0, which is based on the minimum hop count, as well as MRHOF, which is based on the Expected Transmission Count (ETX). However, when the network becomes denser or the number of nodes increases, both OF0 and MRHOF introduce long hops, which can generate a bottleneck that restricts the network. The adaptation is proposed to optimize both OFs through a new routing metric. To solve the above problem, the metrics of the minimum number of hops and the ETX are combined by designing a new routing metric called SIGMA-ETX, in which the best route is calculated using the standard deviation of ETX values between each node, as opposed to working with the ETX average along the route. This method ensures a better routing performance in dense sensor networks. The simulations are done through the Cooja simulator, based on the Contiki operating system. The simulations showed that the proposed optimization outperforms at a high margin in both OF0 and MRHOF, in terms of network latency, packet delivery ratio, lifetime, and power consumption.

A new method for solving routing and wavelength assignment problems under inaccurate routing information in optical networks with conversion capability

NASA Astrophysics Data System (ADS)

Luo, Yanting; Zhang, Yongjun; Gu, Wanyi

2009-11-01

In large dynamic networks it is extremely difficult to maintain accurate routing information on all network nodes. The existing studies have illustrated the impact of imprecise state information on the performance of dynamic routing and wavelength assignment (RWA) algorithms. An algorithm called Bypass Based Optical Routing (BBOR) proposed by Xavier Masip-Bruin et al can reduce the effects of having inaccurate routing information in networks operating under the wavelength-continuity constraint. Then they extended the BBOR mechanism (for convenience it's called EBBOR mechanism below) to be applied to the networks with sparse and limited wavelength conversion. But it only considers the characteristic of wavelength conversion in the step of computing the bypass-paths so that its performance may decline with increasing the degree of wavelength translation (this concept will be explained in the section of introduction again). We will demonstrate the issue through theoretical analysis and introduce a novel algorithm which modifies both the lightpath selection and the bypass-paths computation in comparison to EBBOR algorithm. Simulations show that the Modified EBBOR (MEBBOR) algorithm improves the blocking performance significantly in optical networks with Conversion Capability.

Sigma Routing Metric for RPL Protocol

PubMed Central

Rojas, Aldo; Fernandez, Luis

2018-01-01

This paper presents the adaptation of a specific metric for the RPL protocol in the objective function MRHOF. Among the functions standardized by IETF, we find OF0, which is based on the minimum hop count, as well as MRHOF, which is based on the Expected Transmission Count (ETX). However, when the network becomes denser or the number of nodes increases, both OF0 and MRHOF introduce long hops, which can generate a bottleneck that restricts the network. The adaptation is proposed to optimize both OFs through a new routing metric. To solve the above problem, the metrics of the minimum number of hops and the ETX are combined by designing a new routing metric called SIGMA-ETX, in which the best route is calculated using the standard deviation of ETX values between each node, as opposed to working with the ETX average along the route. This method ensures a better routing performance in dense sensor networks. The simulations are done through the Cooja simulator, based on the Contiki operating system. The simulations showed that the proposed optimization outperforms at a high margin in both OF0 and MRHOF, in terms of network latency, packet delivery ratio, lifetime, and power consumption. PMID:29690524

From the physics of interacting polymers to optimizing routes on the London Underground

PubMed Central

Yeung, Chi Ho; Saad, David; Wong, K. Y. Michael

2013-01-01

Optimizing paths on networks is crucial for many applications, ranging from subway traffic to Internet communication. Because global path optimization that takes account of all path choices simultaneously is computationally hard, most existing routing algorithms optimize paths individually, thus providing suboptimal solutions. We use the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derive a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously. We demonstrate the efficacy of the algorithm by applying it to: (i) random graphs resembling Internet overlay networks, (ii) travel on the London Underground network based on Oyster card data, and (iii) the global airport network. Analytically derived macroscopic properties give rise to insightful new routing phenomena, including phase transitions and scaling laws, that facilitate better understanding of the appropriate operational regimes and their limitations, which are difficult to obtain otherwise. PMID:23898198

From the physics of interacting polymers to optimizing routes on the London Underground.

PubMed

Yeung, Chi Ho; Saad, David; Wong, K Y Michael

2013-08-20

Optimizing paths on networks is crucial for many applications, ranging from subway traffic to Internet communication. Because global path optimization that takes account of all path choices simultaneously is computationally hard, most existing routing algorithms optimize paths individually, thus providing suboptimal solutions. We use the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derive a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously. We demonstrate the efficacy of the algorithm by applying it to: (i) random graphs resembling Internet overlay networks, (ii) travel on the London Underground network based on Oyster card data, and (iii) the global airport network. Analytically derived macroscopic properties give rise to insightful new routing phenomena, including phase transitions and scaling laws, that facilitate better understanding of the appropriate operational regimes and their limitations, which are difficult to obtain otherwise.

Prediction based Greedy Perimeter Stateless Routing Protocol for Vehicular Self-organizing Network

NASA Astrophysics Data System (ADS)

Wang, Chunlin; Fan, Quanrun; Chen, Xiaolin; Xu, Wanjin

2018-03-01

PGPSR (Prediction based Greedy Perimeter Stateless Routing) is based on and extended the GPSR protocol to adapt to the high speed mobility of the vehicle auto organization network (VANET) and the changes in the network topology. GPSR is used in the VANET network environment, the network loss rate and throughput are not ideal, even cannot work. Aiming at the problems of the GPSR, the proposed PGPSR routing protocol, it redefines the hello and query packet structure, in the structure of the new node speed and direction information, which received the next update before you can take advantage of its speed and direction to predict the position of node and new network topology, select the right the next hop routing and path. Secondly, the update of the outdated node information of the neighbor’s table is deleted in time. The simulation experiment shows the performance of PGPSR is better than that of GPSR.

Nonreciprocal signal routing in an active quantum network

NASA Astrophysics Data System (ADS)

Metelmann, A.; Türeci, H. E.

2018-04-01

As superconductor quantum technologies are moving towards large-scale integrated circuits, a robust and flexible approach to routing photons at the quantum level becomes a critical problem. Active circuits, which contain parametrically driven elements selectively embedded in the circuit, offer a viable solution. Here, we present a general strategy for routing nonreciprocally quantum signals between two sites of a given lattice of oscillators, implementable with existing superconducting circuit components. Our approach makes use of a dual lattice of overdamped oscillators linking the nodes of the main lattice. Solutions for spatially selective driving of the lattice elements can be found, which optimally balance coherent and dissipative hopping of microwave photons to nonreciprocally route signals between two given nodes. In certain lattices these optimal solutions are obtained at the exceptional point of the dynamical matrix of the network. We also demonstrate that signal and noise transmission characteristics can be separately optimized.

The In-Transit Vigilant Covering Tour Problem of Routing Unmanned Ground Vehicles

DTIC Science & Technology

2012-08-01

of vertices in both vertex sets V and W, rather than exclusively in the vertex set V. A metaheuristic algorithm which follows the Greedy Randomized...window (VRPTW) approach, with the application of Java-encoded metaheuristic , was used [O’Rourke et al., 2001] for the dynamic routing of UAVs. Harder et...minimize both the two conflicting objectives; tour length and the coverage distance via a multi-objective evolutionary algorithm . This approach avoids a

The safe routes to school program in California: an update.

PubMed

Chaufan, Claudia; Yeh, Jarmin; Fox, Patrick

2012-06-01

Despite efforts to combat increasing rates of childhood obesity, the problem is worsening. Safe Routes to School (SRTS), an international movement motivated by the childhood obesity epidemic, seeks to increase the number of children actively commuting (walking or biking) to school by funding projects that remove barriers preventing them from doing so. We summarize the evaluation of the first phase of an ongoing SRTS program in California and discuss ways to enhance data collection.

Fully automated urban traffic system

NASA Technical Reports Server (NTRS)

Dobrotin, B. M.; Hansen, G. R.; Peng, T. K. C.; Rennels, D. A.

1977-01-01

The replacement of the driver with an automatic system which could perform the functions of guiding and routing a vehicle with a human's capability of responding to changing traffic demands was discussed. The problem was divided into four technological areas; guidance, routing, computing, and communications. It was determined that the latter three areas being developed independent of any need for fully automated urban traffic. A guidance system that would meet system requirements was not being developed but was technically feasible.

The Safe Routes to School Program in California: An Update

PubMed Central

Chaufan, Claudia; Fox, Patrick

2012-01-01

Despite efforts to combat increasing rates of childhood obesity, the problem is worsening. Safe Routes to School (SRTS), an international movement motivated by the childhood obesity epidemic, seeks to increase the number of children actively commuting (walking or biking) to school by funding projects that remove barriers preventing them from doing so. We summarize the evaluation of the first phase of an ongoing SRTS program in California and discuss ways to enhance data collection. PMID:22515862

A Novel Cooperative Opportunistic Routing Scheme for Underwater Sensor Networks

PubMed Central

Ghoreyshi, Seyed Mohammad; Shahrabi, Alireza; Boutaleb, Tuleen

2016-01-01

Increasing attention has recently been devoted to underwater sensor networks (UWSNs) because of their capabilities in the ocean monitoring and resource discovery. UWSNs are faced with different challenges, the most notable of which is perhaps how to efficiently deliver packets taking into account all of the constraints of the available acoustic communication channel. The opportunistic routing provides a reliable solution with the aid of intermediate nodes’ collaboration to relay a packet toward the destination. In this paper, we propose a new routing protocol, called opportunistic void avoidance routing (OVAR), to address the void problem and also the energy-reliability trade-off in the forwarding set selection. OVAR takes advantage of distributed beaconing, constructs the adjacency graph at each hop and selects a forwarding set that holds the best trade-off between reliability and energy efficiency. The unique features of OVAR in selecting the candidate nodes in the vicinity of each other leads to the resolution of the hidden node problem. OVAR is also able to select the forwarding set in any direction from the sender, which increases its flexibility to bypass any kind of void area with the minimum deviation from the optimal path. The results of our extensive simulation study show that OVAR outperforms other protocols in terms of the packet delivery ratio, energy consumption, end-to-end delay, hop count and traversed distance. PMID:26927118

A Novel Cooperative Opportunistic Routing Scheme for Underwater Sensor Networks.

PubMed

Ghoreyshi, Seyed Mohammad; Shahrabi, Alireza; Boutaleb, Tuleen

2016-02-26

Increasing attention has recently been devoted to underwater sensor networks (UWSNs) because of their capabilities in the ocean monitoring and resource discovery. UWSNs are faced with different challenges, the most notable of which is perhaps how to efficiently deliver packets taking into account all of the constraints of the available acoustic communication channel. The opportunistic routing provides a reliable solution with the aid of intermediate nodes' collaboration to relay a packet toward the destination. In this paper, we propose a new routing protocol, called opportunistic void avoidance routing (OVAR), to address the void problem and also the energy-reliability trade-off in the forwarding set selection. OVAR takes advantage of distributed beaconing, constructs the adjacency graph at each hop and selects a forwarding set that holds the best trade-off between reliability and energy efficiency. The unique features of OVAR in selecting the candidate nodes in the vicinity of each other leads to the resolution of the hidden node problem. OVAR is also able to select the forwarding set in any direction from the sender, which increases its flexibility to bypass any kind of void area with the minimum deviation from the optimal path. The results of our extensive simulation study show that OVAR outperforms other protocols in terms of the packet delivery ratio, energy consumption, end-to-end delay, hop count and traversed distance.

Road screening and distribution route multi-objective robust optimization for hazardous materials based on neural network and genetic algorithm.

PubMed

Ma, Changxi; Hao, Wei; Pan, Fuquan; Xiang, Wang

2018-01-01

Route optimization of hazardous materials transportation is one of the basic steps in ensuring the safety of hazardous materials transportation. The optimization scheme may be a security risk if road screening is not completed before the distribution route is optimized. For road screening issues of hazardous materials transportation, a road screening algorithm of hazardous materials transportation is built based on genetic algorithm and Levenberg-Marquardt neural network (GA-LM-NN) by analyzing 15 attributes data of each road network section. A multi-objective robust optimization model with adjustable robustness is constructed for the hazardous materials transportation problem of single distribution center to minimize transportation risk and time. A multi-objective genetic algorithm is designed to solve the problem according to the characteristics of the model. The algorithm uses an improved strategy to complete the selection operation, applies partial matching cross shift and single ortho swap methods to complete the crossover and mutation operation, and employs an exclusive method to construct Pareto optimal solutions. Studies show that the sets of hazardous materials transportation road can be found quickly through the proposed road screening algorithm based on GA-LM-NN, whereas the distribution route Pareto solutions with different levels of robustness can be found rapidly through the proposed multi-objective robust optimization model and algorithm.

Relevancy in Problem Solving: A Computational Framework

ERIC Educational Resources Information Center

Kwisthout, Johan

2012-01-01

When computer scientists discuss the computational complexity of, for example, finding the shortest path from building A to building B in some town or city, their starting point typically is a formal description of the problem at hand, e.g., a graph with weights on every edge where buildings correspond to vertices, routes between buildings to…

Driver's workload comparison in waste collection vehicle routing problem

NASA Astrophysics Data System (ADS)

Benjamin, Aida Mauziah; Abdul-Rahman, Syariza

2016-10-01

This paper compares the workload of the drivers for a waste collection benchmark problem. The problem involves ten data sets with different number of customers to be served and different number of disposal facilities available. Previous studies proposed a heuristic algorithm, namely Different Initial Customer (DIC) to solve the problem by constructing initial vehicles routes for the drivers with two main objectives; to minimize the total distance travelled and to minimize the total number of vehicles needed to collect the waste. The results from DIC compared well with other solutions in the literature. However, the balance of the workload among the vehicle drivers is not considered in the solutions. Thus in this paper, we evaluate the quality of the solutions in terms of the total number of customers served by each driver. Then the computational result is compared in terms of the total distance travelled which have been presented in a previous study. Comparison results show that the workload of the drivers are unbalance in terms of these two factors that may cause dissatisfaction among the drivers as well as to the managament.

Fast rerouting schemes for protected mobile IP over MPLS networks

NASA Astrophysics Data System (ADS)

Wen, Chih-Chao; Chang, Sheng-Yi; Chen, Huan; Chen, Kim-Joan

2005-10-01

Fast rerouting is a critical traffic engineering operation in the MPLS networks. To implement the Mobile IP service over the MPLS network, one can collaborate with the fast rerouting operation to enhance the availability and survivability. MPLS can protect critical LSP tunnel between Home Agent (HA) and Foreign Agent (FA) using the fast rerouting scheme. In this paper, we propose a simple but efficient algorithm to address the triangle routing problem for the Mobile IP over the MPLS networks. We consider this routing issue as a link weighting and capacity assignment (LW-CA) problem. The derived solution is used to plan the fast restoration mechanism to protect the link or node failure. In this paper, we first model the LW-CA problem as a mixed integer optimization problem. Our goal is to minimize the call blocking probability on the most congested working truck for the mobile IP connections. Many existing network topologies are used to evaluate the performance of our scheme. Results show that our proposed scheme can obtain the best performance in terms of the smallest blocking probability compared to other schemes.

Spectrum efficient distance-adaptive paths for fixed and fixed-alternate routing in elastic optical networks

NASA Astrophysics Data System (ADS)

Agrawal, Anuj; Bhatia, Vimal; Prakash, Shashi

2018-01-01

Efficient utilization of spectrum is a key concern in the soon to be deployed elastic optical networks (EONs). To perform routing in EONs, various fixed routing (FR), and fixed-alternate routing (FAR) schemes are ubiquitously used. FR, and FAR schemes calculate a fixed route, and a prioritized list of a number of alternate routes, respectively, between different pairs of origin o and target t nodes in the network. The route calculation performed using FR and FAR schemes is predominantly based on either the physical distance, known as k -shortest paths (KSP), or on the hop count (HC). For survivable optical networks, FAR usually calculates link-disjoint (LD) paths. These conventional routing schemes have been efficiently used for decades in communication networks. However, in this paper, it has been demonstrated that these commonly used routing schemes cannot utilize the network spectral resources optimally in the newly introduced EONs. Thus, we propose a new routing scheme for EON, namely, k -distance adaptive paths (KDAP) that efficiently utilizes the benefit of distance-adaptive modulation, and bit rate-adaptive superchannel capability inherited by EON to improve spectrum utilization. In the proposed KDAP, routes are found and prioritized on the basis of bit rate, distance, spectrum granularity, and the number of links used for a particular route. To evaluate the performance of KSP, HC, LD, and the proposed KDAP, simulations have been performed for three different sized networks, namely, 7-node test network (TEST7), NSFNET, and 24-node US backbone network (UBN24). We comprehensively assess the performance of various conventional, and the proposed routing schemes by solving both the RSA and the dual RSA problems under homogeneous and heterogeneous traffic requirements. Simulation results demonstrate that there is a variation amongst the performance of KSP, HC, and LD, depending on the o - t pair, and the network topology and its connectivity. However, the proposed KDAP always performs better for all the considered networks and traffic scenarios, as compared to the conventional routing schemes, namely, KSP, HC, and LD. The proposed KDAP achieves up to 60 % , and 10.46 % improvement in terms of spectrum utilization, and resource utilization ratio, respectively, over the conventional routing schemes.

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

PubMed Central

Zhang, Jisheng; Jia, Limin; Niu, Shuyun; Zhang, Fan; Tong, Lu; Zhou, Xuesong

2015-01-01

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. PMID:26076404

3D Building Evacuation Route Modelling and Visualization

NASA Astrophysics Data System (ADS)

Chan, W.; Armenakis, C.

2014-11-01

The most common building evacuation approach currently applied is to have evacuation routes planned prior to these emergency events. These routes are usually the shortest and most practical path from each building room to the closest exit. The problem with this approach is that it is not adaptive. It is not responsively configurable relative to the type, intensity, or location of the emergency risk. Moreover, it does not provide any information to the affected persons or to the emergency responders while not allowing for the review of simulated hazard scenarios and alternative evacuation routes. In this paper we address two main tasks. The first is the modelling of the spatial risk caused by a hazardous event leading to choosing the optimal evacuation route for a set of options. The second is to generate a 3D visual representation of the model output. A multicriteria decision making (MCDM) approach is used to model the risk aiming at finding the optimal evacuation route. This is achieved by using the analytical hierarchy process (AHP) on the criteria describing the different alternative evacuation routes. The best route is then chosen to be the alternative with the least cost. The 3D visual representation of the model displays the building, the surrounding environment, the evacuee's location, the hazard location, the risk areas and the optimal evacuation pathway to the target safety location. The work has been performed using ESRI's ArcGIS. Using the developed models, the user can input the location of the hazard and the location of the evacuee. The system then determines the optimum evacuation route and displays it in 3D.

En route Spacing Tool: Efficient Conflict-free Spacing to Flow-Restricted Airspace

NASA Technical Reports Server (NTRS)

Green, S.

1999-01-01

This paper describes the Air Traffic Management (ATM) problem within the U.S. of flow-restricted en route airspace, an assessment of its impact on airspace users, and a set of near-term tools and procedures to resolve the problem. The FAA is committed, over the next few years, to deploy the first generation of modem ATM decision support tool (DST) technology under the Free-Flight Phase-1 (FFp1) program. The associated en route tools include the User Request Evaluation Tool (URET) and the Traffic Management Advisor (TMA). URET is an initial conflict probe (ICP) capability that assists controllers with the detection and resolution of conflicts in en route airspace. TMA orchestrates arrivals transitioning into high-density terminal airspace by providing controllers with scheduled times of arrival (STA) and delay feedback advisories to assist with STA conformance. However, these FFPl capabilities do not mitigate the en route Miles-In-Trail (MIT) restrictions that are dynamically applied to mitigate airspace congestion. National statistics indicate that en route facilities (Centers) apply Miles-In-Trail (MIT) restrictions for approximately 5000 hours per month. Based on results from this study, an estimated 45,000 flights are impacted by these restrictions each month. Current-day practices for implementing these restrictions result in additional controller workload and an economic impact of which the fuel penalty alone may approach several hundred dollars per flight. To mitigate much of the impact of these restrictions on users and controller workload, a DST and procedures are presented. The DST is based on a simple derivative of FFP1 technology that is designed to introduce a set of simple tools for flow-rate (spacing) conformance and integrate them with conflict-probe capabilities. The tool and associated algorithms are described based on a concept prototype implemented within the CTAS baseline in 1995. A traffic scenario is used to illustrate the controller's use of the tool, and potential display options are presented for future controller evaluation.

Fuzzy Hungarian Method for Solving Intuitionistic Fuzzy Travelling Salesman Problem

NASA Astrophysics Data System (ADS)

Prabakaran, K.; Ganesan, K.

2018-04-01

The travelling salesman problem is to identify the shortest route that the salesman journey all the places and return the starting place with minimum cost. We develop a fuzzy version of Hungarian algorithm for the solution of intuitionistic fuzzy travelling salesman problem using triangular intuitionistic fuzzy numbers without changing them to classical travelling salesman problem. The purposed method is easy to empathize and to implement for finding solution of intuitionistic travelling salesman problem happening in real life situations. To illustrate the proposed method numerical example are provided.

La-CTP: Loop-Aware Routing for Energy-Harvesting Wireless Sensor Networks.

PubMed

Sun, Guodong; Shang, Xinna; Zuo, Yan

2018-02-02

In emerging energy-harvesting wireless sensor networks (EH-WSN), the sensor nodes can harvest environmental energy to drive their operation, releasing the user's burden in terms of frequent battery replacement, and even enabling perpetual sensing systems. In EH-WSN applications, usually, the node in energy-harvesting or recharging state has to stop working until it completes the energy replenishment. However, such temporary departures of recharging nodes severely impact the packet routing, and one immediate result is the routing loop problem. Controlling loops in connectivity-intermittent EH-WSN in an efficient way is a big challenge in practice, and so far, users still lack of effective and practicable routing protocols with loop handling. Based on the Collection Tree Protocol (CTP) widely used in traditional wireless sensor networks, this paper proposes a loop-aware routing protocol for real-world EH-WSNs, called La-CTP, which involves a new parent updating metric and a proactive, adaptive beaconing scheme to effectively suppress the occurrence of loops and unlock unavoidable loops, respectively. We constructed a 100-node testbed to evaluate La-CTP, and the experimental results showed its efficacy and efficiency.

Design of an advanced flight planning system

NASA Technical Reports Server (NTRS)

Sorensen, J. A.; Goka, T.

1985-01-01

The demand for both fuel conservation and four-dimensional traffic management require that the preflight planning process be designed to account for advances in airborne flight management and weather forecasting. The steps and issues in designing such an advanced flight planning system are presented. Focus is placed on the different optimization options for generating the three-dimensional reference path. For the cruise phase, one can use predefined jet routes, direct routes based on a network of evenly spaced grid points, or a network where the grid points are existing navaid locations. Each choice has its own problem in determining an optimum solution. Finding the reference path is further complicated by choice of cruise altitude levels, use of a time-varying weather field, and requiring a fixed time-of-arrival (four-dimensional problem).

Model for Bi-objective emergency rescue vehicle routing optimization

NASA Astrophysics Data System (ADS)

Yang, Yuhang

2017-03-01

Vehicle routing problem is an important research topic in management science. In this paper, one vehicle can rescue multiple disaster points and two optimization objectives are rescue time and rescue effect. Rescue effect is expressed as the ratio of unloaded material to arrival time when rescue vehicles participate in rescue every time. In this paper, the corresponding emergency rescue model is established and the effectiveness of the model is verified by simulated annealing algorithm. It can provide the basis for practical decision-making.

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

DTIC Science & Technology

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

Space Station Freedom secondary power wiring requirements

NASA Technical Reports Server (NTRS)

Sawyer, C. R.

1994-01-01

Secondary power is produced by DDCU's (direct current to direct current converter units) and routed to and through secondary power distribution assemblies (SPDA's) to loads or tertiary distribution assemblies. This presentation outlines requirements of Space Station Freedom (SSF) EEE (electrical, electronic, and electromechanical) parts wire and the approved electrical wire and cable. The SSF PDRD (Program Definition and Requirements Document) language problems and resolution are reviewed. The cable routing to and from the SPDA's is presented as diagrams and the wire recommendations and characteristics are given.

Routing Protocols to Minimize the Number of Route Disconnections for Communication in Mobile Ad Hoc Networks

DTIC Science & Technology

2009-09-01

Wireless Sensor Network (WSN) Simulator Research Personnel: Dr. Ali Abu-El Humos Task No. Task Current Status 1 Literature review and problem definition...networks.com/ [2] S. Dulman, P. Havinga, "A Simulation Template for Wireless Sensor Networks ," Supplement of the Sixth International Symposium on Autonomous... Sensor Network (WSN) Simulator 76 I Breakdown of the Research Activity to Tasks 76 II Description of the Tasks 76 Task 1 Literature Review and

Optimization of Location-Routing Problem for Cold Chain Logistics Considering Carbon Footprint.

PubMed

Wang, Songyi; Tao, Fengming; Shi, Yuhe

2018-01-06

In order to solve the optimization problem of logistics distribution system for fresh food, this paper provides a low-carbon and environmental protection point of view, based on the characteristics of perishable products, and combines with the overall optimization idea of cold chain logistics distribution network, where the green and low-carbon location-routing problem (LRP) model in cold chain logistics is developed with the minimum total costs as the objective function, which includes carbon emission costs. A hybrid genetic algorithm with heuristic rules is designed to solve the model, and an example is used to verify the effectiveness of the algorithm. Furthermore, the simulation results obtained by a practical numerical example show the applicability of the model while provide green and environmentally friendly location-distribution schemes for the cold chain logistics enterprise. Finally, carbon tax policies are introduced to analyze the impact of carbon tax on the total costs and carbon emissions, which proves that carbon tax policy can effectively reduce carbon dioxide emissions in cold chain logistics network.

Multipoint to multipoint routing and wavelength assignment in multi-domain optical networks

NASA Astrophysics Data System (ADS)

Qin, Panke; Wu, Jingru; Li, Xudong; Tang, Yongli

2018-01-01

In multi-point to multi-point (MP2MP) routing and wavelength assignment (RWA) problems, researchers usually assume the optical networks to be a single domain. However, the optical networks develop toward to multi-domain and larger scale in practice. In this context, multi-core shared tree (MST)-based MP2MP RWA are introduced problems including optimal multicast domain sequence selection, core nodes belonging in which domains and so on. In this letter, we focus on MST-based MP2MP RWA problems in multi-domain optical networks, mixed integer linear programming (MILP) formulations to optimally construct MP2MP multicast trees is presented. A heuristic algorithm base on network virtualization and weighted clustering algorithm (NV-WCA) is proposed. Simulation results show that, under different traffic patterns, the proposed algorithm achieves significant improvement on network resources occupation and multicast trees setup latency in contrast with the conventional algorithms which were proposed base on a single domain network environment.

Vehicle routing problem with time windows using natural inspired algorithms

NASA Astrophysics Data System (ADS)

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.

Stability-Aware Geographic Routing in Energy Harvesting Wireless Sensor Networks

PubMed Central

Hieu, Tran Dinh; Dung, Le The; Kim, Byung-Seo

2016-01-01

A new generation of wireless sensor networks that harvest energy from environmental sources such as solar, vibration, and thermoelectric to power sensor nodes is emerging to solve the problem of energy limitation. Based on the photo-voltaic model, this research proposes a stability-aware geographic routing for reliable data transmissions in energy-harvesting wireless sensor networks (EH-WSNs) to provide a reliable routes selection method and potentially achieve an unlimited network lifetime. Specifically, the influences of link quality, represented by the estimated packet reception rate, on network performance is investigated. Simulation results show that the proposed method outperforms an energy-harvesting-aware method in terms of energy consumption, the average number of hops, and the packet delivery ratio. PMID:27187414

An Elementary Algorithm for Autonomous Air Terminal Merging and Interval Management

NASA Technical Reports Server (NTRS)

White, Allan L.

2017-01-01

A central element of air traffic management is the safe merging and spacing of aircraft during the terminal area flight phase. This paper derives and examines an algorithm for the merging and interval managing problem for Standard Terminal Arrival Routes. It describes a factor analysis for performance based on the distribution of arrivals, the operating period of the terminal, and the topology of the arrival routes; then presents results from a performance analysis and from a safety analysis for a realistic topology based on typical routes for a runway at Phoenix International Airport. The heart of the safety analysis is a statistical derivation on how to conduct a safety analysis for a local simulation when the safety requirement is given for the entire airspace.

Integrated Thermal Response Modeling System For Hypersonic Entry Vehicles

NASA Technical Reports Server (NTRS)

Chen, Y.-K.; Milos, F. S.; Partridge, Harry (Technical Monitor)

2000-01-01

We describe all extension of the Markov decision process model in which a continuous time dimension is included ill the state space. This allows for the representation and exact solution of a wide range of problems in which transitions or rewards vary over time. We examine problems based on route planning with public transportation and telescope observation scheduling.

Exact Solutions to Time-dependent Mdps

NASA Technical Reports Server (NTRS)

Boyan, Justin A.; Littman, Michael L.

2000-01-01

We describe an extension of the Markov decision process model in which a continuous time dimension is included in the state space. This allows for the representation and exact solution of a wide range of problems in which transitions or rewards vary over time. We examine problems based on route planning with public transportation and telescope observation scheduling.

Barriers to the Implementation of Project Lead the Way as Perceived by Indiana High School Principals

ERIC Educational Resources Information Center

Shields, C. J.

2007-01-01

Technology education (TE) has come to encompass many facets of curriculum, ranging from industrial arts (IA) to integrating problem-solving and engineering concepts into the curriculum. For technology educators who have chosen the pre-engineering problem-solving route there is a pre-engineering curriculum called Project Lead The Way (PLTW), that…

Neurally and Ocularly Informed Graph-Based Models for Searching 3D Environments

DTIC Science & Technology

2014-06-03

hBCI = hybrid brain–computer interface, TAG = transductive annotation by graph, CV = computer vision, TSP = traveling salesman problem . are navigated...environment that are most likely to contain objects that the subject would like to visit. 2.9. Route planning A traveling salesman problem (TSP) solver...fixations in a visual search task using fixation-related potentials J. Vis. 13 Croes G 1958 A method for solving traveling - salesman problems Oper. Res

76 FR 42625 - International Settlements Policy Reform

Federal Register 2010, 2011, 2012, 2013, 2014

2011-07-19

... intervention. Specifically, it seeks comments on proposals and issues regarding the application of the... intervention on any U.S. international route for which competitive problems are alleged by filing with the...

An Efficient Framework Model for Optimizing Routing Performance in VANETs.

PubMed

Al-Kharasani, Nori M; Zulkarnain, Zuriati Ahmad; Subramaniam, Shamala; Hanapi, Zurina Mohd

2018-02-15

Routing in Vehicular Ad hoc Networks (VANET) is a bit complicated because of the nature of the high dynamic mobility. The efficiency of routing protocol is influenced by a number of factors such as network density, bandwidth constraints, traffic load, and mobility patterns resulting in frequency changes in network topology. Therefore, Quality of Service (QoS) is strongly needed to enhance the capability of the routing protocol and improve the overall network performance. In this paper, we introduce a statistical framework model to address the problem of optimizing routing configuration parameters in Vehicle-to-Vehicle (V2V) communication. Our framework solution is based on the utilization of the network resources to further reflect the current state of the network and to balance the trade-off between frequent changes in network topology and the QoS requirements. It consists of three stages: simulation network stage used to execute different urban scenarios, the function stage used as a competitive approach to aggregate the weighted cost of the factors in a single value, and optimization stage used to evaluate the communication cost and to obtain the optimal configuration based on the competitive cost. The simulation results show significant performance improvement in terms of the Packet Delivery Ratio (PDR), Normalized Routing Load (NRL), Packet loss (PL), and End-to-End Delay (E2ED).

Anomaly detection of flight routes through optimal waypoint

NASA Astrophysics Data System (ADS)

Pusadan, M. Y.; Buliali, J. L.; Ginardi, R. V. H.

2017-01-01

Deciding factor of flight, one of them is the flight route. Flight route determined by coordinate (latitude and longitude). flight routed is determined by its coordinates (latitude and longitude) as defined is waypoint. anomaly occurs, if the aircraft is flying outside the specified waypoint area. In the case of flight data, anomalies occur by identifying problems of the flight route based on data ADS-B. This study has an aim of to determine the optimal waypoints of the flight route. The proposed methods: i) Agglomerative Hierarchical Clustering (AHC) in several segments based on range area coordinates (latitude and longitude) in every waypoint; ii) The coefficient cophenetics correlation (c) to determine the correlation between the members in each cluster; iii) cubic spline interpolation as a graphic representation of the has connected between the coordinates on every waypoint; and iv). Euclidean distance to measure distances between waypoints with 2 centroid result of clustering AHC. The experiment results are value of coefficient cophenetics correlation (c): 0,691≤ c ≤ 0974, five segments the generated of the range area waypoint coordinates, and the shortest and longest distance between the centroid with waypoint are 0.46 and 2.18. Thus, concluded that the shortest distance is used as the reference coordinates of optimal waypoint, and farthest distance can be indicated potentially detected anomaly.

Concurrent airline fleet allocation and aircraft design with profit modeling for multiple airlines

NASA Astrophysics Data System (ADS)

Govindaraju, Parithi

A "System of Systems" (SoS) approach is particularly beneficial in analyzing complex large scale systems comprised of numerous independent systems -- each capable of independent operations in their own right -- that when brought in conjunction offer capabilities and performance beyond the constituents of the individual systems. The variable resource allocation problem is a type of SoS problem, which includes the allocation of "yet-to-be-designed" systems in addition to existing resources and systems. The methodology presented here expands upon earlier work that demonstrated a decomposition approach that sought to simultaneously design a new aircraft and allocate this new aircraft along with existing aircraft in an effort to meet passenger demand at minimum fleet level operating cost for a single airline. The result of this describes important characteristics of the new aircraft. The ticket price model developed and implemented here enables analysis of the system using profit maximization studies instead of cost minimization. A multiobjective problem formulation has been implemented to determine characteristics of a new aircraft that maximizes the profit of multiple airlines to recognize the fact that aircraft manufacturers sell their aircraft to multiple customers and seldom design aircraft customized to a single airline's operations. The route network characteristics of two simple airlines serve as the example problem for the initial studies. The resulting problem formulation is a mixed-integer nonlinear programming problem, which is typically difficult to solve. A sequential decomposition strategy is applied as a solution methodology by segregating the allocation (integer programming) and aircraft design (non-linear programming) subspaces. After solving a simple problem considering two airlines, the decomposition approach is then applied to two larger airline route networks representing actual airline operations in the year 2005. The decomposition strategy serves as a promising technique for future detailed analyses. Results from the profit maximization studies favor a smaller aircraft in terms of passenger capacity due to its higher yield generation capability on shorter routes while results from the cost minimization studies favor a larger aircraft due to its lower direct operating cost per seat mile.

SPAR: a security- and power-aware routing protocol for wireless ad hoc and sensor networks

NASA Astrophysics Data System (ADS)

Oberoi, Vikram; Chigan, Chunxiao

2005-05-01

Wireless Ad Hoc and Sensor Networks (WAHSNs) are vulnerable to extensive attacks as well as severe resource constraints. To fulfill the security needs, many security enhancements have been proposed. Like wise, from resource constraint perspective, many power aware schemes have been proposed to save the battery power. However, we observe that for the severely resource limited and extremely vulnerable WAHSNs, taking security or power (or any other resource) alone into consideration for protocol design is rather inadequate toward the truly "secure-and-useful" WAHSNs. For example, from resource constraint perspective, we identify one of the potential problems, the Security-Capable-Congestion (SCC) behavior, for the WAHSNs routing protocols where only the security are concerned. On the other hand, the design approach where only scarce resource is concerned, such as many power-aware WAHSNs protocols, leaves security unconsidered and is undesirable to many WAHSNs application scenarios. Motivated by these observations, we propose a co-design approach, where both the high security and effective resource consumption are targeted for WAHSNs protocol design. Specifically, we propose a novel routing protocol, Security- and Power- Aware Routing (SPAR) protocol based on this co-design approach. In SPAR, the routing decisions are made based on both security and power as routing criteria. The idea of the SPAR mechanism is routing protocol independent and therefore can be broadly integrated into any of the existing WAHSNs routing protocols. The simulation results show that SPAR outperforms the WAHSNs routing protocols where security or power alone is considered, significantly. This research finding demonstrates the proposed security- and resource- aware co-design approach is promising towards the truly "secure-and-useful" WAHSNs.

Routing and wavelength assignment based on normalized resource and constraints for all-optical network

NASA Astrophysics Data System (ADS)

Joo, Seong-Soon; Nam, Hyun-Soon; Lim, Chang-Kyu

2003-08-01

With the rapid growth of the Optical Internet, high capacity pipes is finally destined to support end-to-end IP on the WDM optical network. Newly launched 2D MEMS optical switching module in the market supports that expectations of upcoming a transparent optical cross-connect in the network have encouraged the field applicable research on establishing real all-optical transparent network. To open up a customer-driven bandwidth services, design of the optical transport network becomes more challenging task in terms of optimal network resource usage. This paper presents a practical approach to finding a route and wavelength assignment for wavelength routed all-optical network, which has λ-plane OXC switches and wavelength converters, and supports that optical paths are randomly set up and released by dynamic wavelength provisioning to create bandwidth between end users with timescales on the order of seconds or milliseconds. We suggest three constraints to make the RWA problem become more practical one on deployment for wavelength routed all-optical network in network view: limitation on maximum hop of a route within bearable optical network impairments, limitation on minimum hops to travel before converting a wavelength, and limitation on calculation time to find all routes for connections requested at once. We design the NRCD (Normalized Resource and Constraints for All-Optical Network RWA Design) algorithm for the Tera OXC: network resource for a route is calculated by the number of internal switching paths established in each OXC nodes on the route, and is normalized by ratio of number of paths established and number of paths equipped in a node. We show that it fits for the RWA algorithm of the wavelength routed all-optical network through real experiments on the distributed objects platform.

Estimate of air carrier and air taxi crash frequencies from high altitude en route flight operations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sanzo, D.; Kimura, C.Y.; Prassinos, P.G.

1996-06-03

In estimating the frequency of an aircraft crashing into a facility, it has been found convenient to break the problem down into two broad categories. One category estimates the aircraft crash frequency due to air traffic from nearby airports, the so-called near-airport environment. The other category estimates the aircraft crash frequency onto facilities due to air traffic from airways, jet routes, and other traffic flying outside the near-airport environment The total aircraft crash frequency is the summation of the crash frequencies from each airport near the facility under evaluation and from all airways, jet routes, and other traffic near themore » facility of interest. This paper will examine the problems associated with the determining the aircraft crash frequencies onto facilities outside the near-airport environment. This paper will further concentrate on the estimating the risk of aircraft crashes to ground facilities due to high altitude air carrier and air taxi traffic. High altitude air carrier and air taxi traffic will be defined as all air carrier and air taxi flights above 18,000 feet Mean Sea Level (MSL).« less

Path coloring on the Mesh

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rabani, Y.

In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edge disjoint. Our objective is to minimize the number of colors used. This problem was raised by Aggarwal et al and Raghavan and Upfal as a model for routing in all-optical networks. It is also related to questions in circuit routing. In this paper, we improve the O (ln N) approximation result of Kleinberg and Tardos for path coloring on the N x Nmore » mesh. We give an O(1) approximation algorithm to the number of colors needed, and a poly(ln ln N) approximation algorithm to the choice of paths and colors. To the best of our knowledge, these are the first sub-logarithmic bounds for any network other than trees, rings, or trees of rings. Our results are based on developing new techniques for randomized rounding. These techniques iteratively improve a fractional solution until it approaches integrality. They are motivated by the method used by Leighton, Maggs, and Rao for packet routing.« less

Social Milieu Oriented Routing: A New Dimension to Enhance Network Security in WSNs.

PubMed

Liu, Lianggui; Chen, Li; Jia, Huiling

2016-02-19

In large-scale wireless sensor networks (WSNs), in order to enhance network security, it is crucial for a trustor node to perform social milieu oriented routing to a target a trustee node to carry out trust evaluation. This challenging social milieu oriented routing with more than one end-to-end Quality of Trust (QoT) constraint has proved to be NP-complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this challenging problem. However, existing solutions cannot guarantee the efficiency of searching; that is, they can hardly avoid obtaining partial optimal solutions during a searching process. Quantum annealing (QA) uses delocalization and tunneling to avoid falling into local minima without sacrificing execution time. This has been proven a promising way to many optimization problems in recently published literatures. In this paper, for the first time, with the help of a novel approach, that is, configuration path-integral Monte Carlo (CPIMC) simulations, a QA-based optimal social trust path (QA_OSTP) selection algorithm is applied to the extraction of the optimal social trust path in large-scale WSNs. Extensive experiments have been conducted, and the experiment results demonstrate that QA_OSTP outperforms its heuristic opponents.

Bus Stops Location and Bus Route Planning Using Mean Shift Clustering and Ant Colony in West Jakarta

NASA Astrophysics Data System (ADS)

Supangat, Kenny; Eko Soelistio, Yustinus

2017-03-01

Traffic Jam has been a daily problem for people in Jakarta which is one of the busiest city in Indonesia up until now. Even though the official government has tried to reduce the impact of traffic issues by developing a new public transportation which takes up a lot of resources and time, it failed to diminish the problem. The actual concern to this problem actually lies in how people move between places in Jakarta where they always using their own vehicle like cars, and motorcycles that fill most of the street in Jakarta. Among much other public transportations that roams the street of Jakarta, Buses is believed to be an efficient transportation that can move many people at once. However, the location of the bus stop is now have moved to the middle of the main road, and its too far for the nearby residence to access to it. This paper proposes an optimal location of optimal bus stops in West Jakarta that is experimentally proven to have a maximal distance of 350 m. The optimal location is estimated by means of mean shift clustering method while the optimal routes are calculated using Ant Colony algorithm. The bus stops locations rate of error is 0.07% with overall route area of 32 km. Based on our experiments, we believe our proposed bus stop plan can be an interesting alternative to reduce traffic congestion in West Jakarta.

Optimization of municipal solid waste collection and transportation routes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Das, Swapan, E-mail: swapan2009sajal@gmail.com; Bhattacharyya, Bidyut Kr., E-mail: bidyut53@yahoo.co.in

2015-09-15

Graphical abstract: Display Omitted - Highlights: • Profitable integrated solid waste management system. • Optimal municipal waste collection scheme between the sources and waste collection centres. • Optimal path calculation between waste collection centres and transfer stations. • Optimal waste routing between the transfer stations and processing plants. - Abstract: Optimization of municipal solid waste (MSW) collection and transportation through source separation becomes one of the major concerns in the MSW management system design, due to the fact that the existing MSW management systems suffer by the high collection and transportation cost. Generally, in a city different waste sources scattermore » throughout the city in heterogeneous way that increase waste collection and transportation cost in the waste management system. Therefore, a shortest waste collection and transportation strategy can effectively reduce waste collection and transportation cost. In this paper, we propose an optimal MSW collection and transportation scheme that focus on the problem of minimizing the length of each waste collection and transportation route. We first formulize the MSW collection and transportation problem into a mixed integer program. Moreover, we propose a heuristic solution for the waste collection and transportation problem that can provide an optimal way for waste collection and transportation. Extensive simulations and real testbed results show that the proposed solution can significantly improve the MSW performance. Results show that the proposed scheme is able to reduce more than 30% of the total waste collection path length.« less

Dynamic airspace configuration algorithms for next generation air transportation system

NASA Astrophysics Data System (ADS)

Wei, Jian

The National Airspace System (NAS) is under great pressure to safely and efficiently handle the record-high air traffic volume nowadays, and will face even greater challenge to keep pace with the steady increase of future air travel demand, since the air travel demand is projected to increase to two to three times the current level by 2025. The inefficiency of traffic flow management initiatives causes severe airspace congestion and frequent flight delays, which cost billions of economic losses every year. To address the increasingly severe airspace congestion and delays, the Next Generation Air Transportation System (NextGen) is proposed to transform the current static and rigid radar based system to a dynamic and flexible satellite based system. New operational concepts such as Dynamic Airspace Configuration (DAC) have been under development to allow more flexibility required to mitigate the demand-capacity imbalances in order to increase the throughput of the entire NAS. In this dissertation, we address the DAC problem in the en route and terminal airspace under the framework of NextGen. We develop a series of algorithms to facilitate the implementation of innovative concepts relevant with DAC in both the en route and terminal airspace. We also develop a performance evaluation framework for comprehensive benefit analyses on different aspects of future sector design algorithms. First, we complete a graph based sectorization algorithm for DAC in the en route airspace, which models the underlying air route network with a weighted graph, converts the sectorization problem into the graph partition problem, partitions the weighted graph with an iterative spectral bipartition method, and constructs the sectors from the partitioned graph. The algorithm uses a graph model to accurately capture the complex traffic patterns of the real flights, and generates sectors with high efficiency while evenly distributing the workload among the generated sectors. We further improve the robustness and efficiency of the graph based DAC algorithm by incorporating the Multilevel Graph Partitioning (MGP) method into the graph model, and develop a MGP based sectorization algorithm for DAC in the en route airspace. In a comprehensive benefit analysis, the performance of the proposed algorithms are tested in numerical simulations with Enhanced Traffic Management System (ETMS) data. Simulation results demonstrate that the algorithmically generated sectorizations outperform the current sectorizations in different sectors for different time periods. Secondly, based on our experience with DAC in the en route airspace, we further study the sectorization problem for DAC in the terminal airspace. The differences between the en route and terminal airspace are identified, and their influence on the terminal sectorization is analyzed. After adjusting the graph model to better capture the unique characteristics of the terminal airspace and the requirements of terminal sectorization, we develop a graph based geometric sectorization algorithm for DAC in the terminal airspace. Moreover, the graph based model is combined with the region based sector design method to better handle the complicated geometric and operational constraints in the terminal sectorization problem. In the benefit analysis, we identify the contributing factors to terminal controller workload, define evaluation metrics, and develop a bebefit analysis framework for terminal sectorization evaluation. With the evaluation framework developed, we demonstrate the improvements on the current sectorizations with real traffic data collected from several major international airports in the U.S., and conduct a detailed analysis on the potential benefits of dynamic reconfiguration in the terminal airspace. Finally, in addition to the research on the macroscopic behavior of a large number of aircraft, we also study the dynamical behavior of individual aircraft from the perspective of traffic flow management. We formulate the mode-confusion problem as hybrid estimation problem, and develop a state estimation algorithm for the linear hybrid system with continuous-state-dependent transitions based on sparse observations. We also develop an estimated time of arrival prediction algorithm based on the state-dependent transition hybrid estimation algorithm, whose performance is demonstrated with simulations on the landing procedure following the Continuous Descend Approach (CDA) profile.

Let the pigeon drive the bus: pigeons can plan future routes in a room.

PubMed

Gibson, Brett; Wilkinson, Matthew; Kelly, Debbie

2012-05-01

The task of determining an optimal route to several locations is called the traveling salesperson problem (TSP). The TSP has been used recently to examine spatial cognition in humans and non-human animals. It remains unclear whether or not the decision process of animals other than non-human primates utilizes rigid rule-based heuristics, or whether non-human animals are able to flexibly 'plan' future routes/behavior based on their knowledge of multiple locations. We presented pigeons in a One-way and Round-Trip group with TSPs that included two or three destinations (feeders) in a laboratory environment. The pigeons departed a start location, traveled to each feeder once before returning to a final destination. Pigeons weighed the proximity of the next location heavily, but appeared to plan ahead multiple steps when the travel costs for inefficient behavior appeared to increase. The results provide clear and strong evidence that animals other than primates are capable of planning sophisticated travel routes.

Numerical Modeling of Fiber-Reinforced Metal Matrix Composite Processing by the Liquid Route: Literature Contribution

NASA Astrophysics Data System (ADS)

Lacoste, Eric; Arvieu, Corinne; Mantaux, Olivier

2018-04-01

One of the technologies used to produce metal matrix composites (MMCs) is liquid route processing. One solution is to inject a liquid metal under pressure or at constant rate through a fibrous preform. This foundry technique overcomes the problem of the wettability of ceramic fibers by liquid metal. The liquid route can also be used to produce semiproducts by coating a filament with a molten metal. These processes involve physical phenomena combined with mass and heat transfer and phase change. The phase change phenomena related to solidification and also to the melting of the metal during the process notably result in modifications to the permeability of porous media, in gaps in impregnation, in the appearance of defects (porosities), and in segregation in the final product. In this article, we provide a state-of-the-art review of numerical models and simulation developed to study these physical phenomena involved in MMC processing by the liquid route.

Stochastic Routing and Scheduling Policies for Energy Harvesting Communication Networks

NASA Astrophysics Data System (ADS)

Calvo-Fullana, Miguel; Anton-Haro, Carles; Matamoros, Javier; Ribeiro, Alejandro

2018-07-01

In this paper, we study the joint routing-scheduling problem in energy harvesting communication networks. Our policies, which are based on stochastic subgradient methods on the dual domain, act as an energy harvesting variant of the stochastic family of backpresure algorithms. Specifically, we propose two policies: (i) the Stochastic Backpressure with Energy Harvesting (SBP-EH), in which a node's routing-scheduling decisions are determined by the difference between the Lagrange multipliers associated to their queue stability constraints and their neighbors'; and (ii) the Stochastic Soft Backpressure with Energy Harvesting (SSBP-EH), an improved algorithm where the routing-scheduling decision is of a probabilistic nature. For both policies, we show that given sustainable data and energy arrival rates, the stability of the data queues over all network nodes is guaranteed. Numerical results corroborate the stability guarantees and illustrate the minimal gap in performance that our policies offer with respect to classical ones which work with an unlimited energy supply.

Experiences with serial and parallel algorithms for channel routing using simulated annealing

NASA Technical Reports Server (NTRS)

Brouwer, Randall Jay

1988-01-01

Two algorithms for channel routing using simulated annealing are presented. Simulated annealing is an optimization methodology which allows the solution process to back up out of local minima that may be encountered by inappropriate selections. By properly controlling the annealing process, it is very likely that the optimal solution to an NP-complete problem such as channel routing may be found. The algorithm presented proposes very relaxed restrictions on the types of allowable transformations, including overlapping nets. By freeing that restriction and controlling overlap situations with an appropriate cost function, the algorithm becomes very flexible and can be applied to many extensions of channel routing. The selection of the transformation utilizes a number of heuristics, still retaining the pseudorandom nature of simulated annealing. The algorithm was implemented as a serial program for a workstation, and a parallel program designed for a hypercube computer. The details of the serial implementation are presented, including many of the heuristics used and some of the resulting solutions.

The Probabilistic Thinking of Primary School Pupils in Cyprus: The Case of Tree Diagrams

ERIC Educational Resources Information Center

Lamprianou, Iasonas; Lamprianou, Thekla Afantiti

2003-01-01

In this research work we explored the nature of 9-12 year old pupils' responses to probabilistic problems with tree diagrams. It was found that a large percentage of pupils failed to respond correctly even to very simple problems that demanded the identification of "possible routes/paths" in figures with tree diagrams/mazes. The results…

The Complex Route to Success: Complex Problem-Solving Skills in the Prediction of University Success

ERIC Educational Resources Information Center

Stadler, Matthias J.; Becker, Nicolas; Greiff, Samuel; Spinath, Frank M.

2016-01-01

Successful completion of a university degree is a complex matter. Based on considerations regarding the demands of acquiring a university degree, the aim of this paper was to investigate the utility of complex problem-solving (CPS) skills in the prediction of objective and subjective university success (SUS). The key finding of this study was that…

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

DTIC Science & Technology

2006-08-01

much easier to interpret . In this representation, only one depot (1) was selected and vehicle 10 27 traveled to customers 3 – 7 – 4 – 8 – 5 – 9...Problem ( HTP ). The last section reviews the literature relevant to the PDP. The objective of this section is to discuss methods that researchers have...Handicapped person Transportation Problem ( HTP ), and the Pick-up and Delivery Problem (PDP). The first two instances deal with the transportation of

A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks.

PubMed

Chen, Huan; Li, Lemin; Ren, Jing; Wang, Yang; Zhao, Yangming; Wang, Xiong; Wang, Sheng; Xu, Shizhong

2015-01-01

This paper aims at minimizing the communication cost for collecting flow information in Software Defined Networks (SDN). Since flow-based information collecting method requires too much communication cost, and switch-based method proposed recently cannot benefit from controlling flow routing, jointly optimize flow routing and polling switch selection is proposed to reduce the communication cost. To this end, joint optimization problem is formulated as an Integer Linear Programming (ILP) model firstly. Since the ILP model is intractable in large size network, we also design an optimal algorithm for the multi-rooted tree topology and an efficient heuristic algorithm for general topology. According to extensive simulations, it is found that our method can save up to 55.76% communication cost compared with the state-of-the-art switch-based scheme.

Agent Reward Shaping for Alleviating Traffic Congestion

NASA Technical Reports Server (NTRS)

Tumer, Kagan; Agogino, Adrian

2006-01-01

Traffic congestion problems provide a unique environment to study how multi-agent systems promote desired system level behavior. What is particularly interesting in this class of problems is that no individual action is intrinsically "bad" for the system but that combinations of actions among agents lead to undesirable outcomes, As a consequence, agents need to learn how to coordinate their actions with those of other agents, rather than learn a particular set of "good" actions. This problem is ubiquitous in various traffic problems, including selecting departure times for commuters, routes for airlines, and paths for data routers. In this paper we present a multi-agent approach to two traffic problems, where far each driver, an agent selects the most suitable action using reinforcement learning. The agent rewards are based on concepts from collectives and aim to provide the agents with rewards that are both easy to learn and that if learned, lead to good system level behavior. In the first problem, we study how agents learn the best departure times of drivers in a daily commuting environment and how following those departure times alleviates congestion. In the second problem, we study how agents learn to select desirable routes to improve traffic flow and minimize delays for. all drivers.. In both sets of experiments,. agents using collective-based rewards produced near optimal performance (93-96% of optimal) whereas agents using system rewards (63-68%) barely outperformed random action selection (62-64%) and agents using local rewards (48-72%) performed worse than random in some instances.

La-CTP: Loop-Aware Routing for Energy-Harvesting Wireless Sensor Networks

PubMed Central

Sun, Guodong; Shang, Xinna; Zuo, Yan

2018-01-01

In emerging energy-harvesting wireless sensor networks (EH-WSN), the sensor nodes can harvest environmental energy to drive their operation, releasing the user’s burden in terms of frequent battery replacement, and even enabling perpetual sensing systems. In EH-WSN applications, usually, the node in energy-harvesting or recharging state has to stop working until it completes the energy replenishment. However, such temporary departures of recharging nodes severely impact the packet routing, and one immediate result is the routing loop problem. Controlling loops in connectivity-intermittent EH-WSN in an efficient way is a big challenge in practice, and so far, users still lack of effective and practicable routing protocols with loop handling. Based on the Collection Tree Protocol (CTP) widely used in traditional wireless sensor networks, this paper proposes a loop-aware routing protocol for real-world EH-WSNs, called La-CTP, which involves a new parent updating metric and a proactive, adaptive beaconing scheme to effectively suppress the occurrence of loops and unlock unavoidable loops, respectively. We constructed a 100-node testbed to evaluate La-CTP, and the experimental results showed its efficacy and efficiency. PMID:29393876

Petrous apex cholesterol granuloma: importance of pedicled nasoseptal flap in addition to silicone T-tube for prevention of occlusion of drainage route in transsphenoidal approach--a technical note.

PubMed

Shibao, Shunsuke; Toda, Masahiro; Tomita, Toshiki; Saito, Katsuya; Ogawa, Kaoru; Kawase, Takeshi; Yoshida, Kazunari

2015-01-01

Recently, petrous apex cholesterol granulomas (CGs) have been treated via the endoscopic endonasal transsphenoidal approach (EEA) using a silicone tube, to prevent drainage route occlusion. Occlusion of the drainage route has led to problems with recurrence. The aim of this report is to describe the use of a surgical technique to prevent drainage route occlusion. In surgical technique, the posterolateral wall of the sphenoid sinus was opened by EEA. After cyst debridement, a vascularized nasoseptal flap with a width of approximately 4 cm was inserted into the lumen with a silicone T-tube with a diameter of 7 mm. This technique was used in two patients: the first patient during the second operation after recurrence following occlusion of the drainage route, and the second patient during the first operation. Opening of the cyst wall was confirmed endoscopically in both patients 12-24 months after surgery, even after removal of the T-tube. In conclusion, the use of a pedicled nasoseptal flap with a silicone tube is useful to prevent CG recurrence, by paranasal cavitization of the cystic cavity.

An Energy Balanced and Lifetime Extended Routing Protocol for Underwater Sensor Networks.

PubMed

Wang, Hao; Wang, Shilian; Zhang, Eryang; Lu, Luxi

2018-05-17

Energy limitation is an adverse problem in designing routing protocols for underwater sensor networks (UWSNs). To prolong the network lifetime with limited battery power, an energy balanced and efficient routing protocol, called energy balanced and lifetime extended routing protocol (EBLE), is proposed in this paper. The proposed EBLE not only balances traffic loads according to the residual energy, but also optimizes data transmissions by selecting low-cost paths. Two phases are operated in the EBLE data transmission process: (1) candidate forwarding set selection phase and (2) data transmission phase. In candidate forwarding set selection phase, nodes update candidate forwarding nodes by broadcasting the position and residual energy level information. The cost value of available nodes is calculated and stored in each sensor node. Then in data transmission phase, high residual energy and relatively low-cost paths are selected based on the cost function and residual energy level information. We also introduce detailed analysis of optimal energy consumption in UWSNs. Numerical simulation results on a variety of node distributions and data load distributions prove that EBLE outperforms other routing protocols (BTM, BEAR and direct transmission) in terms of network lifetime and energy efficiency.

Selective randomized load balancing and mesh networks with changing demands

NASA Astrophysics Data System (ADS)

Shepherd, F. B.; Winzer, P. J.

2006-05-01

We consider the problem of building cost-effective networks that are robust to dynamic changes in demand patterns. We compare several architectures using demand-oblivious routing strategies. Traditional approaches include single-hop architectures based on a (static or dynamic) circuit-switched core infrastructure and multihop (packet-switched) architectures based on point-to-point circuits in the core. To address demand uncertainty, we seek minimum cost networks that can carry the class of hose demand matrices. Apart from shortest-path routing, Valiant's randomized load balancing (RLB), and virtual private network (VPN) tree routing, we propose a third, highly attractive approach: selective randomized load balancing (SRLB). This is a blend of dual-hop hub routing and randomized load balancing that combines the advantages of both architectures in terms of network cost, delay, and delay jitter. In particular, we give empirical analyses for the cost (in terms of transport and switching equipment) for the discussed architectures, based on three representative carrier networks. Of these three networks, SRLB maintains the resilience properties of RLB while achieving significant cost reduction over all other architectures, including RLB and multihop Internet protocol/multiprotocol label switching (IP/MPLS) networks using VPN-tree routing.

Channel and Switchbox Routing Using a Greedy Based Channel Algorithm with Outward Scanning Technique.

DTIC Science & Technology

1988-12-01

ol ) V. CONCLUSION AND DISCUSSION......................... ... 6 APPENDIX A. NPGS ROUTER USER GUIDE........................6 APPENDIX B. C PROGRAM...problem and shows some of the terminology. previously mentioned. that is peculiar to VISI routing. Clq C4 C4 C4 -4 C4 Clq -4- o C CCD Co -4 q 04 -4 oL ...34 l II 92-. -.-- -.-- , -.... -4--*- -*-- tC I I + 62- -- - ----- -. .t -- +* 0C ’l i II I o -- - ..... 4+ - -+- j- - --- +-+-g9! 6 Ol ... ... "II g4

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

DOT National Transportation Integrated Search

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...

Evaluation of New Jersey Route 18 OPAC/MIST traffic-control system

DOT National Transportation Integrated Search

1997-01-01

Conventional traffic-control strategies have limitations in handling unanticipated traffic demands. An adaptive traffic-signal control is expected to mitigate this problem and improve overall system performance. Furthermore, with the increasing needs...

Design of Tactical Support Strategies in Military Logistics: Trade-offs Between Efficiency and Effectiveness. A Column and Cut Generation Modeling Methods

DTIC Science & Technology

2011-12-01

problems need to be addressed in the design of military logis- tics networks. The design problem includes strategic decisions, such as the location of...military strategic logistics [11–13]. In this study, we focus on the design of tactical logistics strategies, which achieve different optimal balances...is clear that our problem is N P−Hard 1 since it generalizes the CVPR and the BPP . Different solutions to handle the loading and routing of

Developing a feasible neighbourhood search for solving hub location problem in a communication network

NASA Astrophysics Data System (ADS)

Rakhmawati, Fibri; Mawengkang, Herman; Buulolo, F.; Mardiningsih

2018-01-01

The hub location with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. This paper discusses how to model the polyhedral properties of the problems and develop a feasible neighbourhood search method to solve the model.

Word Frequency Analysis. MOS: 91B. Skill Levels 1 & 2.

DTIC Science & Technology

1981-05-01

RTIrARIA I tS I USARLE 61 TJISG -au- I- Utq -L I U1’NSILS It 11TtT I 1.1UVII.KZF I V AqITA INFR 2 VAC-1I11 6 VALVr I VALVES I V4pCU 3 VA!ELUAR 72 V J5F1...I HA481RDS0 I 11(11 I HPALTOI I 4r ARIN 1. UFIOrtoIL " ITIINC I1r TF1 ? HNlTrTI hfirN Iti I 9111F 1 I1I I 64U4. InI F P f HMW"PFFXe...IUSAI %__3L_ I ITILIZE I VALVES I III p"If t I VFTII RuTNG I VFR’R&.Y 1 VFFIFy I VtRSR ) I VIIPRWL 1 VERTIC.ALLY I vrp V I V f%.%F I VIL 15FL N