Discrete Teaching-learning-based optimization Algorithm for Traveling Salesman Problems

Directory of Open Access Journals (Sweden)

Wu Lehui

2017-01-01

Full Text Available In this paper, a discrete variant of TLBO (DTLBO is proposed for solving the traveling salesman problem (TSP. In the proposed method, an effective learner representation scheme is redefined based on the characteristics of TSP problem. Moreover, all learners are randomly divided into several sub-swarms with equal amounts of learners so as to increase the diversity of population and reduce the probability of being trapped in local optimum. In each sub-swarm, the new positions of learners in the teaching phase and the learning phase are generated by the crossover operation, the legality detection and mutation operation, and then the offspring learners are determined based on greedy selection. Finally, to verify the performance of the proposed algorithm, benchmark TSP problems are examined and the results indicate that DTLBO is effective compared with other algorithms used for TSP problems.

A parallel 2-opt algorithm for the traveling salesman problem

NARCIS (Netherlands)

Verhoeven, M.G.A.; Aarts, E.H.L.; Swinkels, P.C.J.

1995-01-01

We present a scalable parallel local search algorithm based on data parallelism. The concept of distributed neighborhood structures is introduced, and applied to the Traveling Salesman Problem (TSP). Our parallel local search algorithm finds the same quality solutions as the classical 2-opt

Human Performance on the Traveling Salesman and Related Problems: A Review

Science.gov (United States)

MacGregor, James N.; Chu, Yun

2011-01-01

The article provides a review of recent research on human performance on the traveling salesman problem (TSP) and related combinatorial optimization problems. We discuss what combinatorial optimization problems are, why they are important, and why they may be of interest to cognitive scientists. We next describe the main characteristics of human…

2D and 3D Traveling Salesman Problem

Science.gov (United States)

Haxhimusa, Yll; Carpenter, Edward; Catrambone, Joseph; Foldes, David; Stefanov, Emil; Arns, Laura; Pizlo, Zygmunt

2011-01-01

When a two-dimensional (2D) traveling salesman problem (TSP) is presented on a computer screen, human subjects can produce near-optimal tours in linear time. In this study we tested human performance on a real and virtual floor, as well as in a three-dimensional (3D) virtual space. Human performance on the real floor is as good as that on a…

QUANTUM INSPIRED PARTICLE SWARM COMBINED WITH LIN-KERNIGHAN-HELSGAUN METHOD TO THE TRAVELING SALESMAN PROBLEM

Directory of Open Access Journals (Sweden)

Bruno Avila Leal de Meirelles Herrera

2015-12-01

Full Text Available ABSTRACT The Traveling Salesman Problem (TSP is one of the most well-known and studied problems of Operations Research field, more specifically, in the Combinatorial Optimization field. As the TSP is a NP (Non-Deterministic Polynomial time-hard problem, there are several heuristic methods which have been proposed for the past decades in the attempt to solve it the best possible way. The aim of this work is to introduce and to evaluate the performance of some approaches for achieving optimal solution considering some symmetrical and asymmetrical TSP instances, which were taken from the Traveling Salesman Problem Library (TSPLIB. The analyzed approaches were divided into three methods: (i Lin-Kernighan-Helsgaun (LKH algorithm; (ii LKH with initial tour based on uniform distribution; and (iii an hybrid proposal combining Particle Swarm Optimization (PSO with quantum inspired behavior and LKH for local search procedure. The tested algorithms presented promising results in terms of computational cost and solution quality.

The Application of Fitness Sharing Method in Evolutionary Algorithm to Optimizing the Travelling Salesman Problem (TSP

Directory of Open Access Journals (Sweden)

Nurmaulidar Nurmaulidar

2015-04-01

Full Text Available Travelling Salesman Problem (TSP is one of complex optimization problem that is difficult to be solved, and require quite a long time for a large number of cities. Evolutionary algorithm is a precise algorithm used in solving complex optimization problem as it is part of heuristic method. Evolutionary algorithm, like many other algorithms, also experiences a premature convergence phenomenon, whereby variation is eliminated from a population of fairly fit individuals before a complete solution is achieved. Therefore it requires a method to delay the convergence. A specific method of fitness sharing called phenotype fitness sharing has been used in this research. The aim of this research is to find out whether fitness sharing in evolutionary algorithm is able to optimize TSP. There are two concepts of evolutionary algorithm being used in this research. the first one used single elitism and the other one used federated solution. The two concepts had been tested to the method of fitness sharing by using the threshold of 0.25, 0.50 and 0.75. The result was then compared to a non fitness sharing method. The result in this study indicated that by using single elitism concept, fitness sharing was able to give a more optimum result for the data of 100-1000 cities. On the other hand, by using federation solution concept, fitness sharing can yield a more optimum result for the data above 1000 cities, as well as a better solution of data-spreading compared to the method without fitness sharing.

A GPU Implementation of Local Search Operators for Symmetric Travelling Salesman Problem

Directory of Open Access Journals (Sweden)

Juraj Fosin

2013-06-01

Full Text Available The Travelling Salesman Problem (TSP is one of the most studied combinatorial optimization problem which is significant in many practical applications in transportation problems. The TSP problem is NP-hard problem and requires large computation power to be solved by the exact algorithms. In the past few years, fast development of general-purpose Graphics Processing Units (GPUs has brought huge improvement in decreasing the applications’ execution time. In this paper, we implement 2-opt and 3-opt local search operators for solving the TSP on the GPU using CUDA. The novelty presented in this paper is a new parallel iterated local search approach with 2-opt and 3-opt operators for symmetric TSP, optimized for the execution on GPUs. With our implementation large TSP problems (up to 85,900 cities can be solved using the GPU. We will show that our GPU implementation can be up to 20x faster without losing quality for all TSPlib problems as well as for our CRO TSP problem.

Optimization of travel salesman problem using the ant colony system and Greedy search

International Nuclear Information System (INIS)

Esquivel E, J.; Ordonez A, A.; Ortiz S, J. J.

2008-01-01

In this paper we present some results obtained during the development of optimization systems that can be used to design refueling and patterns of control rods in a BWR. These systems use ant colonies and Greedy search. The first phase of this project is to be familiar with these optimization techniques applied to the problem of travel salesman problem (TSP). The utility of TSP study is that, like the refueling design and pattern design of control rods are problems of combinative optimization. Even, the similarity with the problem of the refueling design is remarkable. It is presented some results for the TSP with the 32 state capitals of Mexico country. (Author)

The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches

DEFF Research Database (Denmark)

Petersen, Hanne Løhmann; Madsen, Oli B.G.

2009-01-01

This paper introduces the double travelling salesman problem with multiple stacks and presents four different metaheuristic approaches to its solution. The double TSP with multiple stacks is concerned with determining the shortest route performing pickups and deliveries in two separated networks...

Analysis of travelling salesman problem

Science.gov (United States)

Ahmed, Belal; Singh Chouhan, Shivank; Biswas, Subham; Gayathri, P.; Santhi, H.

2017-11-01

The multiple Traveling Salesman Problem (mTSP) is the general type of TSP, in which at least one than one sales representatives can be utilized as a part of the arrangement set. The Constraint in the improvement undertaking is that every sales representative comes back to beginning stage at end of outing, heading out to a particular arrangement of urban areas in the middle of and with the exception of the first, every last city is gone to by precisely one sales representative. The thought is to scan for the briefest course that is the slightest separation required for every salesperson to go from the beginning area to individual urban areas and back to the area from where he has begun. It is an intricate NP-Hard issue and has different applications for the most part in the field of planning and steering. The measure of algorithm time to take care of this issue develops exponentially as number of urban areas builds thus, the meta-heuristic streamlining algorithms, for example, Genetic Algorithm (GAs) are should have been investigated. The objective of this paper is to discover different algorithms utilized as a part of writing to understand mTSP.

Ant Colony Optimization ACO For The Traveling Salesman Problem TSP Using Partitioning

Directory of Open Access Journals (Sweden)

Alok Bajpai

2015-08-01

Full Text Available Abstract An ant colony optimization is a technique which was introduced in 1990s and which can be applied to a variety of discrete combinatorial optimization problem and to continuous optimization. The ACO algorithm is simulated with the foraging behavior of the real ants to find the incremental solution constructions and to realize a pheromone laying-and-following mechanism. This pheromone is the indirect communication among the ants. In this paper we introduces the partitioning technique based on the divide and conquer strategy for the traveling salesman problem which is one of the most important combinatorial problem in which the original problem is partitioned into the group of sub problems. And then we apply the ant colony algorithm using candidate list strategy for each smaller sub problems. After that by applying the local optimization and combining the sub problems to find the good solution for the original problem by improving the exploration efficiency of the ants. At the end of this paper we have also be presented the comparison of result with the normal ant colony system for finding the optimal solution to the traveling salesman problem.

How Much is Location Information Worth? A Competitive Analysis of the Online Traveling Salesman Problem with Two Disclosure Dates

NARCIS (Netherlands)

F.J. Srour (Jordan); R.A. Zuidwijk (Rob)

2008-01-01

textabstractIn this paper we derive the worst-case ratio of an online algorithm for the Traveling Salesman Problem (TSP) with two disclosure dates. This problem, a variant of the online TSP with release dates, is characterized by the disclosure of a job’s location at one point in time followed by

A HYBRID HEURISTIC ALGORITHM FOR THE CLUSTERED TRAVELING SALESMAN PROBLEM

Directory of Open Access Journals (Sweden)

Mário Mestria

2016-04-01

Full Text Available ABSTRACT This paper proposes a hybrid heuristic algorithm, based on the metaheuristics Greedy Randomized Adaptive Search Procedure, Iterated Local Search and Variable Neighborhood Descent, to solve the Clustered Traveling Salesman Problem (CTSP. Hybrid Heuristic algorithm uses several variable neighborhood structures combining the intensification (using local search operators and diversification (constructive heuristic and perturbation routine. In the CTSP, the vertices are partitioned into clusters and all vertices of each cluster have to be visited contiguously. The CTSP is -hard since it includes the well-known Traveling Salesman Problem (TSP as a special case. Our hybrid heuristic is compared with three heuristics from the literature and an exact method. Computational experiments are reported for different classes of instances. Experimental results show that the proposed hybrid heuristic obtains competitive results within reasonable computational time.

A population-based algorithm for the multi travelling salesman problem

Directory of Open Access Journals (Sweden)

Rubén Iván Bolaños

2016-04-01

Full Text Available This paper presents the implementation of an efficient modified genetic algorithm for solving the multi-traveling salesman problem (mTSP. The main characteristics of the method are the construction of an initial population of high quality and the implementation of several local search operators which are important in the efficient and effective exploration of promising regions of the solution space. Due to the combinatorial complexity of mTSP, the proposed methodology is especially applicable for real-world problems. The proposed algorithm was tested on a set of six benchmark instances, which have from 76 and 1002 cities to be visited. In all cases, the best known solution was improved. The results are also compared with other existing solutions procedure in the literature.

Deterministic algorithms for multi-criteria Max-TSP

NARCIS (Netherlands)

Manthey, Bodo

2012-01-01

We present deterministic approximation algorithms for the multi-criteria maximum traveling salesman problem (Max-TSP). Our algorithms are faster and simpler than the existing randomized algorithms. We devise algorithms for the symmetric and asymmetric multi-criteria Max-TSP that achieve ratios of

Optimization Approaches for the Traveling Salesman Problem with Drone

OpenAIRE

Agatz, N.A.H.; Bouman, P.C.; Schmidt, M.E.

2016-01-01

textabstractThe fast and cost-efficient home delivery of goods ordered online is logistically challenging. Many companies are looking for new ways to cross the last-mile to their customers. One technology-enabled opportunity that recently has received much at- tention is the use of a drone to support deliveries. An innovative last-mile delivery concept in which a truck collaborates with a drone to make deliveries gives rise to a new variant of the traveling salesman problem (TSP) that we call...

List-Based Simulated Annealing Algorithm for Traveling Salesman Problem

Directory of Open Access Journals (Sweden)

Shi-hua Zhan

2016-01-01

Full Text Available Simulated annealing (SA algorithm is a popular intelligent optimization algorithm which has been successfully applied in many fields. Parameters’ setting is a key factor for its performance, but it is also a tedious work. To simplify parameters setting, we present a list-based simulated annealing (LBSA algorithm to solve traveling salesman problem (TSP. LBSA algorithm uses a novel list-based cooling schedule to control the decrease of temperature. Specifically, a list of temperatures is created first, and then the maximum temperature in list is used by Metropolis acceptance criterion to decide whether to accept a candidate solution. The temperature list is adapted iteratively according to the topology of the solution space of the problem. The effectiveness and the parameter sensitivity of the list-based cooling schedule are illustrated through benchmark TSP problems. The LBSA algorithm, whose performance is robust on a wide range of parameter values, shows competitive performance compared with some other state-of-the-art algorithms.

Improved Genetic and Simulating Annealing Algorithms to Solve the Traveling Salesman Problem Using Constraint Programming

Directory of Open Access Journals (Sweden)

M. Abdul-Niby

2016-04-01

Full Text Available The Traveling Salesman Problem (TSP is an integer programming problem that falls into the category of NP-Hard problems. As the problem become larger, there is no guarantee that optimal tours will be found within reasonable computation time. Heuristics techniques, like genetic algorithm and simulating annealing, can solve TSP instances with different levels of accuracy. Choosing which algorithm to use in order to get a best solution is still considered as a hard choice. This paper suggests domain reduction as a tool to be combined with any meta-heuristic so that the obtained results will be almost the same. The hybrid approach of combining domain reduction with any meta-heuristic encountered the challenge of choosing an algorithm that matches the TSP instance in order to get the best results.

THE TRAVELLING SALESMAN PROBLEM IN THE ENGINEERING EDUCATION PROGRAMMING CURRICULUM

Directory of Open Access Journals (Sweden)

Yevgeny Gayev

2017-11-01

Full Text Available Objective: To make students familiar with the famous Traveling Salesman Problem (TSP and suggest the latter to become a common exercise in engineering programming curriculum provided the students master computer science in the easy programming environment MATLAB. Methods: easy programming in MATLAB makes true such modern educational approach as “discovery based” methodology. Results: a MATLAB TSP-program oriented to Ukrainian map is suggested that allows to pictorially demonstrate the process of optimal route search with an option to decelerate or accelerate the demonstration. The program is guessed to be useful both for learning the TSP as one of fundamental logistics problems and as an intriguing programming curriculum excersize. Several sub-programs according to key stone Computer Science Curriculum have also been suggested. This lies in line with recent “discovery based” learning methodology. Discussion: we explain how to create this program for visual discrete optimization, suggest required subprograms belonging to key stone programming algorithms including rather modern graphical user interface (GUI, how to use this MATLAB TSP-program for demonstration the drastical grows of solution time required. Conclusions: easy programming being realized in MATLAB makes dificult curriculum problems attractive to students; it focuses them to main problem’ features, laws and algorithms implementing the “discovery based” methodology in such a way.

On approximately fair cost allocation in Euclidean TSP games

NARCIS (Netherlands)

Faigle, U.; Fekete, Sándor P.; Hochstättler, Winfried; Kern, Walter

1998-01-01

We consider the problem of allocating the cost of an optimal traveling salesman tour in a fair way among the nodes visited; in particular, we focus on the case where the distance matrix of the underlying TSP problem satisfies the triangle inequality. We thereby use the model of TSP games in the

Solving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System

Directory of Open Access Journals (Sweden)

Majid Yousefikhoshbakht

2016-07-01

Full Text Available The TSP is considered one of the most well-known combinatorial optimization tasks and researchers have paid so much attention to the TSP for many years. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The objective is to minimize the total distance traveled by the salesman.  Because this problem is a non-deterministic polynomial (NP-hard problem in nature, a hybrid meta-heuristic algorithm called REACSGA is used for solving the TSP. In REACSGA, a reactive bone route algorithm that uses the ant colony system (ACS for generating initial diversified solutions and the genetic algorithm (GA as an improved procedure are applied. Since the performance of the Metaheuristic algorithms is significantly influenced by their parameters, Taguchi Method is used to set the parameters of the proposed algorithm. The proposed algorithm is tested on several standard instances involving 24 to 318 nodes from the literature. The computational result shows that the results of the proposed algorithm are competitive with other metaheuristic algorithms for solving the TSP in terms of better quality of solution and computational time respectively. In addition, the proposed REACSGA is significantly efficient and finds closely the best known solutions for most of the instances in which thirteen best known solutions are also found.

Developing Programming Tools to Handle Traveling Salesman Problem by the Three Object-Oriented Languages

Directory of Open Access Journals (Sweden)

Hassan Ismkhan

2014-01-01

Full Text Available The traveling salesman problem (TSP is one of the most famous problems. Many applications and programming tools have been developed to handle TSP. However, it seems to be essential to provide easy programming tools according to state-of-the-art algorithms. Therefore, we have collected and programmed new easy tools by the three object-oriented languages. In this paper, we present ADT (abstract data type of developed tools at first; then we analyze their performance by experiments. We also design a hybrid genetic algorithm (HGA by developed tools. Experimental results show that the proposed HGA is comparable with the recent state-of-the-art applications.

An new self-organizing maps strategy for solving the traveling salesman problem

International Nuclear Information System (INIS)

Bai Yanping; Zhang Wendong; Jin Zhen

2006-01-01

This paper presents an approach to the well-known traveling salesman problem (TSP) using self-organizing maps (SOM). There are many types of SOM algorithms to solve the TSP found in the literature, whereas the purpose of this paper is to look for the incorporation of an efficient initialization methods and the definition of a parameters adaptation law to achieve better results and a faster convergence. Aspects of parameters adaptation, selecting the number of nodes of neurons, index of winner neurons and effect of the initial ordering of the cities, as well as the initial synaptic weights of the modified SOM algorithm are discussed. The complexity of the modified SOM algorithm is analyzed. The simulated results show an average deviation of 2.32% from the optimal tour length for a set of 12 TSP instances

An new self-organizing maps strategy for solving the traveling salesman problem

Energy Technology Data Exchange (ETDEWEB)

Bai Yanping [Key Lab of Instrument Science and Dynamic Measurement of Ministry of Education, North University of China, No. 3, Xueyuan Road, TaiYuan, ShanXi 030051 (China)]. E-mail: baiyp@nuc.edu.cn; Zhang Wendong [Key Lab of Instrument Science and Dynamic Measurement of Ministry of Education, North University of China, No. 3, Xueyuan Road, TaiYuan, ShanXi 030051 (China)]. E-mail: wdzhang@nuc.edu.cn; Jin Zhen [Department of Applied Mathematics, North University of China, No. 3 Xueyuan Road, TaiYuan, ShanXi 030051 (China)

2006-05-15

This paper presents an approach to the well-known traveling salesman problem (TSP) using self-organizing maps (SOM). There are many types of SOM algorithms to solve the TSP found in the literature, whereas the purpose of this paper is to look for the incorporation of an efficient initialization methods and the definition of a parameters adaptation law to achieve better results and a faster convergence. Aspects of parameters adaptation, selecting the number of nodes of neurons, index of winner neurons and effect of the initial ordering of the cities, as well as the initial synaptic weights of the modified SOM algorithm are discussed. The complexity of the modified SOM algorithm is analyzed. The simulated results show an average deviation of 2.32% from the optimal tour length for a set of 12 TSP instances.

Hierarchical Solution of the Traveling Salesman Problem with Random Dyadic Tilings

Science.gov (United States)

Kalmár-Nagy, Tamás; Bak, Bendegúz Dezső

We propose a hierarchical heuristic approach for solving the Traveling Salesman Problem (TSP) in the unit square. The points are partitioned with a random dyadic tiling and clusters are formed by the points located in the same tile. Each cluster is represented by its geometrical barycenter and a “coarse” TSP solution is calculated for these barycenters. Midpoints are placed at the middle of each edge in the coarse solution. Near-optimal (or optimal) minimum tours are computed for each cluster. The tours are concatenated using the midpoints yielding a solution for the original TSP. The method is tested on random TSPs (independent, identically distributed points in the unit square) up to 10,000 points as well as on a popular benchmark problem (att532 — coordinates of 532 American cities). Our solutions are 8-13% longer than the optimal ones. We also present an optimization algorithm for the partitioning to improve our solutions. This algorithm further reduces the solution errors (by several percent using 1000 iteration steps). The numerical experiments demonstrate the viability of the approach.

A multiobjective non-dominated sorting genetic algorithm (NSGA-II for the Multiple Traveling Salesman Problem

Directory of Open Access Journals (Sweden)

Rubén Iván Bolaños

2015-06-01

Full Text Available This paper considers a multi-objective version of the Multiple Traveling Salesman Problem (MOmTSP. In particular, two objectives are considered: the minimization of the total traveled distance and the balance of the working times of the traveling salesmen. The problem is formulated as an integer multi-objective optimization model. A non-dominated sorting genetic algorithm (NSGA-II is proposed to solve the MOmTSP. The solution scheme allows one to find a set of ordered solutions in Pareto fronts by considering the concept of dominance. Tests on real world instances and instances adapted from the literature show the effectiveness of the proposed algorithm.

Kombinasi Firefly Algorithm-Tabu Search untuk Penyelesaian Traveling Salesman Problem

Directory of Open Access Journals (Sweden)

Riyan Naufal Hay's

2017-07-01

Full Text Available Traveling Salesman Problem (TSP adalah masalah optimasi kombinatorial klasik dan memiliki peran dalam perencanaan, penjadwalan, dan pencarian pada bidang rekayasa dan pengetahuan (Dong, 2012. TSP juga merupakan objek yang baik untuk menguji kinerja metode optimasi, beberapa metode seperti Cooperative Genetic Ant System (CGAS (Dong, 2012, Parallelized Genetic Ant Colony System (PGAS Particle Swarm Optimization and Ant Colony Optimization Algorithms (PSO–ACO (Elloumi, 2014, dan Ant Colony Hyper-Heuristics (ACO HH (Aziz, 2015 telah dikembangkan untuk memecahkan TSP. Sehingga, pada penelitian ini diimplementasikan kombinasi metode baru untuk meningkatkan akurasi penyelesaian TSP. Firefly Algorithm (FA merupakan salah satu algoritma yang dapat digunakan untuk memecahkan masalah optimasi kombinatorial (Layeb, 2014. FA merupakan algoritma yang berpotensi kuat dalam memecahkan kasus optimasi dibanding algoritma yang ada termasuk Particle Swarm Optimization (Yang, 2010. Namun, FA memiliki kekurangan dalam memecahkan masalah optimasi dengan skala besar (Baykasoğlu dan Ozsoy, 2014. Tabu Search (TS merupakan metode optimasi yang terbukti efektif untuk memecahkan masalah optimasi dengan skala besar (Pedro, 2013. Pada penelitian ini, TS akan diterapkan pada FA (FATS untuk memecahkan kasus TSP. Hasil FATS akan dibandingkan terhadap penelitian sebelumnya yaitu ACOHH. Perbandingan hasil menunjukan peningkatan akurasi sebesar 0.89% pada dataset Oliver30, 0.14% dataset Eil51, 3.81% dataset Eil76 dan 1.27% dataset KroA100.

General k-opt submoves for the Lin-Kernighan TSP heuristic

DEFF Research Database (Denmark)

Helsgaun, Keld

2009-01-01

Local search with k-exchange neighborhoods, k-opt, is the most widely used heuristic method for the traveling salesman problem (TSP). This paper presents an effective implementation of k-opt in LKH-2, a variant of the Lin–Kernighan TSP heuristic. The effectiveness of the implementation...

A combination of genetic algorithm and particle swarm optimization method for solving traveling salesman problem

Directory of Open Access Journals (Sweden)

Keivan Borna

2015-12-01

Full Text Available Traveling salesman problem (TSP is a well-established NP-complete problem and many evolutionary techniques like particle swarm optimization (PSO are used to optimize existing solutions for that. PSO is a method inspired by the social behavior of birds. In PSO, each member will change its position in the search space, according to personal or social experience of the whole society. In this paper, we combine the principles of PSO and crossover operator of genetic algorithm to propose a heuristic algorithm for solving the TSP more efficiently. Finally, some experimental results on our algorithm are applied in some instances in TSPLIB to demonstrate the effectiveness of our methods which also show that our algorithm can achieve better results than other approaches.

An Effective Implementation of K-opt Moves for the Lin-Kernighan TSP Heuristic

DEFF Research Database (Denmark)

Helsgaun, Keld

Local search with k-change neighborhoods, k-opt, is the most widely used heuristic method for the traveling salesman problem (TSP). This report presents an effective implementation of k-opt for the Lin- Kernighan TSP heuristic. The effectiveness of the implementation is demonstrated with extensive...

Heuristic methods using grasp, path relinking and variable neighborhood search for the clustered traveling salesman problem

Directory of Open Access Journals (Sweden)

Mário Mestria

2013-08-01

Full Text Available The Clustered Traveling Salesman Problem (CTSP is a generalization of the Traveling Salesman Problem (TSP in which the set of vertices is partitioned into disjoint clusters and objective is to find a minimum cost Hamiltonian cycle such that the vertices of each cluster are visited contiguously. The CTSP is NP-hard and, in this context, we are proposed heuristic methods for the CTSP using GRASP, Path Relinking and Variable Neighborhood Descent (VND. The heuristic methods were tested using Euclidean instances with up to 2000 vertices and clusters varying between 4 to 150 vertices. The computational tests were performed to compare the performance of the heuristic methods with an exact algorithm using the Parallel CPLEX software. The computational results showed that the hybrid heuristic method using VND outperforms other heuristic methods.

A Cost Assessment of the Dayton Public Schools Vehicle Routing Problem

Science.gov (United States)

2009-03-01

known problems: the Traveling Salesman Problem (TSP) and the Bin Packing Problem ( BPP ) (Ralphs, 2003). The VRP has a plethora of real world...well known problems: the Traveling Salesman Problem (TSP) and the Bin Packing Problem ( BPP ) (Ralphs, 2003). The VRP has a plethora of real world

Traveling salesman problems with PageRank Distance on complex networks reveal community structure

Science.gov (United States)

Jiang, Zhongzhou; Liu, Jing; Wang, Shuai

2016-12-01

In this paper, we propose a new algorithm for community detection problems (CDPs) based on traveling salesman problems (TSPs), labeled as TSP-CDA. Since TSPs need to find a tour with minimum cost, cities close to each other are usually clustered in the tour. This inspired us to model CDPs as TSPs by taking each vertex as a city. Then, in the final tour, the vertices in the same community tend to cluster together, and the community structure can be obtained by cutting the tour into a couple of paths. There are two challenges. The first is to define a suitable distance between each pair of vertices which can reflect the probability that they belong to the same community. The second is to design a suitable strategy to cut the final tour into paths which can form communities. In TSP-CDA, we deal with these two challenges by defining a PageRank Distance and an automatic threshold-based cutting strategy. The PageRank Distance is designed with the intrinsic properties of CDPs in mind, and can be calculated efficiently. In the experiments, benchmark networks with 1000-10,000 nodes and varying structures are used to test the performance of TSP-CDA. A comparison is also made between TSP-CDA and two well-established community detection algorithms. The results show that TSP-CDA can find accurate community structure efficiently and outperforms the two existing algorithms.

Advanced Harmony Search with Ant Colony Optimization for Solving the Traveling Salesman Problem

Directory of Open Access Journals (Sweden)

Ho-Yoeng Yun

2013-01-01

Full Text Available We propose a novel heuristic algorithm based on the methods of advanced Harmony Search and Ant Colony Optimization (AHS-ACO to effectively solve the Traveling Salesman Problem (TSP. The TSP, in general, is well known as an NP-complete problem, whose computational complexity increases exponentially by increasing the number of cities. In our algorithm, Ant Colony Optimization (ACO is used to search the local optimum in the solution space, followed by the use of the Harmony Search to escape the local optimum determined by the ACO and to move towards a global optimum. Experiments were performed to validate the efficiency of our algorithm through a comparison with other algorithms and the optimum solutions presented in the TSPLIB. The results indicate that our algorithm is capable of generating the optimum solution for most instances in the TSPLIB; moreover, our algorithm found better solutions in two cases (kroB100 and pr144 when compared with the optimum solution presented in the TSPLIB.

The application of ant colony optimization in the solution of 3D traveling salesman problem on a sphere

Directory of Open Access Journals (Sweden)

Hüseyin Eldem

2017-08-01

Full Text Available Traveling Salesman Problem (TSP is a problem in combinatorial optimization that should be solved by a salesperson who has to travel all cities at the minimum cost (minimum route and return to the starting city (node. Todays, to resolve the minimum cost of this problem, many optimization algorithms have been used. The major ones are these metaheuristic algorithms. In this study, one of the metaheuristic methods, Ant Colony Optimization (ACO method (Max-Min Ant System – MMAS, was used to solve the Non-Euclidean TSP, which consisted of sets of different count points coincidentally located on the surface of a sphere. In this study seven point sets were used which have different point count. The performance of the MMAS method solving Non-Euclidean TSP problem was demonstrated by different experiments. Also, the results produced by ACO are compared with Discrete Cuckoo Search Algorithm (DCS and Genetic Algorithm (GA that are in the literature. The experiments for TSP on a sphere, show that ACO’s average results were better than the GA’s average results and also best results of ACO successful than the DCS.

Bi-criteria travelling salesman subtour problem with time threshold

Science.gov (United States)

Kumar Thenepalle, Jayanth; Singamsetty, Purusotham

2018-03-01

This paper deals with the bi-criteria travelling salesman subtour problem with time threshold (BTSSP-T), which comes from the family of the travelling salesman problem (TSP) and is NP-hard in the strong sense. The problem arises in several application domains, mainly in routing and scheduling contexts. Here, the model focuses on two criteria: total travel distance and gains attained. The BTSSP-T aims to determine a subtour that starts and ends at the same city and visits a subset of cities at a minimum travel distance with maximum gains, such that the time spent on the tour does not exceed the predefined time threshold. A zero-one integer-programming problem is adopted to formulate this model with all practical constraints, and it includes a finite set of feasible solutions (one for each tour). Two algorithms, namely, the Lexi-Search Algorithm (LSA) and the Tabu Search (TS) algorithm have been developed to solve the BTSSP-T problem. The proposed LSA implicitly enumerates the feasible patterns and provides an efficient solution with backtracking, whereas the TS, which is metaheuristic, will give the better approximate solution. A numerical example is demonstrated in order to understand the search mechanism of the LSA. Numerical experiments are carried out in the MATLAB environment, on the different benchmark instances available in the TSPLIB domain as well as on randomly generated test instances. The experimental results show that the proposed LSA works better than the TS algorithm in terms of solution quality and, computationally, both LSA and TS are competitive.

Large neighborhood search for the double traveling salesman problem with multiple stacks

Energy Technology Data Exchange (ETDEWEB)

Bent, Russell W [Los Alamos National Laboratory; Van Hentenryck, Pascal [BROWN UNIV

2009-01-01

This paper considers a complex real-life short-haul/long haul pickup and delivery application. The problem can be modeled as double traveling salesman problem (TSP) in which the pickups and the deliveries happen in the first and second TSPs respectively. Moreover, the application features multiple stacks in which the items must be stored and the pickups and deliveries must take place in reserve (LIFO) order for each stack. The goal is to minimize the total travel time satisfying these constraints. This paper presents a large neighborhood search (LNS) algorithm which improves the best-known results on 65% of the available instances and is always within 2% of the best-known solutions.

A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem.

Directory of Open Access Journals (Sweden)

Zi-Bin Jiang

Full Text Available The fruit fly optimization algorithm (FOA is a newly developed bio-inspired algorithm. The continuous variant version of FOA has been proven to be a powerful evolutionary approach to determining the optima of a numerical function on a continuous definition domain. In this study, a discrete FOA (DFOA is developed and applied to the traveling salesman problem (TSP, a common combinatorial problem. In the DFOA, the TSP tour is represented by an ordering of city indices, and the bio-inspired meta-heuristic search processes are executed with two elaborately designed main procedures: the smelling and tasting processes. In the smelling process, an effective crossover operator is used by the fruit fly group to search for the neighbors of the best-known swarm location. During the tasting process, an edge intersection elimination (EXE operator is designed to improve the neighbors of the non-optimum food location in order to enhance the exploration performance of the DFOA. In addition, benchmark instances from the TSPLIB are classified in order to test the searching ability of the proposed algorithm. Furthermore, the effectiveness of the proposed DFOA is compared to that of other meta-heuristic algorithms. The results indicate that the proposed DFOA can be effectively used to solve TSPs, especially large-scale problems.

Optimization of Gas Flow Network using the Traveling Salesman ...

African Journals Online (AJOL)

The overall goal of this paper is to develop a general formulation for an optimal infrastructure layout design of gas pipeline distribution networks using algorithm developed from the application of two industrial engineering concepts: the traveling salesman problem (TSP) and the nearest neighbor (NN). The focus is on the ...

The on-line asymmetric traveling salesman problem

NARCIS (Netherlands)

Ausiello, G.; Bonifaci, V.; Laura, L.

2008-01-01

We consider two on-line versions of the asymmetric traveling salesman problem with triangle inequality. For the homing version, in which the salesman is required to return in the city where it started from, we give a -competitive algorithm and prove that this is best possible. For the nomadic

Heuristics for Comparing the Lengths of Completed E-TSP Tours: Crossings and Areas

Science.gov (United States)

MacGregor, James N.

2017-01-01

The article reports three experiments designed to explore heuristics used in comparing the lengths of completed Euclidean Traveling Salesman Problem (E-TSP) tours. The experiments used paired comparisons in which participants judged which of two completed tours of the same point set was shorter. The first experiment manipulated two factors, the…

A Hybrid Symbiotic Organisms Search Algorithm with Variable Neighbourhood Search for Solving Symmetric and Asymmetric Traveling Salesman Problem

Science.gov (United States)

Umam, M. I. H.; Santosa, B.

2018-04-01

Combinatorial optimization has been frequently used to solve both problems in science, engineering, and commercial applications. One combinatorial problems in the field of transportation is to find a shortest travel route that can be taken from the initial point of departure to point of destination, as well as minimizing travel costs and travel time. When the distance from one (initial) node to another (destination) node is the same with the distance to travel back from destination to initial, this problems known to the Traveling Salesman Problem (TSP), otherwise it call as an Asymmetric Traveling Salesman Problem (ATSP). The most recent optimization techniques is Symbiotic Organisms Search (SOS). This paper discuss how to hybrid the SOS algorithm with variable neighborhoods search (SOS-VNS) that can be applied to solve the ATSP problem. The proposed mechanism to add the variable neighborhoods search as a local search is to generate the better initial solution and then we modify the phase of parasites with adapting mechanism of mutation. After modification, the performance of the algorithm SOS-VNS is evaluated with several data sets and then the results is compared with the best known solution and some algorithm such PSO algorithm and SOS original algorithm. The SOS-VNS algorithm shows better results based on convergence, divergence and computing time.

Solving Arc Routing Problems Using the Lin-Kernighan-Helsgaun Algorithm

DEFF Research Database (Denmark)

Helsgaun, Keld

It is well known that many arc routing problems can be transformed into the Equality Generalized Traveling Salesman Problem (E-GTSP), which in turn can be transformed into a standard Asymmetric Traveling Salesman Problem (TSP). This opens up the possibility of solving arc routing problems using...

Optimal solution for travelling salesman problem using heuristic shortest path algorithm with imprecise arc length

Science.gov (United States)

Bakar, Sumarni Abu; Ibrahim, Milbah

2017-08-01

The shortest path problem is a popular problem in graph theory. It is about finding a path with minimum length between a specified pair of vertices. In any network the weight of each edge is usually represented in a form of crisp real number and subsequently the weight is used in the calculation of shortest path problem using deterministic algorithms. However, due to failure, uncertainty is always encountered in practice whereby the weight of edge of the network is uncertain and imprecise. In this paper, a modified algorithm which utilized heuristic shortest path method and fuzzy approach is proposed for solving a network with imprecise arc length. Here, interval number and triangular fuzzy number in representing arc length of the network are considered. The modified algorithm is then applied to a specific example of the Travelling Salesman Problem (TSP). Total shortest distance obtained from this algorithm is then compared with the total distance obtained from traditional nearest neighbour heuristic algorithm. The result shows that the modified algorithm can provide not only on the sequence of visited cities which shown to be similar with traditional approach but it also provides a good measurement of total shortest distance which is lesser as compared to the total shortest distance calculated using traditional approach. Hence, this research could contribute to the enrichment of methods used in solving TSP.

On One Approach to TSP Structural Stability

Directory of Open Access Journals (Sweden)

Evgeny Ivanko

2014-01-01

Full Text Available In this paper we study an inverse approach to the traveling salesman reoptimization problem. Namely, we consider the case of the addition of a new vertex to the initial TSP data and fix the simple “adaptation” algorithm: the new vertex is inserted into an edge of the optimal tour. In the paper we consider the conditions describing the vertexes that can be inserted by this algorithm without loss of optimality, study the properties of stability areas, and address several model applications.

Boltzmann machines for travelling salesman problems

NARCIS (Netherlands)

Aarts, E.H.L.; Korst, J.H.M.

1989-01-01

Boltzmann machines are proposed as a massively parallel alternative to the (sequential) simulated annealing algorithm. Our approach is tailored to the travelling salesman problem, but it can also be applied to a more general class of combinatorial optimization problems. For two distinct 0–1

Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem

DEFF Research Database (Denmark)

Mak, Vicky; Thomadsen, Tommy

2006-01-01

This paper considers the cardinality constrained quadratic knapsack problem (QKP) and the quadratic selective travelling salesman problem (QSTSP). The QKP is a generalization of the knapsack problem and the QSTSP is a generalization of the travelling salesman problem. Thus, both problems are NP...

On Labeled Traveling Salesman Problems

DEFF Research Database (Denmark)

Couetoux, Basile; Gourves, Laurent; Monnot, Jerome

2008-01-01

We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum (or minimum) number of colors. We derive results regarding hardness of approximation, and analyze approximation algorithms for both versions ...

Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem

Directory of Open Access Journals (Sweden)

Anja Fischer

2015-06-01

Full Text Available One fundamental problem of bioinformatics is the computational recognition of DNA and RNA binding sites. Given a set of short DNA or RNA sequences of equal length such as transcription factor binding sites or RNA splice sites, the task is to learn a pattern from this set that allows the recognition of similar sites in another set of DNA or RNA sequences. Permuted Markov (PM models and permuted variable length Markov (PVLM models are two powerful models for this task, but the problem of finding an optimal PM model or PVLM model is NP-hard. While the problem of finding an optimal PM model or PVLM model of order one is equivalent to the traveling salesman problem (TSP, the problem of finding an optimal PM model or PVLM model of order two is equivalent to the quadratic TSP (QTSP. Several exact algorithms exist for solving the QTSP, but it is unclear if these algorithms are capable of solving QTSP instances resulting from RNA splice sites of at least 150 base pairs in a reasonable time frame. Here, we investigate the performance of three exact algorithms for solving the QTSP for ten datasets of splice acceptor sites and splice donor sites of five different species and find that one of these algorithms is capable of solving QTSP instances of up to 200 base pairs with a running time of less than two days.

Branch-and-cut-and-price for the traveling salesman problem with time windows

DEFF Research Database (Denmark)

Røpke, Stefan; Madsen, Oli B.G.

In the traveling salesman problem with time windows (TSPTW) one is given a depot and a set of nodes to be visited by a salesman. The salesman starts his trip at the depot and must visit all nodes while respecting time windows at the nodes. The objective of the problem is to minimize the total...... distance traveled by the salesman. The TSPTW is formulated as a set-partitioning problem which is solved by using combined cut and column generation. The pricing sub problem in the column generation procedure is a shortest path problem with time window constraints and 2-cycle elimination. A standard column...

IMPLEMENTASI ALGORITMA TSP DALAM PENYELESAIAN TRACKING PAKET PADA UNIT PROCESSING CENTER POS INDONESIA KOTA LHOKSEUMAWE ACEH

Directory of Open Access Journals (Sweden)

Richki Hardi

2015-04-01

Full Text Available Traveling salesperson problem-TSP problem is an optimization problem to find the optimal way for the traveling salesman who wants to visit several cities, and returned to the original departure city. TSP is a difficult problem when viewed from the point of computing. Several methods have been used to solve these problems but until now not been found mangkus algorithms to solve them. The easiest way to solve TSP is to try all possible routes and find the optimal route. However, at the time of the very practical now required to complete an algorithm that quickly so that the TSP solution obtained near optimal solutions.TSP is very precise algorithm used for solving complex optimization problems and solved difficult conventional methods. Route and distance data used to determine the optimal route in the system is obtained from the survey results at the post office Lhokseumawe. The results showed that the algorithm is the shortest route from the post office to post office Lhokseumawe, Meulaboh, Lhokseumawe is through the route - Bireun-Simpang Tiga-Takengon-Meulaboh with a total distance of 326 kilometers. The implementation of this system using the programming language PHP, MySQL, and Macromedia Flash.

The modification of hybrid method of ant colony optimization, particle swarm optimization and 3-OPT algorithm in traveling salesman problem

Science.gov (United States)

Hertono, G. F.; Ubadah; Handari, B. D.

2018-03-01

The traveling salesman problem (TSP) is a famous problem in finding the shortest tour to visit every vertex exactly once, except the first vertex, given a set of vertices. This paper discusses three modification methods to solve TSP by combining Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO) and 3-Opt Algorithm. The ACO is used to find the solution of TSP, in which the PSO is implemented to find the best value of parameters α and β that are used in ACO.In order to reduce the total of tour length from the feasible solution obtained by ACO, then the 3-Opt will be used. In the first modification, the 3-Opt is used to reduce the total tour length from the feasible solutions obtained at each iteration, meanwhile, as the second modification, 3-Opt is used to reduce the total tour length from the entire solution obtained at every iteration. In the third modification, 3-Opt is used to reduce the total tour length from different solutions obtained at each iteration. Results are tested using 6 benchmark problems taken from TSPLIB by calculating the relative error to the best known solution as well as the running time. Among those modifications, only the second and third modification give satisfactory results except the second one needs more execution time compare to the third modifications.

An approach using quantum PBIL to solve the traveling salesman problem

International Nuclear Information System (INIS)

Silva, Marcio Henrique; Schirru, Roberto

2011-01-01

Quantum inspired evolutionary algorithms are optimization tools based in artificial intelligence developed to simulate the quantum processing in classical computers viewing that there are not quantum computers available nowadays. In this work is introduced one of these tools, which adds quantum concepts such as the linear superposition of states and the qubit representation to standard PBIL named Quantum PBIL. Here we use Quantum PBIL to solve a well-known NPHard benchmark, the Traveling salesman problem. The objective is to find the shorter path made by a traveler linking all the available cities visiting each one only once and returning to the starter one at the final of his journey. As the main purpose of this work is employ the algorithm to solve the nuclear reload optimization in the future, and according to the similarities that both problems share, TSP is a good challenge for Quantum PBIL. The results have shown that the algorithm is able to obtain good performance when applied on this problem. It is also fast and has a great capacity to find good solutions when compared to other versions of PBIL found in literature despite of its stagnation of bits tendency can easily lead it to local minimums. (author)

An approach using quantum PBIL to solve the traveling salesman problem

Energy Technology Data Exchange (ETDEWEB)

Silva, Marcio Henrique; Schirru, Roberto, E-mail: marciohenrique@lmp.ufrj.br, E-mail: schirru@lmp.ufrj.br [Coordenacao dos Programas de Pos-Graduacao em Engenharia (PEN/COPPE), Rio de Janeiro, RJ (Brazil)

2011-07-01

Quantum inspired evolutionary algorithms are optimization tools based in artificial intelligence developed to simulate the quantum processing in classical computers viewing that there are not quantum computers available nowadays. In this work is introduced one of these tools, which adds quantum concepts such as the linear superposition of states and the qubit representation to standard PBIL named Quantum PBIL. Here we use Quantum PBIL to solve a well-known NPHard benchmark, the Traveling salesman problem. The objective is to find the shorter path made by a traveler linking all the available cities visiting each one only once and returning to the starter one at the final of his journey. As the main purpose of this work is employ the algorithm to solve the nuclear reload optimization in the future, and according to the similarities that both problems share, TSP is a good challenge for Quantum PBIL. The results have shown that the algorithm is able to obtain good performance when applied on this problem. It is also fast and has a great capacity to find good solutions when compared to other versions of PBIL found in literature despite of its stagnation of bits tendency can easily lead it to local minimums. (author)

The Electric Traveling Salesman Problem with Time Windows

DEFF Research Database (Denmark)

Roberti, Roberto; Wen, Min

2016-01-01

To minimize greenhouse gas emissions, the logistic field has seen an increasing usage of electric vehicles. The resulting distribution planning problems present new computational challenges.We address a problem, called Electric Traveling Salesman Problem with Time Windows. We propose a mixed...

Solusi Optimal Model Optimisasi Robust Untuk Masalah Traveling Salesman Dengan Ketidaktentuan Kotak Dan Pendekatan Metode Branch And Bound

Directory of Open Access Journals (Sweden)

Poppy Amriyati

2015-12-01

Full Text Available Traveling Salesman Problem (TSP merupakan teknik pencarian rute yang dimulai dari satu titik awal, setiap kota harus dikunjungi sekali dan kemudian kembali ke tempat asal sehingga total jarak atau waktu perjalanan adalah minimum. Untuk mengatasi kedakpastian jarak atau waktu perjalanan, maka perlu dilakukan pengembangan model TSP. Salah satu bidang Optimisasi yang mampu menyelesaikan permasalahan terkait ketidakpastian adalah Optimisasi Robust. Dalam makalah ini dibahas mengenai penerapan Optimisasi Robust pada TSP (RTSP menggunakan pendekatan Box Uncertainty dan diselesaikan dengan menggunakan Metode Branch and Bound. Disajikan simulasi numerik pada software aplikasi Maple untuk beberapa kasus nyata terkait penerapan Optimisasi RTSP , seperti masalah manajemen konstruksi, penentuan jarak tempuh kota di Pulau Jawa, dan Penentuan Rute Mandiri Fun Run.

Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator

Directory of Open Access Journals (Sweden)

Abid Hussain

2017-01-01

Full Text Available Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time. The genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. The genetic algorithm depends on selection criteria, crossover, and mutation operators. To tackle the traveling salesman problem using genetic algorithms, there are various representations such as binary, path, adjacency, ordinal, and matrix representations. In this article, we propose a new crossover operator for traveling salesman problem to minimize the total distance. This approach has been linked with path representation, which is the most natural way to represent a legal tour. Computational results are also reported with some traditional path representation methods like partially mapped and order crossovers along with new cycle crossover operator for some benchmark TSPLIB instances and found improvements.

An improved self-adaptive ant colony algorithm based on genetic strategy for the traveling salesman problem

Science.gov (United States)

Wang, Pan; Zhang, Yi; Yan, Dong

2018-05-01

Ant Colony Algorithm (ACA) is a powerful and effective algorithm for solving the combination optimization problem. Moreover, it was successfully used in traveling salesman problem (TSP). But it is easy to prematurely converge to the non-global optimal solution and the calculation time is too long. To overcome those shortcomings, a new method is presented-An improved self-adaptive Ant Colony Algorithm based on genetic strategy. The proposed method adopts adaptive strategy to adjust the parameters dynamically. And new crossover operation and inversion operation in genetic strategy was used in this method. We also make an experiment using the well-known data in TSPLIB. The experiment results show that the performance of the proposed method is better than the basic Ant Colony Algorithm and some improved ACA in both the result and the convergence time. The numerical results obtained also show that the proposed optimization method can achieve results close to the theoretical best known solutions at present.

INTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING

Directory of Open Access Journals (Sweden)

Hossein Erfani

2009-07-01

Full Text Available Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT, this is the traveling salesman problem (TSP. A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long for the algorithm to find the shortest path. Furthermore, in reality, things are not as simple as those stated in AT. For instance, the cost of travel for the same part of the city at different times may not be the same. In this project, we have integrated TSP algorithm with AI knowledge-based approach and case-based reasoning in solving the problem. With this integration, knowledge about the geographical information and past cases are used to help TSP algorithm in finding a solution. This approach dramatically reduces the computation time required for minimum tour finding.

THE DUBINS TRAVELING SALESMAN PROBLEM WITH CONSTRAINED COLLECTING MANEUVERS

Directory of Open Access Journals (Sweden)

Petr Váňa

2016-11-01

Full Text Available In this paper, we introduce a variant of the Dubins traveling salesman problem (DTSP that is called the Dubins traveling salesman problem with constrained collecting maneuvers (DTSP-CM. In contrast to the ordinary formulation of the DTSP, in the proposed DTSP-CM, the vehicle is requested to visit each target by specified collecting maneuver to accomplish the mission. The proposed problem formulation is motivated by scenarios with unmanned aerial vehicles where particular maneuvers are necessary for accomplishing the mission, such as object dropping or data collection with sensor sensitive to changes in vehicle heading. We consider existing methods for the DTSP and propose its modifications to use these methods to address a variant of the introduced DTSP-CM, where the collecting maneuvers are constrained to straight line segments.

Incorporation Between AHP and N-TSP for Plant Surveillance Routing with Multiple Constraints

International Nuclear Information System (INIS)

Djoko Hari Nugroho

2002-01-01

This paper observed plant on-line surveillance routing for maintenance management with multiple constraints using TSP (Traveling Salesman Problem). In the research N-TSP (nomadic TSP) type was used. In this case, on-line surveillance could be implemented on moving robot. Route for preventive maintenance management was observed sequentially per stage using multiple constraints (a) distance between components, and (b) failure probability of components using AHP (Analytical Hierarchy Process). Simulation was observed utilizing DURESS as a complex system. The simulation result showed that the route with single constraint distance between components represents the sequence of 1 - 6 - 2 - 4 - 3 - 5. Routing for DURESS with multiple constraints using incorporation of AHP and TSP showed that the first priority in the route is flow sensor FB2 with the value of comparation of 0.1042. The next priority is sequentially FB1, FA2, FA1, FA, FB, VB, VA, VA1, VA2, VB1, VB2, pump B, pump A, FR1, FR2, reservoir 2, and reservoir 1. Numerical experiment obtained that the incorporation between AHP and N-TSP has successfully constructed the surveillance routing with multiple constraints. (author)

Fluctuations in the site-disordered traveling salesman problem

Energy Technology Data Exchange (ETDEWEB)

Dean, David S [Laboratoire de Physique Theorique, UMR CNRS 5152, IRSAMC, Universite Paul Sabatier, 118 route de Narbonne, 31062 Toulouse Cedex 04 (France); Lancaster, David [Harrow School of Computer Science, University of Westminster, Harrow HA1 3TP (United Kingdom)

2007-11-16

We extend a previous statistical mechanical treatment of the traveling salesman problem by defining a discrete 'site-disordered' problem in which fluctuations about saddle points can be computed. The results clarify the basis of our original treatment, and illuminate but do not resolve the difficulties of taking the zero-temperature limit to obtain minimal path lengths.

Espacio literario relevante sobre el problema del vendedor viajero (TSP: contenido, clasificación, métodos y campos de inspiración Relevant literary space on travelling salesman problem (TSP: contents, classification, methods and fields of inspiration

Directory of Open Access Journals (Sweden)

Jorge Ivan Pérez Rave

2013-01-01

Full Text Available Se describe y se analiza un espacio literario relevante sobre el Problema del Vendedor Viajero (TSP en términos de contenido, clases de TSP, métodos y campos de inspiración. Los datos empleados provinieron de los trabajos más citados en Scopus sobre el TSP, tanto a través de la historia como en el período 2006-2010. Se encontró que el TSP prevalece en las investigaciones, con enfoques tanto en el problema original como en sus variantes, entre las cuales se identificaron el TSP Múltiple y el TSP Probabilístico. Entre los principales campos de inspiración para resolver el TSP están la evolución biológica y su base genético-molecular, el comportamiento de hormigas reales, la termodinámica, las estrategias sistemáticas para combinar reglas de decisión y la búsqueda de vecindades. Hoy día se tiende a desarrollar métodos híbridos, especialmente integrando enfoques globales con búsquedas locales, y se identifica la necesidad de introducir nuevos campos de inspiración.This paper describes and analyzes, in terms of content, the types of TSP, methods and fields of inspiration - the most relevant "literary space" on TSP. It is built based on the top most cited on the TSP history and the Top 10 cited from 2006 to 2010. The study of TSP still prevails in Research, focusing on the original problem and its variants: Multiple TSP (m-TSP and Probabilistic TSP (PTSP. Evidence shows that there has been progress in the development of TSP solving methods, highlighted by various inspiration fields: biological evolution, behavior of real ants, thermodynamics, systematic strategies for combining decision rules, and neighborhood search. There is a tendency to develop hybrid methods, in particular by integrating global approaches to local search. There is need to introduce new fields of inspiration.

Multi-Objective Ant Colony Optimization Based on the Physarum-Inspired Mathematical Model for Bi-Objective Traveling Salesman Problems.

Directory of Open Access Journals (Sweden)

Zili Zhang

Full Text Available Bi-objective Traveling Salesman Problem (bTSP is an important field in the operations research, its solutions can be widely applied in the real world. Many researches of Multi-objective Ant Colony Optimization (MOACOs have been proposed to solve bTSPs. However, most of MOACOs suffer premature convergence. This paper proposes an optimization strategy for MOACOs by optimizing the initialization of pheromone matrix with the prior knowledge of Physarum-inspired Mathematical Model (PMM. PMM can find the shortest route between two nodes based on the positive feedback mechanism. The optimized algorithms, named as iPM-MOACOs, can enhance the pheromone in the short paths and promote the search ability of ants. A series of experiments are conducted and experimental results show that the proposed strategy can achieve a better compromise solution than the original MOACOs for solving bTSPs.

The traveling salesman problem a computational study

CERN Document Server

Applegate, David L; Chvatal, Vasek; Cook, William J

2006-01-01

This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience.

Trajectory Stability in the Traveling Salesman Problem

Directory of Open Access Journals (Sweden)

Sergio Sánchez

2018-01-01

Full Text Available Two generalizations of the traveling salesman problem in which sites change their position in time are presented. The way the rank of different trajectory lengths changes in time is studied using the rank diversity. We analyze the statistical properties of rank distributions and rank dynamics and give evidence that the shortest and longest trajectories are more predictable and robust to change, that is, more stable.

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

DEFF Research Database (Denmark)

Kallehauge, Brian

2008-01-01

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

Solving Large-Scale TSP Using a Fast Wedging Insertion Partitioning Approach

Directory of Open Access Journals (Sweden)

Zuoyong Xiang

2015-01-01

Full Text Available A new partitioning method, called Wedging Insertion, is proposed for solving large-scale symmetric Traveling Salesman Problem (TSP. The idea of our proposed algorithm is to cut a TSP tour into four segments by nodes’ coordinate (not by rectangle, such as Strip, FRP, and Karp. Each node is located in one of their segments, which excludes four particular nodes, and each segment does not twist with other segments. After the partitioning process, this algorithm utilizes traditional construction method, that is, the insertion method, for each segment to improve the quality of tour, and then connects the starting node and the ending node of each segment to obtain the complete tour. In order to test the performance of our proposed algorithm, we conduct the experiments on various TSPLIB instances. The experimental results show that our proposed algorithm in this paper is more efficient for solving large-scale TSPs. Specifically, our approach is able to obviously reduce the time complexity for running the algorithm; meanwhile, it will lose only about 10% of the algorithm’s performance.

Binary Cockroach Swarm Optimization for Combinatorial Optimization Problem

Directory of Open Access Journals (Sweden)

Ibidun Christiana Obagbuwa

2016-09-01

Full Text Available The Cockroach Swarm Optimization (CSO algorithm is inspired by cockroach social behavior. It is a simple and efficient meta-heuristic algorithm and has been applied to solve global optimization problems successfully. The original CSO algorithm and its variants operate mainly in continuous search space and cannot solve binary-coded optimization problems directly. Many optimization problems have their decision variables in binary. Binary Cockroach Swarm Optimization (BCSO is proposed in this paper to tackle such problems and was evaluated on the popular Traveling Salesman Problem (TSP, which is considered to be an NP-hard Combinatorial Optimization Problem (COP. A transfer function was employed to map a continuous search space CSO to binary search space. The performance of the proposed algorithm was tested firstly on benchmark functions through simulation studies and compared with the performance of existing binary particle swarm optimization and continuous space versions of CSO. The proposed BCSO was adapted to TSP and applied to a set of benchmark instances of symmetric TSP from the TSP library. The results of the proposed Binary Cockroach Swarm Optimization (BCSO algorithm on TSP were compared to other meta-heuristic algorithms.

Quantum elastic net and the traveling salesman problem

International Nuclear Information System (INIS)

Kostenko, B.F.; Pribis, J.; Yur'ev, M.Z.

2009-01-01

Theory of computer calculations strongly depends on the nature of elements the computer is made of. Quantum interference allows one to formulate the Shor factorization algorithm turned out to be more effective than any one written for classical computers. Similarly, quantum wave packet reduction allows one to devise the Grover search algorithm which outperforms any classical one. In the present paper we argue that the quantum incoherent tunneling can be used for elaboration of new algorithms able to solve some NP-hard problems, such as the traveling Salesman Problem, considered to be intractable in the classical theory of computer computations

Exact Solutions to the Double Travelling Salesman Problem with Multiple Stacks

DEFF Research Database (Denmark)

Petersen, Hanne L.; Archetti, Claudia; Speranza, M. Grazia

2010-01-01

In this paper we present mathematical programming formulations and solution approaches for the optimal solution of the Double Travelling Salesman Problem with Multiple Stacks (DTSPMS). A set of orders is given, each one requiring transportation of one item from a customer in a pickup region...

Improvement of algorithm using Kohonen`s self-organizing feature map for the traveling salesman problem; Kohonen jiko soshikika tokucho mappu wo mochiita ukai serusuman mondai kaiho no kairyo

Energy Technology Data Exchange (ETDEWEB)

Fujimura, K.; Tokutaka, H.; Tanaka, H.; Kishida, S. [Tottori Univ., Tottori (Japan); Oshima, Y. [Mita Industrial Co. Ltd., Osaka (Japan)

1996-02-20

Traveling salesman problem (TSP) is one of the combinatorial optimization problems. The solution of this problem is to seek the way of how to visit every city only once within the shortest traveling distance. The solutions of this problem are studied a lot hitherto since they are the index for observing the basic properties of optimization algorithm. The method of Angeniol using the elf-organizing feature map is greatly forceful from the viewpoint of its short calculating time. In this study, regarding the algorithm of Angeniol, the conditions of obtaining the shortest tour length within shorter time are examined. Namely, a half of calculating time is reduced by changing Angeniol method into the method of making the node create after the searches of M cities. Additionally, the calculating time for unchanged tour length is reduced to one fourth by adding an inertia item in accordance with the variation of the number of total nodes. 14 refs., 8 figs.

Motion Planning and Task Assignment for Unmanned Aerial Vehicles Cooperating with Unattended Ground Sensors

Science.gov (United States)

2014-10-24

constraints on its motion. This problem was formalized as the Dubins travelling salesman problem (TSP). In the second phase of the research we have...given constraints on its motion. This problem was formalized as the Dubins travelling salesman problem (TSP). The contributions of the study in the...assumptions were made on the magnitude of the intercity distances. The two algorithms complement each other in terms of their range of applicability

Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain

Science.gov (United States)

Anbuudayasankar, S. P.; Ganesh, K.; Lenny Koh, S. C.; Mohandas, K.

2010-03-01

A reverse logistics problem, motivated by many real-life applications, is examined where bottles/cans in which products are delivered from a processing depot to customers in one period are available for return to the depot in the following period. The picked-up bottles/cans need to be adjusted in the place of delivery load. This problem is termed as simultaneous delivery and pick-up problem with constrained capacity (SDPC). We develop three unified heuristics based on extended branch and bound heuristic, genetic algorithm and simulated annealing to solve SDPC. These heuristics are also designed to solve standard travelling salesman problem (TSP) and TSP with simultaneous delivery and pick-up (TSDP). We tested the heuristics on standard, derived and randomly generated datasets of TSP, TSDP and SDPC and obtained satisfying results with high convergence in reasonable time.

Theoretical analysis of two ACO approaches for the traveling salesman problem

DEFF Research Database (Denmark)

Kötzing, Timo; Neumann, Frank; Röglin, Heiko

2012-01-01

Bioinspired algorithms, such as evolutionary algorithms and ant colony optimization, are widely used for different combinatorial optimization problems. These algorithms rely heavily on the use of randomness and are hard to understand from a theoretical point of view. This paper contributes...... to the theoretical analysis of ant colony optimization and studies this type of algorithm on one of the most prominent combinatorial optimization problems, namely the traveling salesperson problem (TSP). We present a new construction graph and show that it has a stronger local property than one commonly used...... for constructing solutions of the TSP. The rigorous runtime analysis for two ant colony optimization algorithms, based on these two construction procedures, shows that they lead to good approximation in expected polynomial time on random instances. Furthermore, we point out in which situations our algorithms get...

Method for the traveling salesman problem by controlling two parameters of the Hopfield neural network; Parameter seigyogata hop field net ni yoru junkai salesman mondai no kaiho

Energy Technology Data Exchange (ETDEWEB)

Setsu, N.; Murakami, K.; Ohori, T.; Watanabe, K. [Hokkaido Institute of Technology, Sapporo (Japan)

1996-01-20

For solving the traveling salesman problem (TSP) by using a continuous value outputting neural net (NN), an investigation was given on the accuracy of solution and the possibility on traveling routes by using the penalty coefficient and temperature as the parameters for energy functions. The parameter range to obtain high-quality traveling routes was shown by a numerical experiment. The experimental result revealed that, when the penalty coefficient `r` is large, the traveling route possibility tends to become higher, but the route length increases, and when the `r` is small, the traveling route possibility becomes lower, but the route length decreases, also in the continuous value outputting NN as in the two-value outputting NN. Noticing this fact, and in order to improve the traveling route possibility as well as the solution quality, a method was proposed to expand the penalty control method which was proposed previously by the authors on the two-value outputting NN, into the continuous value outputting NN. In addition, a proposal was also made on a method to derive an optimal temperature efficiently by using the golden section method. It was found that the relative error has been reduced by 48% on the average as compared with that in the conventional method in which the temperature is fixed. 6 refs., 5 figs.

Parallel patterns determination in solving cyclic flow shop problem with setups

Directory of Open Access Journals (Sweden)

Bożejko Wojciech

2017-06-01

Full Text Available The subject of this work is the new idea of blocks for the cyclic flow shop problem with setup times, using multiple patterns with different sizes determined for each machine constituting optimal schedule of cities for the traveling salesman problem (TSP. We propose to take advantage of the Intel Xeon Phi parallel computing environment during so-called ’blocks’ determination basing on patterns, in effect significantly improving the quality of obtained results.

Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows

Science.gov (United States)

Yurtkuran, Alkın

2014-01-01

The traveling salesman problem with time windows (TSPTW) is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA) that uses a new constraint handling technique to minimize the travel cost in TSPTW problems. The EMA utilizes the attraction-repulsion mechanism between charged particles in a multidimensional space for global optimization. This paper investigates the problem-specific constraint handling capability of the EMA framework using a new variable bounding strategy, in which real-coded particle's boundary constraints associated with the corresponding time windows of customers, is introduced and combined with the penalty approach to eliminate infeasibilities regarding time window violations. The performance of the proposed algorithm and the effectiveness of the constraint handling technique have been studied extensively, comparing it to that of state-of-the-art metaheuristics using several sets of benchmark problems reported in the literature. The results of the numerical experiments show that the EMA generates feasible and near-optimal results within shorter computational times compared to the test algorithms. PMID:24723834

Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows

Directory of Open Access Journals (Sweden)

Alkın Yurtkuran

2014-01-01

Full Text Available The traveling salesman problem with time windows (TSPTW is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA that uses a new constraint handling technique to minimize the travel cost in TSPTW problems. The EMA utilizes the attraction-repulsion mechanism between charged particles in a multidimensional space for global optimization. This paper investigates the problem-specific constraint handling capability of the EMA framework using a new variable bounding strategy, in which real-coded particle’s boundary constraints associated with the corresponding time windows of customers, is introduced and combined with the penalty approach to eliminate infeasibilities regarding time window violations. The performance of the proposed algorithm and the effectiveness of the constraint handling technique have been studied extensively, comparing it to that of state-of-the-art metaheuristics using several sets of benchmark problems reported in the literature. The results of the numerical experiments show that the EMA generates feasible and near-optimal results within shorter computational times compared to the test algorithms.

Comparison of neural networks for solving the travelling salesman problem

NARCIS (Netherlands)

Maire, La B.F.J.; Mladenov, V.M.

2012-01-01

The TSP deals with finding a shortest path through a number of cities. This seemingly simple problem is hard to solve because of the amount of possible solutions. Which is why methods that give a good suboptimal solution in a reasonable time are generally used. In this paper three methods were

A Data-Guided Lexisearch Algorithm for the Asymmetric Traveling Salesman Problem

Directory of Open Access Journals (Sweden)

Zakir Hussain Ahmed

2011-01-01

Full Text Available A simple lexisearch algorithm that uses path representation method for the asymmetric traveling salesman problem (ATSP is proposed, along with an illustrative example, to obtain exact optimal solution to the problem. Then a data-guided lexisearch algorithm is presented. First, the cost matrix of the problem is transposed depending on the variance of rows and columns, and then the simple lexisearch algorithm is applied. It is shown that this minor preprocessing of the data before the simple lexisearch algorithm is applied improves the computational time substantially. The efficiency of our algorithms to the problem against two existing algorithms has been examined for some TSPLIB and random instances of various sizes. The results show remarkably better performance of our algorithms, especially our data-guided algorithm.

Perancangan Aplikasi Penjadwalan Traveling Salesman Problem dengan Algoritma Genetika

Directory of Open Access Journals (Sweden)

Hendy Tannady

2012-12-01

Full Text Available Supply chain management plays an important role in enhancing the efficiency and effectiveness of manufacturing industry business process. In this research, the problem is taken from a sales division in a company in determining the optimal sequence when delivering goods into nine cities. This problem is oftenreferred as travelling salesman problem. This problem is considered important since the optimal sequence can cut off operational cost. Creating an artificial intelligence for the company in determining the location and the optimal sequence of delivering goods is the main objective of this research. A genetic algorithm is utilized to determine the location and the optimal sequence. While for processing the data and concluding the result, researcher designed a Java-based application that provides the capability of automatic computing. The result of this computation is a sequence of locations with a fitness number for each. The best fitness number for the sequence location will be used for the final result and the conclusion to answer the company’s problem.

OPTIMAL TOUR CONSTRUCTIONS FOR MULTIPLE MOBILE ROBOTS

Directory of Open Access Journals (Sweden)

AMIR A. SHAFIE

2011-04-01

Full Text Available The attempts to use mobile robots in a variety of environments are currently being limited by their navigational capability, thus a set of robots must be configured for one specific environment. The problem of navigating an environment is the fundamental problem in mobile robotic where various methods including exact and heuristic approaches have been proposed to solve the problem. This paper proposed a solution to the navigation problem via the use of multiple robots to explore the environment employing heuristic methods to navigate the environment using a variant of a Traveling Salesman Problem (TSP known as Multiple Traveling Salesman Problem (M-TSP.

An Enhanced Genetic Algorithm for the Generalized Traveling Salesman Problem

Directory of Open Access Journals (Sweden)

H. Jafarzadeh

2017-12-01

Full Text Available The generalized traveling salesman problem (GTSP deals with finding the minimum-cost tour in a clustered set of cities. In this problem, the traveler is interested in finding the best path that goes through all clusters. As this problem is NP-hard, implementing a metaheuristic algorithm to solve the large scale problems is inevitable. The performance of these algorithms can be intensively promoted by other heuristic algorithms. In this study, a search method is developed that improves the quality of the solutions and competition time considerably in comparison with Genetic Algorithm. In the proposed algorithm, the genetic algorithms with the Nearest Neighbor Search (NNS are combined and a heuristic mutation operator is applied. According to the experimental results on a set of standard test problems with symmetric distances, the proposed algorithm finds the best solutions in most cases with the least computational time. The proposed algorithm is highly competitive with the published until now algorithms in both solution quality and running time.

Certification of an optimal TSP tour through 85,900 cities

DEFF Research Database (Denmark)

Applegate, David L.; Bixby, Robert E.; Chvatal, Vasek

2009-01-01

We describe a computer code and data that together certify the optimality of a solution to the 85,900-city traveling salesman problem pla85900, the largest instance in the TSPLIB collection of challenge problems......We describe a computer code and data that together certify the optimality of a solution to the 85,900-city traveling salesman problem pla85900, the largest instance in the TSPLIB collection of challenge problems...

ON THE USE OF LYTLE’S ALGORITHM FOR SOLVING TRAVELING SALESMAN PROBLEM AT DEVELOPING SUBURBAN ROUTE

Directory of Open Access Journals (Sweden)

S. Kantsedal

2012-01-01

Full Text Available Lytle’s algorithm is described as proposed for an accurate solution of the salesman Problem. Statistical characteristics of solution duration with lytle’s algorithm of some problems and of their modifications are specified. On the basis of the results obtained the limits for the algorithm practical specification in the preparation of the route network are given.

Heuristic Solution Approaches to the Double TSP with Multiple Stacks

DEFF Research Database (Denmark)

Petersen, Hanne Løhmann

This paper introduces the Double Travelling Salesman Problem with Multiple Stacks and presents a three different metaheuristic approaches to its solution. The Double Travelling Salesman Problem with Multiple Stacks is concerned with finding the shortest route performing pickups and deliveries in ...... are developed for the problem and used with each of the heuristics. Finally some computational results are given along with lower bounds on the objective value....

Heuristic Solution Approaches to the Double TSP with Multiple Stacks

DEFF Research Database (Denmark)

Petersen, Hanne Løhmann

2006-01-01

This paper introduces the Double Travelling Salesman Problem with Multiple Stacks and presents a three different metaheuristic approaches to its solution. The Double Travelling Salesman Problem with Multiple Stacks is concerned with finding the shortest route performing pickups and deliveries in ...... are developed for the problem and used with each of the heuristics. Finally some computational results are given along with lower bounds on the objective value....

The Expanded Invasive Weed Optimization Metaheuristic for Solving Continuous and Discrete Optimization Problems

Directory of Open Access Journals (Sweden)

Henryk Josiński

2014-01-01

Full Text Available This paper introduces an expanded version of the Invasive Weed Optimization algorithm (exIWO distinguished by the hybrid strategy of the search space exploration proposed by the authors. The algorithm is evaluated by solving three well-known optimization problems: minimization of numerical functions, feature selection, and the Mona Lisa TSP Challenge as one of the instances of the traveling salesman problem. The achieved results are compared with analogous outcomes produced by other optimization methods reported in the literature.

A Computational Analysis of the Traveling Salesman and Cutting Stock Problems

Directory of Open Access Journals (Sweden)

Gracia María D.

2015-01-01

Full Text Available The aim of this article is to perform a computational study to analyze the impact of formulations, and the solution strategy on the algorithmic performance of two classical optimization problems: the traveling salesman problem and the cutting stock problem. In order to assess the algorithmic performance on both problems three dependent variables were used: solution quality, computing time and number of iterations. The results are useful for choosing the solution approach to each specific problem. In the STSP, the results demonstrate that the multistage decision formulation is better than the conventional formulations, by solving 90.47% of the instances compared with MTZ (76.19% and DFJ (14.28%. The results of the CSP demonstrate that the cutting patterns formulation is better than the standard formulation with symmetry breaking inequalities, when the objective function is to minimize the loss of trim when cutting the rolls.

ON SAMPLING BASED METHODS FOR THE DUBINS TRAVELING SALESMAN PROBLEM WITH NEIGHBORHOODS

Directory of Open Access Journals (Sweden)

Petr Váňa

2015-12-01

Full Text Available In this paper, we address the problem of path planning to visit a set of regions by Dubins vehicle, which is also known as the Dubins Traveling Salesman Problem Neighborhoods (DTSPN. We propose a modification of the existing sampling-based approach to determine increasing number of samples per goal region and thus improve the solution quality if a more computational time is available. The proposed modification of the sampling-based algorithm has been compared with performance of existing approaches for the DTSPN and results of the quality of the found solutions and the required computational time are presented in the paper.

Double evolutsional artificial bee colony algorithm for multiple traveling salesman problem

Directory of Open Access Journals (Sweden)

Xue Ming Hao

2016-01-01

Full Text Available The double evolutional artificial bee colony algorithm (DEABC is proposed for solving the single depot multiple traveling salesman problem (MTSP. The proposed DEABC algorithm, which takes advantage of the strength of the upgraded operators, is characterized by its guidance in exploitation search and diversity in exploration search. The double evolutional process for exploitation search is composed of two phases of half stochastic optimal search, and the diversity generating operator for exploration search is used for solutions which cannot be improved after limited times. The computational results demonstrated the superiority of our algorithm over previous state-of-the-art methods.

A Solution Approach from an Analytic Model to Heuristic Algorithm for Special Case of Vehicle Routing Problem with Stochastic Demands

Directory of Open Access Journals (Sweden)

2009-03-01

Full Text Available We define a special case for the vehicle routing problem with stochastic demands (SC-VRPSD where customer demands are normally distributed. We propose a new linear model for computing the expected length of a tour in SC-VRPSD. The proposed model is based on the integration of the “Traveling Salesman Problem” (TSP and the Assignment Problem. For large-scale problems, we also use an Iterated Local Search (ILS algorithm in order to reach an effective solution.

In Pursuit of the Traveling Salesman Mathematics at the Limits of Computation

CERN Document Server

Cook, William J

2011-01-01

What is the shortest possible route for a traveling salesman seeking to visit each city on a list exactly once and return to his city of origin? It sounds simple enough, yet the traveling salesman problem is one of the most intensely studied puzzles in applied mathematics--and it has defied solution to this day. In this book, William Cook takes readers on a mathematical excursion, picking up the salesman's trail in the 1800s when Irish mathematician W. R. Hamilton first defined the problem, and venturing to the furthest limits of today's state-of-the-art attempts to solve it. Cook examines

PENYELESAIAN MULTI TRAVELING SALESMAN PROBLEM DENGAN ALGORITMA GENETIKA

Directory of Open Access Journals (Sweden)

NI KADEK MAYULIANA

2017-01-01

Full Text Available Genetic algorithm is a part of heuristic algorithm which can be applied to solve various computational problems. This work is directed to study the performance of the genetic algorithm (GA to solve Multi Traveling Salesmen Problem (multi-TSP. GA is simulated to determine the shortest route for 5 to 10 salesmen who travelled 10 to 30 cities. The performance of this algorithm is studied based on the minimum distance and the processing time required for 10 repetitions for each of cities-salesmen combination. The result showed that the minimum distance and the processing time of the GA increase consistently whenever the number of cities to visit increase. In addition, different number of sales who visited certain number of cities proved significantly affect the running time of GA, but did not prove significantly affect the minimum distance.

TUTORIALS ON AFRICAN BUFFALO OPTIMIZATION FOR SOLVING THE TRAVELLING SALESMAN PROBLEM

Directory of Open Access Journals (Sweden)

Odili J.B

2017-03-01

Full Text Available The African Buffalo Optimization is a newly designed metaheuristic optimization algorithm inspired by the migration of African buffalos from place to place across the vast African forests, deserts and savannah in search of food. Being a new algorithm, several researchers from different parts of the research world have indicated huge interest in understanding the working of the novel algorithm. This paper presents a practical demonstration of the workings of the African Buffalo Optimization in solving the popular travelling salesman problem. It is our belief that this tutorial paper will be helpful in further introducing the new algorithm and making it user-friendly.

Using 2-Opt based evolution strategy for travelling salesman problem

Directory of Open Access Journals (Sweden)

Kenan Karagul

2016-03-01

Full Text Available Harmony search algorithm that matches the (µ+1 evolution strategy, is a heuristic method simulated by the process of music improvisation. In this paper, a harmony search algorithm is directly used for the travelling salesman problem. Instead of conventional selection operators such as roulette wheel, the transformation of real number values of harmony search algorithm to order index of vertex representation and improvement of solutions are obtained by using the 2-Opt local search algorithm. Then, the obtained algorithm is tested on two different parameter groups of TSPLIB. The proposed method is compared with classical 2-Opt which randomly started at each step and best known solutions of test instances from TSPLIB. It is seen that the proposed algorithm offers valuable solutions.

Algorithms for the on-line travelling salesman

NARCIS (Netherlands)

Ausiello, G.; Feuerstein, E.; Leonardi, S.; Stougie, L.; Talamo, M.

1999-01-01

In this paper the problem of efficiently serving a sequence of requests presented in an on-line fashion located at points of a metric space is considered. We call this problem the On-Line Travelling Salesman Problem (OLTSP). It has a variety of relevant applications in logistics and robotics. We

Solution for a bipartite Euclidean traveling-salesman problem in one dimension

Science.gov (United States)

Caracciolo, Sergio; Di Gioacchino, Andrea; Gherardi, Marco; Malatesta, Enrico M.

2018-05-01

The traveling-salesman problem is one of the most studied combinatorial optimization problems, because of the simplicity in its statement and the difficulty in its solution. We characterize the optimal cycle for every convex and increasing cost function when the points are thrown independently and with an identical probability distribution in a compact interval. We compute the average optimal cost for every number of points when the distance function is the square of the Euclidean distance. We also show that the average optimal cost is not a self-averaging quantity by explicitly computing the variance of its distribution in the thermodynamic limit. Moreover, we prove that the cost of the optimal cycle is not smaller than twice the cost of the optimal assignment of the same set of points. Interestingly, this bound is saturated in the thermodynamic limit.

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

Science.gov (United States)

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.

Evaluation of Edge Assembly Crossover for Hybrid GA

OpenAIRE

Yoshihara, Ikuo; Sato, Masakazu; Nguyen, Hung Dinh; Yamanori, Kunihito

2004-01-01

Abstract ###Traveling Salesman Problem (TSP) is one of the representative combinatorial optimization prob-###lems. The promising approach to solve TSP is Genetic Algorithm (GA). GA has global search ability, ###and heuristic is used in order to compensate local search ability, because GA is lack of local search abil-###ity. Hybrid (GA (HGA) combined with heuristics can be expected to obtain high quality solutions.We ###employ Lin-Kernighan heuristics which is very effective in TSP. Because cr...

Optimization of Multiple Traveling Salesman Problem Based on Simulated Annealing Genetic Algorithm

Directory of Open Access Journals (Sweden)

Xu Mingji

2017-01-01

Full Text Available It is very effective to solve the multi variable optimization problem by using hierarchical genetic algorithm. This thesis analyzes both advantages and disadvantages of hierarchical genetic algorithm and puts forward an improved simulated annealing genetic algorithm. The new algorithm is applied to solve the multiple traveling salesman problem, which can improve the performance of the solution. First, it improves the design of chromosomes hierarchical structure in terms of redundant hierarchical algorithm, and it suggests a suffix design of chromosomes; Second, concerning to some premature problems of genetic algorithm, it proposes a self-identify crossover operator and mutation; Third, when it comes to the problem of weak ability of local search of genetic algorithm, it stretches the fitness by mixing genetic algorithm with simulated annealing algorithm. Forth, it emulates the problems of N traveling salesmen and M cities so as to verify its feasibility. The simulation and calculation shows that this improved algorithm can be quickly converged to a best global solution, which means the algorithm is encouraging in practical uses.

The Multi-commodity One-to-one Pickup-and-delivery Traveling Salesman Problem with Path Duration Limits

DEFF Research Database (Denmark)

Plum, Christian Edinger Munk; Pisinger, David; Salazar-González, Juan-José

2012-01-01

The design of container shipping networks is an important real world problem, with assets and operational costs in billions of dollars. To guide the optimal deployment of the ships, a single vessel roundtrip is considered by minimizing operational costs and flowing the best paying cargo under...... commercial constraints. Inspiration for formulation and solution method is taken from the rich research done within pickup and delivery problems. The problem, the multicommodity one-toone pickup and delivery traveling salesman problem with path duration limits is, to the best of out knowledge, considered...... for the first time. An arc flow and a path flow model are presented. A Branch and Cut and Price solution method is proposed and implemented....

Global approach to the n-dimensional traveling salesman problem: Application to the optimization of crystallographic data collection

Energy Technology Data Exchange (ETDEWEB)

Weinrach, J.B.; Bennett, D.W.

1987-12-01

An algorithm for the optimization of data collection time has been written and a subsequent computer program tested for diffractometer systems. The program, which utilizes a global statistical approach to the traveling salesman problem, yields reasonable solutions in a relatively short time. The algorithm has been successful in treating very large data sets (up to 4000 points) in three dimensions with subsequent time savings of ca 30%.

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

Science.gov (United States)

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.

COOBBO: A Novel Opposition-Based Soft Computing Algorithm for TSP Problems

Directory of Open Access Journals (Sweden)

Qingzheng Xu

2014-12-01

Full Text Available In this paper, we propose a novel definition of opposite path. Its core feature is that the sequence of candidate paths and the distances between adjacent nodes in the tour are considered simultaneously. In a sense, the candidate path and its corresponding opposite path have the same (or similar at least distance to the optimal path in the current population. Based on an accepted framework for employing opposition-based learning, Oppositional Biogeography-Based Optimization using the Current Optimum, called COOBBO algorithm, is introduced to solve traveling salesman problems. We demonstrate its performance on eight benchmark problems and compare it with other optimization algorithms. Simulation results illustrate that the excellent performance of our proposed algorithm is attributed to the distinct definition of opposite path. In addition, its great strength lies in exploitation for enhancing the solution accuracy, not exploration for improving the population diversity. Finally, by comparing different version of COOBBO, another conclusion is that each successful opposition-based soft computing algorithm needs to adjust and remain a good balance between backward adjacent node and forward adjacent node.

Particle Swarm Optimization applied to combinatorial problem aiming the fuel recharge problem solution in a nuclear reactor

International Nuclear Information System (INIS)

Meneses, Anderson Alvarenga de Moura; Schirru, Roberto

2005-01-01

This work focuses on the usage the Artificial Intelligence technique Particle Swarm Optimization (PSO) to optimize the fuel recharge at a nuclear reactor. This is a combinatorial problem, in which the search of the best feasible solution is done by minimizing a specific objective function. However, in this first moment it is possible to compare the fuel recharge problem with the Traveling Salesman Problem (TSP), since both of them are combinatorial, with one advantage: the evaluation of the TSP objective function is much more simple. Thus, the proposed methods have been applied to two TSPs: Oliver 30 and Rykel 48. In 1995, KENNEDY and EBERHART presented the PSO technique to optimize non-linear continued functions. Recently some PSO models for discrete search spaces have been developed for combinatorial optimization. Although all of them having different formulation from the ones presented here. In this paper, we use the PSO theory associated with to the Random Keys (RK)model, used in some optimizations with Genetic Algorithms. The Particle Swarm Optimization with Random Keys (PSORK) results from this association, which combines PSO and RK. The adaptations and changings in the PSO aim to allow the usage of the PSO at the nuclear fuel recharge. This work shows the PSORK being applied to the proposed combinatorial problem and the obtained results. (author)

An Exact Method for the Double TSP with Multiple Stacks

DEFF Research Database (Denmark)

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

2010-01-01

The double travelling salesman problem with multiple stacks (DTSPMS) is a pickup and delivery problem in which all pickups must be completed before any deliveries can be made. The problem originates from a real-life application where a 40 foot container (configured as 3 columns of 11 rows) is used...

An Exact Method for the Double TSP with Multiple Stacks

DEFF Research Database (Denmark)

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

The double travelling salesman problem with multiple stacks (DTSPMS) is a pickup and delivery problem in which all pickups must be completed before any deliveries can be made. The problem originates from a real-life application where a 40 foot container (configured as 3 columns of 11 rows) is used...

Performance analysis of the partial use of a local optimization operator on the genetic algorithm for the Travelling Salesman Problem

Directory of Open Access Journals (Sweden)

Milan Djordjevic

2012-01-01

Full Text Available Background: The Travelling Salesman Problem is an NP-hard problem in combinatorial optimization with a number of practical implications. There are many heuristic algorithms and exact methods for solving the problem. Objectives: In this paper we study the influence of hybridization of a genetic algorithm with a local optimizer on solving instances of the Travelling Salesman Problem. Methods/ Approach: Our algorithm uses hybridization that occurs at various percentages of generations of a genetic algorithm. Moreover, we have also studied at which generations to apply the hybridization and hence applied it at random generations, at the initial generations, and at the last ones. Results: We tested our algorithm on instances with sizes ranging from 76 to 439 cities. On the one hand, the less frequent application of hybridization decreased the average running time of the algorithm from 14.62 sec to 2.78 sec at 100% and 10% hybridization respectively, while on the other hand, the quality of the solution on average deteriorated only from 0.21% till 1.40% worse than the optimal solution. Conclusions: In the paper we have shown that even a small hybridization substantially improves the quality of the result. Moreover, the hybridization in fact does not deteriorate the running time too much. Finally, our experiments show that the best results are obtained when hybridization occurs in the last generations of the genetic algorithm.

Algorithms for Collecting Data from Cooperating Sensor Motes using Unmanned Vehicles

DEFF Research Database (Denmark)

Sundar, Kaarthik; Sujit, PB; Rathinam, Sivakumar

2015-01-01

of communication costs involved in transmitting the data from the motes to the cluster-heads and the travel costs of the UV is a minimum. This problem is a generalization of a single Traveling Salesman Problem (TSP) and is NP-Hard. This article presents a rounding algorithm and heuristics to solve the problem...

The Design of a Polymorphous Cognitive Agent Architecture (PCAA)

Science.gov (United States)

2008-05-01

this scenario is very similar to the classic Traveling Salesman Problem (TSP). However, this problem has a strong cognitive aspect , and the goal was to...strong cognitive aspect , and the goal was to focus on this aspect rather than to find a possibly quicker non-cognitive solution. Additionally

A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case

Directory of Open Access Journals (Sweden)

Chun-Wei Tsai

2014-01-01

Full Text Available This paper presents a simple but efficient algorithm for reducing the computation time of genetic algorithm (GA and its variants. The proposed algorithm is motivated by the observation that genes common to all the individuals of a GA have a high probability of surviving the evolution and ending up being part of the final solution; as such, they can be saved away to eliminate the redundant computations at the later generations of a GA. To evaluate the performance of the proposed algorithm, we use it not only to solve the traveling salesman problem but also to provide an extensive analysis on the impact it may have on the quality of the end result. Our experimental results indicate that the proposed algorithm can significantly reduce the computation time of GA and GA-based algorithms while limiting the degradation of the quality of the end result to a very small percentage compared to traditional GA.

Applying Data Clustering Feature to Speed Up Ant Colony Optimization

Directory of Open Access Journals (Sweden)

Chao-Yang Pang

2014-01-01

Full Text Available Ant colony optimization (ACO is often used to solve optimization problems, such as traveling salesman problem (TSP. When it is applied to TSP, its runtime is proportional to the squared size of problem N so as to look less efficient. The following statistical feature is observed during the authors’ long-term gene data analysis using ACO: when the data size N becomes big, local clustering appears frequently. That is, some data cluster tightly in a small area and form a class, and the correlation between different classes is weak. And this feature makes the idea of divide and rule feasible for the estimate of solution of TSP. In this paper an improved ACO algorithm is presented, which firstly divided all data into local clusters and calculated small TSP routes and then assembled a big TSP route with them. Simulation shows that the presented method improves the running speed of ACO by 200 factors under the condition that data set holds feature of local clustering.

A new approach to the use of genetic algorithms to solve the pressurized water reactor's fuel management optimization problem

Energy Technology Data Exchange (ETDEWEB)

Chapot, Jorge Luiz C. [ELETRONUCLEAR, Rio de Janeiro, RJ (Brazil); Carvalho Da Silva, Fernando; Schirru, Roberto [COPPE/UFRJ-Nuclear, Rio de Janeiro, RJ (Brazil)

1999-05-01

A Genetic Algorithm (GA) based system, coupling the computer codes GENESIS 5.0 and ANC through the interface ALGER has been developed aiming at pressurized water reactor's (PWR) fuel management optimization. An innovative codification, the List Model (LM), has been incorporated into the system. LM avoids the use of heuristic crossover operators and only generates valid nonrepetitive loading patterns in the reactor core. The LM has been used to solve the Traveling Salesman Problem (TSP). The results got for a benchmark problem were very satisfactory, in terms of precision and computational costs. The GENESIS/ALGER/ANC system has been successfully tested in optimization studies for Angra 1 power plant reloads.

New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks: new formulation and branch-and-cut algorithm

NARCIS (Netherlands)

Sampaio Oliveira, A.H.; Urrutia, S.

2017-01-01

In this paper, we consider the pickup and delivery traveling salesman problem with multiple stacks in which a single vehicle must serve a set of customer requests defined by a pair of pickup and delivery destinations of an item. The vehicle contains a fixed number of stacks, where each item is

GEZGİN SATICI PROBLEMİNİ ÇÖZMEK İÇİN YENİ BİR HİBRİD SEZGİSEL ALGORİTMA

Directory of Open Access Journals (Sweden)

Gözde KIZILATEŞ

2015-05-01

Full Text Available The Traveling Salesman Problem (TS P is an important and well known combinatoriyal opti- mization problem. The goal of the problem is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. Although the definition of the travelling salesman problem is easy, it belongs to NP-Hard class. In this paper, a new hybrid heurist ic algorithm based on Nearest Neighbour (NN and Greedy heur istic algorithms is proposed for s olving the TSP. This proposed hybrid heuristic algorithm is compared with NN and Greedy heuristi cs. The experimental results show that the proposed algorithm is efficient

TSP tour domination and Hamilton cycle decompositions of regular digraphs

DEFF Research Database (Denmark)

Gutin, Gregory; Yeo, Anders

2001-01-01

by the relative performance compared to the optimal value. In particular, we show that for the asymmetric traveling salesman problem, there is a deterministic polynomial time algorithm that finds a tour that is at least as good as the median of all tour values. Our algorithm uses an unpublished theorem...

Particle Swarm Optimization applied to combinatorial problem aiming the fuel recharge problem solution in a nuclear reactor; Particle swarm optimization aplicado ao problema combinatorio com vistas a solucao do problema de recarga em um reator nuclear

Energy Technology Data Exchange (ETDEWEB)

Meneses, Anderson Alvarenga de Moura; Schirru, Roberto [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia. Programa de Engenharia Nuclear]. E-mail: ameneses@con.ufrj.br; schirru@lmp.ufrj.br

2005-07-01

This work focuses on the usage the Artificial Intelligence technique Particle Swarm Optimization (PSO) to optimize the fuel recharge at a nuclear reactor. This is a combinatorial problem, in which the search of the best feasible solution is done by minimizing a specific objective function. However, in this first moment it is possible to compare the fuel recharge problem with the Traveling Salesman Problem (TSP), since both of them are combinatorial, with one advantage: the evaluation of the TSP objective function is much more simple. Thus, the proposed methods have been applied to two TSPs: Oliver 30 and Rykel 48. In 1995, KENNEDY and EBERHART presented the PSO technique to optimize non-linear continued functions. Recently some PSO models for discrete search spaces have been developed for combinatorial optimization. Although all of them having different formulation from the ones presented here. In this paper, we use the PSO theory associated with to the Random Keys (RK)model, used in some optimizations with Genetic Algorithms. The Particle Swarm Optimization with Random Keys (PSORK) results from this association, which combines PSO and RK. The adaptations and changings in the PSO aim to allow the usage of the PSO at the nuclear fuel recharge. This work shows the PSORK being applied to the proposed combinatorial problem and the obtained results. (author)

Aplicación de un algoritmo ACO al problema de taller de flujo de permutación con tiempos de preparación dependientes de la secuencia y minimización de makespan An ant colony algorithm for the permutation flowshop with sequence dependent setup times and makespan minimization

Directory of Open Access Journals (Sweden)

Eduardo Salazar Hornig

2011-08-01

Full Text Available En este trabajo se estudió el problema de secuenciamiento de trabajos en el taller de flujo de permutación con tiempos de preparación dependientes de la secuencia y minimización de makespan. Para ello se propuso un algoritmo de optimización mediante colonia de hormigas (ACO, llevando el problema original a una estructura semejante al problema del vendedor viajero TSP (Traveling Salesman Problem asimétrico, utilizado para su evaluación problemas propuestos en la literatura y se compara con una adaptación de la heurística NEH (Nawaz-Enscore-Ham. Posteriormente se aplica una búsqueda en vecindad a la solución obtenida tanto por ACO como NEH.This paper studied the permutation flowshop with sequence dependent setup times and makespan minimization. An ant colony algorithm which turns the original problem into an asymmetric TSP (Traveling Salesman Problem structure is presented, and applied to problems proposed in the literature and is compared with an adaptation of the NEH heuristic. Subsequently a neighborhood search was applied to the solution obtained by the ACO algorithm and the NEH heuristic.

Two-phase framework for optimal multi-target Lambert rendezvous

OpenAIRE

Bang, Jun; Ahn, Jaemyung

2017-01-01

This paper proposes a two-phase framework to solve an optimal multi-target Lambert rendezvous problem. The first phase solves a series of single-target rendezvous problems for all departure-arrival object pairs to generate the elementary solutions, which provides candidate rendezvous trajectories (elementary solutions). The second phase formulates a variant of traveling salesman problem (TSP) using the elementary solutions prepared in the first phase and determines the best rendezvous sequenc...

Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem.

Directory of Open Access Journals (Sweden)

Carlos Contreras-Bolton

Full Text Available Genetic algorithms are powerful search methods inspired by Darwinian evolution. To date, they have been applied to the solution of many optimization problems because of the easy use of their properties and their robustness in finding good solutions to difficult problems. The good operation of genetic algorithms is due in part to its two main variation operators, namely, crossover and mutation operators. Typically, in the literature, we find the use of a single crossover and mutation operator. However, there are studies that have shown that using multi-operators produces synergy and that the operators are mutually complementary. Using multi-operators is not a simple task because which operators to use and how to combine them must be determined, which in itself is an optimization problem. In this paper, it is proposed that the task of exploring the different combinations of the crossover and mutation operators can be carried out by evolutionary computing. The crossover and mutation operators used are those typically used for solving the traveling salesman problem. The process of searching for good combinations was effective, yielding appropriate and synergic combinations of the crossover and mutation operators. The numerical results show that the use of the combination of operators obtained by evolutionary computing is better than the use of a single operator and the use of multi-operators combined in the standard way. The results were also better than those of the last operators reported in the literature.

On the Core of Multiple Longest Traveling Salesman Games

NARCIS (Netherlands)

Estevez Fernandez, M.A.; Borm, P.E.M.; Hamers, H.J.M.

2003-01-01

In this paper we introduce multiple longest traveling salesman (MLTS) games. An MLTS game arises from a network in which a salesman has to visit each node (player) precisely once, except its home location, in an order that maximizes the total reward.First it is shown that the value of a coalition of

On the Optimization and Parallelizing Little Algorithm for Solving the Traveling Salesman Problem

Directory of Open Access Journals (Sweden)

V. V. Vasilchikov

2016-01-01

Full Text Available The paper describes some ways to accelerate solving the NP-complete Traveling Salesman Problem. The classic Little algorithm belonging to the category of ”branch and bound methods” can solve it both for directed and undirected graphs. However, for undirected graphs its operation can be accelerated by eliminating the consideration of branches examined earlier. The paper proposes changes to be made in the key operations of the algorithm to speed up its execution. It also describes the results of an experiment that demonstrated a significant acceleration of solving the problem by using an advanced algorithm. Another way to speed up the work is to parallelize the algorithm. For problems of this kind it is difficult to break the task into a sufficient number of subtasks having comparable complexity. Their parallelism arises dynamically during the execution. For such problems, it seems reasonable to use parallel-recursive algorithms. In our case the use of the library RPM ParLib developed by the author was a good choice. It allows us to develop effective applications for parallel computing on a local network using any .NET-compatible programming language. We used C# to develop the programs. Parallel applications were developed as for basic and modified algorithms, the comparing of their speed was made. Experiments were performed for the graphs with the number of vertexes up to 45 and with the number of network computers up to 16. We also investigated the acceleration that can be achieved by parallelizing the basic Little algorithm for directed graphs. The results of these experiments are also presented in the paper. 

Genetic algorithm based on virus theory of evolution for traveling salesman problem; Virus shinkaron ni motozuku identeki algorithm no junkai salesman mondai eno oyo

Energy Technology Data Exchange (ETDEWEB)

Kubota, N. [Osaka Inst. of Technology, Osaka (Japan); Fukuda, T. [Nagoya University, Nagoya (Japan)

1998-05-31

This paper deals with virus evolutionary genetic algorithm. The genetic algorithms (GAs) have been demonstrated its effectiveness in optimization problems in these days. In general, the GAs simulate the survival of fittest by natural selection and the heredity of the Darwin`s theory of evolution. However, some types of evolutionary hypotheses such as neutral theory of molecular evolution, Imanishi`s evolutionary theory, serial symbiosis theory, and virus theory of evolution, have been proposed in addition to the Darwinism. Virus theory of evolution is based on the view that the virus transduction is a key mechanism for transporting segments of DNA across species. This paper proposes genetic algorithm based on the virus theory of evolution (VE-GA), which has two types of populations: host population and virus population. The VE-GA is composed of genetic operators and virus operators such as reverse transcription and incorporation. The reverse transcription operator transcribes virus genes on the chromosome of host individual and the incorporation operator creates new genotype of virus from host individual. These operators by virus population make it possible to transmit segment of DNA between individuals in the host population. Therefore, the VE-GA realizes not only vertical but also horizontal propagation of genetic information. Further, the VE-GA is applied to the traveling salesman problem in order to show the effectiveness. 20 refs., 10 figs., 3 tabs.

Ant Systems for a Dynamic TSP - Ants Caught in a Traffic Jam

NARCIS (Netherlands)

Eyckelhof, C.J.; Dorigo, M.; Caro Di, G.; Snoek, M.; Sampels, M.

2002-01-01

In this paper we present a new Ants System approach to a dynamic Travelling Salesman Problem. Here the travel times between the cities are subject to change. To handle this dynamism several ways of adapting the pheromone matrix both locally and globally are considered. We show that the strategy of

FACES WITH LARGE DIAMETER ON THE SYMMETRICAL TRAVELING SALESMAN POLYTOPE

NARCIS (Netherlands)

SIERKSMA, G; TIJSSEN, GA

This paper deals with the symmetric traveling salesman polytope and contains three main theorems. The first one gives a new characterization of (non)adjacency. Based on this characterization a new upper bound for the diameter of the symmetric traveling salesman polytope (conjectured to be 2 by M.

Quantum particle swarm approaches applied to combinatorial problems

Energy Technology Data Exchange (ETDEWEB)

Nicolau, Andressa dos S.; Schirru, Roberto; Lima, Alan M.M. de, E-mail: andressa@lmp.ufrj.br [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil). Programa de Engenharia Nuclear

2017-07-01

Quantum Particle Swarm Optimization (QPSO) is a global convergence algorithm that combines the classical PSO philosophy and quantum mechanics to improve performance of PSO. Different from PSO it only has the 'measurement' of the position equation for all particles. The process of 'measurement' in quantum mechanics, obey classic laws while the particle itself follows the quantum rules. QPSO works like PSO in search ability but has fewer parameters control. In order to improve the QPSO performance, some strategies have been proposed in the literature. Weighted QPSO (WQPSO) is a version of QPSO, where weight parameter is insert in the calculation of the balance between the global and local searching of the algorithm. It has been shown to perform well in finding the optimal solutions for many optimization problems. In this article random confinement was introduced in WQPSO. The WQPSO with random confinement was tested in two combinatorial problems. First, we execute the model on Travelling Salesman Problem (TSP) to find the parameters' values resulting in good solutions in general. Finally, the model was tested on Nuclear Reactor Reload Problem, and the performance was compared with QPSO standard. (author)

Quantum particle swarm approaches applied to combinatorial problems

International Nuclear Information System (INIS)

Nicolau, Andressa dos S.; Schirru, Roberto; Lima, Alan M.M. de

2017-01-01

Quantum Particle Swarm Optimization (QPSO) is a global convergence algorithm that combines the classical PSO philosophy and quantum mechanics to improve performance of PSO. Different from PSO it only has the 'measurement' of the position equation for all particles. The process of 'measurement' in quantum mechanics, obey classic laws while the particle itself follows the quantum rules. QPSO works like PSO in search ability but has fewer parameters control. In order to improve the QPSO performance, some strategies have been proposed in the literature. Weighted QPSO (WQPSO) is a version of QPSO, where weight parameter is insert in the calculation of the balance between the global and local searching of the algorithm. It has been shown to perform well in finding the optimal solutions for many optimization problems. In this article random confinement was introduced in WQPSO. The WQPSO with random confinement was tested in two combinatorial problems. First, we execute the model on Travelling Salesman Problem (TSP) to find the parameters' values resulting in good solutions in general. Finally, the model was tested on Nuclear Reactor Reload Problem, and the performance was compared with QPSO standard. (author)

Exact Solutions to the Double TSP with Multiple Stacks

DEFF Research Database (Denmark)

Petersen, Hanne Løhmann; Archetti, Claudia; Madsen, Oli B.G.

In the Double Travelling Salesman Problem with Multiple Stacks (DTSPMS) a set of orders is given, each one requiring transportation of one item from a customer in a pickup region to a customer in a delivery region. The vehicle available for the transportation in each region carries a container....... We present different modelling approaches to solving the DTSPMS to optimality and use the solutions obtained to evaluate the quality of previously obtained heuristic solutions....

Fuzzy Multi-objective Linear Programming Approach

Directory of Open Access Journals (Sweden)

Amna Rehmat

2007-07-01

Full Text Available Traveling salesman problem (TSP is one of the challenging real-life problems, attracting researchers of many fields including Artificial Intelligence, Operations Research, and Algorithm Design and Analysis. The problem has been well studied till now under different headings and has been solved with different approaches including genetic algorithms and linear programming. Conventional linear programming is designed to deal with crisp parameters, but information about real life systems is often available in the form of vague descriptions. Fuzzy methods are designed to handle vague terms, and are most suited to finding optimal solutions to problems with vague parameters. Fuzzy multi-objective linear programming, an amalgamation of fuzzy logic and multi-objective linear programming, deals with flexible aspiration levels or goals and fuzzy constraints with acceptable deviations. In this paper, a methodology, for solving a TSP with imprecise parameters, is deployed using fuzzy multi-objective linear programming. An example of TSP with multiple objectives and vague parameters is discussed.

TETRAHEURÍSTICA SISTÉMICA (THS PARA EL TSP SYSTEMIC TETRAHEURISTIC FOR THE TSP

Directory of Open Access Journals (Sweden)

Jorge Iván Pérez Rave

2010-08-01

Full Text Available Este artículo presenta un novedoso método, basado en elementos del pensamiento sistémico, para solucionar instancias del problema del vendedor viajero (TSP, el cual es comparado en términos de eficacia y eficiencia con "nearest neighbour", "cheapest insertion", "two-wwy exchange improvement" y "branch and bound". El primer apartado introduce la optimización combinatoria, el segundo ofrece un marco de referencia, el tercero presenta la metodología empleada, el cuarto apartado presenta el desarrollo de la tetraheurística sistémica, seguido del análisis de varianza y de rangos de Duncan para los factores: método y cantidad de ciudades; este apartado finaliza con el análisis del comportamiento de la proporción de "fracasos" del algoritmo propuesto a medida que aumenta la complejidad del TSP. Como resultado se obtiene un método para resolver instancias del TSP, conformado por tres heurísticas misionales: 1."vecino más cercano", 2. "sacrificio cortoplacista" y 3. "traslado LIFO", y una de apoyo llamada "búsqueda derecha 4P4". El diseño de la heurística denominada "sacrificio cortoplacista" es inspirado en el análisis sistémico del "vecino más cercano", al cual se le identifica el arquetipo de "soluciones rápidas que fallan", con aplicación a decisiones cotidianas. La tetraheurística sistémica se destaca, respecto a las demás, en solución arrojada y en tiempo computacional consumido, especialmente cuando incrementa la complejidad del TSP.This paper presents a novel method to solve instances of the TSP. This method is comparable in effectiveness and efficiency with "nearest neighbour", "cheapest insertion", "two-way exchange improvement" and "branch and bound". The first section provides a literature review of the combinatorial optimization, the second provides a reference frame, the third the methodology used and the fourth contains, inter alia, system thinking, AxB factorial design and management tool CAP-DO. The fourth

20 CFR 404.1008 - Agent-driver or commission-driver, full-time life insurance salesman, home worker, or traveling...

Science.gov (United States)

2010-04-01

... commission-driver, full-time life insurance salesman, home worker, or traveling or city salesman. (a) General... 20 Employees' Benefits 2 2010-04-01 2010-04-01 false Agent-driver or commission-driver, full-time life insurance salesman, home worker, or traveling or city salesman. 404.1008 Section 404.1008...

[The recent advances of HAM/TSP research].

Science.gov (United States)

Osame, M

1999-12-01

The ninth international conference on HTLVs and related disorders was held on April 5-9, 1999 at Kagoshima, Japan under the conference chairperson, Dr. Mitsuhiro Osame. In this meeting, world-wide epidemiological data on HTLV-I carriers, ATL patients, and HAM/TSP patients were summarized as shown in the table. The total number of them was supposed to be more than 2.2 millions, 1,200, and 3,000, respectively. To elucidate the localization of HTLV-I proviral DNA directly, double staining using immunohistochemistry and PCR in situ hybridization in the spinal cords of HAM/TSP patients were performed. HTLV-I proviral DNA was localized only to OPD 4-positive cells (Matsuoka et al, 1998). The localization of HTLV-I messenger RNA was the same (Moritoyo et al, 1996). A novel technique to detect HTLV-I tax protein was also developed. In HAM/TSP patients, 0.04-1.16% of the CSF cells and 0.02-0.54% of PBMCs were positive for HTLV-I tax protein (Moritoyo et al, 1999). It was also hypothesized that HLA alleles control HTLV-I proviral load and thus influence susceptibility to HAM/TSP. Two hundred and thirty-two cases of HAM/TSP were compared with 201 randomly selected HTLV-I seropositive asymptomatic blood donors. It was shown that, after infection with HTLV-I, the class I allele HLA-A*02 halves the odds of HAM/TSP (p doubled the odds of HAM/TSP in the absence of the protective effect of HLA-A*02 (Jeffery and Usuku et al, 1999).

Minimum Time Path Planning for Robotic Manipulator in Drilling/ Spot Welding Tasks

Directory of Open Access Journals (Sweden)

Qiang Zhang

2016-04-01

Full Text Available In this paper, a minimum time path planning strategy is proposed for multi points manufacturing problems in drilling/spot welding tasks. By optimizing the travelling schedule of the set points and the detailed transfer path between points, the minimum time manufacturing task is realized under fully utilizing the dynamic performance of robotic manipulator. According to the start-stop movement in drilling/spot welding task, the path planning problem can be converted into a traveling salesman problem (TSP and a series of point to point minimum time transfer path planning problems. Cubic Hermite interpolation polynomial is used to parameterize the transfer path and then the path parameters are optimized to obtain minimum point to point transfer time. A new TSP with minimum time index is constructed by using point-point transfer time as the TSP parameter. The classical genetic algorithm (GA is applied to obtain the optimal travelling schedule. Several minimum time drilling tasks of a 3-DOF robotic manipulator are used as examples to demonstrate the effectiveness of the proposed approach.

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

NARCIS (Netherlands)

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

2004-01-01

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

An entropy-based improved k-top scoring pairs (TSP) method for ...

African Journals Online (AJOL)

An entropy-based improved k-top scoring pairs (TSP) (Ik-TSP) method was presented in this study for the classification and prediction of human cancers based on gene-expression data. We compared Ik-TSP classifiers with 5 different machine learning methods and the k-TSP method based on 3 different feature selection ...

5 CFR 1601.12 - Investing future deposits in the TSP Funds.

Science.gov (United States)

2010-01-01

... 5 Administrative Personnel 3 2010-01-01 2010-01-01 false Investing future deposits in the TSP... PARTICIPANTS' CHOICES OF TSP FUNDS Investing Future Deposits § 1601.12 Investing future deposits in the TSP.... All participants may elect to invest all or any portion of their deposits in any of the TSP Funds. [70...

NEW HIGH STRENGTH AND FASTER DRILLING TSP DIAMOND CUTTERS

Energy Technology Data Exchange (ETDEWEB)

Robert Radtke

2006-01-31

The manufacture of thermally stable diamond (TSP) cutters for drill bits used in petroleum drilling requires the brazing of two dissimilar materials--TSP diamond and tungsten carbide. The ENDURUS{trademark} thermally stable diamond cutter developed by Technology International, Inc. exhibits (1) high attachment (shear) strength, exceeding 345 MPa (50,000 psi), (2) TSP diamond impact strength increased by 36%, (3) prevents TSP fracture when drilling hard rock, and (4) maintains a sharp edge when drilling hard and abrasive rock. A novel microwave brazing (MWB) method for joining dissimilar materials has been developed. A conventional braze filler metal is combined with microwave heating which minimizes thermal residual stress between materials with dissimilar coefficients of thermal expansion. The process results in preferential heating of the lower thermal expansion diamond material, thus providing the ability to match the thermal expansion of the dissimilar material pair. Methods for brazing with both conventional and exothermic braze filler metals have been developed. Finite element modeling (FEM) assisted in the fabrication of TSP cutters controllable thermal residual stress and high shear attachment strength. Further, a unique cutter design for absorbing shock, the densification of otherwise porous TSP diamond for increased mechanical strength, and diamond ion implantation for increased diamond fracture resistance resulted in successful drill bit tests.

Advances in bio-inspired computing for combinatorial optimization problems

CERN Document Server

Pintea, Camelia-Mihaela

2013-01-01

Advances in Bio-inspired Combinatorial Optimization Problems' illustrates several recent bio-inspired efficient algorithms for solving NP-hard problems.Theoretical bio-inspired concepts and models, in particular for agents, ants and virtual robots are described. Large-scale optimization problems, for example: the Generalized Traveling Salesman Problem and the Railway Traveling Salesman Problem, are solved and their results are discussed.Some of the main concepts and models described in this book are: inner rule to guide ant search - a recent model in ant optimization, heterogeneous sensitive a

Parallel optimization algorithm for drone inspection in the building industry

Science.gov (United States)

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.

Scope of Various Random Number Generators in ant System Approach for TSP

Science.gov (United States)

Sen, S. K.; Shaykhian, Gholam Ali

2007-01-01

Experimented on heuristic, based on an ant system approach for traveling salesman problem, are several quasi- and pseudo-random number generators. This experiment is to explore if any particular generator is most desirable. Such an experiment on large samples has the potential to rank the performance of the generators for the foregoing heuristic. This is mainly to seek an answer to the controversial issue "which generator is the best in terms of quality of the result (accuracy) as well as cost of producing the result (time/computational complexity) in a probabilistic/statistical sense."

Establishing the tolerability and performance of tamarind seed polysaccharide (TSP in treating dry eye syndrome: results of a clinical study

Directory of Open Access Journals (Sweden)

Valente Cristiana

2007-03-01

Full Text Available Abstract Background One of the problems arising from available preparations for dry eye syndrome is the limited residence time of products on the ocular surface. In this paper, we look at an innovative new treatment for dry eye, tamarind seed polysaccharide (TSP. TSP possesses mucomimetic, mucoadhesive and pseudoplastic properties. The 'mucin-like' molecular structure of TSP is similar to corneal and conjunctival mucin 1 (MUC1, a transmembrane glycoprotein thought to play an essential role in protecting and wetting the corneal surface and may explain its increased retention on the eye surface. Methods The activity of TSP and hyaluronic acid (HA in the treatment of dry eye syndrome was compared in an open-label, randomised, single-centre clinical study. Thirty patients were randomised to receive three or more applications per day of either TSP 0.5%, TSP 1% or HA 0.2% (Hyalistil™ over a period of 90 days. The primary objective of tolerability was assessed by visual analogue scale (VAS, scoring of specific symptoms and the incidence of adverse events. Secondary objectives included improvement in stability of the precorneal tear film, subjective symptoms and corneal and conjunctival staining. Results TSP 0.5% and 1% were comparable to HA 0.2% with regard to both primary and secondary objective parameters. TSP 1% showed benefits over HA 0.2% for the subjective symptoms; trouble blinking, ocular burning and foreign body sensation. Conclusion This study suggests that TSP 0.5% and 1% offer at least equivalent relief to HA 0.2% for dry eye syndrome. All treatments demonstrated optimal tolerability and are suitable for frequent use in the therapy of dry eye. TSP 1% produced promising results in terms of improvements in certain patient symptoms and suggests benefits of the TSP formulation. This study paves the way for a larger study to further establish the performance and safety of TSP compared with HA and highlights the need to expand this therapeutic

An integrated TSP-GA with EOL cost model for selecting the best EOL option

OpenAIRE

Zakri Ghazalli; Atsuo Murata

2011-01-01

This paper presents our research works on integrating design for disassembly with cost model for end-of-life (EOL) product. This paper has two objectives. The first objective is to optimize disassembly sequence of the EOL product. We integrate a traveling salesman problem approach with genetic algorithm in finding the optimal disassembly sequence for disassembling the EOL product. Based on this optimal sequence, the second objective is to identify the best EOL option. We employ EOL profits an...

A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model

International Nuclear Information System (INIS)

Zhang, Zili; Gao, Chao; Liu, Yuxin; Qian, Tao

2014-01-01

Ant colony optimization (ACO) algorithms often fall into the local optimal solution and have lower search efficiency for solving the travelling salesman problem (TSP). According to these shortcomings, this paper proposes a universal optimization strategy for updating the pheromone matrix in the ACO algorithms. The new optimization strategy takes advantages of the unique feature of critical paths reserved in the process of evolving adaptive networks of the Physarum-inspired mathematical model (PMM). The optimized algorithms, denoted as PMACO algorithms, can enhance the amount of pheromone in the critical paths and promote the exploitation of the optimal solution. Experimental results in synthetic and real networks show that the PMACO algorithms are more efficient and robust than the traditional ACO algorithms, which are adaptable to solve the TSP with single or multiple objectives. Meanwhile, we further analyse the influence of parameters on the performance of the PMACO algorithms. Based on these analyses, the best values of these parameters are worked out for the TSP. (paper)

A review of tsp as one of the transportation security aspects of nuclear materials

International Nuclear Information System (INIS)

Wiryono

2013-01-01

A review has done for the Transportation Safety Plan (TSP) as one of the aspects of safety in the transport of nuclear materials. The review is necessary to harmonize national regulations with international practice. International practice of using TSP as one of the security requirements in addition to the Radiation Protection Program as a requirement of safety in the transport of nuclear materials. TSP is intended to ensure sound implementation of the transport of nuclear materials. TSP evaluation process can be done with a prescriptive approach, performance, and combinations. TSP contains information about administrative requirements, delivery security and response planning. TSP can be used to ensure the security of the implementation of the transport of nuclear materials effectively and efficiently. BAPETEN should require the applicant to submit the TSP as one document security requirements prior approval transporting nuclear materials. BAPETEN need to define the approach to the formulation and evaluation of TSP. BAPETEN need to set up an evaluation and inspection procedures for the implementation of TSP. (author)

Cytotoxicity of TSP in 3D Agarose Gel Cultured Cell.

Directory of Open Access Journals (Sweden)

Song-I Chun

Full Text Available A reference reagent, 3-(trimethylsilyl propionic-2, 2, 3, 3-d4 acid sodium (TSP, has been used frequently in nuclear magnetic resonance (NMR and magnetic resonance spectroscopy (MRS as an internal reference to identify cell and tissue metabolites, and determine chemical and protein structures. This reference material has been exploited for the quantitative and dynamic analyses of metabolite spectra acquired from cells. The aim of this study was to evaluate the cytotoxicity of TSP on three-dimensionally, agarose gel, cultured cells.A human osteosarcoma cell line (MG-63 was selected, and cells were three dimensionally cultured for two weeks in an agarose gel. The culture system contained a mixture of conventional culture medium and various concentrations (0, 1, 3, 5, 7, 10, 20 30 mM of TSP. A DNA quantification assay was conducted to assess cell proliferation using Quant-iT PicoGreen dsDNA reagent and kit, and cell viability was determined using a LIVE/DEAD Viability/Cytotoxicity kit. Both examinations were performed simultaneously at 1, 3, 7 and 14 days from cell seeding.In this study, the cytotoxicity of TSP in the 3D culture of MG-63 cells was evaluated by quantifying DNA (cell proliferation and cell viability. High concentrations of TSP (from 10 to 30 mM reduced both cell proliferation and viability (to 30% of the control after one week of exposure, but no such effects were found using low concentrations of TSP (0-10 mM.This study shows that low concentrations of TSP in 3D cell culture medium can be used for quantitative NMR or MRS examinations for up to two weeks post exposure.

Enhanced protective efficacy of a chimeric form of the schistosomiasis vaccine antigen Sm-TSP-2.

Directory of Open Access Journals (Sweden)

Mark S Pearson

Full Text Available The large extracellular loop of the Schistosoma mansoni tetraspanin, Sm-TSP-2, when fused to a thioredoxin partner and formulated with Freund's adjuvants, has been shown to be an efficacious vaccine against murine schistosomiasis. Moreover, Sm-TSP-2 is uniquely recognised by IgG(1 and IgG(3 from putatively resistant individuals resident in S. mansoni endemic areas in Brazil. In the present study, we expressed Sm-TSP-2 at high yield and in soluble form in E. coli without the need for a solubility enhancing fusion partner. We also expressed in E. coli a chimera called Sm-TSP-2/5B, which consisted of Sm-TSP-2 fused to the immunogenic 5B region of the hookworm aspartic protease and vaccine antigen, Na-APR-1. Sm-TSP-2 formulated with alum/CpG showed significant reductions in adult worm and liver egg burdens in two separate murine schistosomiasis challenge studies. Sm-TSP-2/5B afforded significantly greater protection than Sm-TSP-2 alone when both antigens were formulated with alum/CpG. The enhanced protection obtained with the chimeric fusion protein was associated with increased production of anti-Sm-TSP-2 antibodies and IL-4, IL-10 and IFN-γ from spleen cells of vaccinated animals. Sera from 666 individuals from Brazil who were infected with S. mansoni were screened for potentially deleterious IgE responses to Sm-TSP-2. Anti-Sm-TSP-2 IgE to this protein was not detected (also shown previously for Na-APR-1, suggesting that the chimeric antigen Sm-TSP-2/5B could be used to safely and effectively vaccinate people in areas where schistosomes and hookworms are endemic.

The Pyramidal Capacitated Vehicle Routing Problem

DEFF Research Database (Denmark)

Lysgaard, Jens

This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the Pyramidal Traveling Salesman Problem (PTSP). A pyramidal...

The pyramidal capacitated vehicle routing problem

DEFF Research Database (Denmark)

Lysgaard, Jens

2010-01-01

This paper introduces the pyramidal capacitated vehicle routing problem (PCVRP) as a restricted version of the capacitated vehicle routing problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the pyramidal traveling salesman problem (PTSP). A pyramidal...

Hamiltonian cycle problem and Markov chains

CERN Document Server

Borkar, Vivek S; Filar, Jerzy A; Nguyen, Giang T

2014-01-01

This book summarizes a line of research that maps certain classical problems of discrete mathematics and operations research - such as the Hamiltonian cycle and the Travelling Salesman problems - into convex domains where continuum analysis can be carried out.

Fractionation of applied 32P labeled TSP in calcareous soils

International Nuclear Information System (INIS)

Asfary, A.F.; Al-Merey, R.; Al-Hameish, M.

2005-01-01

Calcareous dark brown red soil (calcixerollic xerochrept) from northern Syria was used in a pot experiment to study the fate of triple super phosphate fertilizer (TSP) with and without a crop (Local durum wheat (Triticum turgidum L. group durum (Desf)) c v. Bohouth). The soil received 17μg P/g soil of 32 P labeled TSP, and samples were collected from soils and plants at successive dates. Soil inorganic P was ≅94% of total soil P, with only 50-80% being soluble. Calcium phosphate compounds were the dominant fraction (≤68%) of the soluble inorganic soil P followed by occluded iron phosphate (≤48%) and all other fractions were ≤9%. Isotopic measurements showed that ≅ 50% of fertilizer P was nonexchangeable within 2 days, and TSP values in each fraction of soil inorganic P fluctuated in relatively similar proportions to the concentrations of fractions in soil. Available P (soil and TSP) in cropped soil was more than that in the uncropped soil, and plants had no effect on the distribution of P from fertilizer amongst the different P fractions. (author)

A United Framework for Solving Multiagent Task Assignment Problems

National Research Council Canada - National Science Library

Cousin, Kevin

2007-01-01

.... The CMTS descriptor represents a wide range of classical and modern problems, such as job shop scheduling, the traveling salesman problem, vehicle routing, and cooperative multi-object tracking...

A Bibliography of the Personal Software Process (PSP) and the Team Software Process (TSP)

Science.gov (United States)

2009-10-01

tspsymposium/ Padula , Alan. ―TSP-Agile Showdown: The Gun Smoke Clears.‖ Proceedings of the TSP Sympo- sium (September 2009). http://www.sei.cmu.edu...www.sei.cmu.edu/tspsymposium/ Padula , Alan. ―TSP—Agile Showdown.‖ Proceedings of the TSP Symposium (September 2008). http://www.sei.cmu.edu

Temperature Switch PCR (TSP: Robust assay design for reliable amplification and genotyping of SNPs

Directory of Open Access Journals (Sweden)

Mather Diane E

2009-12-01

Full Text Available Abstract Background Many research and diagnostic applications rely upon the assay of individual single nucleotide polymorphisms (SNPs. Thus, methods to improve the speed and efficiency for single-marker SNP genotyping are highly desirable. Here, we describe the method of temperature-switch PCR (TSP, a biphasic four-primer PCR system with a universal primer design that permits amplification of the target locus in the first phase of thermal cycling before switching to the detection of the alleles. TSP can simplify assay design for a range of commonly used single-marker SNP genotyping methods, and reduce the requirement for individual assay optimization and operator expertise in the deployment of SNP assays. Results We demonstrate the utility of TSP for the rapid construction of robust and convenient endpoint SNP genotyping assays based on allele-specific PCR and high resolution melt analysis by generating a total of 11,232 data points. The TSP assays were performed under standardised reaction conditions, requiring minimal optimization of individual assays. High genotyping accuracy was verified by 100% concordance of TSP genotypes in a blinded study with an independent genotyping method. Conclusion Theoretically, TSP can be directly incorporated into the design of assays for most current single-marker SNP genotyping methods. TSP provides several technological advances for single-marker SNP genotyping including simplified assay design and development, increased assay specificity and genotyping accuracy, and opportunities for assay automation. By reducing the requirement for operator expertise, TSP provides opportunities to deploy a wider range of single-marker SNP genotyping methods in the laboratory. TSP has broad applications and can be deployed in any animal and plant species.

The threonine protease activity of testes-specific protease 50 (TSP50 is essential for its function in cell proliferation.

Directory of Open Access Journals (Sweden)

Yu-Yin Li

Full Text Available BACKGROUND: Testes-specific protease 50 (TSP50, a newly discovered threonine enzyme, has similar amino acid sequences and enzymatic structures to those of many serine proteases. It may be an oncogene. TSP50 is up-regulated in breast cancer epithelial cells, and ectopic expression of TSP50 in TSP50-deficient Chinese hamster ovary (CHO cells has been found to promote cell proliferation. However, the mechanisms by which TSP50 exerts its growth-promoting effects are not yet fully understood. METHODOLOGY/PRINCIPAL FINDINGS: To delineate whether the threonine protease activity of TSP50 is essential to its function in cell proliferation, we constructed and characterized a mutant TSP50, called TSP50 T310A, which was identified as a protease-dead mutant of TSP50. By a series of proliferation analyses, colony formation assays and apoptosis analyses, we showed that T310A mutation significantly depresses TSP50-induced cell proliferation in vitro. Next, the CHO stable cell line expressing either wild-type or T310A mutant TSP50 was injected subcutaneously into nude mice. We found that the T310A mutation could abolish the tumorigenicity of TSP50 in vivo. A mechanism investigation revealed that the T310A mutation prevented interaction between TSP50 and the NF-κBIκBα complex, which is necessary for TSP50 to perform its function in cell proliferation. CONCLUSION: Our data highlight the importance of threonine 310, the most critical protease catalytic site in TSP50, to TSP50-induced cell proliferation and tumor formation.

Arthur Miller's Death of a Salesman

OpenAIRE

Apolinário, Valdemar dos Passos

2001-01-01

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro de Comunicação e Expressão. Programa de Pós-Graduação em Letras/Inglês e Literatura Correspondente Investiga como as questões político-sociais atingiram as personagens de Arthur Miller na peça Death of a Salesman, contribuindo para moldar suas personalidades e determinando o seu destino. Mostra que, para Arthur Miller, Benjamin Franklin foi a principal fonte de inspiração no seu retrato das preocupações políticas, da c...

Autonomous Data Collection Using a Self-Organizing Map.

Science.gov (United States)

Faigl, Jan; Hollinger, Geoffrey A

2018-05-01

The self-organizing map (SOM) is an unsupervised learning technique providing a transformation of a high-dimensional input space into a lower dimensional output space. In this paper, we utilize the SOM for the traveling salesman problem (TSP) to develop a solution to autonomous data collection. Autonomous data collection requires gathering data from predeployed sensors by moving within a limited communication radius. We propose a new growing SOM that adapts the number of neurons during learning, which also allows our approach to apply in cases where some sensors can be ignored due to a lower priority. Based on a comparison with available combinatorial heuristic algorithms for relevant variants of the TSP, the proposed approach demonstrates improved results, while also being less computationally demanding. Moreover, the proposed learning procedure can be extended to cases where particular sensors have varying communication radii, and it can also be extended to multivehicle planning.

Pumping characteristics of sputter ion pump (SIP) and titanium sublimation pump (TSP) combination

International Nuclear Information System (INIS)

Ratnakala, K.C.; Patel, R.J.; Bhavsar, S.T.; Pandiyar, M.L.; Ramamurthi, S.S.

1995-01-01

For achieving hydrocarbon free, clean ultra high vacuum, SIP-TSP combination is one of the ideal choice for pumping. For the SRS facility in Centre for Advanced Technology (CAT), we are utilising this combination, enmass. For this purpose, two modules of these combination set-ups are assembled, one with the TSP as an integral part of SIP and the other, with TSP as a separate pump mounted on the top of SIP. The pump bodies were vacuum degassed at 700 degC at 10 -5 mbar for 3 hrs. An ultimate vacuum of 3 x 10 -11 mbar was achieved, after a bake-out at 250 degC for 4 hrs, followed by continuous SIP pumping for 48 hrs, with two TSP flashing at approximately 10 hrs interval. The pump-down patterns as well as the pressure-rise patterns are studied. (author). 2 refs., 5 figs

41 CFR 102-117.285 - What are my choices if a TSP's performance is not satisfactory?

Science.gov (United States)

2010-07-01

... 41 Public Contracts and Property Management 3 2010-07-01 2010-07-01 false What are my choices if a TSP's performance is not satisfactory? 102-117.285 Section 102-117.285 Public Contracts and Property... are my choices if a TSP's performance is not satisfactory? You may choose to place a TSP in temporary...

Extraction and Characterization of Tamarind (Tamarind indica L. Seed Polysaccharides (TSP from Three Difference Sources

Directory of Open Access Journals (Sweden)

Khanittha Chawananorasest

2016-06-01

Full Text Available Tamarind seed polysaccharide (TSP, a natural polysaccharide extracted from tamarind seeds is used in the pharmaceutical, textile and food industries as a mucoadhesive polymer. This work aimed to extract TSP from tamarind seeds from three sources with two methods and characterized its physical and chemical properties. Kernel powder of tamarind seeds was slurried into a clear solution, set aside overnight and then centrifuged at 6000 rpm for 20 min to separate all foreign matter. The supernatant was separated and poured into excess 95% ethanol with continuous stirring. The precipitate obtained was collected and dried in the oven and then the dried TSP polymer was stored in a desiccator. The dried TSP was analyzed by 1H-NMR, FT-IR and XRD. The results showed TSP from tamarind seeds taken from paddy farmland (A, a waste from the export tamarind juice industry (B and the export tamarind powder industry(C gave yields of 31.55%, 26.95% and 17.30%, respectively, using method 1 and 11.15%, 53.65% and 54.65%, with method 2, respectively, but method 2 gave purer TSP than method 1. The FT-IR spectra displayed peaks at 3351.95 cm−1, 2920.76 cm−1, 1018.85 cm−1 and 555.16 cm−1. The 1H-NMR showed polysaccharide peaks between δ 3.50–4.20 ppm and XRD diagrams indicated their amorphous nature. Future works will focus on the quantitative analysis, biological activity and possible use of TSP as a drug delivery system.

Targeting Neutrophil Protease-Mediated Degradation of Tsp-1 to Induce Metastatic Dormancy

Science.gov (United States)

2017-10-01

AWARD NUMBER: W81XWH-16-1-0615 TITLE: Targeting Neutrophil Protease-Mediated Degradation of Tsp-1 to Induce Metastatic Dormancy PRINCIPAL...29 Sep 2017 4. TITLE AND SUBTITLE 5a. CONTRACT NUMBER Targeting Neutrophil Protease-Mediated Degradation of Tsp-1 to Induce Metastatic Dormancy...infection or cigarette smoke enhanced pulmonary metastasis from breast cancer in humans and mice. Similarly, autoimmune arthritis, characterized by

41 CFR 102-117.255 - What actions may I take if the TSP's performance is not satisfactory?

Science.gov (United States)

2010-07-01

... 41 Public Contracts and Property Management 3 2010-07-01 2010-07-01 false What actions may I take if the TSP's performance is not satisfactory? 102-117.255 Section 102-117.255 Public Contracts and... may I take if the TSP's performance is not satisfactory? If the TSP's performance is not satisfactory...

An integrated TSP-GA with EOL cost model for selecting the best EOL option

Directory of Open Access Journals (Sweden)

Zakri Ghazalli

2011-10-01

Full Text Available This paper presents our research works on integrating design for disassembly with cost model for end-of-life (EOL product. This paper has two objectives. The first objective is to optimize disassembly sequence of the EOL product. We integrate a traveling salesman problem approach with genetic algorithm in finding the optimal disassembly sequence for disassembling the EOL product. Based on this optimal sequence, the second objective is to identify the best EOL option. We employ EOL profits and net present value of parts and subassemblies of the EOL product to determine the best EOL option of components and parts of the EOL product. The predicted results showed that the developed cost model has reached a good correspondence with the established methods.

Metaheurísticas híbridas para resolução do problema do caixeiro viajante com coleta de prêmios Hybrid metaheuristics for solve the prize collecting traveling salesman problem

Directory of Open Access Journals (Sweden)

Antonio Augusto Chaves

2007-08-01

Full Text Available O Problema do Caixeiro Viajante com Coleta de Prêmios (PCVCP pode ser associado a um caixeiro que coleta um prêmio em cada cidade visitada e paga uma penalidade para cada cidade não visitada, com um custo de deslocamento entre as cidades. O problema encontra-se em minimizar o somatório dos custos da viagem e penalidades, enquanto inclui na sua rota um número suficiente de cidades que lhe permita coletar um prêmio mínimo preestabelecido. Este trabalho contribui com o desenvolvimento de metaheurísticas híbridas para o PCVCP, baseadas em GRASP e métodos de busca em vizinhança variável (VNS/VND para solucionar aproximadamente o PCVCP. De forma a validar as soluções obtidas, propõe-se uma formulação matemática a ser resolvida por um solver comercial, objetivando encontrar a solução ótima para o problema, sendo este solver aplicado a problemas de pequeno porte. Resultados computacionais demonstram a eficiência da abordagem híbrida proposta, tanto em relação à qualidade da solução final obtida quanto em relação ao tempo de execução.The Prize Collecting Traveling Salesman Problem (PCTSP can be associated to a salesman who collects a prize in each city visited and pays a penalty for each city not visited, with travel costs among the cities. The objective is to minimize the sum of the travel costs and penalties, including in the tour enough number of cities that allow collecting a minimum prize. This paper contributes with the development of a hybrid metaheuristic to PCTSP, based on GRASP and search methods in variable neighborhood (VNS/VND to solve PCTSP approximately. In order to validate the obtained solutions, we proposed a mathematical formulation to be solved by a commercial solver to find the best solution to the problem, being this solver applied to small problems. Computational results demonstrate the efficiency of the proposed method, as much in relation to the quality of the obtained final solution as in relation

The motor evoked potential in AIDS and HAM/TSP: state of the evidence.

Science.gov (United States)

Leon-Sarmiento, Fidias E; Elfakhani, Mohamed; Boutros, Nash N

2009-12-01

We aimed to better understand the involvement of the corticospinal tract, assessed by non-invasive transcranial stimulation, in order to determine the actual involvement of the motor system in patients with HAM/TSP and AIDS. An exhaustive MEDLINE search for the period of 1985 to 2008 for all articles cross-referenced for 'HTLV-I, HTLV-II, HTLV-III and HIV, HIV1, HIV2, evoked potential, motor evoked potential, high voltage electrical stimulation, transcranial magnetic stimulation, magnetic stimulation, corticomotor physiology, motor pathways, acquired immunodeficiency syndrome, AIDS, SIDA, tropical spastic paraparesis, HTLV-I-associated myelopathy, HAM, TSP, and HAM/TSP' were selected and analysed. Eighteen papers published in English, Spanish, Portuguese, French and Japanese were identified. Only the central motor conduction time has been analyzed in seropositive patients to human retroviruses. The investigations done on HAM/TSP support the involvement of the pyramidal tract mainly at lower levels, following a centripetal pattern; in AIDS, such an involvement seems to be more prominent at brain levels following a centrifugal pattern. The central motor conduction time abnormalities and involvement differences of the corticospinal tract of patients with AIDS and HAM/TSP dissected here would allow to re-orient early neurorehabilitation measures in these retroviruses-associated neurodegenerative disorders. Besides this, more sophisticated and sensitive non-invasive corticospinal stimulation measures that detect early changes in thalamocortical-basal ganglia circuitry will be needed in both clinically established as well as asymptomatic patients at times when the fastest corticospinal fibers remain uninvolved.

Characteristic of total suspended particulate (TSP) containing Pb and Zn at solid waste landfill

Science.gov (United States)

Budihardjo, M. A.; Noveandra, K.; Samadikun, B. P.

2018-05-01

Activities conducted at municipal solid waste landfills (MSWLs) potentially cause air pollution. Heavy vehicles in MSWLs release various pollutants that can have negative impacts for humans. One noticeable pollutant at MSWLs is airborne total suspended particulate (TSP) which may contain heavy metals such as Pb and Zn and can cause disease when inhaled by humans. In this study, TSP from a landfill in Semarang, Indonesia was collected and characterized to quantify the concentration of Pb and Zn. Meteorological factors (i.e. temperature, humidity and wind velocity) and landfill activities were considered as factors affecting pollutant concentrations. TSP was sampled using dust samplers while the concentrations of heavy metals in TSP were analyzed using an Atomic Absorption Spectrophotometer (AAS). Pb concentration ranged from 0.84 to 1.78 µg/m3 while Zn concentration was from 7.87 to 8.76 µg/m3. The levels of Pb were below the threshold specified by the Indonesian Government. Meanwhile, the threshold for Zn has not yet been determined.

Reachability cuts for the vehicle routing problem with time windows

DEFF Research Database (Denmark)

Lysgaard, Jens

2004-01-01

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

41 CFR 102-117.280 - What aspects of the TSP's performance are important to measure?

Science.gov (United States)

2010-07-01

...'s performance are important to measure? 102-117.280 Section 102-117.280 Public Contracts and... § 102-117.280 What aspects of the TSP's performance are important to measure? Important TSP performance...) Percentage of customer satisfaction reports on carrier performance. ...

Detrusor Arreflexia as an End Stage of Neurogenic Bladder in HAM/TSP?

Directory of Open Access Journals (Sweden)

Matheus Tannus

2011-01-01

Full Text Available The HTLV-1 virus is a known agent involved in the development of HAM/TSP. Past studies have typically observed patients with autonomic dysfunction consisting of detrusor overactivity and detrusor-sphincter dyssynergia, with the occasional observation of underactive detrusor or detrusor arreflexia. However, studies have not yet evaluated the progression of neurogenic bladder over time. In this paper, we describe a HAM/TSP patient with the initial development of overactive detrusor, and subsequent development of detrusor arreflexia. Given a paucity of studies characterizing the effects of HTLV-1 on the autonomic nervous system, particularly aspects controlling continence, this patient's clinical course may represent one type of end point for patients with HAM/TSP and neurogenic bladder. Further cohort or case-series studies, with particular emphasis on the progression of neurogenic bladder, are needed to evaluate the significance of this described case in relation to typical disease progression patterns.

The tumor suppressor PTEN inhibits EGF-induced TSP-1 and TIMP-1 expression in FTC-133 thyroid carcinoma cells

International Nuclear Information System (INIS)

Soula-Rothhut, Mahdhia; Coissard, Cyrille; Sartelet, Herve; Boudot, Cedric; Bellon, Georges; Martiny, Laurent; Rothhut, Bernard

2005-01-01

Thrombospondin-1 (TSP-1) is a multidomain extracellular macromolecule that was first identified as natural modulator of angiogenesis and tumor growth. In the present study, we found that epidermal growth factor (EGF) up-regulated TSP-1 expression in FTC-133 (primary tumor) but not in FTC-238 (lung metastasis) thyroid cancer cells. Both EGF and TSP-1 induced expression of tissue inhibitor of metalloproteinase-1 (TIMP-1) in a mitogen-activated protein kinase/extracellular signal-regulated kinase (MAPK/ERK) and phosphatidylinositol 3-kinase (PI3-kinase)-dependent manner. In FTC-133 cells, EGF induced proliferation in a TSP-1- and TIMP-1-dependent manner. In addition, we determined that re-expression of the tumor suppressor protein PTEN induced cell death, an effect that correlated with a block of Akt kinase phosphorylation. EGF-induced TSP-1 and TIMP-1 promoter activity and protein expression were inhibited in FTC-133 cells stably expressing wtPTEN but not in cells expressing mutant PTEN. Furthermore, we found that wtPTEN inhibited EGF-but not TSP-1-stimulated FTC-133 cell migration and also inhibited invasion induced by EGF and by TSP-1. Finally, an antibody against TSP-1 reversed EGF-stimulated FTC-133 cell invasion as well as the constitutive invasive potential of FTC-238 cells. Overall, our results suggest that PTEN can function as an important modulator of extracellular matrix proteins in thyroid cancer. Therefore, analyzing differential regulation of TSP-1 by growth factors such as EGF can be helpful in understanding thyroid cancer development

Wind tunnel evaluation of Hi-Vol TSP effectiveness data

Data.gov (United States)

U.S. Environmental Protection Agency — Wind tunnel evaluation of EPA's Hi-Vol TSP sampler for sampling effectiveness with regards to aerodynamic particle diameter (5 to 35 microns), wind speed (2, 8, 24...

Carbon Footprint Management of Road Freight Transport under the Carbon Emission Trading Mechanism

Directory of Open Access Journals (Sweden)

Jin Li

2015-01-01

Full Text Available Growing concern over environmental issues has considerably increased the number of regulations and legislation that aim to curb carbon emissions. Carbon emission trading mechanism, which is one of the most effective means, has been broadly adopted by several countries. This paper presents a road truck routing problem under the carbon emission trading mechanism. By introducing a calculation method of carbon emissions that considers the load and speed of the vehicle among other factors, a road truck routing optimizing model under the cap and trade mechanism based on the Travelling Salesman Problem (TSP is described. Compared with the classical TSP model that only considers the economic cost, this model suggests that the truck routing decision under the cap and trade mechanism is more effective in reducing carbon emissions. A modified tabu search algorithm is also proposed to obtain solutions within a reasonable amount of computation time. We theoretically and numerically examine the impacts of carbon trading, carbon cap, and carbon price on truck routing decision, carbon emissions, and total cost. From the results of numerical experiments, we derive interesting observations about how to control the total cost and reduce carbon emissions.

The Orienteering Problem under Uncertainty Stochastic Programming and Robust Optimization compared

NARCIS (Netherlands)

L. Evers (Lanah); K.M. Glorie (Kristiaan); S. van der Ster (Suzanne); A.I. Barros (Ana); H. Monsuur (Herman)

2012-01-01

textabstractThe Orienteering Problem (OP) is a generalization of the well-known traveling salesman problem and has many interesting applications in logistics, tourism and defense. To reflect real-life situations, we focus on an uncertain variant of the OP. Two main approaches that deal with

Data-Acquisition Software for PSP/TSP Wind-Tunnel Cameras

Science.gov (United States)

Amer, Tahani R.; Goad, William K.

2005-01-01

Wing-Viewer is a computer program for acquisition and reduction of image data acquired by any of five different scientificgrade commercial electronic cameras used at Langley Research center to observe wind-tunnel models coated with pressure or temperature-sensitive paints (PSP/TSP). Wing-Viewer provides full automation of camera operation and acquisition of image data, and has limited data-preprocessing capability for quick viewing of the results of PSP/TSP test images. Wing- Viewer satisfies a requirement for a standard interface between all the cameras and a single personal computer: Written by use of Microsoft Visual C++ and the Microsoft Foundation Class Library as a framework, Wing-Viewer has the ability to communicate with the C/C++ software libraries that run on the controller circuit cards of all five cameras.

Path inequalities for the vehicle routing problem with time windows

DEFF Research Database (Denmark)

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

2007-01-01

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

The Orienteering Problem under Uncertainty Stochastic Programming and Robust Optimization compared

NARCIS (Netherlands)

Evers, L.; Glorie, K.; Ster, S. van der; Barros, A.I.; Monsuur, H.

2012-01-01

The Orienteering Problem (OP) is a generalization of the well-known traveling salesman problem and has many interesting applications in logistics, tourism and defense. To reflect real-life situations, we focus on an uncertain variant of the OP. Two main approaches that deal with optimization under

Chemical mass balance source apportionment of TSP in a lignite-burning area of Western Macedonia, Greece

Science.gov (United States)

Samara, Constantini

Total suspended particle mass concentrations (TSP) were determined in the Kozani-Ptolemais-Florina basin (western Macedonia, Greece), an area with intensive lignite burning for power generation. The study was conducted over a 1-year period (November 2000-November 2001) at 10 receptor sites located at variable distances from the power plants. Ambient TSP samples were analyzed for 27 major, minor and trace elements. Particulate emissions were also collected from a variety of sources including fly ash, lignite dust, automobile traffic, domestic heating, and open-air burning of agricultural biomass and refuse, and analyzed for the same chemical components. Ambient and source chemical profiles were used for source identification and apportionment of TSP by employing a chemical mass balance (CMB) receptor model. Diesel burning in vehicular traffic and in the power plants for generator start up was found to be the major contributor to ambient TSP levels at all 10 sites. Other sources with significant contributions were domestic coal burning, vegetative burning (wood combustion and agricultural burns) and refuse open-air burning. Fly ash escaping the electrostatic precipitators of the power plants was a minor contributor to ambient TSP.

Team Software Process (TSP) Coach Mentoring Program Guidebook

Science.gov (United States)

2009-08-01

Hodgins, Michelle Jurkouich, Delwyn Kel- logg, Juan Lopez, Andy Oughton, Rafael Salazar, and Jim Van Buren. vi | CMU/SEI-2009-SR-009 1...listed below in bold font ) are areas that should be of particular interest for potential SEI-Certified TSP Coaches and Mentor Coaches, as these are

Efficient heuristics for the Rural Postman Problem | Groves | ORiON

African Journals Online (AJOL)

A local search framework for the (undirected) Rural Postman Problem (RPP) is presented in this paper. The framework allows local search approaches that have been applied successfully to the well–known Travelling Salesman Problem also to be applied to the RPP. New heuristics for the RPP, based on this framework, ...

On the Equivalence between some Local and Global Chinese Postman and Traveling Salesman Graphs

NARCIS (Netherlands)

Granot, D.; Hamers, H.J.M.

2000-01-01

A connected graph G=(V,E), a vertex in V and a non-negative weight function defined on Ecan be used to induce Chinese postman and traveling salesman (cooperative) games. A graph G=(V,E) is said to be locally (respectively, globally) Chinese postman balanced (respectively, totally balanced,

A nuclear reactor core fuel reload optimization using artificial ant colony connective networks

International Nuclear Information System (INIS)

Lima, Alan M.M. de; Schirru, Roberto; Carvalho da Silva, Fernando; Medeiros, Jose Antonio Carlos Canedo

2008-01-01

The core of a nuclear Pressurized Water Reactor (PWR) may be reloaded every time the fuel burn-up is such that it is not more possible to maintain the reactor operating at nominal power. The nuclear core fuel reload optimization problem consists in finding a pattern of burned-up and fresh-fuel assemblies that maximize the number of full operational days. This is an NP-Hard problem, meaning that complexity grows exponentially with the number of fuel assemblies in the core. Moreover, the problem is non-linear and its search space is highly discontinuous and multi-modal. Ant Colony System (ACS) is an optimization algorithm based on artificial ants that uses the reinforcement learning technique. The ACS was originally developed to solve the Traveling Salesman Problem (TSP), which is conceptually similar to the nuclear core fuel reload problem. In this work a parallel computational system based on the ACS, called Artificial Ant Colony Networks is introduced to solve the core fuel reload optimization problem

A nuclear reactor core fuel reload optimization using artificial ant colony connective networks

Energy Technology Data Exchange (ETDEWEB)

Lima, Alan M.M. de [Universidade Federal do Rio de Janeiro, PEN/COPPE - UFRJ, Ilha do Fundao s/n, CEP 21945-970 Rio de Janeiro (Brazil)], E-mail: alanmmlima@yahoo.com.br; Schirru, Roberto [Universidade Federal do Rio de Janeiro, PEN/COPPE - UFRJ, Ilha do Fundao s/n, CEP 21945-970 Rio de Janeiro (Brazil)], E-mail: schirru@lmp.ufrj.br; Carvalho da Silva, Fernando [Universidade Federal do Rio de Janeiro, PEN/COPPE - UFRJ, Ilha do Fundao s/n, CEP 21945-970 Rio de Janeiro (Brazil)], E-mail: fernando@con.ufrj.br; Medeiros, Jose Antonio Carlos Canedo [Universidade Federal do Rio de Janeiro, PEN/COPPE - UFRJ, Ilha do Fundao s/n, CEP 21945-970 Rio de Janeiro (Brazil)], E-mail: canedo@lmp.ufrj.br

2008-09-15

The core of a nuclear Pressurized Water Reactor (PWR) may be reloaded every time the fuel burn-up is such that it is not more possible to maintain the reactor operating at nominal power. The nuclear core fuel reload optimization problem consists in finding a pattern of burned-up and fresh-fuel assemblies that maximize the number of full operational days. This is an NP-Hard problem, meaning that complexity grows exponentially with the number of fuel assemblies in the core. Moreover, the problem is non-linear and its search space is highly discontinuous and multi-modal. Ant Colony System (ACS) is an optimization algorithm based on artificial ants that uses the reinforcement learning technique. The ACS was originally developed to solve the Traveling Salesman Problem (TSP), which is conceptually similar to the nuclear core fuel reload problem. In this work a parallel computational system based on the ACS, called Artificial Ant Colony Networks is introduced to solve the core fuel reload optimization problem.

The matricellular protein TSP1 promotes human and mouse endothelial cell senescence through CD47 and Nox1.

Science.gov (United States)

Meijles, Daniel N; Sahoo, Sanghamitra; Al Ghouleh, Imad; Amaral, Jefferson H; Bienes-Martinez, Raquel; Knupp, Heather E; Attaran, Shireen; Sembrat, John C; Nouraie, Seyed M; Rojas, Mauricio M; Novelli, Enrico M; Gladwin, Mark T; Isenberg, Jeffrey S; Cifuentes-Pagano, Eugenia; Pagano, Patrick J

2017-10-17

Senescent cells withdraw from the cell cycle and do not proliferate. The prevalence of senescent compared to normally functioning parenchymal cells increases with age, impairing tissue and organ homeostasis. A contentious principle governing this process has been the redox theory of aging. We linked matricellular protein thrombospondin 1 (TSP1) and its receptor CD47 to the activation of NADPH oxidase 1 (Nox1), but not of the other closely related Nox isoforms, and associated oxidative stress, and to senescence in human cells and aged tissue. In human endothelial cells, TSP1 promoted senescence and attenuated cell cycle progression and proliferation. At the molecular level, TSP1 increased Nox1-dependent generation of reactive oxygen species (ROS), leading to the increased abundance of the transcription factor p53. p53 mediated a DNA damage response that led to senescence through Rb and p21 cip , both of which inhibit cell cycle progression. Nox1 inhibition blocked the ability of TSP1 to increase p53 nuclear localization and p21 cip abundance and its ability to promote senescence. Mice lacking TSP1 showed decreases in ROS production, p21 cip expression, p53 activity, and aging-induced senescence. Conversely, lung tissue from aging humans displayed increases in the abundance of vascular TSP1, Nox1, p53, and p21 cip Finally, genetic ablation or pharmacological blockade of Nox1 in human endothelial cells attenuated TSP1-mediated ROS generation, restored cell cycle progression, and protected against senescence. Together, our results provide insights into the functional interplay between TSP1 and Nox1 in the regulation of endothelial senescence and suggest potential targets for controlling the aging process at the molecular level. Copyright © 2017 The Authors, some rights reserved; exclusive licensee American Association for the Advancement of Science. No claim to original U.S. Government Works.

Secondary side TSP deposit buildup: lab test investigation focused on electrokinetic considerations

International Nuclear Information System (INIS)

Barale, M.; Guillodo, M.; Foucault, M.; Ryckelynck, N.; Clinard, M-H.; Chahma, F.; Brun, C.; Corredera, G.

2010-01-01

Deposit buildup which caused the clogging of the 'foils' of the upper tube-support-plates (TSP) inside a PWR steam generator of French NPPs in 2006 presents certain similarities with deposits observed in lab tests performed in secondary coolant chemistry at the Technical Centre of AREVA NP in 2002. The mechanism of TSP clogging seems not to present obvious phenomenological links with the fouling of the free span of SG since deposits buildup is quite uniform and is currently related to a surface boiling effect due to the surface heat flux. A specific mechanism could account for TSP clogging. In particular, electrokinetic effects were investigated by EDF-CEIDRE and AREVA NP SAS in the framework of a lab test program started in 2007. The electrokinetic approach is to consider that the coupling of local hydrodynamic and surface electrochemistry could lead to the formation of a very localized and heterogeneous deposit at the leading edge between both TSP and SG tubing material. Electrokinetic effects can lead to the oxidation and/or the precipitation of ferrous ions and to a variation of the electrokinetic potential which can produce strong attraction of iron oxide colloids. These electrokinetic effects are dependent of the T/H and local hydrodynamic conditions and surface electrochemistry explaining. The objective of this EDF-AREVA lab test program is to investigate the role of secondary chemistry coolant (pH, DH, N 2 H 4 , amine, redox) and of the nature of materials (SS, Ni base alloy) on deposit buildup. Properties of oxide surface and zeta potential of oxidized metallic materials have been also determined at temperature to understand their potential contribution on mechanism of TSP clogging in secondary side chemistry coolant. In this paper, a set of specific experiments carried out in this frame have been presented and discussed, paying particular attention to the effects of electrokinetic considerations and surface charges at oxide-solution interfaces

Secondary side TSP deposit buildup: lab test investigation focused on electrokinetic considerations

Energy Technology Data Exchange (ETDEWEB)

Barale, M.; Guillodo, M.; Foucault, M., E-mail: Morgan.Barale@areva.com [AREVA NP SAS, Technical Centre, Le Creusot (France); Ryckelynck, N.; Clinard, M-H.; Chahma, F.; Brun, C. [AREVA NP SAS, Chemistry and Radiochemistry Group, Paris (France); Corredera, G. [Electricite de France, Centre d' Expertise et d' Inspection dans les domaines de la Realisation et de l' Exploitation, Saint-Denis (France)

2010-07-01

Deposit buildup which caused the clogging of the 'foils' of the upper tube-support-plates (TSP) inside a PWR steam generator of French NPPs in 2006 presents certain similarities with deposits observed in lab tests performed in secondary coolant chemistry at the Technical Centre of AREVA NP in 2002. The mechanism of TSP clogging seems not to present obvious phenomenological links with the fouling of the free span of SG since deposits buildup is quite uniform and is currently related to a surface boiling effect due to the surface heat flux. A specific mechanism could account for TSP clogging. In particular, electrokinetic effects were investigated by EDF-CEIDRE and AREVA NP SAS in the framework of a lab test program started in 2007. The electrokinetic approach is to consider that the coupling of local hydrodynamic and surface electrochemistry could lead to the formation of a very localized and heterogeneous deposit at the leading edge between both TSP and SG tubing material. Electrokinetic effects can lead to the oxidation and/or the precipitation of ferrous ions and to a variation of the electrokinetic potential which can produce strong attraction of iron oxide colloids. These electrokinetic effects are dependent of the T/H and local hydrodynamic conditions and surface electrochemistry explaining. The objective of this EDF-AREVA lab test program is to investigate the role of secondary chemistry coolant (pH, DH, N{sub 2}H{sub 4}, amine, redox) and of the nature of materials (SS, Ni base alloy) on deposit buildup. Properties of oxide surface and zeta potential of oxidized metallic materials have been also determined at temperature to understand their potential contribution on mechanism of TSP clogging in secondary side chemistry coolant. In this paper, a set of specific experiments carried out in this frame have been presented and discussed, paying particular attention to the effects of electrokinetic considerations and surface charges at oxide

Ants Colony Optimisation of a Measuring Path of Prismatic Parts on a CMM

Directory of Open Access Journals (Sweden)

Stojadinovic Slavenko M.

2016-03-01

Full Text Available This paper presents optimisation of a measuring probe path in inspecting the prismatic parts on a CMM. The optimisation model is based on: (i the mathematical model that establishes an initial collision-free path presented by a set of points, and (ii the solution of Travelling Salesman Problem (TSP obtained with Ant Colony Optimisation (ACO. In order to solve TSP, an ACO algorithm that aims to find the shortest path of ant colony movement (i.e. the optimised path is applied. Then, the optimised path is compared with the measuring path obtained with online programming on CMM ZEISS UMM500 and with the measuring path obtained in the CMM inspection module of Pro/ENGINEER® software. The results of comparing the optimised path with the other two generated paths show that the optimised path is at least 20% shorter than the path obtained by on-line programming on CMM ZEISS UMM500, and at least 10% shorter than the path obtained by using the CMM module in Pro/ENGINEER®.

Cloning and analysis of a bifunctional methyltransferase/restriction endonuclease TspGWI, the prototype of a Thermus sp. enzyme family

Directory of Open Access Journals (Sweden)

Zylicz-Stachula Agnieszka

2009-05-01

Full Text Available Abstract Background Restriction-modification systems are a diverse class of enzymes. They are classified into four major types: I, II, III and IV. We have previously proposed the existence of a Thermus sp. enzyme family, which belongs to type II restriction endonucleases (REases, however, it features also some characteristics of types I and III. Members include related thermophilic endonucleases: TspGWI, TaqII, TspDTI, and Tth111II. Results Here we describe cloning, mutagenesis and analysis of the prototype TspGWI enzyme that recognises the 5'-ACGGA-3' site and cleaves 11/9 nt downstream. We cloned, expressed, and mutagenised the tspgwi gene and investigated the properties of its product, the bifunctional TspGWI restriction/modification enzyme. Since TspGWI does not cleave DNA completely, a cloning method was devised, based on amino acid sequencing of internal proteolytic fragments. The deduced amino acid sequence of the enzyme shares significant sequence similarity with another representative of the Thermus sp. family – TaqII. Interestingly, these enzymes recognise similar, yet different sequences in the DNA. Both enzymes cleave DNA at the same distance, but differ in their ability to cleave single sites and in the requirement of S-adenosylmethionine as an allosteric activator for cleavage. Both the restriction endonuclease (REase and methyltransferase (MTase activities of wild type (wt TspGWI (either recombinant or isolated from Thermus sp. are dependent on the presence of divalent cations. Conclusion TspGWI is a bifunctional protein comprising a tandem arrangement of Type I-like domains; particularly noticeable is the central HsdM-like module comprising a helical domain and a highly conserved S-adenosylmethionine-binding/catalytic MTase domain, containing DPAVGTG and NPPY motifs. TspGWI also possesses an N-terminal PD-(D/EXK nuclease domain related to the corresponding domains in HsdR subunits, but lacks the ATP-dependent translocase module

Cytoplasmic Localization of HTLV-1 HBZ Protein: A Biomarker of HTLV-1-Associated Myelopathy/Tropical Spastic Paraparesis (HAM/TSP).

Science.gov (United States)

Baratella, Marco; Forlani, Greta; Raval, Goutham U; Tedeschi, Alessandra; Gout, Olivier; Gessain, Antoine; Tosi, Giovanna; Accolla, Roberto S

2017-01-01

HTLV-1 is the causative agent of a severe form of adult T cell leukemia/Lymphoma (ATL), and of a chronic progressive neuromyelopathy designated HTLV-1 associated myelopathy/tropical spastic paraparesis (HAM/TSP). Two important HTLV-1-encoded proteins, Tax-1 and HBZ, play crucial roles in the generation and maintenance of the oncogenic process. Less information is instead available on the molecular and cellular mechanisms leading to HAM/TSP. More importantly, no single specific biomarker has been described that unambiguously define the status of HAM/TSP. Here we report for the first time the finding that HBZ, described until now as an exclusive nuclear protein both in chronically infected and in ATL cells, is instead exclusively localized in the cytoplasm of peripheral blood mononuclear cells (PBMC) from patients suffering of HAM/TSP. Interestingly, at the single cell level, HBZ and Tax-1 proteins are never found co-expressed in the same cell, suggesting the existence of mechanisms of expression uncoupling of these two important HTLV-1 viral products in HAM/TSP patients. Cells expressing cytoplasmic HBZ were almost exclusively found in the CD4+ T cell compartment that was not, at least in a representative HAM/TSP patient, expressing the CD25 marker. Less than 1 percent CD8+ T cells were fond positive for HBZ, while B cells and NK cells were found negative for HBZ in HAM/TSP patients. Our results identify the cytoplasmic localization of HBZ in HAM/TSP patient as a possible biomarker of this rather neglected tropical disease, and raise important hypotheses on the role of HBZ in the pathogenesis of the neuromyelopathy associated to HTLV-1 infection.

Cytoplasmic Localization of HTLV-1 HBZ Protein: A Biomarker of HTLV-1-Associated Myelopathy/Tropical Spastic Paraparesis (HAM/TSP.

Directory of Open Access Journals (Sweden)

Marco Baratella

2017-01-01

Full Text Available HTLV-1 is the causative agent of a severe form of adult T cell leukemia/Lymphoma (ATL, and of a chronic progressive neuromyelopathy designated HTLV-1 associated myelopathy/tropical spastic paraparesis (HAM/TSP. Two important HTLV-1-encoded proteins, Tax-1 and HBZ, play crucial roles in the generation and maintenance of the oncogenic process. Less information is instead available on the molecular and cellular mechanisms leading to HAM/TSP. More importantly, no single specific biomarker has been described that unambiguously define the status of HAM/TSP. Here we report for the first time the finding that HBZ, described until now as an exclusive nuclear protein both in chronically infected and in ATL cells, is instead exclusively localized in the cytoplasm of peripheral blood mononuclear cells (PBMC from patients suffering of HAM/TSP. Interestingly, at the single cell level, HBZ and Tax-1 proteins are never found co-expressed in the same cell, suggesting the existence of mechanisms of expression uncoupling of these two important HTLV-1 viral products in HAM/TSP patients. Cells expressing cytoplasmic HBZ were almost exclusively found in the CD4+ T cell compartment that was not, at least in a representative HAM/TSP patient, expressing the CD25 marker. Less than 1 percent CD8+ T cells were fond positive for HBZ, while B cells and NK cells were found negative for HBZ in HAM/TSP patients. Our results identify the cytoplasmic localization of HBZ in HAM/TSP patient as a possible biomarker of this rather neglected tropical disease, and raise important hypotheses on the role of HBZ in the pathogenesis of the neuromyelopathy associated to HTLV-1 infection.

The Response to P-Derived from Phosphate Rock and TSP by Crops Grown in a Simulated Crop Rotation System

International Nuclear Information System (INIS)

Sisworo, Elsye L; Sisworo, Widjang H; Havid-Rasjid; Syamsul-Rizal; Komarudin-Idris

2002-01-01

A green house experiment was carried out on a simulated crop rotation system of upland rice-soybean-mungbean to determine the effect of P-derived from different phosphate rock (PR) sources and TSP using 32 P. The data obtained reveal that all the P-sources has a significant effect on the growth of all the three crops, expressed in dry weight, % P-total and total P-uptake (mg P pot -1 ). For the P-source it was shown that % P-derived from PR/TSP and their uptake (mg P pot -1 ) was quite high, showing that the PR s applied were of good reactivity. The residue of the PR s has also still a good effect on plant growth than that of TSP. The efficiency of PR s was far below that of TSP. This apparently was due to the high rate of application, ten times the rate of TSP. (author)

5 CFR 1605.22 - Claims for correction of Board or TSP record keeper errors; time limitations.

Science.gov (United States)

2010-01-01

... record keeper errors; time limitations. 1605.22 Section 1605.22 Administrative Personnel FEDERAL... § 1605.22 Claims for correction of Board or TSP record keeper errors; time limitations. (a) Filing claims... after that time, the Board or TSP record keeper may use its sound discretion in deciding whether to...

Energy-saving methodology for material handling applications

Energy Technology Data Exchange (ETDEWEB)

Makris, P.A.; Makri, A.P.; Provatidis, C.G. [National Technical University of Athens, School of Mechanical Engineering, Mechanical Design and Control Systems Division, 9 Iroon Polytechniou Street, Zografou Campus, GR-15773 Athens (Greece)

2006-10-15

This paper presents an energy saving approach to the problem of order picking in warehousing environment, which is directly related to the well-known Traveling Salesman Problem (TSP). While the available heuristic algorithms for the order-picking problem search for the route that minimizes the travel time, here the problem is addressed from the energy saving point of view. In a few words, the least energy-consuming route is identified in order to quantify the trade off in time and energy between the fastest route and the most energy economic one. Keeping in mind that often energy is as important as time, especially during a low-demand period, the current paper sheds some light into a two dimensional way of addressing the warehouse material handling problem, which saves time as well as energy. A very interesting finding is that a relatively small loss of service time in many cases may lead to a significant decrease of consumed energy without any additional cost. (author)

Fast-response underwater TSP investigation of subcritical instabilities of a cylinder in crossflow

Science.gov (United States)

Capone, Alessandro; Klein, Christian; Di Felice, Fabio; Beifuss, Uwe; Miozzi, Massimo

2015-10-01

We investigate the classic cylinder in crossflow case to test the effectiveness of a fast-response underwater temperature-sensitive paint coating (TSP) in providing highly resolved spatial and time observations of the action of a flow over a bluff body surface. The flow is investigated at Reynolds number crisis state. The obtained TSP image sequences convey an accurate description of the evolution of the main features in the fluid-cylinder interaction, like the separation line position, the pattern of the large coherent structures acting on the cylinder's surface and the small-scale intermittent streamwise arrays of vortices. Ad hoc data management and features extraction techniques are proposed which allow extraction of quantitative data, such as separation line position and vortex-shedding frequency, and results are compared to the literature. Use of TSP for water applications introduces an interesting point of view about the fluid-body interactions by focusing directly on the effect of the flow on the model surface.

Measurement of Ambient Air Particle (TSP, PM10, PM2,5) Around Candidate Location of PLTN Semenanjung Lemahabang

International Nuclear Information System (INIS)

AgusGindo S; Budi Hari H

2008-01-01

Measurement analysis of ambient air particle (TSP, PM 10 , PM 2,5 ) around location candidate of PLTN (Power Station of Nuclear Energy) Semenanjung Lemahabang has been carried out. The measurement was conducted in May 2007 with a purpose to providing information about concentration of ambient air particle (TSP, PM 10 , PM 2,5 ) and diameter distribution of its air particle. The measurement was conducted in three locations i.e. 1). Balong village 2). Bayuran 3). Bondo. Concentration of TSP, PM 10 , and PM 2,5 per 24 hours in all measured locations in area candidate of PLTN exceed quality standard of national ambient air is specified by government. All measurement locations for the TSP, PM 10 , and PM 2,5 was include category of ISPU (Standard Index of Air Pollution) moderate. (author)

A rescheduling heuristic for the single machine total tardiness problem

African Journals Online (AJOL)

In this paper, we propose a rescheduling heuristic for scheduling N jobs on a .... the schedules which start both jobs i and j after time T, there is an optimal ..... [14] Picard J & Queyranne M, 1978, The time-dependent traveling salesman problem.

Standardisation of Western blotting to detect HTLV-1 antibodies synthesised in the central nervous system of HAM/TSP patients

Directory of Open Access Journals (Sweden)

Luiz Claudio Pereira Ribeiro

2013-09-01

Full Text Available Intrathecal synthesis of human T-lymphotropic virus type 1 (HTLV-1 antibodies (Abs represents conclusive evidence of a specific immune response in the central nervous system of HTLV-1 associated myelopathy/tropical spastic paraparesis (HAM/TSP patients. Western blotting (WB for HTLV Abs in serum is a confirmatory test for HTLV-1 infection. The aim of this study was to standardise the Western blot to demonstrate the intrathecal pattern of Abs against HTLV-1 proteins in HAM/TSP patients. Paired cerebrospinal fluid (CSF and serum samples were selected from 20 patients with definite HAM/TSP, 19 HTLV-1 seronegative patients and two HTLV-1 patients without definite HAM/TSP. The presence of reactive bands of greater intensity in the CSF compared to serum (or bands in only the CSF indicated the intrathecal synthesis of anti-HTLV-1 Abs. All definite HAM/TSP patients presented with an intrathecal synthesis of anti-HTLV-1 Abs; these Abs were not detected in the control patients. The most frequent intrathecal targets of anti-HTLV-1 Abs were GD21, rgp46-I and p24 and, to a lesser extent, p19, p26, p28, p32, p36, p53 gp21 and gp46. The intrathecal immune response against env (GD21 and rgp46-I and gag (p24 proteins represents the most important humoral pattern in HAM/TSP. This response may be used as a diagnostic marker, considering the frequent association of intrathecal anti-HTLV-1 Ab synthesis with HAM/TSP and the pathogenesis of this neurological disease.

Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.

Science.gov (United States)

Nallaperuma, Samadhi; Neumann, Frank; Sudholt, Dirk

2017-01-01

Randomized search heuristics are frequently applied to NP-hard combinatorial optimization problems. The runtime analysis of randomized search heuristics has contributed tremendously to our theoretical understanding. Recently, randomized search heuristics have been examined regarding their achievable progress within a fixed-time budget. We follow this approach and present a fixed-budget analysis for an NP-hard combinatorial optimization problem. We consider the well-known Traveling Salesperson Problem (TSP) and analyze the fitness increase that randomized search heuristics are able to achieve within a given fixed-time budget. In particular, we analyze Manhattan and Euclidean TSP instances and Randomized Local Search (RLS), (1+1) EA and (1+[Formula: see text]) EA algorithms for the TSP in a smoothed complexity setting, and derive the lower bounds of the expected fitness gain for a specified number of generations.

Imaging spinal cord atrophy in progressive myelopathies: HTLV-I-associated neurological disease (HAM/TSP) and multiple sclerosis (MS).

Science.gov (United States)

Azodi, Shila; Nair, Govind; Enose-Akahata, Yoshimi; Charlip, Emily; Vellucci, Ashley; Cortese, Irene; Dwyer, Jenifer; Billioux, B Jeanne; Thomas, Chevaz; Ohayon, Joan; Reich, Daniel S; Jacobson, Steven

2017-11-01

Previous work measures spinal cord thinning in chronic progressive myelopathies, including human T-lymphotropic virus 1 (HTLV-1)-associated myelopathy/tropical spastic paraparesis (HAM/TSP) and multiple sclerosis (MS). Quantitative measurements of spinal cord atrophy are important in fully characterizing these and other spinal cord diseases. We aimed to investigate patterns of spinal cord atrophy and correlations with clinical markers. Spinal cord cross-sectional area was measured in individuals (24 healthy controls [HCs], 17 asymptomatic carriers of HTLV-1 (AC), 47 HAM/TSP, 74 relapsing-remitting MS [RRMS], 17 secondary progressive MS [SPMS], and 40 primary progressive MS [PPMS]) from C1 to T10. Clinical disability scores, viral markers, and immunological parameters were obtained for patients and correlated with representative spinal cord cross-sectional area regions at the C2 to C3, C4 to C5, and T4 to T9 levels. In 2 HAM/TSP patients, spinal cord cross-sectional area was measured over 3 years. All spinal cord regions are thinner in HAM/TSP (56 mm 2 [standard deviation, 10], 59 [10], 23 [5]) than in HC (76 [7], 83 [8], 38 [4]) and AC (71 [7], 78 [9], 36 [7]). SPMS (62 [9], 66 [9], 32 [6]) and PPMS (65 [11], 68 [10], 35 [7]) have thinner cervical cords than HC and RRMS (73 [9], 77 [10], 37 [6]). Clinical disability scores (Expanded Disability Status Scale [p = 0.009] and Instituto de Pesquisas de Cananeia [p = 0.03]) and CD8 + T-cell frequency (p = 0.04) correlate with T4 to T9 spinal cord cross-sectional area in HAM/TSP. Higher cerebrospinal fluid HTLV-1 proviral load (p = 0.01) was associated with thinner spinal cord cross-sectional area. Both HAM/TSP patients followed longitudinally showed thoracic thinning followed by cervical thinning. Group average spinal cord cross-sectional area in HAM/TSP and progressive MS show spinal cord atrophy. We further hypothesize in HAM/TSP that is possible that neuroglial loss from a thoracic inflammatory

A Smooth Tour Construction Approach for a Mobile Robot with Kinematic Constraints

Directory of Open Access Journals (Sweden)

Ahmet Yazici

2013-10-01

Full Text Available Mobile robots are increasingly used for service-like applications in which the service points are known and the mobile robot starts from a starting location, visits all the service points requested and returns to the starting location. The tour construction problem in these applications can be treated as a Travelling Salesman Problem (TSP. Classical tour construction algorithms that are proposed for the TSP find tours do not consider robot kinematic constraints. These tours may have sharp turns at some service points. When a mobile robot follows such a tour, it stops, turns and speeds up again. Therefore, the robots waste a considerable amount of power and time. In these cases, tour smoothing can be used to overcome this problem. However, smoothing an existing tour may result in unnecessarily long tours. In this study, a Smooth Tour Construction (STC approach is proposed for mobile robots with kinematic constraints. The STC approach considers tour construction and tour smoothing concurrently. The logic behind the tour construction part of the approach is based on the Savings Algorithm (SA. The tour smoothing is based on Dubins' arc-line approach. Experiments are conducted for P3-DX robots in a laboratory environment. Comparisons are also drawn with various tour smoothing algorithms in simulation environments to demonstrate the effectiveness of the proposed STC approach.

An entropy-based improved k-top scoring pairs (TSP) method for ...

African Journals Online (AJOL)

DR. NJ TONUKARI

2012-06-05

Jun 5, 2012 ... Key words: Cancer classification, gene expression, k-TSP, information entropy, gene selection. INTRODUCTION ..... The 88 kDa precursor protein, progranulin, is also ... TCF3 is in acute myeloid leukemia pathway, so it is.

[The rotationally stable screw-anchor with trochanteric stabilizing plate (RoSA/TSP) : First results in unstable trochanteric femur fractures].

Science.gov (United States)

Maier, K-J; Bücking, B; Horst, K; Andruszkow, H; Hildebrand, F; Knobe, M

2017-12-01

In unstable trochanteric fractures, the extramedullary rotationally stable screw-anchor (RoSA) combines the benefits of the load and rotational stability of the blade with the advantages of the screw (pull-out resistance, compression capability) in a single load carrier, and was designed to prevent femoral neck shortening by using an additional locked trochanteric stabilizing plate (TSP). The aim of the current prospective cohort study was the clinical evaluation of the RoSA/TSP system regarding the mechanical re-operation rate and the amount of postoperative femoral neck shortening. From September 2011 to January 2014 80 patients with unstable trochanteric fractures underwent internal extramedullary fixation with the RoSA/TSP (Königsee Implantate GmbH, Allendorf, Germany). Due to fracture stability and after induction of compression, additional long locked antitelescoping screws (AT, n = 1-4) were placed reaching the femoral head. Radiological (femoral neck shortening) and clinical re-examination of patients (n = 61) was performed 6-10 weeks and 6-10 months later. In the 61 re-examined patients (76 %) femoral neck shortening was very low with 2 mm 6-10 months after operation. Re-operations occurred in 8 % (n = 6) and in 4 % (n = 3) as prophylactic surgical intervention. Whereas one-third (4 %) of re-operations occurred due to iatrogenic surgical problems from the first operation two-thirds of patients (8 %) had a re-operation due to delay of bone union (3× nonunion, 3 planned removals of AT-screws to improve healing). The in-hospital mortality was 3 % (n = 2). The fixation of unstable trochanteric femur fractures using the RoSA/TSP in a first clinical setting led to a great primary stability, with significant advantages with regard to limited femoral neck shortening. However, the rigidity of the construct with its consequences regarding bone healing can be challenging for the surgeon. Nevertheless, in some cases of revision it could be beneficial

Warehouse order-picking process. Order-picker routing problem

Directory of Open Access Journals (Sweden)

E. V. Korobkov

2015-01-01

Full Text Available This article continues “Warehouse order-picking process” cycle and describes order-picker routing sub-problem of a warehouse order-picking process. It draws analogies between the orderpickers’ routing problem and traveling salesman’s problem, shows differences between the standard problem statement of a traveling salesman and routing problem of warehouse orderpickers, and gives the particular Steiner’s problem statement of a traveling salesman.Warehouse layout with a typical order is represented by a graph, with some its vertices corresponding to mandatory order-picker’s visits and some other ones being noncompulsory. The paper describes an optimal Ratliff-Rosenthal algorithm to solve order-picker’s routing problem for the single-block warehouses, i.e. warehouses with only two crossing aisles, defines seven equivalent classes of partial routing sub-graphs and five transitions used to have an optimal routing sub-graph of a order-picker. An extension of optimal Ratliff-Rosenthal order-picker routing algorithm for multi-block warehouses is presented and also reasons for using the routing heuristics instead of exact optimal algorithms are given. The paper offers algorithmic description of the following seven routing heuristics: S-shaped, return, midpoint, largest gap, aisle-by-aisle, composite, and combined as well as modification of combined heuristics. The comparison of orderpicker routing heuristics for one- and two-block warehouses is to be described in the next article of the “Warehouse order-picking process” cycle.

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

Directory of Open Access Journals (Sweden)

E. Osaba

2014-01-01

Full Text Available 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

Science.gov (United States)

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

Characterization, source identification and apportionment of selected metals in TSP in an urban atmosphere.

Science.gov (United States)

Shah, Munir H; Shaheen, N; Jaffar, M

2006-03-01

To understand the metal distribution characteristics in the atmosphere of urban Islamabad, total suspended particulate (TSP) samples were collected on daily 12 h basis, at Quaid-i-Azam University campus, using high volume sampler. The TSP samples were treated with HNO(3)/HClO(4) based wet digestion method for the quantification of eight selected metals; Fe, Zn, Pb, Mn, Cr, Co, Ni and Cd by FAAS method. The monitoring period ran from June 2001 to January 2002, with a total of 194 samples collected on cellulose filters. Effects of different meteorological conditions such as temperature, relative humidity, wind speed and wind direction on selected metal levels were interpreted by means of multivariate statistical approach. Enhanced metal levels for Fe (930 ng/m(3)), Zn (542 ng/m(3)) and Pb (210 ng/m(3)) were found on the mean scale while Mn, Cr, Co and Ni emerged as minor contributors. Statistical correlation study was also conducted and a strong correlation was observed between Pb-Cr (r=0.611). The relative humidity showed some significant influence on atmospheric metal distribution while other meteorological parameters showed weak relationship with TSP metal levels. Regarding the origin of sources of heavy metals in TSP, the statistical procedure identified three source profiles; automobile emissions, industrial/metallurgical units, and natural soil dust. The metal levels were also compared with those reported for other parts of the world which showed that the metal levels in urban atmosphere of Islamabad are in exceedence than those of European industrial and urban sites while comparable with some Asian sites.

Comparison of HTLV-I Proviral Load in Adult T Cell Leukemia/Lymphoma (ATL), HTLV-I-Associated Myelopathy (HAM-TSP) and Healthy Carriers.

Science.gov (United States)

Akbarin, Mohammad Mehdi; Rahimi, Hossein; Hassannia, Tahereh; Shoja Razavi, Ghazaleh; Sabet, Faezeh; Shirdel, Abbas

2013-03-01

Human T Lymphocyte Virus Type one (HTLV-I) is a retrovirus that infects about 10-20 million people worldwide. Khorasan province in Iran is an endemic area. The majority of HTLV-I-infected individuals sustain healthy carriers but small proportion of infected population developed two progressive diseases: HAM/TSP and ATL. The proviral load could be a virological marker for disease monitoring, therefore in the present study HTLV-I proviral load has been evaluated in ATL and compared to HAM/TSP and healthy carriers. In this case series study, 47 HTLV-I infected individuals including 13 ATL, 23 HAM/TSP and 11 asymptomatic subjects were studied. Peripheral blood mononuclear cells (PBMCs) were investigated for presence of HTLV-I DNA provirus by PCR using LTR and Tax fragments. Then in infected subjects, HTLV-I proviral load was measured using real time PCR TaqMan method. The average age of patients in ATL was 52±8, in HAM/TSP 45.52±15.17 and in carrier's 38.65±14.9 years which differences were not statistically significant. The analysis of data showed a significant difference in mean WBC among study groups (ATL vs HAM/TSP and carriers P=0.0001). Moreover, mean HTLV-I proviral load was 11967.2 ± 5078, 409 ± 71.3 and 373.6 ± 143.3 in ATL, HAM/TSP and Healthy Carriers, respectively. The highest HTLV-I proviral load was measured in ATL group that had a significant correlation with WBC count (R=0.495, P=0.001). The proviral load variations between study groups was strongly significant (ATL vs carrier P=0.0001; ATL vs HAM/TSP P= 0.0001 and HAM/TSP vs carriers P< 0.05). Conclusion : The present study demonstrated that HTLV-I proviral load was higher in ATL group in comparison with HAM/TSP and healthy carriers. Therefore, HTLV-I proviral load is a prognostic factor for development of HTLV-I associated diseases and can be used as a monitoring marker for the efficiency of therapeutic regime.

41 CFR 102-118.195 - What documents must a transportation service provider (TSP) send to receive payment for a...

Science.gov (United States)

2010-07-01

... transportation service provider (TSP) send to receive payment for a transportation billing? 102-118.195 Section... must a transportation service provider (TSP) send to receive payment for a transportation billing? For... Government Billing Documents Terms and Conditions Governing Acceptance and Use of A Government Bill of Lading...

Convex hull and tour crossings in the Euclidean traveling salesperson problem : implications for human performance studies

NARCIS (Netherlands)

Rooij, van I.; Stege, U.; Schactman, A.

2003-01-01

Recently there has been growing interest among psychologists in human performance on the Euclidean traveling salesperson problem (E-TSP). A debate has been initiated on what strategy people use in solving visually presented E-TSP instances. The most prominent hypothesis is the convex-hull

Solution Structure, Membrane Interactions, and Protein Binding Partners of the Tetraspanin Sm-TSP-2, a Vaccine Antigen from the Human Blood Fluke Schistosoma mansoni*

Science.gov (United States)

Jia, Xinying; Schulte, Leigh; Loukas, Alex; Pickering, Darren; Pearson, Mark; Mobli, Mehdi; Jones, Alun; Rosengren, Karl J.; Daly, Norelle L.; Gobert, Geoffrey N.; Jones, Malcolm K.; Craik, David J.; Mulvenna, Jason

2014-01-01

The tetraspanins (TSPs) are a family of integral membrane proteins that are ubiquitously expressed at the surface of eukaryotic cells. TSPs mediate a range of processes at the surface of the plasma membrane by providing a scaffold for the assembly of protein complexes known as tetraspanin-enriched microdomains (TEMs). We report here the structure of the surface-exposed EC2 domain from Sm-TSP-2, a TSP from Schistosoma mansoni and one of the better prospects for the development of a vaccine against schistosomiasis. This is the first solution structure of this domain, and our investigations of its interactions with lipid micelles provide a general model for interactions between TSPs, membranes, and other proteins. Using chemical cross-linking, eight potential protein constituents of Sm-TSP-2-mediated TEMs were also identified. These include proteins important for membrane maintenance and repair, providing further evidence for the functional role of Sm-TSP-2- and Sm-TSP-2-mediated TEMs. The identification of calpain, Sm29, and fructose-bisphosphate aldolase, themselves potential vaccine antigens, suggests that the Sm-TSP-2-mediated TEMs could be disrupted via multiple targets. The identification of further Sm-TSP-2-mediated TEM proteins increases the available candidates for multiplex vaccines and/or novel drugs targeting TEMs in the schistosome tegument. PMID:24429291

Solution structure, membrane interactions, and protein binding partners of the tetraspanin Sm-TSP-2, a vaccine antigen from the human blood fluke Schistosoma mansoni.

Science.gov (United States)

Jia, Xinying; Schulte, Leigh; Loukas, Alex; Pickering, Darren; Pearson, Mark; Mobli, Mehdi; Jones, Alun; Rosengren, Karl J; Daly, Norelle L; Gobert, Geoffrey N; Jones, Malcolm K; Craik, David J; Mulvenna, Jason

2014-03-07

The tetraspanins (TSPs) are a family of integral membrane proteins that are ubiquitously expressed at the surface of eukaryotic cells. TSPs mediate a range of processes at the surface of the plasma membrane by providing a scaffold for the assembly of protein complexes known as tetraspanin-enriched microdomains (TEMs). We report here the structure of the surface-exposed EC2 domain from Sm-TSP-2, a TSP from Schistosoma mansoni and one of the better prospects for the development of a vaccine against schistosomiasis. This is the first solution structure of this domain, and our investigations of its interactions with lipid micelles provide a general model for interactions between TSPs, membranes, and other proteins. Using chemical cross-linking, eight potential protein constituents of Sm-TSP-2-mediated TEMs were also identified. These include proteins important for membrane maintenance and repair, providing further evidence for the functional role of Sm-TSP-2- and Sm-TSP-2-mediated TEMs. The identification of calpain, Sm29, and fructose-bisphosphate aldolase, themselves potential vaccine antigens, suggests that the Sm-TSP-2-mediated TEMs could be disrupted via multiple targets. The identification of further Sm-TSP-2-mediated TEM proteins increases the available candidates for multiplex vaccines and/or novel drugs targeting TEMs in the schistosome tegument.

NORPERM, the Norwegian Permafrost Database - a TSP NORWAY IPY legacy

Science.gov (United States)

Juliussen, H.; Christiansen, H. H.; Strand, G. S.; Iversen, S.; Midttømme, K.; Rønning, J. S.

2010-10-01

NORPERM, the Norwegian Permafrost Database, was developed at the Geological Survey of Norway during the International Polar Year (IPY) 2007-2009 as the main data legacy of the IPY research project Permafrost Observatory Project: A Contribution to the Thermal State of Permafrost in Norway and Svalbard (TSP NORWAY). Its structural and technical design is described in this paper along with the ground temperature data infrastructure in Norway and Svalbard, focussing on the TSP NORWAY permafrost observatory installations in the North Scandinavian Permafrost Observatory and Nordenskiöld Land Permafrost Observatory, being the primary data providers of NORPERM. Further developments of the database, possibly towards a regional database for the Nordic area, are also discussed. The purpose of NORPERM is to store ground temperature data safely and in a standard format for use in future research. The IPY data policy of open, free, full and timely release of IPY data is followed, and the borehole metadata description follows the Global Terrestrial Network for Permafrost (GTN-P) standard. NORPERM is purely a temperature database, and the data is stored in a relation database management system and made publically available online through a map-based graphical user interface. The datasets include temperature time series from various depths in boreholes and from the air, snow cover, ground-surface or upper ground layer recorded by miniature temperature data-loggers, and temperature profiles with depth in boreholes obtained by occasional manual logging. All the temperature data from the TSP NORWAY research project is included in the database, totalling 32 temperature time series from boreholes, 98 time series of micrometeorological temperature conditions, and 6 temperature depth profiles obtained by manual logging in boreholes. The database content will gradually increase as data from previous and future projects are added. Links to near real-time permafrost temperatures, obtained

Corrosion and solubility in a TSP-buffered chemical environment following a loss of coolant accident: Part 2 – Zinc

International Nuclear Information System (INIS)

Pease, David; LaBrier, Daniel; Ali, Amir; Blandford, Edward D.; Howe, Kerry J.

2016-01-01

Highlights: • Zinc release is limited to less than 1 mg/L in TSP-buffered solution under a variety of conditions (pH, temperature, zinc source). • Zinc release in high-temperature non-TSP-buffered environment is approximately 25 mg/L. • Long-term zinc release is controlled by passivation (without TSP) and zinc solubility (with TSP). • Precipitation and solubility of zinc phosphate limit the release of zinc. - Abstract: Bench experiments were conducted to investigate the effect of the presence of trisodium phosphate (TSP) on the corrosion and release of zinc from metallic zinc-bearing surfaces under conditions representative of the containment pool following a postulated loss of coolant accident (LOCA) at a nuclear power generating facility. The experiments showed that in non-buffered (acidic) environments, measurable quantities of zinc are released from zinc-bearing surfaces. Precipitation and solubility of phosphate-based corrosion products, such as zinc phosphate, limit the release of zinc from zinc-bearing surfaces. These experiments have found that under a variety of conditions, including variations of temperature, pH, and across different zinc-bearing surfaces, the release of zinc into solution is limited to <1 mg/L when phosphate is present. When phosphate is not present, zinc release is instead bounded by a markedly higher saturation limit which is a strong function of the solution temperature.

Vervet monkey (Chlorocebus pygerythrus) behavior in a multi-destination route: Evidence for planning ahead when heuristics fail.

Science.gov (United States)

Teichroeb, Julie Annette; Smeltzer, Eve Ann

2018-01-01

Animal paths are analogous to intractable mathematical problems like the Traveling Salesman Problem (TSP) and the shortest path problem (SPP). Both the TSP and SPP require an individual to find the shortest path through multiple targets but the TSP demands a return to the start, while the SPP does not. Vervet monkeys are very efficient in solving TSPs but this species is a multiple central place forager that does not always return to the same sleeping site and thus theoretically should be selected to find solutions to SPPs rather than TSPs. We examined path choice by wild vervets in an SPP experimental array where the shortest paths usually differed from those consistent with common heuristic strategies, the nearest-neighbor rule (NNR-go to the closest resource that has not been visited), and the convex hull (put a mental loop around sites, adding inner targets in order of distance from the edge)-an efficient strategy for TSPs but not SPPs. In addition, humans solving SPPs use an initial segment strategy (ISS-choose the straightest path at the beginning, only turning when necessary) and we looked at vervet paths consistent with this strategy. In 615 trials by single foragers, paths usually conformed to the NNR and rarely the slightly more efficient convex hull, supporting that vervets may be selected to solve SPPs. Further, like humans solving SPPs, vervets showed a tendency to use the ISS. Paths consistent with heuristics dropped off sharply, and use of the shortest path increased, when heuristics led to longer paths showing trade-offs in efficiency versus cognitive load. Two individuals out of 17, found the shortest path most often, showing inter-individual variation in path planning. Given support for the NNR and the ISS, we propose a new rule-of-thumb termed the "region heuristic" that vervets may apply in multi-destination routes.

41 CFR 102-118.260 - Must my agency send all quotations, tenders, or contracts with a TSP to GSA?

Science.gov (United States)

2010-07-01

... quotations, tenders, or contracts with a TSP to GSA? 102-118.260 Section 102-118.260 Public Contracts and... REGULATION TRANSPORTATION 118-TRANSPORTATION PAYMENT AND AUDIT Use of Government Billing Documents Quotations, Tenders Or Contracts § 102-118.260 Must my agency send all quotations, tenders, or contracts with a TSP to...

Corrosion and solubility in a TSP-buffered chemical environment following a loss of coolant accident: Part 1 – Aluminum

Energy Technology Data Exchange (ETDEWEB)

Howe, Kerry J., E-mail: howe@unm.edu [University of New Mexico, 210 University Blvd., Albuquerque, NM 87131 (United States); Mitchell, Lana, E-mail: lmitchell@alionscience.com [University of New Mexico, 210 University Blvd., Albuquerque, NM 87131 (United States); Kim, Seung-Jun, E-mail: skim@lanl.gov [University of New Mexico, 210 University Blvd., Albuquerque, NM 87131 (United States); Blandford, Edward D., E-mail: edb@unm.edu [University of New Mexico, 210 University Blvd., Albuquerque, NM 87131 (United States); Kee, Ernest J., E-mail: erniekee@gmail.com [South Texas Project Nuclear Operating Company, P.O. Box 270, Wadsworth, TX 77483 (United States)

2015-10-15

Highlights: • Trisodium phosphate (TSP) causes aluminum corrosion to cease after 24 h of exposure. • Chloride, iron, and copper have a minimal effect on the rate of aluminum corrosion when TSP is present. • Zinc can reduce the rate of aluminum corrosion when TSP is present. • Aluminum occasionally precipitates at concentrations lower than the calculated solubility for Al(OH){sub 3}. • Corrosion and solubility equations can be used to calculate the solids generated during a LOCA. - Abstract: Bench experiments were conducted to investigate the effect of the presence of trisodium phosphate (TSP) on the corrosion and release of aluminum from metallic aluminum surfaces under conditions representative of the containment pool following a postulated loss of coolant accident at a nuclear power generating facility. The experiments showed that TSP is capable of passivating the aluminum surface and preventing continued corrosion after about 24 h at the conditions tested. A correlation that describes the rate of corrosion including the passivation effect was developed from the bench experiments and validated with a separate set of experiments from a different test system. The saturation concentration of aluminum was shown to be well described by the solubility of amorphous aluminum hydroxide for the majority of cases, but instances have been observed when aluminum precipitates at concentrations lower than the calculated aluminum hydroxide solubility. Based on the experimental data and previous literature, an equation was developed to calculate the saturation concentration of aluminum as a function of pH and temperature under conditions representative of a loss of coolant accident (LOCA) in a TSP-buffered pressurized water reactor (PWR) containment. The corrosion equation and precipitation equation can be used in concert with each other to calculate the quantity of solids that would form as a function of time during a LOCA if the temperature and pH profiles were known.

Corrosion and solubility in a TSP-buffered chemical environment following a loss of coolant accident: Part 1 – Aluminum

International Nuclear Information System (INIS)

Howe, Kerry J.; Mitchell, Lana; Kim, Seung-Jun; Blandford, Edward D.; Kee, Ernest J.

2015-01-01

Highlights: • Trisodium phosphate (TSP) causes aluminum corrosion to cease after 24 h of exposure. • Chloride, iron, and copper have a minimal effect on the rate of aluminum corrosion when TSP is present. • Zinc can reduce the rate of aluminum corrosion when TSP is present. • Aluminum occasionally precipitates at concentrations lower than the calculated solubility for Al(OH) 3 . • Corrosion and solubility equations can be used to calculate the solids generated during a LOCA. - Abstract: Bench experiments were conducted to investigate the effect of the presence of trisodium phosphate (TSP) on the corrosion and release of aluminum from metallic aluminum surfaces under conditions representative of the containment pool following a postulated loss of coolant accident at a nuclear power generating facility. The experiments showed that TSP is capable of passivating the aluminum surface and preventing continued corrosion after about 24 h at the conditions tested. A correlation that describes the rate of corrosion including the passivation effect was developed from the bench experiments and validated with a separate set of experiments from a different test system. The saturation concentration of aluminum was shown to be well described by the solubility of amorphous aluminum hydroxide for the majority of cases, but instances have been observed when aluminum precipitates at concentrations lower than the calculated aluminum hydroxide solubility. Based on the experimental data and previous literature, an equation was developed to calculate the saturation concentration of aluminum as a function of pH and temperature under conditions representative of a loss of coolant accident (LOCA) in a TSP-buffered pressurized water reactor (PWR) containment. The corrosion equation and precipitation equation can be used in concert with each other to calculate the quantity of solids that would form as a function of time during a LOCA if the temperature and pH profiles were known

Socioeconomic Differences in Exposure to Tobacco Smoke Pollution (TSP in Bangladeshi Households with Children: Findings from the International Tobacco Control (ITC Bangladesh Survey

Directory of Open Access Journals (Sweden)

Geoffrey T. Fong

2011-03-01

Full Text Available This study assessed the pattern of exposure to tobacco smoke pollution (TSP; also known as, secondhand smoke in Bangladeshi households with children and examined the variations in household smoking restrictions and perception of risk for children’s exposure to TSP by socioeconomic status. We interviewed 1,947 respondents from Bangladeshi households with children from the first wave (2009 of the International Tobacco Control (ITC Bangladesh Survey. 43.5% of the respondents had complete smoking restrictions at home and 39.7% were very or extremely concerned about TSP risk to children’s health. Participants with lower level of education were significantly less likely to be concerned about the risk of TSP exposure to children’s health and less likely to adopt complete smoking restrictions at home. Logistic regression revealed that the predictors of concern for TSP exposure risk were educational attainment of 1 to 8 years (OR = 1.94 or 9 years or more (OR = 4.07 and being a smoker (OR = 0.24. The predictors of having complete household smoking restrictions were: urban residence (OR = 1.64, attaining education of 9 years or more (OR = 1.94, being a smoker (OR = 0.40 and being concerned about TSP exposure risk to children (OR = 3.25. The findings show that a high proportion of adults with children at home smoke tobacco at home and their perceptions of risk about TSP exposure to children’s health were low. These behaviours were more prevalent among rural smokers who were illiterate. There is a need for targeted intervention, customized for low educated public, on TSP risk to children’s health and tobacco control policy with specific focus on smoke-free home.

The A-priori Traveling Salesman Problem with Time Windows

DEFF Research Database (Denmark)

Larsen, Allan; Madsen, Oli B.G.; Solomon, Marius M.

2004-01-01

seek to minimize lateness and examine the impact of this criterion choice on the distance traveled. Our focus on lateness is motivated by the problem faced by overnight mail service providers. We propose a real-time solution method that requires the vehicle, when idle, to wait at the current customer......In this paper we examine the traveling saleman problem with time windows for various degrees of dynamism. In contrast to the static problem, where the dispatcher can plan ahead, in the dynamic version, part or all of the necessary information becomes available only during the day of operation. We...... randomly generated data and on a real-world case study indicate that all policies proved capable of significantly reducing lateness. Our results also show that this can be accomplished with only small distance increases. The basic policy outperformed the other methods primarily when lateness and distance...

HiCoDG: a hierarchical data-gathering scheme using cooperative multiple mobile elements.

Science.gov (United States)

Van Le, Duc; Oh, Hoon; Yoon, Seokhoon

2014-12-17

In this paper, we study mobile element (ME)-based data-gathering schemes in wireless sensor networks. Due to the physical speed limits of mobile elements, the existing data-gathering schemes that use mobile elements can suffer from high data-gathering latency. In order to address this problem, this paper proposes a new hierarchical and cooperative data-gathering (HiCoDG) scheme that enables multiple mobile elements to cooperate with each other to collect and relay data. In HiCoDG, two types of mobile elements are used: the mobile collector (MC) and the mobile relay (MR). MCs collect data from sensors and forward them to the MR, which will deliver them to the sink. In this work, we also formulated an integer linear programming (ILP) optimization problem to find the optimal trajectories for MCs and the MR, such that the traveling distance of MEs is minimized. Two variants of HiCoDG, intermediate station (IS)-based and cooperative movement scheduling (CMS)-based, are proposed to facilitate cooperative data forwarding from MCs to the MR. An analytical model for estimating the average data-gathering latency in HiCoDG was also designed. Simulations were performed to compare the performance of the IS and CMS variants, as well as a multiple traveling salesman problem (mTSP)-based approach. The simulation results show that HiCoDG outperforms mTSP in terms of latency. The results also show that CMS can achieve the lowest latency with low energy consumption.

HiCoDG: A Hierarchical Data-Gathering Scheme Using Cooperative Multiple Mobile Elements

Directory of Open Access Journals (Sweden)

Duc Van Le

2014-12-01

Full Text Available In this paper, we study mobile element (ME-based data-gathering schemes in wireless sensor networks. Due to the physical speed limits of mobile elements, the existing data-gathering schemes that usemobile elements can suffer from high data-gathering latency. In order to address this problem, this paper proposes a new hierarchical and cooperative data-gathering (HiCoDG scheme that enables multiple mobile elements to cooperate with each other to collect and relay data. In HiCoDG, two types of mobile elements are used: the mobile collector (MC and the mobile relay (MR. MCs collect data from sensors and forward them to the MR, which will deliver them to the sink. In this work, we also formulated an integer linear programming (ILP optimization problem to find the optimal trajectories for MCs and the MR, such that the traveling distance of MEs is minimized. Two variants of HiCoDG, intermediate station (IS-based and cooperative movement scheduling (CMS-based, are proposed to facilitate cooperative data forwarding from MCs to theMR. An analytical model for estimating the average data-gathering latency in HiCoDG was also designed. Simulations were performed to compare the performance of the IS and CMS variants, as well as a multiple traveling salesman problem (mTSP-based approach. The simulation results show that HiCoDG outperformsmTSP in terms of latency. The results also show that CMS can achieve the lowest latency with low energy consumption.

Team Software Process (TSP) Coach Mentoring Program Guidebook Version 1.1

Science.gov (United States)

2010-06-01

Hodgins, Michelle Jurkouich, Delwyn Kellogg, Juan Lopez, Andy Oughton, Rafael Salazar, and Jim Van Buren. vi | CMU/SEI-2010-SR-016 vii | CMU/SEI...which it was deemed that TSP coaches must be competent; Sections C through G (listed below in bold font ) are areas that should be of particular

Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II

Directory of Open Access Journals (Sweden)

Eremeev Anton V.

2014-01-01

Full Text Available This paper surveys results on complexity of the optimal recombination problem (ORP, which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. In Part II, we consider the computational complexity of ORPs arising in genetic algorithms for problems on permutations: the Travelling Salesman Problem, the Shortest Hamilton Path Problem and the Makespan Minimization on Single Machine and some other related problems. The analysis indicates that the corresponding ORPs are NP-hard, but solvable by faster algorithms, compared to the problems they are derived from.

A multi-objective optimization for brush monofilament tufting process design

Directory of Open Access Journals (Sweden)

Ali Salmasnia

2018-01-01

Full Text Available This paper addresses the optimization of monofilament tufting process as the most important and the main stage of toothbrush production in sanitary industries. In order to minimize both process time and depreciation costs, and ultimately increase the production efficiency in such an industrial unit, we propose a metaheuristic based optimization approach to solve it. The Traveling Salesman Problem (TSP is used to formulate the proposed problem. Then by using multi-objective evolutionary algorithms, NSGA-II and MOPSO, we seek to obtain the best solution and objective functions described above. Extensive computational experiments on three different kinds of toothbrush handles are performed and the results demonstrate the applicability and appropriate performance of algorithms. The comparison metrics like spacing, number of Pareto solutions, time, mean distance from the ideal solution and diversity are used to evaluate the quality of solutions. Moreover a sensitivity analysis is done for investigation of the performance in various setting of parameters.

Angiogenesis in cancer of unknown primary: clinicopathological study of CD34, VEGF and TSP-1

International Nuclear Information System (INIS)

Karavasilis, Vasilis; Malamou-Mitsi, Vasiliki; Briasoulis, Evangelos; Tsanou, Elena; Kitsou, Evangelia; Kalofonos, Haralambos; Fountzilas, George; Fotsis, Theodore; Pavlidis, Nicholas

2005-01-01

Cancer of unknown primary remains a mallignancy of elusive biology and grim prognosis that lacks effective therapeutic options. We investigated angiogenesis in cancer of unknown primary to expand our knowledge on the biology of these tumors and identify potential therapeutic targets. Paraffin embedded archival material from 81 patients diagnosed with CUP was used. Tumor histology was adenocarcinoma (77%), undifferentiated carcinoma (18%) and squamous cell carcinoma (5%). The tissue expression of CD34, VEGF and TSP-1 was assessed immunohistochemically by use of specific monoclonal antibodies and was analyzed against clinicopathological data. VEGF expression was detected in all cases and was strong in 83%. Stromal expression of TSP-1 was seen in 80% of cases and was strong in 20%. The expression of both proteins was not associated with any clinical or pathological parameters. Tumor MVD was higher in tumors classified as unfavorable compared to more favorable and was positively associated with VEGF and negatively with TSP-1. Angiogenesis is very active and expression of VEGF is almost universal in cancers of unknown primary. These findings support the clinical investigation of VEGF targeted therapy in this clinical setting

41 CFR 102-117.50 - What are the advantages and disadvantages of contracting directly with a TSP under the FAR?

Science.gov (United States)

2010-07-01

... and disadvantages of contracting directly with a TSP under the FAR? 102-117.50 Section 102-117.50... Related Services § 102-117.50 What are the advantages and disadvantages of contracting directly with a TSP... office is able to handle the requirement. (b) The FAR may be a disadvantage when you: (1) Cannot prepare...

Heuristics methods for the flow shop scheduling problem with separated setup times

Directory of Open Access Journals (Sweden)

Marcelo Seido Nagano

2012-06-01

Full Text Available This paper deals with the permutation flow shop scheduling problem with separated machine setup times. As a result of an investigation on the problem characteristics, four heuristics methods are proposed with procedures of the construction sequencing solution by an analogy with the asymmetric traveling salesman problem with the objective of minimizing makespan. Experimental results show that one of the new heuristics methods proposed provide high quality solutions in comparisons with the evaluated methods considered in the literature.

A branch-and-cut algorithm for the capacitated profitable tour problem

DEFF Research Database (Denmark)

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

2014-01-01

This paper considers the Capacitated Profitable Tour Problem (CPTP) which is a special case of the Elementary Shortest Path Problem with Resource Constraints (ESPPRC). The CPTP belongs to the group of problems known as traveling salesman problems with profits. In CPTP each customer is associated...... with a profit and a demand and the objective is to find a capacitated tour (rooted in a depot node) that minimizes the total travel distance minus the profit of the visited customers. The CPTP can be recognized as the sub-problem in many column generation applications, where it is traditionally solved through...

About an Optimal Visiting Problem

Energy Technology Data Exchange (ETDEWEB)

Bagagiolo, Fabio, E-mail: bagagiol@science.unitn.it; Benetton, Michela [Unversita di Trento, Dipartimento di Matematica (Italy)

2012-02-15

In this paper we are concerned with the optimal control problem consisting in minimizing the time for reaching (visiting) a fixed number of target sets, in particular more than one target. Such a problem is of course reminiscent of the famous 'Traveling Salesman Problem' and brings all its computational difficulties. Our aim is to apply the dynamic programming technique in order to characterize the value function of the problem as the unique viscosity solution of a suitable Hamilton-Jacobi equation. We introduce some 'external' variables, one per target, which keep in memory whether the corresponding target is already visited or not, and we transform the visiting problem in a suitable Mayer problem. This fact allows us to overcome the lacking of the Dynamic Programming Principle for the originary problem. The external variables evolve with a hysteresis law and the Hamilton-Jacobi equation turns out to be discontinuous.

26 CFR 31.3402(j)-1 - Remuneration other than in cash for service performed by retail commission salesman.

Science.gov (United States)

2010-04-01

... performed by retail commission salesman. 31.3402(j)-1 Section 31.3402(j)-1 Internal Revenue INTERNAL REVENUE... EMPLOYMENT TAXES AND COLLECTION OF INCOME TAX AT SOURCE Collection of Income Tax at Source § 31.3402(j)-1.... (2) Section 3402(j) and this section are not applicable with respect to wages paid to the employee...

Efficient heuristics for the Rural Postman Problem

Directory of Open Access Journals (Sweden)

GW Groves

2005-06-01

Full Text Available A local search framework for the (undirected Rural Postman Problem (RPP is presented in this paper. The framework allows local search approaches that have been applied successfully to the well–known Travelling Salesman Problem also to be applied to the RPP. New heuristics for the RPP, based on this framework, are introduced and these are capable of solving significantly larger instances of the RPP than have been reported in the literature. Test results are presented for a number of benchmark RPP instances in a bid to compare efficiency and solution quality against known methods.

Structural and electrical characterization of tamarind seed polysaccharide (TSP) doped with NH4HCO2

Science.gov (United States)

Premalatha, M.; Mathavan, T.; Selvasekarapandian, S.; Selvalakshmi, S.

2018-04-01

In the modern era, development of electrochemical energy devices such as batteries, fuel cells and supercapacitors gain attention due to the deficiency of renewable energy resources. More specifically, proton conducting materials create prime interest in the development of electrochemical devices. In this regards, a novel proton conducting biopolymer electrolyte based on Tamarind Seed Polysaccharide (TSP) was synthesized with different concentration of ammonium formate (NH4HCO2). The amorphous nature of the polymer electrolytes has been identified by XRD technique. The observed ionic conductivity values reveal that the biopolymer containing 1 g TSP: 0.4 g NH4HCO2 has highest ionic conductivity 1.23×10-3 S cm-1.

EDF steam generators fleet: In-operation monitoring of TSP blockage and tube fouling

Energy Technology Data Exchange (ETDEWEB)

Bertrand, P.; Gay, N.; Crinon, R. [Electricite De France (France)

2012-07-01

EDF operates 58 Pressurized Water Reactors in France. In the mid 2000‟s some of them have been affected by Steam Generators (SG) Tube Support Plates (TSP) blockage and U-tubes external surface fouling with iron oxides deposits due to corrosion of secondary-side components. These issues have been tackled by a global maintenance strategy of chemical cleanings and a method for in-operation monitoring of fouling and TSP blockage has been developed and is implemented since mid 2009. This monitoring is aimed at giving information for SG maintenance planning as regards non destructive examinations and chemical cleaning. This paper will first remind of the physical reasons of fouling and TSP blockage and identify the resulting stakes regarding safety and availability along with the action levers available to control both phenomena. Then details will be given on how in-operation monitoring of fouling and TSP blockage is carried out, using measurements of Wide Range water Level (WRL) and SG steam pressure during thermally stabilized periods. Information will also be given on how those data are analyzed and shared as well at a local as at a corporate level to participate in the planning of SG inspection and maintenance operations. Finally, possible refinements will be discussed, notably regarding the issue of WRL measurements reliability and the possibility to use the analysis of SG dynamic behavior during power transients to assess the TSP blockage ratio. In terms of „issues requiring discussion‟, the following are operational issues currently being investigated by EDF: 1. SG pressure can have quite large variations during one operating cycle (notably after a plant trip) and from one cycle to the other and generally pressure tends to decrease on a long-term basis. How can such variations be explained? What are the solutions to moderate/stop the pressure loss? 2. On some of the SG-models operated by EDF, hard curative Chemical Cleaning of the U-tubes didn't bring

Wintertime indoor air levels of PM10, PM2.5 and PM1 at public places and their contributions to TSP.

Science.gov (United States)

Liu, Yangsheng; Chen, Rui; Shen, Xingxing; Mao, Xiaoling

2004-04-01

From 26 October 2002 to 8 March 2003, particulate matter (PM) concentrations (total suspended particles [TSP], PM10, PM2.5 and PM1) were measured at 49 public places representing different environments in the urban area of Beijing. The objectives of this study were (1) to characterize the indoor PM concentrations in public places, (2) to evaluate the potential indoor sources and (3) to investigate the contribution of PM10 to TSP and the contributions of PM2.5 and PM1 to PM10. Additionally, The indoor and outdoor particle concentrations in the same type of indoor environment were employed to investigate the I/O level, and comparison was made between I/O levels in different types of indoor environment. Construction activities and traffic condition were the major outdoor sources to influence the indoor particle levels. The contribution of PM10 to TSP was even up to 68.8%, while the contributions of PM2.5 and PM1 to PM10 were not as much as that of PM10 to TSP.

5 CFR 839.1119 - How is the actuarial reduction for TSP computed?

Science.gov (United States)

2010-01-01

... benefit that is payable, the present value factor for the survivor's age at the time of death is used. The survivor benefit is not reduced for TSP if the retiree's rate was reduced. Survivor Benefits ... reduction. OPM will divide the Government contributions and earnings by the present value factor for your...

Heuristic versus statistical physics approach to optimization problems

International Nuclear Information System (INIS)

Jedrzejek, C.; Cieplinski, L.

1995-01-01

Optimization is a crucial ingredient of many calculation schemes in science and engineering. In this paper we assess several classes of methods: heuristic algorithms, methods directly relying on statistical physics such as the mean-field method and simulated annealing; and Hopfield-type neural networks and genetic algorithms partly related to statistical physics. We perform the analysis for three types of problems: (1) the Travelling Salesman Problem, (2) vector quantization, and (3) traffic control problem in multistage interconnection network. In general, heuristic algorithms perform better (except for genetic algorithms) and much faster but have to be specific for every problem. The key to improving the performance could be to include heuristic features into general purpose statistical physics methods. (author)

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

Science.gov (United States)

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.

About some types of constraints in problems of routing

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Cēsu alus konkurētspēja un to ietekmējošie faktori Latvijas tirgū.

OpenAIRE

Baltroka, Krista

2014-01-01

Bakalaura darba tēma „Cēsu alus konkurētspēja un to ietekmējošie faktori Latvijas tirgū”. Konkurence ir viens no svarīgākajiem nosacījumiem uzņēmuma pilnveidošanās procesā, stratēģijas izstrādē. Latvijas tirgū, dzērienu nozarē ir liela konkurence, piedāvāto produktu klāsts ir ļoti plašs. Bakalaura darba mērķis ir izpētīt akciju sabiedrības „Cēsu alus” konkurētspēju ietekmējošos faktorus Latvijas tirgū, kā arī izstrādāt priekšlikumus konkurētspējas paaugstināšanai. Kvantitatīvās analīze...

KANDUNGAN TSP DAN PM-10 DI UDARA JAKARTA DAN SEKITARNYA

Directory of Open Access Journals (Sweden)

Hendro Martono

2016-09-01

Full Text Available Abstract. A survey was performed to assess the quality of ambient air in Jakarta, Bogor,Depok,  Tangerang  and Bekasi.  Ambient air samples were collected from 33 sampling points at a distance of 0meter and 120 meters from each main roads respectively. The highest average content of TSP in ambientair at 0 meter was found in West Jakarta (652.02 p.g/cu.m and that of 120 meters from the main road was in Bekasi (445.46µg/cu.m . The highest difference of the TSP content between the two sampling pointswas in Kebon  Jeruk, West Jakarta (96.62 %,  and the lowest one was inCikarang, Bekasi (1.63 %.  Furthermore, the highest difference of the PM-10 content between the two sampling points was inJalan  Raya Bogor, Depok  (96.86 %,  and the lowest one was in Cikarang,  Bekasi (17.26%. In the whole areasof study, the average content of TSP  was 522.44.tg/cu.m  (0 meter, and178.09µg/cu.m (120 meters,  so the difference of the pollutant content between the two sampling points was 65.91%. Meanwhile, theaverage content of PM-10 was 326.25µg/cu.m  (0 meter, and97.09µg/cu.m (120 meters, so the difference of the pollutant content between the two sampling points was 70.24 %. The difference of the means ofboth TSP  and PM-10 content levels between the two sampling sites were significant. The percentages ofsampling points complying withTSP level standard were 9.52 %  (0 meter and 75.76% (120 meters from the road sides. While that of PM-10 were 18.18%  (road side sampling and 78.79% (120 meters from theroad sides.Crusial  measure for controlling theTSP  and PM-10 pollution should also be addressed tomobile sources, such as reducing diesel motorized-vehicles and providing proper mass transportation.

HiCoDG: A Hierarchical Data-Gathering Scheme Using Cooperative Multiple Mobile Elements †

Science.gov (United States)

Van Le, Duc; Oh, Hoon; Yoon, Seokhoon

2014-01-01

In this paper, we study mobile element (ME)-based data-gathering schemes in wireless sensor networks. Due to the physical speed limits of mobile elements, the existing data-gathering schemes that use mobile elements can suffer from high data-gathering latency. In order to address this problem, this paper proposes a new hierarchical and cooperative data-gathering (HiCoDG) scheme that enables multiple mobile elements to cooperate with each other to collect and relay data. In HiCoDG, two types of mobile elements are used: the mobile collector (MC) and the mobile relay (MR). MCs collect data from sensors and forward them to the MR, which will deliver them to the sink. In this work, we also formulated an integer linear programming (ILP) optimization problem to find the optimal trajectories for MCs and the MR, such that the traveling distance of MEs is minimized. Two variants of HiCoDG, intermediate station (IS)-based and cooperative movement scheduling (CMS)-based, are proposed to facilitate cooperative data forwarding from MCs to the MR. An analytical model for estimating the average data-gathering latency in HiCoDG was also designed. Simulations were performed to compare the performance of the IS and CMS variants, as well as a multiple traveling salesman problem (mTSP)-based approach. The simulation results show that HiCoDG outperforms mTSP in terms of latency. The results also show that CMS can achieve the lowest latency with low energy consumption. PMID:25526356

Concept and development of measurement method of time sensitivity profile (TSP) in X-ray CT. Comparison of non-helical, single-slice helical, and multi-slice helical scans

International Nuclear Information System (INIS)

Tsujioka, Katsumi; Ida, Yoshihiro; Ohtsubo, Hironori; Takahashi, Yasukata; Niwa, Masayoshi

2000-01-01

We focused on the time element contained in a single CT image, and devised the concept of a time-sensitivity profile (TSP) describing how the time element is translated into an image. We calculated the data collection time range when the helical pitch is changed in non helical scans, single slice helical scans, and multi slice helical scans. We then calculated the time sensitivity profile (TSP) from the weighting applied when the data collection time range is translated into an image. TSP was also measured for each scanning method using our self-made moving phantom. TSPs obtained from the calculation and the experiments were very close. TSP showed interesting characteristics with each scanning method, especially in the case of multi slice helical scanning, in which TSP became shorter as helical pitch increased. We referred to the TSP's FWHM as the effective scanning time. When we conducted multi slice helical scanning at helical pitch 3, the effective scanning time increased to about 24% longer than that of a non helical scan. When we conducted multi slice helical scanning at helical pitch 5 or 6, the effective scanning time was about half that of a non helical scan. The time sensitivity profile (TSP) is a totally new concept that we consider an important element in discussing the time resolution of a CT scanner. The results of this review will provide significant data in determining the scanning parameters when scanning a moving object. (author)

Evaluation of tunnel seismic prediction (TSP) result using the Japanese highway rock mass classification system for Pahang-Selangor Raw Water Transfer Tunnel

Science.gov (United States)

Von, W. C.; Ismail, M. A. M.

2017-10-01

The knowing of geological profile ahead of tunnel face is significant to minimize the risk in tunnel excavation work and cost control in preventative measure. Due to mountainous area, site investigation with vertical boring is not recommended to obtain the geological profile for Pahang-Selangor Raw Water Transfer project. Hence, tunnel seismic prediction (TSP) method is adopted to predict the geological profile ahead of tunnel face. In order to evaluate the TSP results, IBM SPSS Statistic 22 is used to run artificial neural network (ANN) analysis to back calculate the predicted Rock Grade Points (JH) from actual Rock Grade Points (JH) using Vp, Vs and Vp/Vs from TSP. The results show good correlation between predicted Rock Grade points and actual Rock Grade Points (JH). In other words, TSP can provide geological profile prediction ahead of tunnel face significantly while allowing continuously TBM excavation works. Identifying weak zones or faults ahead of tunnel face is crucial for preventative measures to be carried out in advance for a safer tunnel excavation works.

Finding Solutions to Different Problems Simultaneously in a Multi-molecule Simulated Reactor

Directory of Open Access Journals (Sweden)

Jaderick P. Pabico

2014-12-01

Full Text Available – In recent years, the chemical metaphor has emerged as a computational paradigm based on the observation of different researchers that the chemical systems of living organisms possess inherent computational properties. In this metaphor, artificial molecules are considered as data or solutions, while the interactions among molecules are defined by an algorithm. In recent studies, the chemical metaphor was used as a distributed stochastic algorithm that simulates an abstract reactor to solve the traveling salesperson problem (TSP. Here, the artificial molecules represent Hamiltonian cycles, while the reactor is governed by reactions that can re-order Hamiltonian cycles. In this paper, a multi-molecule reactor (MMR-n that simulates chemical catalysis is introduced. The MMR-n solves in parallel three NP-hard computational problems namely, the optimization of the genetic parameters of a plant growth simulation model, the solution to large instances of symmetric and asymmetric TSP, and the static aircraft landing scheduling problems (ALSP. The MMR-n was shown as a computational metaphor capable of optimizing the cultivar coefficients of CERES-Rice model, and at the same time, able to find solutions to TSP and ALSP. The MMR-n as a computational paradigm has a better computational wall clock time compared to when these three problems are solved individually by a single-molecule reactor (MMR-1.

Balancing emergency message dissemination and network lifetime in wireless body area network using ant colony optimization and Bayesian game formulation

Directory of Open Access Journals (Sweden)

R. Latha

Full Text Available Nowadays, Wireless Body Area Network (WBAN is emerging very fast and so many new methods and algorithms are coming up for finding the optimal path for disseminating emergency messages. Ant Colony Optimization (ACO is one of the cultural algorithms for solving many hard problems such as Travelling Salesman Problem (TSP. ACO is a natural behaviour of ants, which work stochastically with the help of pheromone trails deposited in the shortest route to find their food. This optimization procedure involves adapting, positive feedback and inherent parallelism. Each ant will deposit certain amount of pheromone in the tour construction it makes searching for food. This type of communication is known as stigmetric communication. In addition, if a dense WBAN environment prevails, such as hospital, i.e. in the environment of overlapping WBAN, game formulation was introduced for analyzing the mixed strategy behaviour of WBAN. In this paper, the ant colony optimization approach to the travelling salesman problem was applied to the WBAN to determine the shortest route for sending emergency message to the doctor via sensor nodes; and also a static Bayesian game formulation with mixed strategy was analysed to enhance the network lifetime. Whenever the patient needs any critical care or any other medical issue arises, emergency messages will be created by the WBAN and sent to the doctor's destination. All the modes of communication were realized in a simulation environment using OMNet++. The authors investigated a balanced model of emergency message dissemination and network lifetime in WBAN using ACO and Bayesian game formulation. Keywords: Wireless body area network, Ant colony optimization, Bayesian game model, Sensor network, Message latency, Network lifetime

Sabiedriskās ēdināšanas uzņēmuma konkurētspējas analīze

OpenAIRE

Beinaroviča, Kristīne

2011-01-01

Bakalaura darbs „Sabiedriskās ēdināšanas uzņēmuma konkurētspējas analīze”. Darba mērķis ir izpētīt SIA „G & K” restorāna „Zilā govs” konkurētspēju un izstrādāt priekšlikumus tās uzlabošanai. Bakalaura darba pirmajā nodaļā pētīti konkurences un konkurētspējas teorētiskie aspekti, otrajā nodaļā raksturota nozare, kurā uzņēmums darbojas, valsts ekonomiskās lejupslīdes kontekstā, veikta nozares vides analīze, izmantojot M.E.Portera 5 spēku modeli. Trešajā nodaļā raksturota uzņēmuma vēsturiskā ...

Heuristics for NP-hard optimization problems - simpler is better!?

Directory of Open Access Journals (Sweden)

Žerovnik Janez

2015-11-01

Full Text Available We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard optimization problems. In addition, generation of starting solutions by greedy heuristics should be at least considered as one of very natural possibilities. In this critical survey, selected examples discussed include the traveling salesman, the resource-constrained project scheduling, the channel assignment, and computation of bounds for the Shannon capacity.

Experimental and numerical study of deposit formation in secondary side SG TSP by electrokinetic approach

International Nuclear Information System (INIS)

Guillodo, Michael; Foucault, Marc; Ryckelynck, Natacha; Chahma, Farah; Guingo, Mathieu; Mansour, Carine; Alos-Ramos, Olga; Corredera, Geraldine

2012-09-01

Corrosion products deposit formation observed in PWR steam generators (SGs) - related to SG free span fouling and SG clogging - is now reported since several years. SG clogging is a localized phenomenon observed between the leading edge of the Tube Support Plate (TSP) and SG tubing materials. Based on visual inspections, it was found that the gaps between SG tubing material and TSP at the lower part of the broached holes were getting progressively blocked. Therefore, for safe operation, most affected PWRs had to be operated at reduced power. TSP blockage was mainly observed for low-pH water chemistry conditioning, which directly depends on the operating water chemistry. The TSP blockage mechanism is complex due to the localized conditions in which flow pattern change, chemistry and electrochemical conditions are not well understood. Electrokinetic considerations could be pointed out to explain the coupling of chemistry, materials and thermohydraulic (T/H) conditions. In this frame AREVA and EDF have launched a long-term R and D program in order to understand the mechanisms driving the formation of SG clogging. This study based on parametric laboratory tests aims to assess the role of secondary water chemistry, material and T/H conditions on deposit formation. The experimental approach focused on electrokinetic measurements of metallic substrates and on the assessment of oxidation properties of materials in secondary side chemistry. An overall analysis of recent results is presented to address SG deposit formation in secondary water chemistry for various conditioning amines - morpholine, ethanolamine and dimethylamine. To complete the study, the experimental results have been correlated to CFD simulations of particle deposition, by means of stochastic Lagrangian models. These calculations have in particular reproduced correctly the location of the most important particle deposit (the leading edge of the test tube), and have stressed the influence of the

Nucleotide sequence analysis of HTLV-I isolated from cerebrospinal fluid of a patient with TSP/HAM: comparison to other HTLV-I isolates.

Science.gov (United States)

Mukhopadhyaya, R; Sadaie, M R

1993-02-01

Human T-cell leukemia virus type I (HTLV-I) has been associated with adult T-cell leukemia/lymphoma and the chronic neurologic disorder tropical spastic paraparesis/HTLV-I-associated myelopathy (TSP/HAM). To study the genetic structure of the virus associated with TSP/HAM, we have obtained and sequenced a partial genomic clone from an HTLV-I-positive cell line established from cerebrospinal fluid (CSF) of a Jamaican patient with TSP/HAM. This clone consisted of a 4.3-kb viral sequence containing the 5' long terminal repeat (LTR), gag, and N-terminal portion of the pol gene, with an overall 1.3% sequence variation resulting from mostly nucleotide substitutions, as compared to the prototype HTLV-I ATK-1. The gag and pol regions showed only 1.4% and 1.2% nucleotide variations, respectively. However, the U3 region of the LTR showed the highest sequence variation (3.6%), where several changes appear to be common among certain TSP/HAM isolates. Several of these changes reside within the 21-bp boundaries and the Tax-responsive element. It would be important to determine if the observed changes are sufficient to cause neurologic disorders similar to the murine leukemia virus system or simply reflect the divergent pool of HTLV-I from different geographic locations. At this time, we cannot rule out the possibility that the observed changes have either direct or indirect significance for the HTLV-I pathogenesis in TSP/HAM.

Role of IL-21 in HTLV-1 infections with emphasis on HTLV-1-associated myelopathy/tropical spastic paraparesis (HAM/TSP).

Science.gov (United States)

Rajaei, Taraneh; Farajifard, Hamid; Rafatpanah, Houshang; Bustani, Reza; Valizadeh, Narges; Rajaei, Bahareh; Rezaee, Seyed Abdolrahim

2017-06-01

Interleukin-21 (IL-21) enhances the survival and cytotoxic properties of cytotoxic T cells (CTLs) and exhibits essential roles in controlling chronic viral infections. HTLV-1-associated myelopathy/tropical spastic paraparesis (HAM/TSP) is a chronic progressive inflammatory disease of the nervous system. The main determinant of disease progression is efficiency of the CTL response to Human T lymphotropic virus types I (HTLV-1). In this study, the expression of host IL-21 and HTLV-I Tax and proviral load (PVL) was evaluated to understand the role and mechanism of IL-21 in HTLV-1 infections and the subsequent development of HAM/TSP. A cross-sectional study was carried out on 20 HAM/TSP patients, 20 asymptomatic HTLV-1 carriers (ACs) and 20 healthy controls (HCs) to evaluate the expression of IL-21 and Tax and PVL in non-activated and phorbol myristate acetate (PMA)-ionomycin-activated peripheral blood mononuclear cells (PBMCs). The mean mRNA expression of IL-21 in the non-activated and activated PBMCs was higher (by 5-13 times) in the HAM/TSP patients than in ACs and HCs (p Tax and PVL was observed in the HAM/TSP subjects than ACs (p Tax gene expression was positively correlated with PVL (R = 0.595, p = 0.000) and IL-21 gene expression (R = 0.395, p = 0.021) in the HTLV-1-infected subjects. In conclusion, the increase in IL-21 mRNA expression may reflect the attempt of infected T cells to induce an appropriate antiviral response, and the decrease in IL-21 protein expression may reflect the inhibition of IL-21 mRNA translation by viral factors in favour of virus evasion and dissemination.

Fast and Efficient Discrimination of Traveling Salesperson Problem Stimulus Difficulty

Science.gov (United States)

Dry, Matthew J.; Fontaine, Elizabeth L.

2014-01-01

The Traveling Salesperson Problem (TSP) is a computationally difficult combinatorial optimization problem. In spite of its relative difficulty, human solvers are able to generate close-to-optimal solutions in a close-to-linear time frame, and it has been suggested that this is due to the visual system's inherent sensitivity to certain geometric…

Uzņēmuma McDonalds konkurētspējas novērtēšanas un tās uzlabošanas iespējas

OpenAIRE

Artemjeva, Anžela

2012-01-01

Bakalaura darba tēma – „Uzņēmuma McDonalds konkurētspējas novērtēšana un tās uzlabošanas iespējas”. Bakalaura darba mērķis-pamatojoties uz teorētiskām atziņām par konkurenci un konkurētspēju, izpētīt SIA McDonalds konkurētspēju tirgū un tās pilnveidošanas iespējas balstoties uz Latvijas, Lietuvas un Igaunijas investīciju nozares analīzes datu rezultātiem, izdarīt secinājumus un sniegt priekšlikumus SIA McDonalds konkurētspējas uzlabošanai. Bakalaura darba izstrādes gaitā autore ir izstr...

On the Core of Routing Games with Revenues

NARCIS (Netherlands)

A. Estévez-Fernandéz (Arantza); P. Borm; M. Meertens; H. Reijnierse

2006-01-01

htmlabstract Traveling salesman problems with revenues form a generalization of traveling salesman problems. Here, next to travel costs an explicit revenue is generated by visiting a city. We analyze routing problems with revenues, where a predetermined route on all cities determines the tours

On the Core of Routing Games with Revenues

NARCIS (Netherlands)

Estevez Fernandez, M.A.; Borm, P.E.M.; Meertens, M.; Reijnierse, J.H.

2006-01-01

Traveling salesman problems with revenues form a generalization of traveling salesman problems.Here, next to travel costs an explicit revenue is generated by visiting a city.We analyze routing problems with revenues, where a predetermined route on all cities determines the tours along

Use of Gray code in PBIL algorithm for application in recharge of nuclear fuels; Utilização do código Gray no algoritmo PBIL para aplicação na recarga de combustíveis nucleares

Energy Technology Data Exchange (ETDEWEB)

Nast, Fernando N.; Silva, Patrick V.; Meneses, Anderson A. M., E-mail: anderson.meneses@pq.cnpq.br [Universidade Federal do Oeste do Para (UNIOESTE), Santarem, PA (Brazil). Lab. de Inteligencia Computacional; Schirru, Roberto, E-mail: schirru@lmp.ufrj.br [Coordenacao de Pos-Graduacao e Pesquisa de Engenharia (COPPE/UFRJ), Rio de Janeiro, RJ (Brazil). Lab. de Monitoracao de Processos

2017-07-01

The In-Core Fuel Management Optimization (OGCIN) problem, or design optimization of Load Patterns (PCs) are denominations for the optimization problem associated with the refueling operation in a reactor nuclear. The OCGIN is considered a problem of difficult resolution, considering aspects of combinatorial optimization and calculations of analysis and physics of reactors. In order to validate algorithms for the OGCIN solution, we use benchmark problems such as the Travelling Salesman Problem (TSP), because it is considered, like OGCIN, an NP-difficult problem. In the present work, we implemented the Population-Based Incremental Learning (PBIL) algorithm with binary coding and Gray coding and applied them to the optimization of the symmetric PCV Oliver30 and Rykel48 asymmetric PCV and implemented only the Gray coding in the OGCIN application of the cycle 7 of the Angra-1 Nuclear Plant, where we compared its performance with binary coding in. The results on average were 1311 and 1327 ppm of Boron for the binary and Gray codifications respectively, emphasizing that the binary codification obtained a maximum value of 1330 ppm, while the Gray code obtained a value of 1401 ppm, showing superiority, since the Boron concentration is an indicator of the PC cycle extension.

Use of Gray code in PBIL algorithm for application in recharge of nuclear fuels

International Nuclear Information System (INIS)

Nast, Fernando N.; Silva, Patrick V.; Meneses, Anderson A. M.; Schirru, Roberto

2017-01-01

The In-Core Fuel Management Optimization (OGCIN) problem, or design optimization of Load Patterns (PCs) are denominations for the optimization problem associated with the refueling operation in a reactor nuclear. The OCGIN is considered a problem of difficult resolution, considering aspects of combinatorial optimization and calculations of analysis and physics of reactors. In order to validate algorithms for the OGCIN solution, we use benchmark problems such as the Travelling Salesman Problem (TSP), because it is considered, like OGCIN, an NP-difficult problem. In the present work, we implemented the Population-Based Incremental Learning (PBIL) algorithm with binary coding and Gray coding and applied them to the optimization of the symmetric PCV Oliver30 and Rykel48 asymmetric PCV and implemented only the Gray coding in the OGCIN application of the cycle 7 of the Angra-1 Nuclear Plant, where we compared its performance with binary coding in. The results on average were 1311 and 1327 ppm of Boron for the binary and Gray codifications respectively, emphasizing that the binary codification obtained a maximum value of 1330 ppm, while the Gray code obtained a value of 1401 ppm, showing superiority, since the Boron concentration is an indicator of the PC cycle extension

Integrating packing and distribution problems and optimization through mathematical programming

Directory of Open Access Journals (Sweden)

Fabio Miguel

2016-06-01

Full Text Available This paper analyzes the integration of two combinatorial problems that frequently arise in production and distribution systems. One is the Bin Packing Problem (BPP problem, which involves finding an ordering of some objects of different volumes to be packed into the minimal number of containers of the same or different size. An optimal solution to this NP-Hard problem can be approximated by means of meta-heuristic methods. On the other hand, we consider the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW, which is a variant of the Travelling Salesman Problem (again a NP-Hard problem with extra constraints. Here we model those two problems in a single framework and use an evolutionary meta-heuristics to solve them jointly. Furthermore, we use data from a real world company as a test-bed for the method introduced here.

On the core of routing games with revenues

NARCIS (Netherlands)

Estevez Fernandez, M.A.; Borm, P.; Meertens, M.; Reijnierse, H.

2009-01-01

Traveling salesman problems with revenues form a generalization of traveling salesman problems. Here, next to travel costs an explicit revenue is generated by visiting a city. We analyze routing problems with revenues, where a predetermined route on all cities determines the tours along subgroups.

Search Problems in Mission Planning and Navigation of Autonomous Aircraft. M.S. Thesis

Science.gov (United States)

Krozel, James A.

1988-01-01

An architecture for the control of an autonomous aircraft is presented. The architecture is a hierarchical system representing an anthropomorphic breakdown of the control problem into planner, navigator, and pilot systems. The planner system determines high level global plans from overall mission objectives. This abstract mission planning is investigated by focusing on the Traveling Salesman Problem with variations on local and global constraints. Tree search techniques are applied including the breadth first, depth first, and best first algorithms. The minimum-column and row entries for the Traveling Salesman Problem cost matrix provides a powerful heuristic to guide these search techniques. Mission planning subgoals are directed from the planner to the navigator for planning routes in mountainous terrain with threats. Terrain/threat information is abstracted into a graph of possible paths for which graph searches are performed. It is shown that paths can be well represented by a search graph based on the Voronoi diagram of points representing the vertices of mountain boundaries. A comparison of Dijkstra's dynamic programming algorithm and the A* graph search algorithm from artificial intelligence/operations research is performed for several navigation path planning examples. These examples illustrate paths that minimize a combination of distance and exposure to threats. Finally, the pilot system synthesizes the flight trajectory by creating the control commands to fly the aircraft.

The motor evoked potential in aids and HAM/TSP State of the evidence El potencial evocado motor en SIDA y HAM/PET

Directory of Open Access Journals (Sweden)

Fidias E. Leon-Sarmiento

2009-12-01

Full Text Available OBJECTIVE: We aimed to better understand the involvement of the corticospinal tract, assessed by non-invasive transcranial stimulation, in order to determine the actual involvement of the motor system in patients with HAM/TSP and AIDS. METHOD: An exhaustive MEDLINE search for the period of 1985 to 2008 for all articles cross-referenced for "HTLV-I, HTLV-II, HTLV-III and HIV, HIV1, HIV2, evoked potential, motor evoked potential, high voltage electrical stimulation, transcranial magnetic stimulation, magnetic stimulation, corticomotor physiology, motor pathways, acquired immunodeficiency syndrome, AIDS, SIDA, tropical spastic paraparesis, HTLV-I-associated myelopathy, HAM, TSP, and HAM/TSP" were selected and analysed. RESULTS: Eighteen papers published in English, Spanish, Portuguese, French and Japanese were identified. Only the central motor conduction time has been analyzed in seropositive patients to human retroviruses. The investigations done on HAM/TSP support the involvement of the pyramidal tract mainly at lower levels, following a centripetal pattern; in AIDS, such an involvement seems to be more prominent at brain levels following a centrifugal pattern. CONCLUSION: The central motor conduction time abnormalities and involvement differences of the corticospinal tract of patients with AIDS and HAM/TSP dissected here would allow to re-orient early neurorehabilitation measures in these retroviruses-associated neurodegenerative disorders. Besides this, more sophisticated and sensitive non-invasive corticospinal stimulation measures that detect early changes in thalamocortical-basal ganglia circuitry will be needed in both clinically established as well as asymptomatic patients at times when the fastest corticospinal fibers remain uninvolved.OBJETIVO: Investigar el compromiso del tracto piramidal, evaluado por estimulación trascranial no invasiva, en pacientes afectados por SIDA y HAM/TSP. MÉTODO: Se realizó una búsqueda en la base de

The Total Synthesis Problem of linear multivariable control. II - Unity feedback and the design morphism

Science.gov (United States)

Sain, M. K.; Antsaklis, P. J.; Gejji, R. R.; Wyman, B. F.; Peczkowski, J. L.

1981-01-01

Zames (1981) has observed that there is, in general, no 'separation principle' to guarantee optimality of a division between control law design and filtering of plant uncertainty. Peczkowski and Sain (1978) have solved a model matching problem using transfer functions. Taking into consideration this investigation, Peczkowski et al. (1979) proposed the Total Synthesis Problem (TSP), wherein both the command/output-response and command/control-response are to be synthesized, subject to the plant constraint. The TSP concept can be subdivided into a Nominal Design Problem (NDP), which is not dependent upon specific controller structures, and a Feedback Synthesis Problem (FSP), which is. Gejji (1980) found that NDP was characterized in terms of the plant structural matrices and a single, 'good' transfer function matrix. Sain et al. (1981) have extended this NDP work. The present investigation is concerned with a study of FSP for the unity feedback case. NDP, together with feedback synthesis, is understood as a Total Synthesis Problem.

Parallel Framework for Cooperative Processes

Directory of Open Access Journals (Sweden)

Mitică Craus

2005-01-01

Full Text Available This paper describes the work of an object oriented framework designed to be used in the parallelization of a set of related algorithms. The idea behind the system we are describing is to have a re-usable framework for running several sequential algorithms in a parallel environment. The algorithms that the framework can be used with have several things in common: they have to run in cycles and the work should be possible to be split between several "processing units". The parallel framework uses the message-passing communication paradigm and is organized as a master-slave system. Two applications are presented: an Ant Colony Optimization (ACO parallel algorithm for the Travelling Salesman Problem (TSP and an Image Processing (IP parallel algorithm for the Symmetrical Neighborhood Filter (SNF. The implementations of these applications by means of the parallel framework prove to have good performances: approximatively linear speedup and low communication cost.

Saharan dust contributions to PM10 and TSP levels in Southern and Eastern Spain

Science.gov (United States)

Rodríguez, S.; Querol, X.; Alastuey, A.; Kallos, G.; Kakaliagou, O.

The analysis of PM10 and TSP levels recorded in rural areas from Southern and Eastern Spain (1996-1999) shows that most of the PM10 and TSP peak events are simultaneously recorded at monitoring stations up to 1000 km apart. The study of the atmospheric dynamics by back-trajectory analysis and simulations with the SKIRON Forecast System show that these high PM10 and TSP events occur when high-dust Saharan air masses are transported over the Iberian Peninsula. In the January-June period, this dust transport is mainly caused by cyclonic activity over the West or South of Portugal, whereas in the summer period this is induced by anticyclonic activity over the East or Southeast Iberian Peninsula. Most of the Saharan intrusions which exert a major influence on the particulate levels occur from May to September (63%) and in January and October. In rural areas in Northeast Spain, where the PM10 annual mean is around 18 μg PM10 m -3, the Saharan dust accounts for 4-7 annual daily exceedances of the forthcoming PM10-EU limit value (50 μg PM10 m -3 daily mean). Higher PM10 background levels are recorded in Southern Spain (30 μg PM10 m -3 as annual mean for rural areas) and very similar values are recorded in industrial and urban areas. In rural areas in Southern Spain, the Saharan dust events accounts for 10-23 annual daily exceedances of the PM10 limit value, a high number when compared with the forthcoming EU standard, which states that the limit value cannot be exceeded more than 7 days per year. The proportion of Sahara-induced exceedances with respect to the total annual exceedances is discussed for rural, urban and industrial sites in Southern Spain.

An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints

Directory of Open Access Journals (Sweden)

Jinmo Sung

2014-01-01

Full Text Available Traveling sales man problem with precedence constraints is one of the most notorious problems in terms of the efficiency of its solution approach, even though it has very wide range of industrial applications. We propose a new evolutionary algorithm to efficiently obtain good solutions by improving the search process. Our genetic operators guarantee the feasibility of solutions over the generations of population, which significantly improves the computational efficiency even when it is combined with our flexible adaptive searching strategy. The efficiency of the algorithm is investigated by computational experiments.

Polynomial Approximation Algorithms for the TSP and the QAP with a Factorial Domination Number

DEFF Research Database (Denmark)

Gutin, Gregory; Yeo, Anders

2002-01-01

Glover and Punnen (J. Oper. Res. Soc. 48 (1997) 502) asked whether there exists a polynomial time algorithm that always produces a tour which is not worse than at least n!/p(n) tours for some polynomial p(n) for every TSP instance on n cities. They conjectured that, unless P = NP, the answer to t...

DNA Vaccine Encoding the Chimeric Form of Schistosoma mansoni Sm-TSP2 and Sm29 Confers Partial Protection against Challenge Infection.

Directory of Open Access Journals (Sweden)

Natan Raimundo Gonçalves de Assis

Full Text Available Schistosomiasis is an important parasitic disease worldwide that affects more than 207 million people in 76 countries and causes approximately 250,000 deaths per year. The best long-term strategy to control schistosomiasis is through immunization combined with drug treatment. Due to the ability of DNA vaccines to generate humoral and cellular immune responses, such vaccines are considered a promising approach against schistosomiasis. Sm29 and tetraspanin-2 (Sm-TSP2 are two proteins that are located in the S. mansoni tegument of adult worms and schistosomula and induce high levels of protection through recombinant protein immunization. In this study, we transfected BHK-21 cells with plasmids encoding Sm29, Sm-TSP2 or a chimera containing both genes. Using RT-PCR analysis and western blot, we confirmed that the DNA vaccine constructs were transcribed and translated, respectively, in BHK-21 cells. After immunization of mice, we evaluated the reduction in worm burden. We observed worm burden reductions of 17-22%, 22%, 31-32% and 24-32% in animals immunized with the pUMVC3/Sm29, pUMVC3/SmTSP-2, pUMVC3/Chimera and pUMVC3/Sm29 + pUMVC3/SmTSP-2 plasmids, respectively. We evaluated the humoral response elicited by DNA vaccines, and animals immunized with pUMVC3/Sm29 and pUMVC3/Sm29 + pUMVC3/SmTSP-2 showed higher titers of anti-Sm29 antibodies. The cytokine profile produced by the spleen cells of immunized mice was then evaluated. We observed higher production of Th1 cytokines, such as TNF-α and IFN-γ, in vaccinated mice and no significant production of IL-4 and IL-5. The DNA vaccines tested in this study showed the ability to generate a protective immune response against schistosomiasis, probably through the production of Th1 cytokines. However, future strategies aiming to optimize the protective response induced by a chimeric DNA construct need to be developed.

DNA Vaccine Encoding the Chimeric Form of Schistosoma mansoni Sm-TSP2 and Sm29 Confers Partial Protection against Challenge Infection

Science.gov (United States)

Gonçalves de Assis, Natan Raimundo; Batistoni de Morais, Suellen; Figueiredo, Bárbara Castro Pimentel; Ricci, Natasha Delaqua; de Almeida, Leonardo Augusto; da Silva Pinheiro, Carina; Martins, Vicente de Paulo; Oliveira, Sergio Costa

2015-01-01

Schistosomiasis is an important parasitic disease worldwide that affects more than 207 million people in 76 countries and causes approximately 250,000 deaths per year. The best long-term strategy to control schistosomiasis is through immunization combined with drug treatment. Due to the ability of DNA vaccines to generate humoral and cellular immune responses, such vaccines are considered a promising approach against schistosomiasis. Sm29 and tetraspanin-2 (Sm-TSP2) are two proteins that are located in the S. mansoni tegument of adult worms and schistosomula and induce high levels of protection through recombinant protein immunization. In this study, we transfected BHK-21 cells with plasmids encoding Sm29, Sm-TSP2 or a chimera containing both genes. Using RT-PCR analysis and western blot, we confirmed that the DNA vaccine constructs were transcribed and translated, respectively, in BHK-21 cells. After immunization of mice, we evaluated the reduction in worm burden. We observed worm burden reductions of 17-22%, 22%, 31-32% and 24-32% in animals immunized with the pUMVC3/Sm29, pUMVC3/SmTSP-2, pUMVC3/Chimera and pUMVC3/Sm29 + pUMVC3/SmTSP-2 plasmids, respectively. We evaluated the humoral response elicited by DNA vaccines, and animals immunized with pUMVC3/Sm29 and pUMVC3/Sm29 + pUMVC3/SmTSP-2 showed higher titers of anti-Sm29 antibodies. The cytokine profile produced by the spleen cells of immunized mice was then evaluated. We observed higher production of Th1 cytokines, such as TNF-α and IFN-γ, in vaccinated mice and no significant production of IL-4 and IL-5. The DNA vaccines tested in this study showed the ability to generate a protective immune response against schistosomiasis, probably through the production of Th1 cytokines. However, future strategies aiming to optimize the protective response induced by a chimeric DNA construct need to be developed. PMID:25942636

Advanced evaluation method of SG TSP BEC hole blockage rate

International Nuclear Information System (INIS)

Izumida, Hiroyuki; Nagata, Yasuyuki; Harada, Yutaka; Murakami, Ryuji

2003-01-01

In spite of the control of the water chemistry of SG secondary feed-water in PWR-SG, SG TSP BEC holes, which are the flow path of secondary water, are often clogged. In the past, the trending of BEC hole blockage rate has conducted by evaluating ECT original signals and visual inspections. However, the ECT original signals of deposits are diversified, it becomes difficult to analyze them with the existing evaluation method using the ECT original signals. In this regard, we have developed the secondary side visual inspection system, which enables the high-accuracy evaluation of BEC hole blockage rate, and new ECT signal evaluation method. (author)

Solving optimization problems by the public goods game

Science.gov (United States)

Javarone, Marco Alberto

2017-09-01

We introduce a method based on the Public Goods Game for solving optimization tasks. In particular, we focus on the Traveling Salesman Problem, i.e. a NP-hard problem whose search space exponentially grows increasing the number of cities. The proposed method considers a population whose agents are provided with a random solution to the given problem. In doing so, agents interact by playing the Public Goods Game using the fitness of their solution as currency of the game. Notably, agents with better solutions provide higher contributions, while those with lower ones tend to imitate the solution of richer agents for increasing their fitness. Numerical simulations show that the proposed method allows to compute exact solutions, and suboptimal ones, in the considered search spaces. As result, beyond to propose a new heuristic for combinatorial optimization problems, our work aims to highlight the potentiality of evolutionary game theory beyond its current horizons.

USING GENETIC ALGORTIHM TO SOLVE STEINER MINIMUM SPANNING TREE PROBLEM

Directory of Open Access Journals (Sweden)

Öznur İŞÇİ

2006-03-01

Full Text Available Genetic algorithms (GA are a stochastic research methods, and they produce solutions that are close to optimum or near optimum. In addition to GA's successful application to traveling salesman problem, square designation, allocation, workshop table, preparation of lesson/examination schedules, planning of communication networks, assembling line balanced, minimum spanning tree type many combinatorial optimization problems it would be applicable to make the best comparison in optimization. In this study a Java program is developed to solve Steiner minimum spanning tree problem by genetic algorithm and its performance is examined. According to the tests carried out on the problems that were given before in the literature, results that are close to optimum are obtained in by GA approach that is recommended in this study. For the predetermined points in the study, length and gain are calculated for Steiner minimum spanning tree problem and minimum spanning tree problem.

Inventory slack routing application in emergency logistics and relief distributions.

Science.gov (United States)

Yang, Xianfeng; Hao, Wei; Lu, Yang

2018-01-01

Various natural and manmade disasters during last decades have highlighted the need of further improving on governmental preparedness to emergency events, and a relief supplies distribution problem named Inventory Slack Routing Problem (ISRP) has received increasing attentions. In an ISRP, inventory slack is defined as the duration between reliefs arriving time and estimated inventory stock-out time. Hence, a larger inventory slack could grant more responsive time in facing of various factors (e.g., traffic congestion) that may lead to delivery lateness. In this study, the relief distribution problem is formulated as an optimization model that maximize the minimum slack among all dispensing sites. To efficiently solve this problem, we propose a two-stage approach to tackle the vehicle routing and relief allocation sub-problems. By analyzing the inter-relations between these two sub-problems, a new objective function considering both delivery durations and dispensing rates of demand sites is applied in the first stage to design the vehicle routes. A hierarchical routing approach and a sweep approach are also proposed in this stage. Given the vehicle routing plan, the relief allocation could be easily solved in the second stage. Numerical experiment with a comparison of multi-vehicle Traveling Salesman Problem (TSP) has demonstrated the need of ISRP and the capability of the proposed solution approaches.

Practical application of a field work information support system for one-stop service; One stoop service wo mezashita genchi sagyo joho shien system no jitsuyoka kenkyu

Energy Technology Data Exchange (ETDEWEB)

Ishikawa, M. [Kansai Electric Power Co. Inc., Osaka (Japan)

1998-04-10

This paper reports the current research result of the field work information support system in a one-stop service system. The work arrangement in the branch office of an electric company is how to assign the service operator efficiently and accurately for the transfer to the customer. This problem is grasped as a traveling salesman problem (TSP) of `make the round of `n` works by `m` persons for processing and return to the branch office with the branch office as a start point`. The system in which the day`s schedule of each operator can be automatically created by entering only the work schedule (including limitation conditions (difficulty degree of work contents or time appointment) and skill management information of each work) was investigated. The compatibility and evaluation of each traveling route search method were carried out. As a result, the genetic algorithm is judged to be fully practical. The communication information for field work could be retrieved in real time using PHS. This system can also be applied to the maintenance or consulting including a disaster or accident as well as general work. 4 figs., 1 tab.

THE ABERRANT PROMOTER HYPERMETHYLATION PATTERN OF THE ANTI - ANGIOGENIC TSP1 GENE IN EPITHELIAL OVARIAN CARCINOMA: AN INDIAN STUDY

Directory of Open Access Journals (Sweden)

Ramesh

2015-06-01

Full Text Available PURPOSE: The promoter hypermethylation patterns of Thrombospodin - 1 gene in 50 EOC patients were studied and the methylation pattern was correlated with various clinic pathological parameters. METHODS: The promoter hypermethylation pattern of the TSP - 1 gene was assessed using nested PCR and Methylation specific PCR. STATISTICAL ANALYSIS: All the available data was statistically analyzed using the Chi square test or Fisher Exact Test on the SPSS software version 22.0 and a value <0.0 5 was considered statistically significant. RESULTS: Forty of the fifty ovarian carcinoma samples reported positive for methylation corresponding to a methylation frequency of 80%. A methylation frequency of 89.2%, 83.3% and 42.8% was observed in malignant , Low malignant potential (borderline and benign sample cohorts. CONCLUSION: From the results drawn from this study, it clearly shows that the anti angiogenic protein TSP - 1 is extensively hypermethylated in ovarian carcinoma and that it accumulates over t he progression of the disease from benign to malignant. As previous reports suggest that there is no evidence of mutation of this gene, promoter hypermethylation may be a crucial factor for the down regulation of the gene. Further by clubbing together the promoter hypermethylation pattern of TSP - 1 gene with hypermethylation patterns of other TSG may provide a better insight into the application of using methylation profiles of TSG as a biomarker in the detection of ovarian carcinoma.

TSP, PM10, and PM2.5 emissions from a beef cattle feedlot using the flux-gradient technique

Science.gov (United States)

Emissions data on air pollutants from large open-lot beef cattle feedlots are limited. This research was conducted to determine emissions of total suspended particulates (TSP) and particulate matter (PM10 and PM2.5) from a commercial beef cattle feedlot in Kansas (USA). Vertical particulate concentr...

41 CFR 102-118.45 - How does a transportation service provider (TSP) bill my agency for transportation and...

Science.gov (United States)

2010-07-01

... (b) Billing method (1)(i) Government issued agency charge card, (1) Bill from charge card company (may be electronic). (ii) Centrally billed travel account citation. (2)(i) Purchase order, (2) Bill from TSP (may be electronic). (ii) Bill of lading, (iii) Government Bill of Lading, (iv) Government...

Corrosion and solubility in a TSP-buffered chemical environment following a loss of coolant accident: Part 4 – Integrated chemical effects testing

Energy Technology Data Exchange (ETDEWEB)

Ali, Amir; LaBrier, Daniel [Department of Nuclear Engineering, University of New Mexico (United States); Blandford, Edward, E-mail: edb@unm.edu [Department of Nuclear Engineering, University of New Mexico (United States); Howe, Kerry [Department of Civil Engineering, University of New Mexico (United States)

2016-04-15

Highlights: • Integrated test explored the material release of a postulated large break LOCA. • Aluminum concentration was very low (<0.1 mg/L) throughout the test duration. • Zinc concentration was low (<1 mg/L) in TSP-buffered system. • Calcium release showed two distinguished release zones: prompt and meta-stable. • Copper and iron has no distinguishable concentration up to first 24 h of testing. - Abstract: This paper presents the results of an integrated chemical effects experiment executed under conditions representative of the containment pool following a postulated loss of coolant accident (LOCA) at the Vogtle nuclear power plant, operated by the Southern Nuclear Operating Company (SNOC). This test was conducted for closure of a series of bench scale experiments conducted to investigate the effect of the presence of trisodium phosphate (TSP) on the corrosion and release of aluminum (Howe et al., 2015) and zinc (Pease et al., 2015) from metallic surfaces, and calcium from NUKON fiberglass insulation (Olson et al., 2015) . The integrated test was performed in the Corrosion/Chemical Head Loss Experimental (CHLE) facility with representative amounts of zinc, aluminum, carbon steel, copper, NUKON fiberglass, and latent debris. The test was conducted using borated TSP-buffered solution under a post-LOCA prototypical temperature profile lasting for 30 days. The results presented in this article demonstrate trends for zinc, aluminum, and calcium release that are consistent with separate bench scale testing and previous integrated tests under TSP conditions. The release rate and maximum concentrations of the released materials were slightly different than the separate effect testing as a result of different experimental conditions (temperature, surface area-to-water volume ratio) and/or the presence of other metals and chemicals in the integrated test. Samples of metal coupons and fiberglass were selected for analysis using Scanning Electron Microscopy

Corrosion and solubility in a TSP-buffered chemical environment following a loss of coolant accident: Part 4 – Integrated chemical effects testing

International Nuclear Information System (INIS)

Ali, Amir; LaBrier, Daniel; Blandford, Edward; Howe, Kerry

2016-01-01

Highlights: • Integrated test explored the material release of a postulated large break LOCA. • Aluminum concentration was very low (<0.1 mg/L) throughout the test duration. • Zinc concentration was low (<1 mg/L) in TSP-buffered system. • Calcium release showed two distinguished release zones: prompt and meta-stable. • Copper and iron has no distinguishable concentration up to first 24 h of testing. - Abstract: This paper presents the results of an integrated chemical effects experiment executed under conditions representative of the containment pool following a postulated loss of coolant accident (LOCA) at the Vogtle nuclear power plant, operated by the Southern Nuclear Operating Company (SNOC). This test was conducted for closure of a series of bench scale experiments conducted to investigate the effect of the presence of trisodium phosphate (TSP) on the corrosion and release of aluminum (Howe et al., 2015) and zinc (Pease et al., 2015) from metallic surfaces, and calcium from NUKON fiberglass insulation (Olson et al., 2015) . The integrated test was performed in the Corrosion/Chemical Head Loss Experimental (CHLE) facility with representative amounts of zinc, aluminum, carbon steel, copper, NUKON fiberglass, and latent debris. The test was conducted using borated TSP-buffered solution under a post-LOCA prototypical temperature profile lasting for 30 days. The results presented in this article demonstrate trends for zinc, aluminum, and calcium release that are consistent with separate bench scale testing and previous integrated tests under TSP conditions. The release rate and maximum concentrations of the released materials were slightly different than the separate effect testing as a result of different experimental conditions (temperature, surface area-to-water volume ratio) and/or the presence of other metals and chemicals in the integrated test. Samples of metal coupons and fiberglass were selected for analysis using Scanning Electron Microscopy

A neural network approach to the orienteering problem

Energy Technology Data Exchange (ETDEWEB)

Golden, B.; Wang, Q.; Sun, X.; Jia, J.

1994-12-31

In the orienteering problem, we are given a transportation network in which a start point and an end point are specified. Other points have associated scores. Given a fixed amount of time, the goal is to determine a path from start to end through a subset of locations in order to maximize the total path score. This problem has received a considerable amount of attention in the last ten years. The TSP is a variant of the orienteering problem. This paper applies a modified, continuous Hopfield neural network to attack this NP-hard optimization problem. In it, we design an effective energy function and learning algorithm. Unlike some applications of neural networks to optimization problems, this approach is shown to perform quite well.

Analysis of the Effectiveness of the Retire Tool When Deciding Between High 36 Retirement and Blended TSP Retirement

Science.gov (United States)

2016-12-01

22202-4302, and to the Office of Management and Budget , Paperwork Reduction Project (0704-0188) Washington DC 20503. 1. AGENCY USE ONLY (Leave...VALUE OF THE TSP ...........16 D. ELEMENTS OF RETIRE TOOL ANALYSIS .....................................18 1. Cash Flow Analysis...23 3. Cash Flow Comparison ...............................................................24 4. Volatility Analysis

Serum levels of TSP-1, NF-κB and TGF-β1 in polycystic ovarian syndrome (PCOS) patients in northern China suggest PCOS is associated with chronic inflammation.

Science.gov (United States)

Liu, Meimei; Gao, Jiayin; Zhang, Yanhua; Li, Peiling; Wang, Hongli; Ren, Xiaopang; Li, Changmin

2015-12-01

The objective of this study was to determine the levels of thrombospondin-1 (TSP-1), transforming growth factor-β1 (TGF-β1) and nuclear factor kappaβ (NF-κβ) in polycystic ovarian syndrome (PCOS) patients with and without insulin resistance and after treatment with cyproterone acetate/ethinyloestradiol with or without concomitant metformin. Prospective. Patients with PCOS and healthy women were recruited. Patients were subdivided into obese and nonobese based on body mass index. Patients with PCOS were also grouped according to homoeostasis model assessment-insulin resistance (HOMA-IR) ≥ 2·69 or PCOS phenotype. Patients with PCOS-IR were treated with a 6-month course of cyproterone acetate/ethinyloestradiol with or without concomitant metformin. Inflammatory markers were examined at baseline, and after 6 months of treatment. A total of 445 women with PCOS (mean age 25·9 ± 2·7 years; 298 obese, 147 nonobese) and 213 normal controls (mean age 24·9 ± 3·0 years) were included. Regardless of obesity status, testosterone, free androgen index (FAI), luteinizing hormone/follicle-stimulating hormone (LH/FSH) ratio, HOMA-IR, TSP-1 and NF-κB in the PCOS groups were significantly higher than in the control group, whereas TSP-1 was lower in the PCOS groups (all, P PCOS without IR had lower TSP-1 levels than control patients (P Treatment with cyproterone acetate/ethinyloestradiol with addition of metformin reduced the level of NF-κB, TGF-β1 and HOMA-IR and increased the level of TSP-1. These results support the association between PCOS and chronic inflammation. © 2015 John Wiley & Sons Ltd.

Effects of Cluster Location on Human Performance on the Traveling Salesperson Problem

Science.gov (United States)

MacGregor, James N.

2013-01-01

Most models of human performance on the traveling salesperson problem involve clustering of nodes, but few empirical studies have examined effects of clustering in the stimulus array. A recent exception varied degree of clustering and concluded that the more clustered a stimulus array, the easier a TSP is to solve (Dry, Preiss, & Wagemans,…

Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service

Directory of Open Access Journals (Sweden)

Goran Martinovic

2008-01-01

Full Text Available We present a novel variation of the vehicle routing problem (VRP. Single commodity cargo with pickup and delivery service is considered. Customers are labeled as either cargo sink or cargo source, depending on their pickup or delivery demand. This problem is called a single commodity vehicle routing problem with pickup and delivery service (1-VRPPD. 1-VRPPD deals with multiple vehicles and is the same as the single-commodity traveling salesman problem (1-PDTSP when the number of vehicles is equal to 1. Since 1-VRPPD specializes VRP, it is hard in the strong sense. Iterative modified simulated annealing (IMSA is presented along with greedy random-based initial solution algorithm. IMSA provides a good approximation to the global optimum in a large search space. Experiment is done for the instances with different number of customers and their demands. With respect to average values of IMSA execution times, proposed method is appropriate for practical applications.

Mutagenic and recombinagenic activity of airborne particulates, PM10 and TSP, organic extracts in the Drosophila wing-spot test

International Nuclear Information System (INIS)

Rodrigues Dihl, Rafael; Grazielli Azevedo da Silva, Carla; Souza do Amaral, Viviane; Reguly, Maria Luiza; Rodrigues de Andrade, Heloisa Helena

2008-01-01

The genotoxicity associated with air pollution in the city of Canoas, Rio Grande do Sul (Brazil), was assessed in November (spring) and January (summer). We applied the somatic mutation and recombination test (SMART) in Drosophila melanogaster in its standard version with normal bioactivation (ST) and in its variant with increased cytochrome P450-dependent biotransformation capacity (HB). The data indicated the genotoxicity of TSP and PM10 collected in November, in both ST and HB crosses. The genotoxic activity of the PM10 material in the spring sample was exclusively associated with the induction of mitotic recombination, whereas the TSP genetic toxicity was due to both recombinational as well as point and/or chromosomal mutation events. Considering PM10 collected in January, a positive response-100% (17.10 m 3 /ml) concentration-was observed in the HB cross, which was not detected in the ST cross. - Drosophila Wing-Spot Test can be used for detection of airborne particulates mutagenesis

Mutagenic and recombinagenic activity of airborne particulates, PM10 and TSP, organic extracts in the Drosophila wing-spot test

Energy Technology Data Exchange (ETDEWEB)

Rodrigues Dihl, Rafael [Programa de Pos Graduacao em Genetica e Biologia Molecular (PPGBM), Universidade Federal do Rio Grande do Sul, Porto Alegre, RS (Brazil); Grazielli Azevedo da Silva, Carla [Instituto de Quimica, Departamento de Quimica Organica, Universidade Federal do Rio Grande do Sul, Porto Alegre, RS (Brazil); Souza do Amaral, Viviane; Reguly, Maria Luiza [Laboratorio de Diagnostico da Toxicidade Genetica (TOXIGEN), Programa de Pos Graduacao em Genetica e Toxicologia Aplicada (PPGGTA), Universidade Luterana do Brasil - ULBRA, Avenida Farroupilha 8001, 92420280 Canoas, RS (Brazil); Rodrigues de Andrade, Heloisa Helena [Laboratorio de Diagnostico da Toxicidade Genetica (TOXIGEN), Programa de Pos Graduacao em Genetica e Toxicologia Aplicada (PPGGTA), Universidade Luterana do Brasil -ULBRA, Avenida Farroupilha 8001, 92420280 Canoas, RS (Brazil)], E-mail: heloisa@ulbra.br

2008-01-15

The genotoxicity associated with air pollution in the city of Canoas, Rio Grande do Sul (Brazil), was assessed in November (spring) and January (summer). We applied the somatic mutation and recombination test (SMART) in Drosophila melanogaster in its standard version with normal bioactivation (ST) and in its variant with increased cytochrome P450-dependent biotransformation capacity (HB). The data indicated the genotoxicity of TSP and PM10 collected in November, in both ST and HB crosses. The genotoxic activity of the PM10 material in the spring sample was exclusively associated with the induction of mitotic recombination, whereas the TSP genetic toxicity was due to both recombinational as well as point and/or chromosomal mutation events. Considering PM10 collected in January, a positive response-100% (17.10 m{sup 3}/ml) concentration-was observed in the HB cross, which was not detected in the ST cross. - Drosophila Wing-Spot Test can be used for detection of airborne particulates mutagenesis.

A performance evaluation of ACO and SA TSP in a supply chain network

Science.gov (United States)

Rao, T. Srinivas

2017-07-01

Supply Chain management and E commerce business solutions are one of the prominent areas of active research. In our paper we have modelled a supply chain model which aggregates all the manufacturers requirement and the products are supplied to all the manufacturer through a common vehicle routing algorithm. An appropriate tsp has been constructed for all the manufacturers which determines the shortest route thru which the aggregated material can be supplied in the shortest possible time. In this paper we have solved the shortest route through constructing a Simulated annealing algorithm and Ant colony algorithm and their performance is evaluated.

Seasonal variations of total suspended particles (TSP) and heavy metals under tropical conditions in Rio de Janeiro, Brazil

International Nuclear Information System (INIS)

Pfeiffer, W.C.; Trindade, H.A.; Costa-Ribeiro, C.; Londres, H.; Oliveira, A.E.

The total suspended particle (TSP) and heavy metal concentrations are studied in Rio de Janeiro, Brazil from 1974 until 1981. The principal aims are to determine how these things vary in two different areas and how meteorological parameters responsible for the transport and dilution of atmospheric pollutants affect these areas. (M.A.C.) [pt

Chemical mass balance source apportionment of PM10 and TSP in residential and industrial sites of an urban region of Kolkata, India.

Science.gov (United States)

Gupta, A K; Karar, Kakoli; Srivastava, Anjali

2007-04-02

Daily average PM(10) (particulate matter which passes through a size selective impactor inlet with a 50% efficiency cut-off at 10 microm aerodynamic diameter), TSP (total suspended particulate matter) and their chemical species mass concentrations were measured at residential and industrial sites of an urban region of Kolkata during November 2003-November 2004. Source apportionment using chemical mass balance model revealed that the most dominant source throughout the study period at residential site was coal combustion (42%), while vehicular emission (47%) dominates at industrial site to PM(10). Paved road, field burning and wood combustion contributed 21%, 7% and 1% at residential site, while coal combustion, metal industry and soil dust contributed 34%, 1% and 1% at industrial site, respectively, to PM(10) during the study period. The contributors to TSP included coal combustion (37%), soil dust (19%), road dust (17%) and diesel combustion (15%) at residential site, while soil dust (36%), coal combustion (17%), solid waste (17%), road dust (16%) and tyre wear (7%) at industrial site. Significant seasonal variations of the particulate matters have been observed during the study period. In the monitoring sites total carbon, organic carbon and iron were found to be the marker species of road dust, while organic carbon, total carbon, chloride and sulfate have been observed as the marker species of soil dust in TSP.

A PostgreSQL/PostGIS Implementation for the Sightseeing Tour Planning Problem

Directory of Open Access Journals (Sweden)

Ardiansyah .

2013-04-01

Full Text Available This article discusses a procedure for finding the best multi stops route for sightseeing tour through a road network. The procedure involves building a database containing nodes and road network in PostgreSQL, calculating the shortest distance between a pair of nodes using pgDijkstra module, and solving the tour problem using a function written in PL/pgSQL. The function was developed based on the Nearest Insertion Algorithm for solving the Travelling Salesman Problem. The algorithm inserts a sightseeing attraction (node at the best position in the existing route, which is between a pair of nodes that yields the minimum difference between the total tour time before and after the new node was inserted. The test result shows that the function can solve the problem within acceptable runtime for web application for total destination nodes of 22. It is concluded that the whole procedure was suitable for developing Web GIS application that solve the sightseeing tour planning problem.

Application of Fuzzy Optimization to the Orienteering Problem

Directory of Open Access Journals (Sweden)

Madhushi Verma

2015-01-01

Full Text Available This paper deals with the orienteering problem (OP which is a combination of two well-known problems (i.e., travelling salesman problem and the knapsack problem. OP is an NP-hard problem and is useful in appropriately modeling several challenging applications. As the parameters involved in these applications cannot be measured precisely, depicting them using crisp numbers is unrealistic. Further, the decision maker may be satisfied with graded satisfaction levels of solutions, which cannot be formulated using a crisp program. To deal with the above-stated two issues, we formulate the fuzzy orienteering problem (FOP and provide a method to solve it. Here we state the two necessary conditions of OP of maximizing the total collected score and minimizing the time taken to traverse a path (within the specified time bound as fuzzy goals and the remaining necessary conditions as crisp constraints. Using the max-min formulation of the fuzzy sets obtained from the fuzzy goals, we calculate the fuzzy decision sets (Z and Z∗ that contain the feasible paths and the desirable paths, respectively, along with the degrees to which they are acceptable. To efficiently solve large instances of FOP, we also present a parallel algorithm on CREW PRAM model.

EDF feedback on recent EPRI SGOG SG chemical cleanings applications for TSP blockage reduction and heat transfer recover

International Nuclear Information System (INIS)

Dijoux, M.; De Bouvier, O.; Mercier, S.; Pages, D.; Bretelle, J.-L.; Leclercq, P.; Mermillod, A.

2010-01-01

cleanings applications, for which some qualifications have been performed on several processes (ASCA/DMT), to prevent problems linked to high deposit loading (excessive TSP blockage, loss of heat transfer). (author)

An Investigation of Starting Point Preferences in Human Performance on Traveling Salesman Problems

Science.gov (United States)

MacGregor, James N.

2014-01-01

Previous studies have shown that people start traveling sales problem tours significantly more often from boundary than from interior nodes. There are a number of possible reasons for such a tendency: first, it may arise as a direct result of the processes involved in tour construction; second, boundary points may be perceptually more salient than…

Aseguramiento de la Calidad en el Proceso de Desarrollo de Software utilizando CMMI, TSP y PSP

OpenAIRE

Chavarría, Alex Espejo; Oré, Sussy Bayona; Pastor, Carlos

2016-01-01

En la actualidad las empresas que desarrollan software se han convertido en socios estratégicos de sus clientes a través de la generación de valor, mediante la entrega de productos que soportan sus diversos procesos de negocio. Sin embargo, aún existen problemas en los proyectos de desarrollo de software como la calidad. En este artículo se describe los resultados de la implementación de un modelo de aseguramiento de la calidad que integra CMMI (Capability Maturity Model Integration), TSP (Te...

AAS "BALTA" konkurētspēja juridisko personu īpašuma produkta apdrošināšanā Latvijā

OpenAIRE

Jukštaka, Elīna

2012-01-01

Bakalaura darbā tiek pētīta AAS Balta juridisko personu īpašuma apdrošināšanas produkta konkurētspēja starp vadošajiem tirgus līderiem īpašuma apdrošināšanā Latvijas tirgū. Analizējot juridisko personu īpašuma apdrošināšanas noteikumus un finanšu rādītājus ir izteikti secinājumi un priekšlikumi AAS Balta juridisko personu īpašuma apdrošināšanas produkta konkurētspējas paaugstināšanai. Lai sasniegtu izvirzīto mērķi, autors izpētīja Latvijas nedzīvības apdrošināšanas tirgus attīstību un atse...

An Improved Routing Optimization Algorithm Based on Travelling Salesman Problem for Social Networks

Directory of Open Access Journals (Sweden)

Naixue Xiong

2017-06-01

Full Text Available A social network is a social structure, which is organized by the relationships or interactions between individuals or groups. Humans link the physical network with social network, and the services in the social world are based on data and analysis, which directly influence decision making in the physical network. In this paper, we focus on a routing optimization algorithm, which solves a well-known and popular problem. Ant colony algorithm is proposed to solve this problem effectively, but random selection strategy of the traditional algorithm causes evolution speed to be slow. Meanwhile, positive feedback and distributed computing model make the algorithm quickly converge. Therefore, how to improve convergence speed and search ability of algorithm is the focus of the current research. The paper proposes the improved scheme. Considering the difficulty about searching for next better city, new parameters are introduced to improve probability of selection, and delay convergence speed of algorithm. To avoid the shortest path being submerged, and improve sensitive speed of finding the shortest path, it updates pheromone regulation formula. The results show that the improved algorithm can effectively improve convergence speed and search ability for achieving higher accuracy and optimal results.

Ship Block Transportation Scheduling Problem Based on Greedy Algorithm

Directory of Open Access Journals (Sweden)

Chong Wang

2016-05-01

Full Text Available Ship block transportation problems are crucial issues to address in reducing the construction cost and improving the productivity of shipyards. Shipyards aim to maximize the workload balance of transporters with time constraint such that all blocks should be transported during the planning horizon. This process leads to three types of penalty time: empty transporter travel time, delay time, and tardy time. This study aims to minimize the sum of the penalty time. First, this study presents the problem of ship block transportation with the generalization of the block transportation restriction on the multi-type transporter. Second, the problem is transformed into the classical traveling salesman problem and assignment problem through a reasonable model simplification and by adding a virtual node to the proposed directed graph. Then, a heuristic algorithm based on greedy algorithm is proposed to assign blocks to available transporters and sequencing blocks for each transporter simultaneously. Finally, the numerical experiment method is used to validate the model, and its result shows that the proposed algorithm is effective in realizing the efficient use of the transporters in shipyards. Numerical simulation results demonstrate the promising application of the proposed method to efficiently improve the utilization of transporters and to reduce the cost of ship block logistics for shipyards.

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

Science.gov (United States)

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.

A Study on Wireless Charging for Prolonging the Lifetime of Wireless Sensor Networks.

Science.gov (United States)

Tu, Weijian; Xu, Xianghua; Ye, Tingcong; Cheng, Zongmao

2017-07-04

Wireless charging is an important issue in wireless sensor networks, since it can provide an emerging and effective solution in the absence of other power supplies. The state-of-the-art methods employ a mobile car and a predefined moving path to charge the sensor nodes in the network. Previous studies only consider a factor of the network (i.e., residual energy of sensor node) as a constraint to design the wireless charging strategy. However, other factors, such as the travelled distance of the mobile car, can also affect the effectiveness of wireless charging strategy. In this work, we study wireless charging strategy based on the analysis of a combination of two factors, including the residual energy of sensor nodes and the travelled distance of the charging car. Firstly, we theoretically analyze the limited size of the sensor network to match the capability of a charging car. Then, the networked factors are selected as the weights of traveling salesman problem (TSP) to design the moving path of the charging car. Thirdly, the charging time of each sensor node is computed based on the linear programming problem for the charging car. Finally, a charging period for the network is studied. The experimental results show that the proposed approach can significantly maximize the lifetime of the wireless sensor network.

A Study on Wireless Charging for Prolonging the Lifetime of Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Weijian Tu

2017-07-01

Full Text Available Wireless charging is an important issue in wireless sensor networks, since it can provide an emerging and effective solution in the absence of other power supplies. The state-of-the-art methods employ a mobile car and a predefined moving path to charge the sensor nodes in the network. Previous studies only consider a factor of the network (i.e., residual energy of sensor node as a constraint to design the wireless charging strategy. However, other factors, such as the travelled distance of the mobile car, can also affect the effectiveness of wireless charging strategy. In this work, we study wireless charging strategy based on the analysis of a combination of two factors, including the residual energy of sensor nodes and the travelled distance of the charging car. Firstly, we theoretically analyze the limited size of the sensor network to match the capability of a charging car. Then, the networked factors are selected as the weights of traveling salesman problem (TSP to design the moving path of the charging car. Thirdly, the charging time of each sensor node is computed based on the linear programming problem for the charging car. Finally, a charging period for the network is studied. The experimental results show that the proposed approach can significantly maximize the lifetime of the wireless sensor network.

Latvijas kā medicīnas tūrisma galamērķa konkurētspēju ietekmējošie faktori

OpenAIRE

Sidorenko, Anna

2012-01-01

Bakalaura darba temats ir «Latvijas kā medicīnas tūrisma galamērķa konkurētspēju ietekmējošie faktori». Ņemot vērā starptautisko pieredzi, medicīnas pakalpojumu sniegšana ārvalstniekiem var nodrošināt papildus ienākumu avotu nacionālajai ekonomikai. Bakalaura darba mērķis ir identificēt un izpētīt faktorus, kas ietekmē Latvijas kā medicīnas tūrisma galamērķa konkurētspēju un izstrādāt priekšlikumus medicīnas pakalpojumu sniedzējiem un valsts pārvaldes institūcijām ar nolūku veicināt Latvij...

Optimization processing of the elementary surfaces of the composite body parts on machines such as «machining center»

Directory of Open Access Journals (Sweden)

Євген Іванович Іванов

2015-11-01

Full Text Available This article describes the processing optimization and minimizing the number of tool changes. Two versions for setting the processing scheme, according to the rules for processing scheme setting for the «processing center» machines were offered. In the first version, according to the classical technology processing of each hole is carried out over all the passes, providing for the required accuracy of sizes and shapes. In the second version the number of tool changes is minimized. This method consists of dividing all the holes into groups according to their diameters. All the holes of the same diameter are processed over one pass; then the tools are changed and the holes of some other diameter are processed and so on. Let us consider the optimization problem. The traveling salesman problem - is one of the most famous problems in the theory of combinatorics. The problem is as follows: a travelling salesman (hawker must find the most advantageous route coming out of a town and visiting all other towns from 2,3,…to...n just once in an unknown order and come back to the first town. The distances between all the towns are known. It is necessary to determine in what order the Salesman must visit the towns so that the route should be the shortest. There exists just one absolutely precise algorithm - sorting options. This option is the longest, so the most inefficient. There are also simpler methods to solve the traveling salesman problem: the branch and bound algorithm and ant colony method and method of genetic algorithms

Corrosion and solubility in a TSP-buffered chemical environment following a loss of coolant accident: Part 3—Calcium

Energy Technology Data Exchange (ETDEWEB)

Olson, Sterling; Ali, Amir; LaBrier, Daniel [Department of Nuclear Engineering, University of New Mexico (United States); Blandford, Edward D, E-mail: edb@unm.edu [Department of Nuclear Engineering, University of New Mexico (United States); Howe, Kerry [Department of Civil Engineering, University of New Mexico (United States)

2016-04-15

Highlights: • Calcium leaching from NUKON fiberglass in borated TSP-buffered solution is independent of the level of fiberglass destruction. • The initial calcium release rate and the maximum calcium concentration increases with increased fiber concentration. • The calcium release in solution has a repeatable pattern of four distinct regions (prompt release, metastable, autocatalytic drop, and stable region) for all experiments. • Magnesium plays a significant role in initiating calcium precipitation in TSP-buffered environment. • Head loss through multi-constituents debris beds was found to increase progressively in all calcium concentration regions. - Abstract: Calcium that leaches from damaged or destroyed NUKON fiberglass in containment post a loss of coolant accident (LOCA) could lead to the formation of chemical precipitates. These precipitates could be filtered through the accumulated fibrous debris on the sump screen and compromising the emergency core cooling system (ECCS) sump pump performance. Reduced-scale leaching experiments were conducted on three solution inventory scales—bench (0.5 L), vertical column (31.5 L), and tank (1136 L) using three different flow conditions, and fiberglass concentrations (1.18–8 g/L) to investigate calcium release from NUKON fiber. All experiments were conducted in simulated post-LOCA water chemistry. (∼220 mM boric acid with ∼5.8 mM trisodium phosphate (TSP) buffer). Prior to the leaching tests, a preliminary experiment was carried out on the bench scale to determine the effect of the fiber preparation (unaltered and blended) method on calcium leaching. Results indicate that the extent of fiberglass destruction does not affect the amount of calcium released from fiberglass. Long-term calcium leach testing at constant temperature (80 °C) in borated TSP-buffered solution had repeatable behavior on all solution scales for different fiberglass concentrations. The calcium-leaching pattern can be divided into

Solución al Problema de Secuenciación de Trabajos mediante el Problema del Agente Viajero

Directory of Open Access Journals (Sweden)

G.E. Anaya Fuentes

2016-10-01

Full Text Available Resumen: En este trabajo se estudia el Problema de Secuenciación de Trabajos codificado como un Problema de Agente Viajero y resuelto mediante Algoritmos Genéticos. Se propone un Algoritmo Genético en donde se comparan dos tipos de selección: por torneo y por ruleta. Se realizan diferentes pruebas para la solución del Problema del Agente Viajero con los dos tipos de selección bajo diferentes parámetros: número de individuos, número de iteraciones, probabilidad de cruce y probabilidad de mutación; a partir de estos se seleccionan los parámetros y el tipo de selección. Posteriormente se codifica al Problema de Secuenciación como un Problema del Agente Viajero. La propuesta se presenta mediante la aplicación a diferentes ejemplos del Problema de Secuenciación de Trabajos y la comparación con los resultados obtenidos en la literatura. Abstract: In this paper we proposed a solution to the Job-Shop Scheduling Problem using the Traveling Salesman Problem solved by Genetic Algorithms. We proposed a genetic algorithm where we compare two types of selection: tournament and roulette. Different tests are performed to solve the Traveling Salesman Problem with the two types of selection under different parameters: number of individuals, number of iterations, crossover probability and mutation probability. Then the best type of selection and the best parameters are used to solve the Job-Shop Scheduling Problem with Genetic Algorithms for the Traveling Salesman Problem. The proposal is presented solving different examples of Job Sequencing Problem and compare them with the results obtained in the literature. Palabras clave: algoritmos eficientes, sistemas industriales de producción, problemas de optimización, problema de agente viajero, Keywords: Efficient algorithms, industrial production systems, optimization problem, traveling salesman problem

Decision Support for Planning of Multimodal Transportation with Multiple Objectives

DEFF Research Database (Denmark)

Petersen, Hanne Løhmann

phase, and considers passenger inconvenience at transfers at the same time. The paper presents a mathematical model of the problem, and the implementation of a large neighbourhood search solution procedure. The problem is solved for a real-life based problem instance, containing eight bus lines......-known issues. They both originate in the world of multimodality, and deal with problems that arise as a consequence of the combined use of several modes. The thesis introduces the Double Travelling Salesman Problem with Multiple Stacks (DTSPMS), which is a problem that combines routing and last...... compare to solutions of the regular Travelling Salesman Problem. Next, two papers are presented, introducing respectively heuristic and exact solution procedures for the problem. The heuristic approach tests a variety of metaheuristic solution approaches, of which a large neighbourhood search obtains...

Handling steam generator problems: the strategy for Ringhals 3 and 4

International Nuclear Information System (INIS)

Larsen, G.

1992-01-01

An examination in Sweden of twelve Pressurized Water Reactor steam generator tubes (six from Ringhals 3 and six from Ringhals 4) revealed that several had cracks in the roll transition zone, all tubes had shallow intergranular attacks at support plate (TSP) intersections, and some from Ringhals 3 had cracks in the TSP position due to intergranular stress corrosion. It was concluded that this could drastically limit the possibility of successfully operating Ringhals 3 (which entered commercial operation in 1981) to 2010, the year when all nuclear power in Sweden will be phased out. Two possible ways to deal with the problem were investigated: replace the steam generators and uprate the plant; operate with the existing steam generators and reduce the rate of degradation by lowering the primary water temperature, with most failed tubes repaired by sleeving. The analysis showed that replacement of the Ringhals 3 steam generators would be a good investment. As there were no attacks in the TSP intersections at Ringhals 4, which started commercial operation in 1983, it was assumed possible to operate this unit until 2010 without any temperature reduction. The economic evaluation for Ringhals 4 nevertheless indicated that it would be cost effective to replace the steam generators and uprate Ringhals 4 to 112%. However, a new economic study showed that it will still be cost effective to replace the steam generators at Ringhals 3, but it is not clear that there is still a case for replacement at Ringhals 4. Ringhals 3 steam generators will be replaced in 1995, while Ringhals 4 will continue to operate with the existing steam generators. (Author)

Applications of Operational Research Techniques in Optimization to Visit Tourist Points of Vina del Mar

Directory of Open Access Journals (Sweden)

Joao CARDOSO NETO

2012-01-01

Full Text Available Chile is a country with great attractions for tourists in South America and the whole world. Among the many tourist Chilean attractions the city of Vina del Mar is one of the highlights, recognized nationally and internationally as one of the most beautiful places for summer. In Vina del Mar tourists have many options for leisure, besides pretty beaches, e.g. playa renaca, the city has beautiful squares and castles, e.g. Castillo Wulff built more than 100 (one hundred years ago. It is noteworthy that already exist over there five (5 tourist itineraries, so this work was developed in order to determine the best routes to these existing itineraries, and create a unique route that includes all the tourist points in Vina del Mar, because in this way, the tourists visiting this city can minimize the time spent in traveling, as well as optimize their moments of leisure, taking the opportunity to know all the city attractions. To determine shorter ways to do it and then propose some suggestions for improvement of the quality of the tourist service offered, it had used the exact method, by solving the mathematical model of the TSP (Traveling Salesman Problem, and the heuristic method, using the most economic insertion algorithm.

Portable bacterial identification system based on elastic light scatter patterns

Directory of Open Access Journals (Sweden)

Bae Euiwon

2012-08-01

Full Text Available Abstract Background Conventional diagnosis and identification of bacteria requires shipment of samples to a laboratory for genetic and biochemical analysis. This process can take days and imposes significant delay to action in situations where timely intervention can save lives and reduce associated costs. To enable faster response to an outbreak, a low-cost, small-footprint, portable microbial-identification instrument using forward scatterometry has been developed. Results This device, weighing 9 lb and measuring 12 × 6 × 10.5 in., utilizes elastic light scatter (ELS patterns to accurately capture bacterial colony characteristics and delivers the classification results via wireless access. The overall system consists of two CCD cameras, one rotational and one translational stage, and a 635-nm laser diode. Various software algorithms such as Hough transform, 2-D geometric moments, and the traveling salesman problem (TSP have been implemented to provide colony count and circularity, centering process, and minimized travel time among colonies. Conclusions Experiments were conducted with four bacteria genera using pure and mixed plate and as proof of principle a field test was conducted in four different locations where the average classification rate ranged between 95 and 100%.

Cost allocation in distribution planning

International Nuclear Information System (INIS)

Engevall, S.

1996-01-01

This thesis concerns cost allocation problems in distribution planning. The cost allocation problems we study are illustrated using the distribution planning situation at the Logistics department of Norsk Hydro Olje AB. The planning situation is modeled as a Traveling Salesman Problem and a Vehicle Routing Problem with an inhomogeneous fleet. The cost allocation problems are the problems of how to divide the transportation costs among the customers served in each problem. The cost allocation problems are formulated as cooperative games, in characteristic function form, where the customers are defined to be the players. The games contain five and 21 players respectively. Game theoretical solution concepts such as the core, the nucleolus, the Shapley value and the τ-value are discussed. From the empirical results we can, among other things, conclude that the core of the Traveling Salesman Game is large, and that the core of the Vehicle Routing Game is empty. In the accounting of Norsk Hydro the cost per m 3 can be found for each tour. We conclude that for a certain definition of the characteristic function, a cost allocation according to this principle will not be included in the core of the Traveling Salesman Game. The models and methods presented in this thesis can be applied to transportation problems similar to that of Norsk Hydro, independent of the type of products that are delivered. 96 refs, 11 figs, 26 tabs

Cost allocation in distribution planning

Energy Technology Data Exchange (ETDEWEB)

Engevall, S.

1996-12-31

This thesis concerns cost allocation problems in distribution planning. The cost allocation problems we study are illustrated using the distribution planning situation at the Logistics department of Norsk Hydro Olje AB. The planning situation is modeled as a Traveling Salesman Problem and a Vehicle Routing Problem with an inhomogeneous fleet. The cost allocation problems are the problems of how to divide the transportation costs among the customers served in each problem. The cost allocation problems are formulated as cooperative games, in characteristic function form, where the customers are defined to be the players. The games contain five and 21 players respectively. Game theoretical solution concepts such as the core, the nucleolus, the Shapley value and the {tau}-value are discussed. From the empirical results we can, among other things, conclude that the core of the Traveling Salesman Game is large, and that the core of the Vehicle Routing Game is empty. In the accounting of Norsk Hydro the cost per m{sup 3} can be found for each tour. We conclude that for a certain definition of the characteristic function, a cost allocation according to this principle will not be included in the core of the Traveling Salesman Game. The models and methods presented in this thesis can be applied to transportation problems similar to that of Norsk Hydro, independent of the type of products that are delivered. 96 refs, 11 figs, 26 tabs

Cost allocation in distribution planning

Energy Technology Data Exchange (ETDEWEB)

Engevall, S

1997-12-31

This thesis concerns cost allocation problems in distribution planning. The cost allocation problems we study are illustrated using the distribution planning situation at the Logistics department of Norsk Hydro Olje AB. The planning situation is modeled as a Traveling Salesman Problem and a Vehicle Routing Problem with an inhomogeneous fleet. The cost allocation problems are the problems of how to divide the transportation costs among the customers served in each problem. The cost allocation problems are formulated as cooperative games, in characteristic function form, where the customers are defined to be the players. The games contain five and 21 players respectively. Game theoretical solution concepts such as the core, the nucleolus, the Shapley value and the {tau}-value are discussed. From the empirical results we can, among other things, conclude that the core of the Traveling Salesman Game is large, and that the core of the Vehicle Routing Game is empty. In the accounting of Norsk Hydro the cost per m{sup 3} can be found for each tour. We conclude that for a certain definition of the characteristic function, a cost allocation according to this principle will not be included in the core of the Traveling Salesman Game. The models and methods presented in this thesis can be applied to transportation problems similar to that of Norsk Hydro, independent of the type of products that are delivered. 96 refs, 11 figs, 26 tabs

A mixed integer programming model for a continuous move transportation problem with service constraints

Directory of Open Access Journals (Sweden)

J. Fabian Lopez

2010-01-01

Full Text Available We consider a Pickup and Delivery Vehicle Routing Problem (PDP commonly encountered in real-world logistics operations. The problem involves a set of practical complications that have received little attention in the vehicle routing literature. In this problem, there are multiple vehicle types available to cover a set of pickup and delivery requests, each of which has pickup time windows and delivery time windows. Transportation orders and vehicle types must satisfy a set of compatibility constraints that specify which orders cannot be covered by which vehicle types. In addition we include some dock service capacity constraints as is required on common real world operations. This problem requires to be attended on large scale instances (orders ≥ 500, (vehicles ≥ 150. As a generalization of the traveling salesman problem, clearly this problem is NP-hard. The exact algorithms are too slow for large scale instances. The PDP-TWDS is both a packing problem (assign order to vehicles, and a routing problem (find the best route for each vehicle. We propose to solve the problem in three stages. The first stage constructs initials solutions at aggregate level relaxing some constraints on the original problem. The other two stages imposes time windows and dock service constraints. Our results are favorable finding good quality solutions in relatively short computational times.

Receptor modeling of PM2.5, PM10 and TSP in different seasons and long-range transport analysis at a coastal site of Tianjin, China.

Science.gov (United States)

Kong, Shaofei; Han, Bin; Bai, Zhipeng; Chen, Li; Shi, Jianwu; Xu, Zhun

2010-09-15

Atmospheric particulate matter (PM(2.5), PM(10) and TSP) were sampled synchronously during three monitoring campaigns from June 2007 to February 2008 at a coastal site in TEDA of Tianjin, China. Chemical compositions including 19 elements, 6 water-solubility ions, organic and elemental carbon were determined. principle components analysis (PCA) and chemical mass balance modeling (CMB) were applied to determine the PM sources and their contributions with the assistance of NSS SO(4)(2)(-), the mass ratios of NO(3)(-) to SO(4)(2)(-) and OC to EC. Air mass backward trajectory model was compared with source apportionment results to evaluate the origin of PM. Results showed that NSS SO(4)(2)(-) values for PM(2.5) were 2147.38, 1701.26 and 239.80 ng/m(3) in summer, autumn and winter, reflecting the influence of sources from local emissions. Most of it was below zero in summer for PM(10) indicating the influence of sea salt. The ratios of NO(3)(-) to SO(4)(2)(-) was 0.19 for PM(2.5), 0.18 for PM(10) and 0.19 for TSP in winter indicating high amounts of coal consumed for heating purpose. Higher OC/EC values (mostly larger than 2.5) demonstrated that secondary organic aerosol was abundant at this site. The major sources were construction activities, road dust, vehicle emissions, marine aerosol, metal manufacturing, secondary sulfate aerosols, soil dust, biomass burning, some pharmaceutics industries and fuel-oil combustion according to PCA. Coal combustion, marine aerosol, vehicular emission and soil dust explained 5-31%, 1-13%, 13-44% and 3-46% for PM(2.5), PM(10) and TSP, respectively. Backward trajectory analysis showed air parcels originating from sea accounted for 39% in summer, while in autumn and winter the air parcels were mainly related to continental origin. Copyright 2010 Elsevier B.V. All rights reserved.

Solution of combinatorial optimization problems by an accelerated hopfield neural network. Kobai kasokugata poppu firudo nyuraru netto ni yoru kumiawase saitekika mondai no kaiho

Energy Technology Data Exchange (ETDEWEB)

Ohori, T.; Yamamoto, H.; Setsu, Nenso; Watanabe, K. (Hokkaido Inst. of Technology, Hokkaido (Japan))

1994-04-20

The accelerated approximate solution of combinatorial optimization problems by symmetry integrating hopfield neural network (NN) has been applied to many combinatorial problems such as the traveling salesman problem, the network planning problem, etc. However, the hopfield NN converges to local minimum solutions very slowly. In this paper, a general inclination model composed by introducing an accelerated parameter to the hopfield model is proposed, and it has been shown that the acceleration parameter can make the model converge to the local minima more quickly. Moreover, simulation experiments for random quadratic combinatorial problems with two and twenty-five variables were carried out. The results show that the acceleration of convergence makes the attraction region of the local minimum change and the accuracy of solution worse. If an initial point is selected around the center of unit hyper cube, solutions with high accuracy not affected by the acceleration parameter can be obtained. 9 refs., 8 figs., 3 tabs.

Corrosion performance of tube support materials

International Nuclear Information System (INIS)

Malagola, P.

1985-01-01

The problem of denting in steam generators leads to change in the conception of the tube support plates. A new material is now used for this component, a 13% Cr steel, which composition has been adjusted for weldability and mechanical resistance criteria. The geometry of trefoil support plate (TSP) has also been improved, using a broached TSP (quadrifoiled holes) instead of a drilled TSP. Tests have been performed on 13% Cr and C-steel broached TSP, and drilled TSP, to confirm the better resistance to denting of this new configuration

The bane of low-dimensionality clustering

DEFF Research Database (Denmark)

Cohen-Addad, Vincent; de Mesmay, Arnaud; Rotenberg, Eva

2018-01-01

geometric problems such as the traveling salesman problem, or computing an independent set of unit spheres. While these problems benefit from the so-called (limited) blessing of dimensionality, as they can be solved in time nO(k1--1/d) or 2

An optimization approach for communal home meal delivery service : A case study

NARCIS (Netherlands)

Bräysy, Olli; Nakari, Pentti; Dullaert, Wout; Neittaanmäki, Pekka

2009-01-01

This paper is the first to discuss the communal home meal delivery problem. The problem can be modelled as a multiple travelling salesman problem with time windows, that is closely related to the well-studied vehicle routing problem with time windows. Experimental results are reported for a

Defective human T-cell lymphotropic virus type I (HTLV-I) provirus in seronegative tropical spastic paraparesis/HTLV-I-associated myelopathy (TSP/HAM) patients.

Science.gov (United States)

Ramirez, E; Fernandez, J; Cartier, L; Villota, C; Rios, M

2003-02-01

Infection with human T-cell lymphotropic virus type I (HTLV-I) have been associated with the development of the tropical spastic paraparesis/HTLV-I-associated myelopathy (TSP/HAM). We studied the presence of HTLV-I provirus in peripheral blood mononuclear cells (PBMC) from 72 Chilean patients with progressive spastic paraparesis by polymerase chain reaction: 32 seropositive and 40 seronegative cases. We amplified different genomic regions of HTLV-I using primers of 5' ltr, tax, env/tax, pX, pol and env genes. These genes were detected from all seropositive patients. The seronegative patients were negative with 5' ltr, pol, env, and pX primers. However, amplified product of tax and env/tax genes was detected from 16 and four seronegative patients, respectively. Three of them were positive with both genetic regions. The results of this study show that the complete HTLV-I provirus is found in 100% of seropositive cases. In seronegative cases, clinically very similar of seropositive cases, was found only tax gene in 42.5% (17/40) of patients. These results suggest the presence of a defective HTLV-I provirus in some seronegative patients with progressive spastic paraparesis, and suggest a pathogenic role of this truncate provirus for a group of TSP/HAM.

Solving Constraint Satisfaction Problems with Networks of Spiking Neurons.

Science.gov (United States)

Jonke, Zeno; Habenschuss, Stefan; Maass, Wolfgang

2016-01-01

Network of neurons in the brain apply-unlike processors in our current generation of computer hardware-an event-based processing strategy, where short pulses (spikes) are emitted sparsely by neurons to signal the occurrence of an event at a particular point in time. Such spike-based computations promise to be substantially more power-efficient than traditional clocked processing schemes. However, it turns out to be surprisingly difficult to design networks of spiking neurons that can solve difficult computational problems on the level of single spikes, rather than rates of spikes. We present here a new method for designing networks of spiking neurons via an energy function. Furthermore, we show how the energy function of a network of stochastically firing neurons can be shaped in a transparent manner by composing the networks of simple stereotypical network motifs. We show that this design approach enables networks of spiking neurons to produce approximate solutions to difficult (NP-hard) constraint satisfaction problems from the domains of planning/optimization and verification/logical inference. The resulting networks employ noise as a computational resource. Nevertheless, the timing of spikes plays an essential role in their computations. Furthermore, networks of spiking neurons carry out for the Traveling Salesman Problem a more efficient stochastic search for good solutions compared with stochastic artificial neural networks (Boltzmann machines) and Gibbs sampling.

Solving constraint satisfaction problems with networks of spiking neurons

Directory of Open Access Journals (Sweden)

Zeno eJonke

2016-03-01

Full Text Available Network of neurons in the brain apply – unlike processors in our current generation ofcomputer hardware – an event-based processing strategy, where short pulses (spikes areemitted sparsely by neurons to signal the occurrence of an event at a particular point intime. Such spike-based computations promise to be substantially more power-efficient thantraditional clocked processing schemes. However it turned out to be surprisingly difficult todesign networks of spiking neurons that can solve difficult computational problems on the levelof single spikes (rather than rates of spikes. We present here a new method for designingnetworks of spiking neurons via an energy function. Furthermore we show how the energyfunction of a network of stochastically firing neurons can be shaped in a quite transparentmanner by composing the networks of simple stereotypical network motifs. We show that thisdesign approach enables networks of spiking neurons to produce approximate solutions todifficult (NP-hard constraint satisfaction problems from the domains of planning/optimizationand verification/logical inference. The resulting networks employ noise as a computationalresource. Nevertheless the timing of spikes (rather than just spike rates plays an essential rolein their computations. Furthermore, networks of spiking neurons carry out for the Traveling Salesman Problem a more efficient stochastic search for good solutions compared with stochastic artificial neural networks (Boltzmann machines and Gibbs sampling.

A novel method to design S-box based on chaotic map and genetic algorithm

International Nuclear Information System (INIS)

Wang, Yong; Wong, Kwok-Wo; Li, Changbing; Li, Yang

2012-01-01

The substitution box (S-box) is an important component in block encryption algorithms. In this Letter, the problem of constructing S-box is transformed to a Traveling Salesman Problem and a method for designing S-box based on chaos and genetic algorithm is proposed. Since the proposed method makes full use of the traits of chaotic map and evolution process, stronger S-box is obtained. The results of performance test show that the presented S-box has good cryptographic properties, which justify that the proposed algorithm is effective in generating strong S-boxes. -- Highlights: ► The problem of constructing S-box is transformed to a Traveling Salesman Problem. ► We present a new method for designing S-box based on chaos and genetic algorithm. ► The proposed algorithm is effective in generating strong S-boxes.

A novel method to design S-box based on chaotic map and genetic algorithm

Energy Technology Data Exchange (ETDEWEB)

Wang, Yong, E-mail: wangyong_cqupt@163.com [State Key Laboratory of Power Transmission Equipment and System Security and New Technology, Chongqing University, Chongqing 400044 (China); Key Laboratory of Electronic Commerce and Logistics, Chongqing University of Posts and Telecommunications, Chongqing 400065 (China); Wong, Kwok-Wo [Department of Electronic Engineering, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon Tong (Hong Kong); Li, Changbing [Key Laboratory of Electronic Commerce and Logistics, Chongqing University of Posts and Telecommunications, Chongqing 400065 (China); Li, Yang [Department of Automatic Control and Systems Engineering, The University of Sheffield, Mapping Street, S1 3DJ (United Kingdom)

2012-01-30

The substitution box (S-box) is an important component in block encryption algorithms. In this Letter, the problem of constructing S-box is transformed to a Traveling Salesman Problem and a method for designing S-box based on chaos and genetic algorithm is proposed. Since the proposed method makes full use of the traits of chaotic map and evolution process, stronger S-box is obtained. The results of performance test show that the presented S-box has good cryptographic properties, which justify that the proposed algorithm is effective in generating strong S-boxes. -- Highlights: ► The problem of constructing S-box is transformed to a Traveling Salesman Problem. ► We present a new method for designing S-box based on chaos and genetic algorithm. ► The proposed algorithm is effective in generating strong S-boxes.

Pengaruh Pemberian Urea, Tsp, Kcl Dan Pupuk Organik Cair (Poc) Kulit Pisang Terhadap Pertumbuhan Dan Produksi Tanaman Cabai Merah Keriting (Capsicum Annum L.)

OpenAIRE

adrian, Edo; Yetti, Husna

2017-01-01

This research to determine the interaction of inorganic fertilizer (Urea, TSP, KCl)and banana peelliquid organic fertilizer (POC) to find the best results on the growth and yield of red pepper (Capsicum annuum L.).This study was conducted for four months (March-June, 2016), the Experimental Station, Faculty of Agriculture, University of Riau Pekanbaru,using a completely randomized design (CRD) factorial,consists of two factors and three replications.The results were analyzed by analysis of va...

The Mice Drawer System Tissue Sharing Program (MDS-TSP)

Science.gov (United States)

Biticchi, Roberta; Cancedda, Ranieri; Cilli, Michele; Cotronei, Vittorio; Costa, Delfina; Liu, Yi; Piccardi, Federica; Pignataro, Salvatore; Ruggiu, Alessandra; Tasso, Roberta; Tavella, Sara

obtain from the animals sent to the ISS as much as possible information including also microgravity induced modifications of tissues other than bone, we associated to the MDS experiment several international group from Italian, American, Japanese Universities and from NASA and JAXA labs and we created a Tissue Sharing Program (TSP). In total 17 groups from 6 countries were involved in the program. The MDS payload containing three PTN-transgenic mice (Tg) and three wild type (Wt) mice was launched with the Shuttle STS-128, on August, 28 2009 and the MDS transferred to the ISS for three months. The payload re-entry was with the Shuttle STS-129 on November, 27 2009 in Florida. Unfortunately during this period 3 mice (two Wt and one Tg) died due to a spinal cord lesion probably occurred during the shuttle lift off, a liver pathology and a failure of the food delivery system respectively. All the three dead mice were however frozen for subsequent skeletal analysis. The remaining 3 mice had a normal behavior during the flight and appeared in excellent health conditions at the time of landing. During the MDS stay at the ISS several physical parameters were under daily check. With regard to the animal health status checking, the daily water consumption for each individual mouse revealed to be one of the most important parameter. Immediately after landing the mice were sacrificed, blood parameter were measured and all different tissues were dissected. Samples from almost the entire organism are now under investigation by the TSP team. A ground replica of the flight experiment ("ground control") was performed at the University of Genova from November 2009 to the second week of February 2010. Some of the initial results from the flight and the ground control experiments are presented in the individual abstracts.

"A/S PET Baltija" kvalitātes pārvaldību sistēmu loma uzņēmuma konkurētspējas nodrošināšanā

OpenAIRE

Goldšteins, Jānis

2012-01-01

Bakalaura darba tēma ir ,,A/S PET Baltija’’ kvalitātes pārvaldību sistēmu loma uzņēmuma konkurētspējas nodrošināšanā. Bakalaura darba mērķis ir izpētīt A/S PET Baltija kvalitātes pārvaldības sistēmu darbības ietekmi uz uzņēmuma konkurētspēju, atklāt problēmas un izstrādāt priekšlikumus problēmu samazināšanai. Bakalaura darbs satur: 65 lapas, 4 tabulas, 24 attēlus. Darba pirmajā daļā autors analizē Eiropas Direktīvu un LR likumdošanas normatīvo aktu analīzi atkritumu apsaimniek...

A tabu search algorithm for scheduling a single robot in a job-shop environment

NARCIS (Netherlands)

Hurink, Johann L.; Knust, S.

1999-01-01

We consider a single-machine scheduling problem which arises as a subproblem in a job-shop environment where the jobs have to be transported between the machines by a single transport robot. The robot scheduling problem may be regarded as a generalization of the travelling-salesman problem with time

A tabu search algorithm for scheduling a single robot in a job-shop environment

NARCIS (Netherlands)

Hurink, Johann L.; Knust, Sigrid

2002-01-01

We consider a single-machine scheduling problem which arises as a subproblem in a job-shop environment where the jobs have to be transported between the machines by a single transport robot. The robot scheduling problem may be regarded as a generalization of the travelling-salesman problem with time

A genetic algorithm solution for combinatorial problems - the nuclear core reload example

Energy Technology Data Exchange (ETDEWEB)

Schirru, R.; Silva, F.C. [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia; Pereira, C.M.N.A. [Instituto de Engenharia Nuclear (IEN), Rio de Janeiro, RJ (Brazil); Chapot, J.L.C. [FURNAS, Rio de Janeiro, RJ (Brazil)

1997-12-01

This paper presents a solution to Traveling Salesman Problem based upon genetic algorithms (GA), using the classic crossover, but avoiding the feasibility problem in offspring individuals, allowing the natural evolution of the GA without introduction of heuristics in the genetic crossover operator. The genetic model presented, that we call the List Model (LM) is based on the encoding and decoding genotype in the way to always generate a phenotype that has a valid structure, over which will be applied the fitness, represented by the total distance. The main purpose of this work was to develop the basis for a new genetic model to be used in the reload of nuclear core of a PWR. In a generic way, this problem can be interpreted as a a search of the optimal combination of N different fuel elements in N nuclear core `holes`, where each combination or load pattern, determines the neutron flux shape and its associate peak factor. The goal is to find out the load pattern that minimizes the peak factor and consequently maximize the useful life of the nuclear fuel. The GA with the List Model was applied to the Angra-1 PWR reload problem and the results are remarkably better than the ones used in the last fuel cycle. (author). 12 refs., 3 figs., 2 tabs.

Reliable Radiation Hybrid Maps: An Efficient Scalable Clustering-based Approach

Science.gov (United States)

The process of mapping markers from radiation hybrid mapping (RHM) experiments is equivalent to the traveling salesman problem and, thereby, has combinatorial complexity. As an additional problem, experiments typically result in some unreliable markers that reduce the overall quality of the map. We ...

Water soluble ions in aerosols (TSP) : Characteristics, sources and seasonal variation over the central Himalayas, Nepal

Science.gov (United States)

Tripathee, Lekhendra; Kang, Shichang; Zhang, Qianggong; Rupakheti, Dipesh

2016-04-01

Atmspheric pollutants transported from South Asia could have adverse impact on the Himalayan ecosystems. Investigation of aerosol chemistry in the Himalayan region in Nepal has been limited on a temporal and spatial scale to date. Therefore, the water-soluble ionic composition of aerosol using TSP sampler was investigated for a year period from April 2013 to March 2014 at four sites Bode, Dhunche, Lumbini and Jomsom characterized as an urban, rural, semi-urban and remote sites in Nepal. During the study period, the highest concentration of major cation was Ca2+ with an average concentration of 8.91, 2.17, 7.85 and 6.42 μg m-3 and the highest concentration of major anion was SO42- with an average of 10.96, 4.06, 6.85 and 3.30 μg m-3 at Bode, Dhunche, Lumbini and Jomsom respectively. The soluble ions showed the decrease in concentrations from urban to the rural site. Correlations and PCA analysis suggested that that SO42-, NO3- and NH4+ were derived from the anthropogenic sources where as the Ca2+ and Mg2+ were from crustal sources. Our results also suggest that the largest acid neutralizing agent at our sampling sites in the central Himalayas are Ca2+ followed by NH4+. Seasonal variations of soluble ions in aerosols showed higher concentrations during pre-monsoon and winter (dry-periods) due to limited precipitation amount and lower concentrations during the monsoon which can be explained by the dilution effect, higher the precipitation lower the concentration. K+ which is regarded as the tracer of biomss burning had a significant peaks during pre-monsoon season when the forest fires are active around the regions. In general, the results of this study suggests that the atmospheric chemistry is influenced by natural and anthropogenic sources. Thus, soluble ionic concentrations in aerosols from central Himalayas, Nepal can provide a useful database to assess atmospheric environment and its impacts on human health and ecosystem in the southern side of central

Application of supernetworks in modeling activity-travel behaviour

NARCIS (Netherlands)

Liao, F.; Arentze, T.A.; Timmermans, H.J.P.

2011-01-01

Network representation and optimization has for long been applied to address vast engineering and scientific problems. Examples are originated from the Seven Bridges of Konigsberg, to a variety of classic P and NP-hard problems such minimum spanning tree, shortest path, and traveling salesman

Robustness of mission plans for unmanned aircraft

Science.gov (United States)

Niendorf, Moritz

This thesis studies the robustness of optimal mission plans for unmanned aircraft. Mission planning typically involves tactical planning and path planning. Tactical planning refers to task scheduling and in multi aircraft scenarios also includes establishing a communication topology. Path planning refers to computing a feasible and collision-free trajectory. For a prototypical mission planning problem, the traveling salesman problem on a weighted graph, the robustness of an optimal tour is analyzed with respect to changes to the edge costs. Specifically, the stability region of an optimal tour is obtained, i.e., the set of all edge cost perturbations for which that tour is optimal. The exact stability region of solutions to variants of the traveling salesman problems is obtained from a linear programming relaxation of an auxiliary problem. Edge cost tolerances and edge criticalities are derived from the stability region. For Euclidean traveling salesman problems, robustness with respect to perturbations to vertex locations is considered and safe radii and vertex criticalities are introduced. For weighted-sum multi-objective problems, stability regions with respect to changes in the objectives, weights, and simultaneous changes are given. Most critical weight perturbations are derived. Computing exact stability regions is intractable for large instances. Therefore, tractable approximations are desirable. The stability region of solutions to relaxations of the traveling salesman problem give under approximations and sets of tours give over approximations. The application of these results to the two-neighborhood and the minimum 1-tree relaxation are discussed. Bounds on edge cost tolerances and approximate criticalities are obtainable likewise. A minimum spanning tree is an optimal communication topology for minimizing the cumulative transmission power in multi aircraft missions. The stability region of a minimum spanning tree is given and tolerances, stability balls

Set-Based Discrete Particle Swarm Optimization Based on Decomposition for Permutation-Based Multiobjective Combinatorial Optimization Problems.

Science.gov (United States)

Yu, Xue; Chen, Wei-Neng; Gu, Tianlong; Zhang, Huaxiang; Yuan, Huaqiang; Kwong, Sam; Zhang, Jun

2017-08-07

This paper studies a specific class of multiobjective combinatorial optimization problems (MOCOPs), namely the permutation-based MOCOPs. Many commonly seen MOCOPs, e.g., multiobjective traveling salesman problem (MOTSP), multiobjective project scheduling problem (MOPSP), belong to this problem class and they can be very different. However, as the permutation-based MOCOPs share the inherent similarity that the structure of their search space is usually in the shape of a permutation tree, this paper proposes a generic multiobjective set-based particle swarm optimization methodology based on decomposition, termed MS-PSO/D. In order to coordinate with the property of permutation-based MOCOPs, MS-PSO/D utilizes an element-based representation and a constructive approach. Through this, feasible solutions under constraints can be generated step by step following the permutation-tree-shaped structure. And problem-related heuristic information is introduced in the constructive approach for efficiency. In order to address the multiobjective optimization issues, the decomposition strategy is employed, in which the problem is converted into multiple single-objective subproblems according to a set of weight vectors. Besides, a flexible mechanism for diversity control is provided in MS-PSO/D. Extensive experiments have been conducted to study MS-PSO/D on two permutation-based MOCOPs, namely the MOTSP and the MOPSP. Experimental results validate that the proposed methodology is promising.

Investigation and study on each technique and example of intelligent planning; Intelligent planning no kakushu shuho to jirei ni kansuru chosa kenkyu

Energy Technology Data Exchange (ETDEWEB)

NONE

1995-12-11

Various problems on intelligent planning (IP) and the tendency of basic technology were investigated. For each technique of IP, a Petri net and mark graph have been widely used as the modeling and analysis methods of a discrete event system. Moreover, various planning problems were modeled by a traveling salesman problem, and the efficient solution of the traveling salesman problem has been studied simultaneously. The tendency of the basic technology and application system viewed from an example of intelligent plant planning was investigated as an applied field of planning technology, with importance attached to the production system and robot planning. In the scheduling technology of the production system, the activation of an AI study and a new theory (i.e., architecture study) based on natural science information was investigated with the transition in the world as a trigger. A robot system has been planned in a wide range such as the environmental information acquisition planning of a robot. 202 refs., 69 figs., 4 tabs.

Tolerance based algorithms for the ATSP

NARCIS (Netherlands)

Goldengorin, B; Sierksma, G; Turkensteen, M; Hromkovic, J; Nagl, M; Westfechtel, B

2004-01-01

In this paper we use arc tolerances, instead of arc costs, to improve Branch-and-Bound type algorithms for the Asymmetric Traveling Salesman Problem (ATSP). We derive new tighter lower bounds based on exact and approximate bottleneck upper tolerance values of the Assignment Problem (AP). It is shown

Browse Title Index

African Journals Online (AJOL)

Items 701 - 750 of 985 ... Vol 16 (2010), On Typical Elastic Problem of Green's Function For Rectangular ... of Transfer Function Models using Genetic Algorithms, Abstract ... the Traveling Salesman And the Nearest Neighbors Algorithms, Abstract.

Aplicação e análise de alguns procedimentos de contrução de rota para o problema do caixeiro viajante

Directory of Open Access Journals (Sweden)

Paula Francis Benevides

2012-04-01

Full Text Available O transporte, em geral, absorve em média a porcentagem mais elevada de custos do que qualquer outra atividade logística. Por isso, muitas empresas estão repensando seus processos para redução dos mesmos. A otimização da distribuição de produtos é um problema estudado há muito tempo por pesquisadores de diversas áreas. Este tipo de problema é classificado como de otimização combinatória. Dentre as modelagens podem ser citados o Problema do Caixeiro Viajante (PCV e o Problema de Roteamento de Veículos (PRV. Estes têm por objetivo encontrar o menor caminho conectando-seNlugares de destino. O presente trabalho visa analisar e comparar, em termos de desempenho computacional e qualidade das soluções obtidas, as principais heurísticas de construção de rotas, além de um Algoritmo Genético para o PCV. Também aplicou-se o algoritmo 2-opt para melhoria das rotas geradas. Foram utilizados dados reais de uma distribuidora de produtos em uma determinada região da cidade de Curitiba (PR, Brasil. As coordenadas geográficas dos pontos de visitação foram extraídas do aplicativo online Google Earth, as quais foramconvertidas em coordenadas cartesianas, para posterior aplicação dos algoritmos utilizados. Os resultados obtidos foram comparados com as rotas reais que estão sendo utilizadas por um determinado representante da referida distribuidora. The transport in general, absorb on average the highest percentage of costs than any other logistics activities. Therefore,many companies are rethinking their processes to reduce them. The optimization of product distribution is a much studied problem time by researchers from several areas. This type of problem is classified as combinatorial optimization. Among the modeling can be cited the Traveling Salesman Problem (TSP and the problem of Vehicle Routing (PRV. These, aims to find the lowest path connecting N places of destination. The present work analyze and compare, in terms of

Computer aided discovery of families of valid inequalities

DEFF Research Database (Denmark)

Røpke, Stefan

that are violated by a fractional solution supplied by the user. It is up to the user to generalize these examples further. We will present examples of new families of inequalities for the capacitated vehicle routing problem and the traveling salesman problem with pickup and deliveries found using the program....

Optimization Approaches for the Traveling Salesman Problem with Drone

NARCIS (Netherlands)

N.A.H. Agatz (Niels); P.C. Bouman (Paul); M.E. Schmidt (Marie)

2016-01-01

textabstractThe fast and cost-efficient home delivery of goods ordered online is logistically challenging. Many companies are looking for new ways to cross the last-mile to their customers. One technology-enabled opportunity that recently has received much at- tention is the use of a drone to

Machine learning meliorates computing and robustness in discrete combinatorial optimization problems.

Directory of Open Access Journals (Sweden)

Fushing Hsieh

2016-11-01

Full Text Available Discrete combinatorial optimization problems in real world are typically defined via an ensemble of potentially high dimensional measurements pertaining to all subjects of a system under study. We point out that such a data ensemble in fact embeds with system's information content that is not directly used in defining the combinatorial optimization problems. Can machine learning algorithms extract such information content and make combinatorial optimizing tasks more efficient? Would such algorithmic computations bring new perspectives into this classic topic of Applied Mathematics and Theoretical Computer Science? We show that answers to both questions are positive. One key reason is due to permutation invariance. That is, the data ensemble of subjects' measurement vectors is permutation invariant when it is represented through a subject-vs-measurement matrix. An unsupervised machine learning algorithm, called Data Mechanics (DM, is applied to find optimal permutations on row and column axes such that the permuted matrix reveals coupled deterministic and stochastic structures as the system's information content. The deterministic structures are shown to facilitate geometry-based divide-and-conquer scheme that helps optimizing task, while stochastic structures are used to generate an ensemble of mimicries retaining the deterministic structures, and then reveal the robustness pertaining to the original version of optimal solution. Two simulated systems, Assignment problem and Traveling Salesman problem, are considered. Beyond demonstrating computational advantages and intrinsic robustness in the two systems, we propose brand new robust optimal solutions. We believe such robust versions of optimal solutions are potentially more realistic and practical in real world settings.

„Honda” korporācijas konkurētspēja Japānas un pasaules auto industrijas tirgū

OpenAIRE

Rubina, Jeļena

2010-01-01

Bakalaura darbs „„Honda” korporācijas konkurētspēja Japānas un pasaules auto industrijas tirgū” ir veltīts „Honda” korporācijas izpētei, balstoties uz vairākiem faktoriem, kuri ietekmējuši tās panākumus Japānas un pasaules auto industrijā. To skaitā ir korporācijas vēsture un pieredze moto industrijā, kas sekmējusi korporācijas stratēģijas izveidi, tehnoloģiju attīstīšana, kuru veic speciāla korporācijas filiāle, un to pielietošana auto būvniecībā, tai skaitā arī hibrīdauto un sacīkšu auto...

On the Complexity of Numerical Analysis

DEFF Research Database (Denmark)

Miltersen, Peter Bro; Kjeldgaard-Pedersen, Johan; Burgisser, Peter

2006-01-01

an integer N, decide whether N is greater than 0. We show that PosSLP lies in the counting hierarchy, and combining our results with work of Tiwari, we show that the Euclidean Traveling Salesman Problem lies in the counting hierarchy - the previous best upper bound for this important problem (in terms...

OpenGLを用いた知能情報処理教育支援

OpenAIRE

辻,大介; 朱,紅兵

2006-01-01

本研究では知能情報処理の分野で欠かせないニューラルネットワークのシミュレーションについて，TSP問題と連想記憶のシミュレーションの過程・結果をグラフィックスライブラリの１つであるOpenGLによって視覚化し，知能情報処理への教育支援について研究した。過程・結果を視覚化することによりシミュレーションの内容を直感的に理解でき，マウスや方向キーによる簡単な操作でシミュレーションを行うことが可能になる。We utilized in this work one of free graphics library OpenGL to visualize the input, output and process of Simulation:resolving TSP(Traveling Salesman Problem) and Associative Memory with neural network that is fundamental application of Intelligent Information Processing.　That makes great advanta...

Comparison of Genetic Algorithm and Hill Climbing for Shortest Path Optimization Mapping

Directory of Open Access Journals (Sweden)

Fronita Mona

2018-01-01

Full Text Available Traveling Salesman Problem (TSP is an optimization to find the shortest path to reach several destinations in one trip without passing through the same city and back again to the early departure city, the process is applied to the delivery systems. This comparison is done using two methods, namely optimization genetic algorithm and hill climbing. Hill Climbing works by directly selecting a new path that is exchanged with the neighbour’s to get the track distance smaller than the previous track, without testing. Genetic algorithms depend on the input parameters, they are the number of population, the probability of crossover, mutation probability and the number of generations. To simplify the process of determining the shortest path supported by the development of software that uses the google map API. Tests carried out as much as 20 times with the number of city 8, 16, 24 and 32 to see which method is optimal in terms of distance and time computation. Based on experiments conducted with a number of cities 3, 4, 5 and 6 producing the same value and optimal distance for the genetic algorithm and hill climbing, the value of this distance begins to differ with the number of city 7. The overall results shows that these tests, hill climbing are more optimal to number of small cities and the number of cities over 30 optimized using genetic algorithms.

in-town tour optimization town tour optimization town tour

African Journals Online (AJOL)

eobe

operation was formulated as a Traveling Salesman Problem on Excel spreadsheet. The results ... 19.27 %, tour time by 0.33-22.80 %, and fuel consumption. 22.80 %, and fuel ..... solving TSPs and reports a real world in-town tour improvement ...

Measurement of activity concentrations of {sup 40}K, 2{sup 32T}h and {sup 238}U in TSP aerosols and the associated inhalation annual effective radiation dose to the public in Gosan site, Jeju

Energy Technology Data Exchange (ETDEWEB)

Han, Chung Hun; Park, Youn Hyun; Park, Jae Woo [Jeju National University, Jeju (Korea, Republic of)

2016-10-15

Gamma radiation emitted from naturally occurring radioisotopes, such as 40K and the radionuclides from the {sup 232}Th and {sup 238}U series and their decay products, which exist at trace levels in all ground formations, represents the main external source of irradiation to the human body. The objective of the current study is to determine the activity concentrations of 40K, {sup 232}Th and {sup 238}U in airborne TSP and the associated internal radiation dose to the public due to inhalation in Gosan site, Jeju Island, Korea. The atmospheric total suspended particulates (TSP) aerosols were collected at Gosan site of Jeju Island, which is one of the background sites of Korea, during January to April 2013. This study analyzed using ICP-DRC-MS the concentrations of potassium, uranium and thorium, and evaluated the annual effective dose by breathing from the results. The correlations between the studied natural isotopes is a good positive correlation between {sup 232}Th and {sup 238}U, supporting the conclusion that they originated from the same source, mostly the crust. The backward trajectory analysis has confirmed that the 40K, {sup 238}U and {sup 232}Th are delivered as the air masses have moved from the China continent. The inhalation annual effective radiation dose (default mode F) to the public due to natural isotopes of the airborne TSP was in the range 16.195 - 77.051 nSv/y, depending on the age group. Jeju Island with less pollution source and low population density is also one of the best places as a background area in Asia.

ON PEDIGREE POLYTOPE AND ITS PROPERTIES

Directory of Open Access Journals (Sweden)

Tiru S. Arthanari

2013-07-01

Full Text Available The fact that linear optimization over a polytope can be done in polynomial time in the input size of the instance, has created renewed interest in studying 0-1 polytopes corresponding to combinatorial optimization problems. Studying their polyhedral structure has resulted in new algorithms to solve very large instances of some difficult problems like the symmetric traveling salesman problem. The multistage insertion formulation (MI given by the author, in 1982, for the symmetric traveling salesman problem (STSP, gives rise to a combinatorial object called the pedigree. The pedigrees are in one-to-one correspondence with Hamiltonian cycles. Given n, the convex hull of all the pedigrees is called the corresponding pedigree polytope. In this article we bring together the research done a little over a decade by the author and his doctoral students, on the pedigree polytope, its structure, membership problem and properties of the MI formulation for the STSP. In addition we summarise some of the computational and other peripheral results relating to pedigree approach to solve the STSP. The pedigree polytope possesses properties not shared by the STSP (tour polytope, which makes it interesting to study the pedigrees, both from theoretical and algorithmic perspectives.

Clausewitzian Friction and Future War Revised Edition

Science.gov (United States)

2004-01-01

Hanoverian general Rudolf von Hammerstein was ordered to occupy the town of Menin in southern Belgium, Scharnhorst served as his principal staff offi...their own files. 100 ENDNOTES FOR PAGES 38–41 156 The intractability of the traveling salesman, or Steiner shortest network, problem is as fol- lows...the class of “hard” problems epitomized by the Steiner problem remains “the preeminent problem in theoretical computer science” (Marshall W. Bern and

Determination of samples with TSP size at PLTU Pacitan, Jawa Timur have been done

International Nuclear Information System (INIS)

Rusmanto, Tri; Mulyono; Irianto, Bambang

2013-01-01

Sampling is done using equipment High Volume Air Sampler (HVAS) and analysis using gamma spectrometer. Sampling at 3 locations, each location of the sampling carried out 24 hours, air samples on filter conditioned at room temperature, weighed to a contained weight, counting for 24 hours with gamma spectrometer. The result of qualitative and quantitative analysis of filter TSP was contained of locations I Ra-226 = 0,000888 Bq/m 3 , Pb-212 = 0,000356 Bq/m 3 , Pb-214 = 0,000859 Bq/m 3 , Bi-214 = 0,000712 Bq/m 3 , Ac-228 = 0,004447 Bq/m 3 , K-40 = 0,035454 Bq/m 3 ) , Locations II Ra-226 = 0,00113 Bq/m 3 , Pb-212 = 0,00079 Bq/m 3 , Pb-214 = 0,001351 Bq/m 3 , Bi-214 = 0,000433 Bq/m 3 , Ac-228 = 0,007138 Bq/m 3 , K-40 = 0,018532 Bq/m 3 , Locations III Ra-226 = 0,001424 Bq/m 3 , Pb-212 = 0,000208 Bq/m 3 , Pb-214 = 000052 Bq/m 3 , Bi-214 = 0,001408 Bq/m 3 , Ac-228 = 0,008362 Bq/m 3 , K-40 = 0,020536 Bq/m 3 . Radionuclides activity was all still below quality of air enabled by BAPETEN. Become the activities of ambient air of PLTU area still be peaceful enough as settlement area. (author)

Prevalence and associated factors for thoracic spine pain in the adult working population: a literature review.

Science.gov (United States)

Briggs, Andrew M; Bragge, Peter; Smith, Anne J; Govil, Dhruv; Straker, Leon M

2009-01-01

Spinal pain is a significant occupational health issue. Whilst neck pain and low back pain have received considerable attention, thoracic spinal pain (TSP) has not. The objective of this study was to systematically identify and report the evidence describing the prevalence and correlates of TSP within occupational groups. This literature review systematically searched for reports of TSP prevalence and associated factors for TSP in working adult cohorts using nine electronic databases. Studies were evaluated for level of evidence and epidemiologic data were narratively synthesised. 52 studies were identified describing 65 cohorts covering manual labourers, office workers, health professionals, manufacturing and industrial workers, drivers, military personnel and performing artists. Prevalence varied with occupational group and time period. One year prevalence of TSP ranged from 3.0-55.0%, with most occupational groups having medians around 30%. Significant odds ratios for individual (concurrent musculoskeletal disorders, exercising, pre-menstrual tension and female gender), general work-related (high work load, high work intensity, perceiving ergonomic problems in the workplace, working in some specialised areas, performing boring/tedious work tasks, certain year levels of study, employment duration, driving specialised vehicles, and a high number of flying hours), physical work-related (manual physiotherapy tasks, climbing stairs and high physical stress) and psychosocial work-related (perceived risk of injury and high mental pressure) factors were reported. The high median prevalence rates suggest TSP may be a significant occupational health problem. The multiple domains of associated factors point to the need for prospective research encompassing these domains to inform targeted occupational interventions.

Efficiency of equilibria in uniform matroid congestion games

NARCIS (Netherlands)

de Jong, Jasper; Klimm, Max; Uetz, Marc Jochen

2016-01-01

Network routing games, and more generally congestion games play a central role in algorithmic game theory, comparable to the role of the traveling salesman problem in combinatorial optimization. It is known that the price of anarchy is independent of the network topology for non-atomic congestion

The pooltable analogy to axion physics

International Nuclear Information System (INIS)

Sikivie, P.

1996-01-01

An imaginary character named TSP finds himself in a playroom whose floor is tilted to one side. However, the pooltable in the playroom is horizontal. TSP wonders how this can be. In doing so, he embarks upon an intellectual journey which parallels that which has been travelled during the past two decades by physicists interested in the Strong CP Problem and axion physics

The pooltable analogy to axion physics

Energy Technology Data Exchange (ETDEWEB)

Sikivie, P.

1996-01-01

An imaginary character named TSP finds himself in a playroom whose floor is tilted to one side. However, the pooltable in the playroom is horizontal. TSP wonders how this can be. In doing so, he embarks upon an intellectual journey which parallels that which has been travelled during the past two decades by physicists interested in the Strong CP Problem and axion physics.

Aplicación de la Teoría de Grafos para mejorar la planificación de rutas de trabajo de una empresa del sector de la distribución automática = An application of Graph Theory to improve the planning of work routes for a company in the vending sector

Directory of Open Access Journals (Sweden)

Puchades Cortés, Vanesa

2008-01-01

Full Text Available En la actualidad, la gestión de rutas es un aspecto fundamental en las empresas cuya actividad se basa principalmente en el transporte, ya que supone elevados costes de carburantes, mano de obra, etc. En este artículo, se estudia el caso de la empresa Semacaf Máquinas de Café S.L., perteneciente al sector de la distribución automática, que quiere evaluar la efectividad de su política actual de rutas y compararla con la política óptima obtenida mediante las aplicaciones informáticas Grafos y Rutas, basadas en algoritmos pertenecientes a la Teoría de Grafos. En este trabajo se aplica el algoritmo del Problema del Viajante, que se adapta a las características del problema de la empresa y que cumple los objetivos de minimizar los costes anteriormente mencionados, así como de evaluar la política actual de gestión de rutas de la empresa. = Currently, the routing management is an important aspect in those companies whose activity is mainly based on the transport, since it involves high costs of fuel, manpower, etc. In this paper, the case of the company Semacaf Máquinas de Café S.L. is studied. This company belongs to the sector of automatic distribution and pursues to evaluate the effectiveness of its current policy about planning routes and to compare it with the optimal policy obtained through the software applications, Grafos and Rutas, based on algorithms belonging to Graph Theory. In this paper, the Traveling Salesman Problem (TSP is applied, due to the characteristics of the problem and because it accomplishes the objectives of minimizing the previously mentioned costs, as well as evaluating the current policy of routing management of the company.

A methodological approach for designing and sequencing product families in Reconfigurable Disassembly Systems

Directory of Open Access Journals (Sweden)

Ignacio Eguia

2011-10-01

Full Text Available Purpose: A Reconfigurable Disassembly System (RDS represents a new paradigm of automated disassembly system that uses reconfigurable manufacturing technology for fast adaptation to changes in the quantity and mix of products to disassemble. This paper deals with a methodology for designing and sequencing product families in RDS. Design/methodology/approach: The methodology is developed in a two-phase approach, where products are first grouped into families and then families are sequenced through the RDS, computing the required machines and modules configuration for each family. Products are grouped into families based on their common features using a Hierarchical Clustering Algorithm. The optimal sequence of the product families is calculated using a Mixed-Integer Linear Programming model minimizing reconfigurability and operational costs. Findings: This paper is focused to enable reconfigurable manufacturing technologies to attain some degree of adaptability during disassembly automation design using modular machine tools. Research limitations/implications: The MILP model proposed for the second phase is similar to the well-known Travelling Salesman Problem (TSP and therefore its complexity grows exponentially with the number of products to disassemble. In real-world problems, which a higher number of products, it may be advisable to solve the model approximately with heuristics. Practical implications: The importance of industrial recycling and remanufacturing is growing due to increasing environmental and economic pressures. Disassembly is an important part of remanufacturing systems for reuse and recycling purposes. Automatic disassembly techniques have a growing number of applications in the area of electronics, aerospace, construction and industrial equipment. In this paper, a design and scheduling approach is proposed to apply in this area. Originality/value: This paper presents a new concept called Reconfigurable Disassembly System

Konkurētspējas analīze medicīnas tūrisma attīstībai Latvijā.

OpenAIRE

Kadincovs, Artūrs

2013-01-01

Maģistra darba tēma ir „Konkurētspējas analīze medicīnas tūrisma attīstībai Latvijā”. Medicīnas tūrisms mūsdienās ir eksporta pakalpojums ar augstu pievienoto vērtību, kurš pozitīva scenārija rezultātā nes lielus ienākumus uzņēmējdarbības videi un valsts ekonomikai un rada labi apmaksātu speciālistu pieprasījumu. Pēc autora domām, medicīnas tūrisma attīstībai Latvijā ir perspektīvs scenārijs, jo Latvijai ir visss nepieciešamais, gan kvalificēts darbaspēks, gan resursi, turklāt pietiekoši ...

Process time optimization of robotic remote laser cutting by utilizing customized beam patterns and redundancy space task sequencing

DEFF Research Database (Denmark)

Villumsen, Sigurd

This dissertation is written as a part of the ROBOCUT project which concerns the development of a new laser cutting technology that seeks to increase the performance of traditional and remote laser cutting by using beam shaping technologies. The resulting customized beam patterns are obtained by ...... axes of the laser cutting system and transforming the sequencing problem into a generalized traveling salesman problem (GTSP)....

STUDI PERBANDINGAN ANTARA ALGORITMA BIVARIATE MARGINAL DISTRIBUTION DENGAN ALGORITMA GENETIKA

Directory of Open Access Journals (Sweden)

Chastine Fatichah

2006-01-01

Full Text Available Bivariate Marginal Distribution Algorithm is extended from Estimation of Distribution Algorithm. This heuristic algorithm proposes the new approach for recombination of generate new individual that without crossover and mutation process such as genetic algorithm. Bivariate Marginal Distribution Algorithm uses connectivity variable the pair gene for recombination of generate new individual. Connectivity between variable is doing along optimization process. In this research, genetic algorithm performance with one point crossover is compared with Bivariate Marginal Distribution Algorithm performance in case Onemax, De Jong F2 function, and Traveling Salesman Problem. In this research, experimental results have shown performance the both algorithm is dependence of parameter respectively and also population size that used. For Onemax case with size small problem, Genetic Algorithm perform better with small number of iteration and more fast for get optimum result. However, Bivariate Marginal Distribution Algorithm perform better of result optimization for case Onemax with huge size problem. For De Jong F2 function, Genetic Algorithm perform better from Bivariate Marginal Distribution Algorithm of a number of iteration and time. For case Traveling Salesman Problem, Bivariate Marginal Distribution Algorithm have shown perform better from Genetic Algorithm of optimization result. Abstract in Bahasa Indonesia : Bivariate Marginal Distribution Algorithm merupakan perkembangan lebih lanjut dari Estimation of Distribution Algorithm. Algoritma heuristik ini mengenalkan pendekatan baru dalam melakukan rekombinasi untuk membentuk individu baru, yaitu tidak menggunakan proses crossover dan mutasi seperti pada Genetic Algorithm. Bivariate Marginal Distribution Algorithm menggunakan keterkaitan pasangan variabel dalam melakukan rekombinasi untuk membentuk individu baru. Keterkaitan antar variabel tersebut ditemukan selama proses optimasi berlangsung. Aplikasi yang

PALNS - A software framework for parallel large neighborhood search

DEFF Research Database (Denmark)

Røpke, Stefan

2009-01-01

This paper propose a simple, parallel, portable software framework for the metaheuristic named large neighborhood search (LNS). The aim is to provide a framework where the user has to set up a few data structures and implement a few functions and then the framework provides a metaheuristic where ...... parallelization "comes for free". We apply the parallel LNS heuristic to two different problems: the traveling salesman problem with pickup and delivery (TSPPD) and the capacitated vehicle routing problem (CVRP)....

Exponential lower bounds for polytopes in combinatorial optimization

NARCIS (Netherlands)

Fiorini, S. (Samuel); Massar, S. (Serge); Pokutta, S. (Sebastian); Tiwary, H.R. (Hans Raj); De Wolf, R. (Ronald)

2015-01-01

textabstractWe solve a 20-year old problem posed by Yannakakis and prove that no polynomial-size linear program (LP) exists whose associated polytope projects to the traveling salesman polytope, even if the LP is not required to be symmetric. Moreover, we prove that this holds also for the cut

Computing nonsimple polygons of minimum perimeter

NARCIS (Netherlands)

Fekete, S.P.; Haas, A.; Hemmer, M.; Hoffmann, M.; Kostitsyna, I.; Krupke, D.; Maurer, F.; Mitchell, J.S.B.; Schmidt, A.; Schmidt, C.; Troegel, J.

2018-01-01

We consider the Minimum Perimeter Polygon Problem (MP3): for a given set V of points in the plane, find a polygon P with holes that has vertex set V , such that the total boundary length is smallest possible. The MP3 can be considered a natural geometric generalization of the Traveling Salesman

Exponential Lower Bounds for Polytopes in Combinatorial Optimization

NARCIS (Netherlands)

Fiorini, S.; Massar, S.; Pokutta, S.; Tiwary, H.R.; de Wolf, R.

2015-01-01

We solve a 20-year old problem posed by Yannakakis and prove that no polynomial-size linear program (LP) exists whose associated polytope projects to the traveling salesman polytope, even if the LP is not required to be symmetric. Moreover, we prove that this holds also for the cut polytope and the

Fulltext PDF

Indian Academy of Sciences (India)

mapffrom a given domain D to the real line and the problem is to find the point in ... number equal to the total distance the salesman would travel ifhe were to visit the ... If the proba- bility of the chain being in i at a given time is 1t Ci), the proba-.

Development of Gis Tool for the Solution of Minimum Spanning Tree Problem using Prim's Algorithm

Science.gov (United States)

Dutta, S.; Patra, D.; Shankar, H.; Alok Verma, P.

2014-11-01

minimum spanning tree (MST) of a connected, undirected and weighted network is a tree of that network consisting of all its nodes and the sum of weights of all its edges is minimum among all such possible spanning trees of the same network. In this study, we have developed a new GIS tool using most commonly known rudimentary algorithm called Prim's algorithm to construct the minimum spanning tree of a connected, undirected and weighted road network. This algorithm is based on the weight (adjacency) matrix of a weighted network and helps to solve complex network MST problem easily, efficiently and effectively. The selection of the appropriate algorithm is very essential otherwise it will be very hard to get an optimal result. In case of Road Transportation Network, it is very essential to find the optimal results by considering all the necessary points based on cost factor (time or distance). This paper is based on solving the Minimum Spanning Tree (MST) problem of a road network by finding it's minimum span by considering all the important network junction point. GIS technology is usually used to solve the network related problems like the optimal path problem, travelling salesman problem, vehicle routing problems, location-allocation problems etc. Therefore, in this study we have developed a customized GIS tool using Python script in ArcGIS software for the solution of MST problem for a Road Transportation Network of Dehradun city by considering distance and time as the impedance (cost) factors. It has a number of advantages like the users do not need a greater knowledge of the subject as the tool is user-friendly and that allows to access information varied and adapted the needs of the users. This GIS tool for MST can be applied for a nationwide plan called Prime Minister Gram Sadak Yojana in India to provide optimal all weather road connectivity to unconnected villages (points). This tool is also useful for constructing highways or railways spanning several

Cortical mechanisms for trans-saccadic memory and integration of multiple object features

Science.gov (United States)

Prime, Steven L.; Vesia, Michael; Crawford, J. Douglas

2011-01-01

Constructing an internal representation of the world from successive visual fixations, i.e. separated by saccadic eye movements, is known as trans-saccadic perception. Research on trans-saccadic perception (TSP) has been traditionally aimed at resolving the problems of memory capacity and visual integration across saccades. In this paper, we review this literature on TSP with a focus on research showing that egocentric measures of the saccadic eye movement can be used to integrate simple object features across saccades, and that the memory capacity for items retained across saccades, like visual working memory, is restricted to about three to four items. We also review recent transcranial magnetic stimulation experiments which suggest that the right parietal eye field and frontal eye fields play a key functional role in spatial updating of objects in TSP. We conclude by speculating on possible cortical mechanisms for governing egocentric spatial updating of multiple objects in TSP. PMID:21242142

PELATIHAN APPRECIATIVE INQUIRY UNTUK MENINGKATKAN EFIKASI DIRI WIRANIAGA DALAM MELAKUKAN TUGAS PENJUALAN

OpenAIRE

Neni Lala Sitepu

2013-01-01

Salesman performance and his effort is influenced by self efficacy. Appreciative inquiry is transformation in order to dig positive experiences that lead human future. The aim of this research is measuring the effect of appreciative inquiry training to improve self efficacy of salesman. Manipulation is conducted by experiental learning method. 36 participants was divided into two groups, experimental group (N=18) and control group (N=18). Characteristic of subject is salesman whose low self e...

ADAPTIVE SELECTION OF AUXILIARY OBJECTIVES IN MULTIOBJECTIVE EVOLUTIONARY ALGORITHMS

Directory of Open Access Journals (Sweden)

I. A. Petrova

2016-05-01

Full Text Available Subject of Research.We propose to modify the EA+RL method, which increases efficiency of evolutionary algorithms by means of auxiliary objectives. The proposed modification is compared to the existing objective selection methods on the example of travelling salesman problem. Method. In the EA+RL method a reinforcement learning algorithm is used to select an objective – the target objective or one of the auxiliary objectives – at each iteration of the single-objective evolutionary algorithm.The proposed modification of the EA+RL method adopts this approach for the usage with a multiobjective evolutionary algorithm. As opposed to theEA+RL method, in this modification one of the auxiliary objectives is selected by reinforcement learning and optimized together with the target objective at each step of the multiobjective evolutionary algorithm. Main Results.The proposed modification of the EA+RL method was compared to the existing objective selection methods on the example of travelling salesman problem. In the EA+RL method and its proposed modification reinforcement learning algorithms for stationary and non-stationary environment were used. The proposed modification of the EA+RL method applied with reinforcement learning for non-stationary environment outperformed the considered objective selection algorithms on the most problem instances. Practical Significance. The proposed approach increases efficiency of evolutionary algorithms, which may be used for solving discrete NP-hard optimization problems. They are, in particular, combinatorial path search problems and scheduling problems.

Exploiting Elementary Landscapes for TSP, Vehicle Routing and Scheduling

Science.gov (United States)

2015-09-03

similar mathematical foundation to enable gradient descent methods for discrete combinatorial optimization problems. We are also generalizing our prior...research has exploited statistical and mathematical properties of elementary landscapes to develop new gradient methods for combinatorial optimization... mathematically methods to more automatically identify elementary landscapes. If a combinatorial optimization problem is a superposition of elemen

"What's happened to this family anyway?" : the disintegration of the American family in selected plays by O'Neill, Miller, and Shepard

OpenAIRE

Mathisen, Kari

2009-01-01

This thesis examines the disintegration of the American family as depicted in selected plays by Eugene O’Neill, Arthur Miller, and Sam Shepard. Four plays are central: Long Day’s Journey into Night (1956), Death of a Salesman (1949), Buried Child (1978), and True West (1980). (Journey and Salesman constitute my major focus and serve to generate my thesis statement, while Buried Child and True West illuminate the thematic concerns of Journey and Salesman from quite a different perspective, and...

Support for the Annual Meeting (30th) of the Cognitive Science Society

Science.gov (United States)

2008-10-01

2006) Contents Zygmunt Pizlo (2006) Editor’s Introduction Nicholas R. Burns. Michael I). Lee. and Douglas Viekers (2006) Are Individual Differences...Zheng Li, VII I laxhimiisa. and \\\\ alter G. Kropatsch (2006) Traveling Salesman Problem: A Foveating Pyramid Model Volume 1 Issue 2 (2007) Contents ...Backward Counterfactuals Morteza Dehghani, Rumen Iliev, Stefan Kaufmann 1169 Concepts and Categories Thursday, July 24,2008

Deploying Monitoring Trails for Fault Localization in All- Optical Networks and Radio-over-Fiber Passive Optical Networks

Science.gov (United States)

Maamoun, Khaled Mohamed

Fault localization is the process of realizing the true source of a failure from a set of collected failure notifications. Isolating failure recovery within the network optical domain is necessary to resolve alarm storm problems. The introduction of the monitoring trail (m-trail) has been proven to deliver better performance by employing monitoring resources in a form of optical trails - a monitoring framework that generalizes all the previously reported counterparts. In this dissertation, the m-trail design is explored and a focus is given to the analysis on using m-trails with established lightpaths to achieve fault localization. This process saves network resources by reducing the number of the m-trails required for fault localization and therefore the number of wavelengths used in the network. A novel approach based on Geographic Midpoint Technique, an adapted version of the Chinese Postman's Problem (CPP) solution and an adapted version of the Traveling Salesman's Problem (TSP) solution algorithms is introduced. The desirable features of network architectures and the enabling of innovative technologies for delivering future millimeter-waveband (mm-WB) Radio-over-Fiber (RoF) systems for wireless services integrated in a Dense Wavelength Division Multiplexing (DWDM) is proposed in this dissertation. For the conceptual illustration, a DWDM RoF system with channel spacing of 12.5 GHz is considered. The mm-WB Radio Frequency (RF) signal is obtained at each Optical Network Unit (ONU) by simultaneously using optical heterodyning photo detection between two optical carriers. The generated RF modulated signal has a frequency of 12.5 GHz. This RoF system is easy, cost-effective, resistant to laser phase noise and also reduces maintenance needs, in principle. A revision of related RoF network proposals and experiments is also included. A number of models for Passive Optical Networks (PON)/ RoF-PON that combine both innovative and existing ideas along with a number of

Solving the Traveling Salesman’s Problem Using the African Buffalo Optimization

Directory of Open Access Journals (Sweden)

Julius Beneoluchi Odili

2016-01-01

Full Text Available This paper proposes the African Buffalo Optimization (ABO which is a new metaheuristic algorithm that is derived from careful observation of the African buffalos, a species of wild cows, in the African forests and savannahs. This animal displays uncommon intelligence, strategic organizational skills, and exceptional navigational ingenuity in its traversal of the African landscape in search for food. The African Buffalo Optimization builds a mathematical model from the behavior of this animal and uses the model to solve 33 benchmark symmetric Traveling Salesman’s Problem and six difficult asymmetric instances from the TSPLIB. This study shows that buffalos are able to ensure excellent exploration and exploitation of the search space through regular communication, cooperation, and good memory of its previous personal exploits as well as tapping from the herd’s collective exploits. The results obtained by using the ABO to solve these TSP cases were benchmarked against the results obtained by using other popular algorithms. The results obtained using the African Buffalo Optimization algorithm are very competitive.

Spatial and temporal variations of chemicals in the TSP aerosols simultaneously collected at three islands in Okinawa, Japan

Science.gov (United States)

Arakaki, Takemitsu; Azechi, Sotaro; Somada, Yuka; Ijyu, Moriaki; Nakaema, Fumiya; Hitomi, Yuya; Handa, Daishi; Oshiro, Yoshito; Miyagi, Youichi; Tsuhako, Ai; Murayama, Hitomi; Higaonna, Yumi; Tanahara, Akira; Itoh, Akihide; Fukushima, Soko; Higashi, Kazuaki; Henza, Yui; Nishikawa, Rin; Shinjo, Hibiki; Wang, Hongyan

2014-11-01

East Asia's rapid economic growth has led to concerns about the emission of air pollutants. We collected total suspended particle (TSP) aerosol samples simultaneously at three islands in Okinawa, Japan, which are downwind of East Asia, during the Asian dust season, to examine the spatial and temporal variations and chemical transformations of major chemicals in the aerosols. Weekly samples were collected from July 2008 to June 2010, and the concentrations of water-soluble cations, anions, and organic carbon (WSOC) were determined (n = 303). Spatial distribution analysis showed that monthly mean concentrations of non-sea-salt (nss)-SO42- in the spring (Asian dust season) decreased with increasing distance from Asia, while the trend for NO3- was less evident, suggesting that chemical transformation affected the long-range transport of certain chemicals. Temporal variation analysis showed that concentrations of nss-SO42-, NO3-, and WSOC during the spring were about 2.0, 2.4, and 1.8 times those in the summer (cleaner air mass from the Pacific Ocean), respectively. This study demonstrated that air pollutants were transported from the Asian continent to the Okinawa islands and affected the air quality in the region. There may also be impacts on ecosystems, because increased concentrations of particulate NO3- could increase nutrient levels around the Okinawa islands.

Genetic algorithm for the optimization of the loading pattern for reactor core fuel management

International Nuclear Information System (INIS)

Zhou Sheng; Hu Yongming; zheng Wenxiang

2000-01-01

The paper discusses the application of a genetic algorithm to the optimization of the loading pattern for in-core fuel management with the NP characteristics. The algorithm develops a matrix model for the fuel assembly loading pattern. The burnable poisons matrix was assigned randomly considering the distributed nature of the poisons. A method based on the traveling salesman problem was used to solve the problem. A integrated code for in-core fuel management was formed by combining this code with a reactor physics code

Modeling of tool path for the CNC sheet cutting machines

Science.gov (United States)

Petunin, Aleksandr A.

2015-11-01

In the paper the problem of tool path optimization for CNC (Computer Numerical Control) cutting machines is considered. The classification of the cutting techniques is offered. We also propose a new classification of toll path problems. The tasks of cost minimization and time minimization for standard cutting technique (Continuous Cutting Problem, CCP) and for one of non-standard cutting techniques (Segment Continuous Cutting Problem, SCCP) are formalized. We show that the optimization tasks can be interpreted as discrete optimization problem (generalized travel salesman problem with additional constraints, GTSP). Formalization of some constraints for these tasks is described. For the solution GTSP we offer to use mathematical model of Prof. Chentsov based on concept of a megalopolis and dynamic programming.

Thrombospondins 1 and 2 are important for afferent synapse formation and function in the inner ear.

Science.gov (United States)

Mendus, Diana; Sundaresan, Srividya; Grillet, Nicolas; Wangsawihardja, Felix; Leu, Rose; Müller, Ulrich; Jones, Sherri M; Mustapha, Mirna

2014-04-01

Thrombospondins (TSPs) constitute a family of secreted extracellular matrix proteins that have been shown to be involved in the formation of synapses in the central nervous system. In this study, we show that TSP1 and TSP2 are expressed in the cochlea, and offer the first description of their putative roles in afferent synapse development and function in the inner ear. We examined mice with deletions of TSP1, TSP2 and both (TSP1/TSP2) for inner ear development and function. Immunostaining for synaptic markers indicated a significant decrease in the number of formed afferent synapses in the cochleae of TSP2 and TSP1/TSP2 knockout (KO) mice at postnatal day (P)29. In functional studies, TSP2 and TSP1/TSP2 KO mice showed elevated auditory brainstem response (ABR) thresholds as compared with wild-type littermates, starting at P15, with the most severe phenotype being seen for TSP1/TSP2 KO mice. TSP1/TSP2 KO mice also showed reduced wave I amplitudes of ABRs and vestibular evoked potentials, suggesting synaptic dysfunction in both the auditory and vestibular systems. Whereas ABR thresholds in TSP1 KO mice were relatively unaffected at early ages, TSP1/TSP2 KO mice showed the most severe phenotype among all of the genotypes tested, suggesting functional redundancy between the two genes. On the basis of the above results, we propose that TSPs play an important role in afferent synapse development and function of the inner ear. © 2014 Federation of European Neuroscience Societies and John Wiley & Sons Ltd.

Pyramid algorithms as models of human cognition

Science.gov (United States)

Pizlo, Zygmunt; Li, Zheng

2003-06-01

There is growing body of experimental evidence showing that human perception and cognition involves mechanisms that can be adequately modeled by pyramid algorithms. The main aspect of those mechanisms is hierarchical clustering of information: visual images, spatial relations, and states as well as transformations of a problem. In this paper we review prior psychophysical and simulation results on visual size transformation, size discrimination, speed-accuracy tradeoff, figure-ground segregation, and the traveling salesman problem. We also present our new results on graph search and on the 15-puzzle.

A hybrid approach for biobjective optimization

DEFF Research Database (Denmark)

Stidsen, Thomas Jacob Riis; Andersen, Kim Allan

2018-01-01

to singleobjective problems is that no standard multiobjective solvers exist and specialized algorithms need to be programmed from scratch.In this article we will present a hybrid approach, which operates both in decision space and in objective space. The approach enables massive efficient parallelization and can...... be used to a wide variety of biobjective Mixed Integer Programming models. We test the approach on the biobjective extension of the classic traveling salesman problem, on the standard datasets, and determine the full set of nondominated points. This has only been done once before (Florios and Mavrotas...

On the Complexity of Numerical Analysis

DEFF Research Database (Denmark)

Allender, Eric; Bürgisser, Peter; Kjeldgaard-Pedersen, Johan

2005-01-01

an integer N, decide whether N>0. We show that PosSLP lies in the counting hierarchy, and we show that if A is any language in the Boolean part of Polynomial-time over the Reals accepted by a machine whose machine constants are algebraic real numbers, then A is in P^PosSLP. Combining our results with work...... of Tiwari, we show that the Euclidean Traveling Salesman Problem lies in the counting hierarchy -- the previous best upper bound for this important problem (in terms of classical complexity classes) being PSPACE....

Apprenticeship Learning: Learning to Schedule from Human Experts

Science.gov (United States)

2016-06-09

identified by the heuristic . A spectrum of problems (i.e. traveling salesman, job-shop scheduling, multi-vehicle routing) was represented , as task locations...caus- ing the codification of this knowledge to become labori- ous. We propose a new approach for capturing domain- expert heuristics through a...demonstrate that this approach accu- rately learns multi-faceted heuristics on both a synthetic data set incorporating job-shop scheduling and vehicle

PELATIHAN APPRECIATIVE INQUIRY UNTUK MENINGKATKAN EFIKASI DIRI WIRANIAGA DALAM MELAKUKAN TUGAS PENJUALAN

Directory of Open Access Journals (Sweden)

Neni Lala Sitepu

2013-10-01

Full Text Available Salesman performance and his effort is influenced by self efficacy. Appreciative inquiry is transformation in order to dig positive experiences that lead human future. The aim of this research is measuring the effect of appreciative inquiry training to improve self efficacy of salesman. Manipulation is conducted by experiental learning method. 36 participants was divided into two groups, experimental group (N=18 and control group (N=18. Characteristic of subject is salesman whose low self efficacy which selected by self efficacy scale. This research used untreated control group design with pretest-posttest. The result showed that mean of posttest (M=148.06 from experimental group is higher than pretest (93.94 and also in control group, posttest (M=88.11 and pretest (87.3. This means that both groups have a higher degree of self efficacy, with difference in experimental group is higher (M=54.12 than control group (0.81. Keywords: appreciative inquiry, self efficacy, salesman, untreated control group design with pretest-posttest

Thrombospondin-1, -2 and -5 have differential effects on vascular smooth muscle cell physiology

Energy Technology Data Exchange (ETDEWEB)

Helkin, Alex; Maier, Kristopher G. [SUNY Upstate Medical University, Division of Vascular Surgery and Endovascular Services, Syracuse, NY (United States); Department of Veterans Affairs VA Healthcare Network Upstate New York at Syracuse, Syracuse, NY (United States); Gahtan, Vivian, E-mail: gahtanv@upstate.edu [SUNY Upstate Medical University, Division of Vascular Surgery and Endovascular Services, Syracuse, NY (United States); Department of Veterans Affairs VA Healthcare Network Upstate New York at Syracuse, Syracuse, NY (United States)

2015-09-04

Introduction: The thrombospondins (TSPs) are matricellular proteins that exert multifunctional effects by binding cytokines, cell-surface receptors and other proteins. TSPs play important roles in vascular pathobiology and are all expressed in arterial lesions. The differential effects of TSP-1, -2, and -5 represent a gap in knowledge in vascular smooth muscle cell (VSMC) physiology. Our objective is to determine if structural differences of the TSPs imparted different effects on VSMC functions critical to the formation of neointimal hyperplasia. We hypothesize that TSP-1 and -2 induce similar patterns of migration, proliferation and gene expression, while the effects of TSP-5 are different. Methods: Human aortic VSMC chemotaxis was tested for TSP-2 and TSP-5 (1–40 μg/mL), and compared to TSP-1 and serum-free media (SFM) using a modified Boyden chamber. Next, VSMCs were exposed to TSP-1, TSP-2 or TSP-5 (0.2–40 μg/mL). Proliferation was assessed by MTS assay. Finally, VSMCs were exposed to TSP-1, TSP-2, TSP-5 or SFM for 3, 6 or 24 h. Quantitative real-time PCR was performed on 96 genes using a microfluidic card. Statistical analysis was performed by ANOVA or t-test, with p < 0.05 being significant. Results: TSP-1, TSP-2 and TSP-5 at 20 μg/mL all induce chemotaxis 3.1 fold compared to serum-free media. TSP-1 and TSP-2 induced proliferation 53% and 54% respectively, whereas TSP-5 did not. In the gene analysis, overall, cardiovascular system development and function is the canonical pathway most influenced by TSP treatment, and includes multiple growth factors, cytokines and proteases implicated in cellular migration, proliferation, vasculogenesis, apoptosis and inflammation pathways. Conclusions and relevance: The results of this study indicate TSP-1, -2, and -5 play active roles in VSMC physiology and gene expression. Similarly to TSP-1, VSMC chemotaxis to TSP-2 and -5 is dose-dependent. TSP-1 and -2 induces VSMC proliferation, but TSP-5 does not, likely

Air quality in Beijing and its transition from coal burning caused problems to traffic exhaust related pollution

International Nuclear Information System (INIS)

Zhang, Y.; Shao, M.; Hu, M.; Tang, D.

1997-01-01

Air pollution in Beijing is characterized by coal smoke for a long time because of energy structure highly dependence on coal consumption. SO 2 , TSP, and NO x ambient concentration are kept in high levels, which exceed the guideline of WHO and National Air Quality Standard NAQS. The trend of SO 2 change is relative stable, its annual average concentration fluctuates around 100 g/m 3 since 1981. TSP show a fast decrease before 1986 and keep a slow decrease afterwards approaching the level of about 300 g/m 3 . NO x concentration increases continuously all the time. Since 1993, NO x concentration exceeds SO 2 to be the important pollutant next to TSP in Beijing, especially in summertime and traffic busy areas. As the consequence of NO x fast increase, the ozone pollution level is elevated greatly since 1980s. Several integrated field measurements were conducted to study the characteristics of photochemical smog and its formation mechanism. Hourly averaged ozone concentration usually exceeded the NAQS (80 ppb) in April to October. The O 3 formation is very sensitive to NO x concentration because of the high NMHC/NO x ratio. In recent years, high O 3 concentration is observed in early Spring and photochemical smog pollution is getting more and more severe with dramatically increase of vehicles in downtown Beijing. It is predicted that O 3 pollution will be expected to enhance greatly in next 20 years under the development plan of future urban transportation system and increment of vehicles, even in the case that control strategies suggested by municipal government are undertaken. So more strengthen control strategies in Beijing are needed

PROBLEMS WITH DETERMINATION OF FUGITIVE EMISSION OF POLYCYCLIC AROMATIC HYDROCARBONS FROM COKE OVEN BATTERY

Directory of Open Access Journals (Sweden)

Rafał Bigda

2017-03-01

Full Text Available Coke oven battery is complex and multifaceted facility in terms of air pollutant emissions. As far as stack or quenching tower does not cause major difficulties of emission measurement, the fugitive emission measurement from sources such as battery top elements (charging holes, ascension pipes or oven doors is still complicated and not fully solved problem. This article presents the discussion concerning main problems and errors likely to be made in particular stages of procedure of fugitive emissions characterization from coke oven battery (selection of sampling points, sampling itself, measurement of air velocity over battery top and laboratory analyses. In addition, results of concentrations measurements of selected substances characteristic for the coking process (naphthalene, anthracene, 4 PAHs and TSP originating from fugitive sources of coke oven battery and subjected to reporting under the E-PRTR are presented. The measurements were carried out on coke oven battery top in points selected on the basis of the preceding detailed air convection velocity measurements over battery top. Results of the velocity measurements were compared with results of numerical modelling using CFD software. The presented material is an attempt to cross-sectional presentation of issues related to the quantitative evaluation of fugitive emission from coke oven battery, discussed on the example of PAHs emission as a group of substances characteristic for coking of coal.

Phylogenomic analysis of vertebrate thrombospondins reveals fish-specific paralogues, ancestral gene relationships and a tetrapod innovation

Directory of Open Access Journals (Sweden)

Adams Josephine C

2006-04-01

Full Text Available Abstract Background Thrombospondins (TSPs are evolutionarily-conserved, extracellular, calcium-binding glycoproteins with important roles in cell-extracellular matrix interactions, angiogenesis, synaptogenesis and connective tissue organisation. Five TSPs, designated TSP-1 through TSP-5, are encoded in the human genome. All but one have known roles in acquired or inherited human diseases. To further understand the roles of TSPs in human physiology and pathology, it would be advantageous to extend the repertoire of relevant vertebrate models. In general the zebrafish is proving an excellent model organism for vertebrate biology, therefore we set out to evaluate the status of TSPs in zebrafish and two species of pufferfish. Results We identified by bioinformatics that three fish species encode larger numbers of TSPs than vertebrates, yet all these sequences group as homologues of TSP-1 to -4. By phylogenomic analysis of neighboring genes, we uncovered that, in fish, a TSP-4-like sequence is encoded from the gene corresponding to the tetrapod TSP-5 gene. Thus, all TSP genes show conservation of synteny between fish and tetrapods. In the human genome, the TSP-1, TSP-3, TSP-4 and TSP-5 genes lie within paralogous regions that provide insight into the ancestral genomic context of vertebrate TSPs. Conclusion A new model for TSP evolution in vertebrates is presented. The TSP-5 protein sequence has evolved rapidly from a TSP-4-like sequence as an innovation in the tetrapod lineage. TSP biology in fish is complicated by the presence of additional lineage- and species-specific TSP paralogues. These novel results give deeper insight into the evolution of TSPs in vertebrates and open new directions for understanding the physiological and pathological roles of TSP-4 and TSP-5 in humans.

Enabling congestion avoidance and reduction in the Michigan-Ohio transportation network to improve supply chain efficiency : freight ATIS.

Science.gov (United States)

2010-01-01

We consider dynamic vehicle routing under milk-run tours with time windows in congested : transportation networks for just-in-time (JIT) production. The arc travel times are considered : stochastic and time-dependent. The problem integrates TSP with ...

Quantitative Global Heat Transfer in a Mach-6 Quiet Tunnel

Science.gov (United States)

Sullivan, John P.; Schneider, Steven P.; Liu, Tianshu; Rubal, Justin; Ward, Chris; Dussling, Joseph; Rice, Cody; Foley, Ryan; Cai, Zeimin; Wang, Bo;

An Empirical Comparison of Seven Iterative and Evolutionary Function Optimization Heuristics

Science.gov (United States)

Baluja, Shumeet

1995-01-01

This report is a repository of the results obtained from a large scale empirical comparison of seven iterative and evolution-based optimization heuristics. Twenty-seven static optimization problems, spanning six sets of problem classes which are commonly explored in genetic algorithm literature, are examined. The problem sets include job-shop scheduling, traveling salesman, knapsack, binpacking, neural network weight optimization, and standard numerical optimization. The search spaces in these problems range from 2368 to 22040. The results indicate that using genetic algorithms for the optimization of static functions does not yield a benefit, in terms of the final answer obtained, over simpler optimization heuristics. Descriptions of the algorithms tested and the encodings of the problems are described in detail for reproducibility.

Solving the equality generalized traveling salesman problem using the Lin–Kernighan–Helsgaun Algorithm

DEFF Research Database (Denmark)

Helsgaun, Keld

2015-01-01

instances in a well-known library of benchmark instances, GTSPLIB, could be solved to optimality in a reasonable time. In addition, it was possible to solve a series of new very-large-scale instances with up to 17,180 clusters and 85,900 vertices. Optima for these instances are not known...... be downloaded in source code....

5 CFR 1651.4 - How to change or cancel a designation of beneficiary.

Science.gov (United States)

2010-01-01

... of beneficiary, the participant must submit to the TSP record keeper a new TSP designation of beneficiary form meeting the requirements of § 1651.3 to the TSP record keeper. If the TSP receives more than... the participant. A participant may change a TSP beneficiary at any time, without the knowledge or...

INCREASED VASOOCCLUSIVE CRISIS IN “O” BLOOD GROUP SICKLE CELL DISEASE PATIENTS: ASSOCIATION WITH UNDERLYING THROMBOSPONDIN LEVELS.

Directory of Open Access Journals (Sweden)

M. Al Huneini

2017-04-01

Full Text Available Abstract: Objectives: To explore the incidence of vaso-occlusive crisis (VOC in Blood Group “O” sickle cell disease (SCD patients, and correlate it with the blood group and thrombospondin (TSP levels. Methods: In 89 consecutive SCD patients, blood samples were obtained for vWF antigen, collagen binding activity, blood group typing, C-reactive protein, variant hemoglobin analysis (HPLC, Serum TSP 1 and TSP 2 levels, complete blood counts, liver function tests, LDH and renal function tests during VOC episodes and in steady state conditions. Results: In the steady state SCD patients (n=72, “O” blood group patients (n=37 showed significantly higher median serum TSP 1 and TSP 2 levels than the non “O” blood group patients [n=35] [p <0.05, Mann-Whitney test], with an inverse relation between VWF:Ag, Factor VIII:C and TSP levels. Furthermore, the serum TSP 1 and TSP 2 levels were significantly higher in patients presenting with acute VOC [n=17], and in those with repeated VOC’s (group 1, n=16 especially amongst those patients with blood group “O” [p, <0.05, Mann-Whitney test]. Conclusions: The study shows that there was an inverse relation between TSP and vWF levels, in blood group “O” SCD patients with an upregulation of the TSP levels. Expectedly, during active VOC crisis, the TSP 1 and TSP 2 levels were significantly elevated.    Key Words: VOC; SCD; TSP; vWD; Blood groups

Thrombospondin1 deficiency reduces obesity-associated inflammation and improves insulin sensitivity in a diet-induced obese mouse model.

Directory of Open Access Journals (Sweden)

Yanzhang Li

Full Text Available Obesity is prevalent worldwide and is associated with insulin resistance. Advanced studies suggest that obesity-associated low-grade chronic inflammation contributes to the development of insulin resistance and other metabolic complications. Thrombospondin 1 (TSP1 is a multifunctional extracellular matrix protein that is up-regulated in inflamed adipose tissue. A recent study suggests a positive correlation of TSP1 with obesity, adipose inflammation, and insulin resistance. However, the direct effect of TSP1 on obesity and insulin resistance is not known. Therefore, we investigated the role of TSP1 in mediating obesity-associated inflammation and insulin resistance by using TSP1 knockout mice.Male TSP1-/- mice and wild type littermate controls were fed a low-fat (LF or a high-fat (HF diet for 16 weeks. Throughout the study, body weight and fat mass increased similarly between the TSP1-/- mice and WT mice under HF feeding conditions, suggesting that TSP1 deficiency does not affect the development of obesity. However, obese TSP1-/- mice had improved glucose tolerance and increased insulin sensitivity compared to the obese wild type mice. Macrophage accumulation and inflammatory cytokine expression in adipose tissue were reduced in obese TSP1-/- mice. Consistent with the local decrease in pro-inflammatory cytokine levels, systemic inflammation was also decreased in the obese TSP1-/- mice. Furthermore, in vitro data demonstrated that TSP1 deficient macrophages had decreased mobility and a reduced inflammatory phenotype.TSP1 deficiency did not affect the development of high-fat diet induced obesity. However, TSP1 deficiency reduced macrophage accumulation in adipose tissue and protected against obesity related inflammation and insulin resistance. Our data demonstrate that TSP1 may play an important role in regulating macrophage function and mediating obesity-induced inflammation and insulin resistance. These data suggest that TSP1 may serve as a

Intravenous methylprednisolone in HTLV-I associated myelopathy/tropical spastic paraparesis (HAM/TSP Metilprednisolona endovenosa na mielopatia associada ao HTLV-I/Paraparesia Espástica Tropical (MAH/PET

Directory of Open Access Journals (Sweden)

Abelardo Q-C Araújo

1993-09-01

Full Text Available HTLV-I (Human T-lymphotropic virus type I associated myelopathy/tropical spastic paraparesis (HAM/TSP is an immunomediated myelopathy induced by the HTLV-I. Some patients, specially those from Japan, seem to have a good response to steroid treatment. However, this has not been found in other regions of the world. High dose intravenous methylprednisolone has been used with success in patients with relapses of multiple sclerosis (MS, another autoimmune disease of the central nervous system. To test the effectiveness of methylprednisolone in patients with HAM/TSP, we devised an open trial in 23 patients. We found a very limited benefit of this form of treatment in these patients. Only one patient, who had the shortest disease duration (five months in the whole group, showed a sustained benefit. We speculate that those patients with a shorter history, with presumably less demye-lination and more inflammatory lesions, would show a better response to immunossupressive treatments.A mielopatia associada ao protovírus T-linfotrópico humano (HTLV-I, também conhecida como paraparesia espástica tropical associada ao HTLV-I (MAH/PET, constitui enfermidade imunomediada desencadeada pela infecção pelo HTLV-I. Nesta condição tem sido demonstrada, particularmente em pacientes japoneses, boa resposta clínica à terapêutica com corticosteróides. Este efeito benéfico todavia não foi encontrado em todas as regiões do mundo. Pulsoterapia com metilprednisolona endovenosa tem sido utilizada com sucesso em pacientes com esclerose múltipla, outro exemplo de doença auto-imune do sistema nervoso central, especialmente durante as fases de exacerbação da doença. Objetivando testar a eficácia da pulsoterapia com metilprednisolona em pacientes com MAH/PET, conduzimos estudo aberto em 23 doentes. Não constatamos efeito benéfico significativo desta forma de tratamento na maioria dos enfermos estudados. Apenas um dos pacientes, o qual exibia o menor tempo de

Sustained beta-cell dysfunction but normalized islet mass in aged thrombospondin-1 deficient mice.

Directory of Open Access Journals (Sweden)

Carl Johan Drott

Full Text Available Pancreatic islet endothelial cells have in recent years been shown to support beta-cell mass and function by paracrine interactions. Recently, we identified an islets endothelial-specific glycoprotein, thrombospondin-1 (TSP-1, that showed to be of importance for islet angiogenesis and beta-cell function in young mice. The present study aimed to investigate long-term consequences for islet morphology and beta-cell function of TSP-1 deficiency. Islet and beta-cell mass were observed increased at 10-12 weeks of age in TSP-1 deficient mice, but were normalized before 16 weeks of age when compared to wild-type controls. Islet vascularity was normal in 10-12 and 16-week-old TSP-1 deficient animals, whereas islets of one-year-old animals lacking TSP-1 were hypervascular. Beta-cell dysfunction in TSP-1 deficient animals was present at similar magnitudes between 10-12 and 52 weeks of age, as evaluated by glucose tolerance tests. The insulin secretion capacity in vivo of islets in one-year-old TSP-1 deficient animals was only ∼15% of that in wild-type animals. Using a transplantation model, we reconstituted TSP-1 in adult TSP-deficient islets. In contrast to neonatal TSP-1 deficient islets that we previously reported to regain function after TSP-1 reconstitution, adult islets failed to recover. We conclude that TSP-1 deficiency in islets causes changing vascular and endocrine morphological alterations postnatally, but is coupled to a chronic beta-cell dysfunction. The beta-cell dysfunction induced by TSP-1 deficiency is irreversible if not substituted early in life.

Translational Control of Host Gene Expression by a Cys-Motif Protein Encoded in a Bracovirus.

Directory of Open Access Journals (Sweden)

Eunseong Kim

Full Text Available Translational control is a strategy that various viruses use to manipulate their hosts to suppress acute antiviral response. Polydnaviruses, a group of insect double-stranded DNA viruses symbiotic to some endoparasitoid wasps, are divided into two genera: ichnovirus (IV and bracovirus (BV. In IV, some Cys-motif genes are known as host translation-inhibitory factors (HTIF. The genome of endoparasitoid wasp Cotesia plutellae contains a Cys-motif gene (Cp-TSP13 homologous to an HTIF known as teratocyte-secretory protein 14 (TSP14 of Microplitis croceipes. Cp-TSP13 consists of 129 amino acid residues with a predicted molecular weight of 13.987 kDa and pI value of 7.928. Genomic DNA region encoding its open reading frame has three introns. Cp-TSP13 possesses six conserved cysteine residues as other Cys-motif genes functioning as HTIF. Cp-TSP13 was expressed in Plutella xylostella larvae parasitized by C. plutellae. C. plutellae bracovirus (CpBV was purified and injected into non-parasitized P. xylostella that expressed Cp-TSP13. Cp-TSP13 was cloned into a eukaryotic expression vector and used to infect Sf9 cells to transiently express Cp-TSP13. The synthesized Cp-TSP13 protein was detected in culture broth. An overlaying experiment showed that the purified Cp-TSP13 entered hemocytes. It was localized in the cytosol. Recombinant Cp-TSP13 significantly inhibited protein synthesis of secretory proteins when it was added to in vitro cultured fat body. In addition, the recombinant Cp-TSP13 directly inhibited the translation of fat body mRNAs in in vitro translation assay using rabbit reticulocyte lysate. Moreover, the recombinant Cp-TSP13 significantly suppressed cellular immune responses by inhibiting hemocyte-spreading behavior. It also exhibited significant insecticidal activities by both injection and feeding routes. These results indicate that Cp-TSP13 is a viral HTIF.

Empty tracks optimization based on Z-Map model

Science.gov (United States)

Liu, Le; Yan, Guangrong; Wang, Zaijun; Zang, Genao

2017-12-01

For parts with many features, there are more empty tracks during machining. If these tracks are not optimized, the machining efficiency will be seriously affected. In this paper, the characteristics of the empty tracks are studied in detail. Combining with the existing optimization algorithm, a new tracks optimization method based on Z-Map model is proposed. In this method, the tool tracks are divided into the unit processing section, and then the Z-Map model simulation technique is used to analyze the order constraint between the unit segments. The empty stroke optimization problem is transformed into the TSP with sequential constraints, and then through the genetic algorithm solves the established TSP problem. This kind of optimization method can not only optimize the simple structural parts, but also optimize the complex structural parts, so as to effectively plan the empty tracks and greatly improve the processing efficiency.

Thrombospondin-2 promotes prostate cancer bone metastasis by the up-regulation of matrix metalloproteinase-2 through down-regulating miR-376c expression

Directory of Open Access Journals (Sweden)

Po-Chun Chen

2017-01-01

Full Text Available Abstract Background Thrombospondin-2 (TSP-2 is a secreted matricellular glycoprotein that is found to mediate cell-to-extracellular matrix attachment and participates in many physiological and pathological processes. The expression profile of TSP-2 on tumors is controversial, and it up-regulates in some cancers, whereas it down-regulates in others, suggesting that the functional role of TSP-2 on tumors is still uncertain. Methods The expression of TSP-2 on prostate cancer progression was determined in the tissue array by the immunohistochemistry. The molecular mechanism of TSP-2 on prostate cancer (PCa metastasis was investigated through pharmaceutical inhibitors, siRNAs, and miRNAs analyses. The role of TSP-2 on PCa metastasis in vivo was verified through xenograft in vivo imaging system. Results Based on the gene expression omnibus database and immunohistochemistry, we found that TSP-2 increased with the progression of PCa, especially in metastatic PCa and is correlated with the matrix metalloproteinase-2 (MMP-2 expression. Additionally, through binding to CD36 and integrin ανβ3, TSP-2 increased cell migration and MMP-2 expression. With inhibition of p38, ERK, and JNK, the TSP-2-induced cell migration and MMP-2 expression were abolished, indicating that the TSP-2’s effect on PCa is MAPK dependent. Moreover, the microRNA-376c (miR-376c was significantly decreased by the TSP-2 treatment. Furthermore, the TSP-2-induced MMP-2 expression and the subsequent cell motility were suppressed upon miR-376c mimic stimulation. On the other hand, the animal studies revealed that the bone metastasis was abolished when TSP-2 was stably knocked down in PCa cells. Conclusions Taken together, our results indicate that TSP-2 enhances the migration of PCa cells by increasing MMP-2 expression through down-regulation of miR-376c expression. Therefore, TSP-2 may represent a promising new target for treating PCa.

Structure and dynamics of the peptide strand KRFK from the thrombospondin TSP-1 in water.

Science.gov (United States)

Taleb Bendiab, W; Benomrane, B; Bounaceur, B; Dauchez, M; Krallafa, A M

2018-02-14

Theoretical investigations of a solute in liquid water at normal temperature and pressure can be performed at different levels of theory. Static quantum calculations as well as classical and ab initio molecular dynamics are used to completely explore the conformational space for large solvated molecular systems. In the classical approach, it is essential to describe all of the interactions of the solute and the solvent in detail. Water molecules are very often described as rigid bodies when the most commonly used interaction potentials, such as the SPCE and the TIP4P models, are employed. Recently, a physical model based upon a cluster of rigid water molecules with a tetrahedral architecture (AB 4 ) was proposed that describes liquid water as a mixture of both TIP4P and SPCE molecular species that occur in the proportions implied by the tetrahedral architecture (one central molecule versus four outer molecules; i.e., 20% TIP4P versus 80% SPCE molecules). In this work, theoretical spectroscopic data for a peptide strand were correlated with the structural properties of the peptide strand solvated in water, based on data calculated using different theoretical approaches and physical models. We focused on a particular peptide strand, KRFK (lysine-arginine-phenylalanine-lysine), found in the thrombospondin TSP-1, due to its interesting properties. As the activity and electronic structure of this system is strongly linked to its structure, we correlated its structure with charge-density maps obtained using different semi-empirical charge Q eq equations. The structural and thermodynamic properties obtained from classical simulations were correlated with ab initio molecular dynamics (AIMD) data. Structural changes in the peptide strand were rationalized in terms of the motions of atoms and groups of atoms. To achieve this, conformational changes were investigated using calculated infrared spectra for the peptide in the gas phase and in water solvent. The calculated AIMD

ROP Case Identification using group-wise ROP detector signal variation

International Nuclear Information System (INIS)

Lee, E. K.

2010-01-01

The aging process in the heat transport system (HTS) of an aged CANDU-6 reactor results in the decrease of regional overpower protection (ROP) Trip setpoint (TSP) because the aging process make the unwanted flow distribution in the fuel channel and increase the possibility of fuel failures in the worst ROP case. It means that the aged CANDU-6 reactor should reduce the operating power level less than 100% at normal operation to prevent fuel failures. To make less decease of operating power level, several methods were applied such as a steam generator tube cleaning to restore efficient heat transfer, an application of new hand switch rules coupled with alarm system, and the adoption of a new TSP evaluation methodology. However, those methods are not permanent solution. The tube cleaning of a steam generator is very expensive work but will be lost its effect within three or four years. The new hand switch position (HSP) rule has been applied to a CANDU reactor by a utility in CANADA but not yet in KOREA. There is a possibility for a site to lost normal operational margin due to the new rule. New ROP TSP evaluation method, i.e., the Extreme Value Statistics (EVS) method, was submitted to Canadian Nuclear Safety Commission (CNSC) and final acceptance is anticipated by end of 2010. However, the successful application of EVS method to CANDU-6 reactors in KOREA maybe require more time because EVS is theoretically different and more complex method compared with the current ROP TSP calculation process. However, if operator can be aware of the core status accurately, then a utility uses the TSP corresponding to the current core status instead of the ROP TSP based on the worst ROP case, which is installed in sites at present. If one can use the TSP against a normal condition, it means the reactor maintains the licensed power or the utility can minimizes the decrease of ROP TSP. The problem is how to get the information about the reactor status accurately. The best way to solve

Evaluation of Efficacy of Radioimmunotherapy with 90Y-Labeled Fully Human Anti-Transferrin Receptor Monoclonal Antibody in Pancreatic Cancer Mouse Models.

Directory of Open Access Journals (Sweden)

Aya Sugyo

Full Text Available Pancreatic cancer is an aggressive tumor and the prognosis remains poor. Therefore, development of more effective therapy is needed. We previously reported that 89Zr-labeled TSP-A01, an antibody against transferrin receptor (TfR, is highly accumulated in a pancreatic cancer xenograft, but not in major normal organs. In the present study, we evaluated the efficacy of radioimmunotherapy (RIT with 90Y-TSP-A01 in pancreatic cancer mouse models.TfR expression in pancreatic cancer cell lines (AsPC-1, BxPC-3, MIAPaCa-2 was evaluated by immunofluorescence staining. 111In-labeled anti-TfR antibodies (TSP-A01, TSP-A02 were evaluated in vitro by cell binding assay with the three cell lines and by competitive inhibition assay with MIAPaCa-2. In vivo biodistribution was evaluated in mice bearing BxPC-3 and MIAPaCa-2 xenografts. Tumor volumes of BxPC-3 and MIAPaCa-2 were sequentially measured after 90Y-TSP-A01 injection and histological analysis of tumors was conducted.MIAPaCa-2 cells showed the highest TfR expression, followed by AsPC-1 and BxPC-3 cells. 111In-TSP-A01 and 111In-TSP-A02 bound specifically to the three cell lines according to TfR expression. The dissociation constants for TSP-A01, DOTA-TSP-A01, TSP-A02, and DOTA-TSP-A02 were 0.22, 0.28, 0.17, and 0.22 nM, respectively. 111In-TSP-A01 was highly accumulated in tumors, especially in MIAPaCa-2, but this was not true of 111In-TSP-A02. The absorbed dose for 90Y-TSP-A01 was estimated to be 8.3 Gy/MBq to BxPC-3 and 12.4 Gy/MBq to MIAPaCa-2. MIAPaCa-2 tumors treated with 3.7 MBq of 90Y-TSP-A01 had almost completely disappeared around 3 weeks after injection and regrowth was not observed. Growth of BxPC-3 tumors was inhibited by 3.7 MBq of 90Y-TSP-A01, but the tumor size was not reduced.90Y-TSP-A01 treatment achieved an almost complete response in MIAPaCa-2 tumors, whereas it merely inhibited the growth of BxPC-3 tumors. 90Y-TSP-A01 is a promising RIT agent for pancreatic cancer, although further

Transiently chaotic neural networks with piecewise linear output functions

Energy Technology Data Exchange (ETDEWEB)

Chen, S.-S. [Department of Mathematics, National Taiwan Normal University, Taipei, Taiwan (China); Shih, C.-W. [Department of Applied Mathematics, National Chiao Tung University, 1001 Ta-Hsueh Road, Hsinchu, Taiwan (China)], E-mail: cwshih@math.nctu.edu.tw

2009-01-30

Admitting both transient chaotic phase and convergent phase, the transiently chaotic neural network (TCNN) provides superior performance than the classical networks in solving combinatorial optimization problems. We derive concrete parameter conditions for these two essential dynamic phases of the TCNN with piecewise linear output function. The confirmation for chaotic dynamics of the system results from a successful application of the Marotto theorem which was recently clarified. Numerical simulation on applying the TCNN with piecewise linear output function is carried out to find the optimal solution of a travelling salesman problem. It is demonstrated that the performance is even better than the previous TCNN model with logistic output function.

An Artificial Immune System with Feedback Mechanisms for Effective Handling of Population Size

Science.gov (United States)

Gao, Shangce; Wang, Rong-Long; Ishii, Masahiro; Tang, Zheng

This paper represents a feedback artificial immune system (FAIS). Inspired by the feedback mechanisms in the biological immune system, the proposed algorithm effectively manipulates the population size by increasing and decreasing B cells according to the diversity of the current population. Two kinds of assessments are used to evaluate the diversity aiming to capture the characteristics of the problem on hand. Furthermore, the processing of adding and declining the number of population is designed. The validity of the proposed algorithm is tested for several traveling salesman benchmark problems. Simulation results demonstrate the efficiency of the proposed algorithm when compared with the traditional genetic algorithm and an improved clonal selection algorithm.

Ultrasound-mediated drug delivery using liposomes modified with a thermosensitive polymer.

Science.gov (United States)

Ninomiya, Kazuaki; Kawabata, Shinya; Tashita, Hiroyuki; Shimizu, Nobuaki

2014-01-01

Ultrasound-mediated drug delivery was established using liposomes that were modified with the thermosensitive polymer (TSP) poly(NIPMAM-co-NIPAM), which sensitized the liposomes to high temperatures. TSP-modified liposomes (TSP liposomes) released encapsulated calcein under 1 MHz ultrasound irradiation at 0.5 W/cm(2) for 120 s as well as the case under incubation at 42 °C for 15 min. In addition, uptake of the drug released from TSP liposomes by cancer cells was enhanced by ultrasound irradiation. In a cell injury assay using doxorubicin (DOX)-loaded TSP liposomes and ultrasound irradiation, cell viability of HepG2 cells at 6 h after ultrasound irradiation (1 MHz, 0.5 W/cm(2) for 30 s) with DOX-loaded TSP liposomes (TSP/lipid ratio=1) was 60%, which was significantly lower than that of the control conditions such as DOX-loaded TSP liposomes alone and DOX-loaded intact liposomes under ultrasound irradiation. Copyright © 2013 Elsevier B.V. All rights reserved.

Path planning for persistent surveillance applications using fixed-wing unmanned aerial vehicles

Science.gov (United States)

Keller, James F.

surveillance applications but few directly address dynamic maneuver constraints. The key feature of C1 is a two stage sequential solution that discretizes the problem so that graph search techniques can be combined with parametric polynomial curve generation. A method to abstract the kino-dynamics of the aerial platforms is then presented so that a graph search solution can be adapted for this application. An A* Traveling Salesman Problem (TSP) algorithm is developed to search the discretized space using the abstract distance metric to acquire more data or avoid obstacles. Results of the graph search are then transcribed into smooth paths based on vehicle maneuver constraints. A complete solution for a single vehicle periodic tour of the area is developed using the results of the graph search algorithm. To execute the mission, we present a simultaneous arrival algorithm (C2) to coordinate execution by multiple vehicles to satisfy data refresh requirements and to ensure there are no collisions at any of the path intersections. We present a toolbox of spline-based algorithms (C3) to streamline the development of C2 continuous paths with numerical stability. These tools are applied to an aerial persistent surveillance application to illustrate their utility. Comparisons with other parametric polynomial approaches are highlighted to underscore the benefits of the B-spline framework. Performance limits with respect to feasibility constraints are documented.

Thrombospondin-1 production is enhanced by Porphyromonas gingivalis lipopolysaccharide in THP-1 cells.

Directory of Open Access Journals (Sweden)

Misa Gokyu

Full Text Available Periodontitis is a chronic inflammatory disease caused by gram-negative anaerobic bacteria. Monocytes and macrophages stimulated by periodontopathic bacteria induce inflammatory mediators that cause tooth-supporting structure destruction and alveolar bone resorption. In this study, using a DNA microarray, we identified the enhanced gene expression of thrombospondin-1 (TSP-1 in human monocytic cells stimulated by Porphyromonas gingivalis lipopolysaccharide (LPS. TSP-1 is a multifunctional extracellular matrix protein that is upregulated during the inflammatory process. Recent studies have suggested that TSP-1 is associated with rheumatoid arthritis, diabetes mellitus, and osteoclastogenesis. TSP-1 is secreted from neutrophils, monocytes, and macrophages, which mediate immune responses at inflammatory regions. However, TSP-1 expression in periodontitis and the mechanisms underlying TSP-1 expression in human monocytic cells remain unknown. Here using real-time RT-PCR, we demonstrated that TSP-1 mRNA expression level was significantly upregulated in inflamed periodontitis gingival tissues and in P. gingivalis LPS-stimulated human monocytic cell line THP-1 cells. TSP-1 was expressed via Toll-like receptor (TLR 2 and TLR4 pathways. In P. gingivalis LPS stimulation, TSP-1 expression was dependent upon TLR2 through the activation of NF-κB signaling. Furthermore, IL-17F synergistically enhanced P. gingivalis LPS-induced TSP-1 production. These results suggest that modulation of TSP-1 expression by P. gingivalis plays an important role in the progression and chronicity of periodontitis. It may also contribute a new target molecule for periodontal therapy.

Complete Evaluation of Suspended Air Particles and Their Composition in the Central Area of Yazd City

Directory of Open Access Journals (Sweden)

M Younesian

2009-01-01

Full Text Available Introduction: Air pollution is one of the problems of the recent century caused by vehicles, industries and other urban activities. The City of Yazd faces air pollution due to its high population, vehicular traffic and industrial places around the city. One of the important parameters of air pollution is suspended air particles that have harmful effects on the health of people, plants and objects. Methods: This research has been carried out by first determining a station in the central area of the city (Shahid Beheshti Square of Yazd. The suspended particles were measured during a five-month period from March to July, 2006. A high volume sampler was used for measuring Total Suspended Particles (TSP. The amount of lead content of TSP was measured in samples by using atomic absorption method. In the next stage, the percentage of organic and inorganic particles in the TSP of all samples was measured by using gravimetric methods and by burning in the oven. Results: The results of this study showed that amount of suspended particles in the city of Yazd is higher than national standard and the general mean average of the suspended particles of air in five months was 233 micrograms per cubic meter. The average concentration of suspended air particles from end of March to August during the five month period was 118, 193, 231, 267and 333, respectively. The average concentration of lead was 0.04 microgram per cubic meter and amount of organic and inorganic particles in TSP was 25.31% and 74.68%, respectively. Conclusion: With respect to the results, the minimum amount of TSP concentration was in March. This could be due to reduction in trading and industrial activities and New Year vacations. In addition, the average monthly TSP increased from March to July; the cause of which could be relative decrease in humidity and increase in temperature. The amount of lead in samples was much less than standard, which could be due to omission of lead from petrol

Intelligent Machine Learning Approaches for Aerospace Applications

Science.gov (United States)

Sathyan, Anoop

detection problem and the aircraft conflict resolution problem. During the last decade, CNNs have become increasingly popular in the domain of image and speech processing. CNNs have a lot more parameters compared to GFSs that are tuned using the back-propagation algorithm. CNNs typically have hundreds of thousands or maybe millions of parameters that are tuned using common cost functions such as integral squared error, softmax loss etc. Chapter 5 discusses a classification problem to classify images as humans or not and Chapter 6 discusses a regression task using CNN for producing an approximate near-optimal route for the Traveling Salesman Problem (TSP) which is regarded as one of the most complicated decision making problem. Both the GFS and CNN are used to develop intelligent systems specific to the application providing them computational efficiency, robustness in the face of uncertainties and scalability.

Calcium-induced conformational changes of Thrombospondin-1 signature domain: implications for vascular disease.

Science.gov (United States)

Gupta, Akanksha; Agarwal, Rahul; Singh, Ashutosh; Bhatnagar, Sonika

2017-06-01

Thrombospondin1 (TSP1) participates in numerous signaling pathways critical for vascular physiology and disease. The conserved signature domain of thrombospondin 1 (TSP1-Sig1) comprises three epidermal growth factor (EGF), 13 calcium-binding type 3 thrombospondin (T3) repeats, and one lectin-like module arranged in a stalk-wire-globe topology. TSP1 is known to be present in both calcium-replete (Holo-) and calcium-depleted (Apo-) state, each with distinct downstream signaling effects. To prepare a homology model of TSP1-Sig1 and investigate the effect of calcium on its dynamic structure and interactions. A homology model of Holo-TSP1-Sig1 was prepared with TSP2 as template in Swissmodel workspace. The Apo-form of the model was obtained by omitting the bound calcium ions from the homology model. Molecular dynamics (MD) simulation studies (100 ns) were performed on the Holo- and Apo- forms of TSP1 using Gromacs4.6.5. After simulation, Holo-TSP1-Sig1 showed significant reorientation at the interface of the EGF1-2 and EGF2-3 modules. The T3 wire is predicted to show the maximum mobility and deviation from the initial model. In Apo-TSP1-Sig1 model, the T3 repeats unfolded and formed coils with predicted increase in flexibility. Apo-TSP1-Sig1model also predicted the exposure of the binding sites for neutrophil elastase, integrin and fibroblast growth factor 2. We present a structural model and hypothesis for the role of TSP1-Sig1 interactions in the development of vascular disorders. The simulated model of the fully calcium-loaded and calcium-depleted TSP1-Sig1 may enable the development of its interactions as a novel therapeutic target for the treatment of vascular diseases.

Thrombospondin-1 is a novel negative regulator of liver regeneration after partial hepatectomy through transforming growth factor-beta1 activation in mice.

Science.gov (United States)

Hayashi, Hiromitsu; Sakai, Keiko; Baba, Hideo; Sakai, Takao

2012-05-01

The matricellular protein, thrombospondin-1 (TSP-1), is prominently expressed during tissue repair. TSP-1 binds to matrix components, proteases, cytokines, and growth factors and activates intracellular signals through its multiple domains. TSP-1 converts latent transforming growth factor-beta1 (TGF-β1) complexes into their biologically active form. TGF-β plays significant roles in cell-cycle regulation, modulation of differentiation, and induction of apoptosis. Although TGF-β1 is a major inhibitor of proliferation in cultured hepatocytes, the functional requirement of TGF-β1 during liver regeneration remains to be defined in vivo. We generated a TSP-1-deficient mouse model of a partial hepatectomy (PH) and explored TSP-1 induction, progression of liver regeneration, and TGF-β-mediated signaling during the repair process after hepatectomy. We show here that TSP-1-mediated TGF-β1 activation plays an important role in suppressing hepatocyte proliferation. TSP-1 expression was induced in endothelial cells (ECs) as an immediate early gene in response to PH. TSP-1 deficiency resulted in significantly reduced TGF-β/Smad signaling and accelerated hepatocyte proliferation through down-regulation of p21 protein expression. TSP-1 induced in ECs by reactive oxygen species (ROS) modulated TGF-β/Smad signaling and proliferation in hepatocytes in vitro, suggesting that the immediately and transiently produced ROS in the regenerating liver were the responsible factor for TSP-1 induction. We have identified TSP-1 as an inhibitory element in regulating liver regeneration by TGF-β1 activation. Our work defines TSP-1 as a novel immediate early gene that could be a potential therapeutic target to accelerate liver regeneration. Copyright © 2011 American Association for the Study of Liver Diseases.

Automatic optimization of a nuclear reactor reload using the algorithm Ant-Q

International Nuclear Information System (INIS)

Machado, Liana; Schirru, Roberto

2002-01-01

The nuclear fuel reload optimization is a NP-Complete combinatorial optimization problem. For decades this problem was solved using an expert's knowledge. From the eighties, however there have been efforts to automatic fuel reload and the more recent ones show the Genetic Algorithm's (GA) efficiency on this problem. Following this trend, our aim is to optimization nuclear fuel reload using Ant-Q, artificial theory based algorithms. Ant-Q's results on the Traveling salesman Problem, which is conceptuality similar to fuel reload, are better than GA's. Ant-Q was tested in real application on the cycle 7 reload of Angra I. Comparing Ant-Q result with the GA's, it can be verified that, even without a local heuristics, the former algorithm, as it superiority comparing the GA in Angra I show. Is a valid technique to solve the nuclear fuel reload problem. (author)

A theory for fluidelastic instability of tube-support-plate-inactive modes

International Nuclear Information System (INIS)

Cai, Y.; Chen, S.S.; Chandra, S.

1991-01-01

Fluidelastic instability of loosely supported tubes, vibrating in a tube support plate (TSP)-inactive mode, is suspected to be one of the main causes of the tube failure in some operating steam generators and heat exchangers. This paper presents a mathematical model for fluidelastic instability of loosely supported tubes exposed to nonuniform crossflow. the model incorporates all motion-dependent fluid forces based on the unsteady-flow theory. In the unstable region associated with a TSP-inactive mode, tube motion can be described by two linear models: TSP-inactive mode when tubes do not strike the TSP, and TSP-active mode when tubes do strike the TSP. The bilinear model (consisting of these linear models) presented here simulates the characteristics of fluidelastic instability of loosely supported tubes in stable and unstable regions associated with TSP-inactive modes. Analytical results obtained with the model are compared with published experimental data; they agree reasonably well. The prediction procedure presented for the fluidelastic instability response of loosely supported tubes is applicable to the stable and unstable regions of the TSP-inactive mode

Dysregulation of CD47 and the ligands thrombospondin 1 and 2 in multiple myeloma

DEFF Research Database (Denmark)

Rendtlew Danielsen, Jannie M; Knudsen, Lene Meldgaard; Dahl, Inger Marie

2007-01-01

% of patients with monoclonal gammopathy of undetermined significance (MGUS) expressed CD47; median expression level increased 10-fold with progression from MGUS to MM. Elevated TSP1/TSP2 levels occurred in bone marrow cultures from MM patients compared with healthy donors. CD47 and TSP1/TSP2 may have......CD47 and thrombospondin 1 and 2 (TSP1 and TSP2) expression were analysed by real-time reverse transcription polymerase chain reaction in fluorescence-activated cell sorted plasma cells (PCs) from patients at consecutive stages of multiple myeloma (MM) development. 80% of MM patients, but only 39...... a potential role in the pathophysiology of MM, probably in the interaction between MM PCs and the microenvironment....

Pain modulatory phenotypes differentiate subgroups with different clinical and experimental pain sensitivity

DEFF Research Database (Denmark)

Vaegter, Henrik B.; Graven-Nielsen, Thomas

2016-01-01

between subgroups. Cuff algometry was performed on lower legs in 400 chronic pain patients to assess pressure pain threshold (cPPT), pressure pain tolerance (cPTT), temporal summation of pain (TSP: increase in pain scores to ten repeated stimulations), and conditioned pain modulation (CPM: increase in c......PPT during cuff pain conditioning on the contralateral leg). Heat detection (HDT) and heat pain thresholds (HPT) at clinical painful and non-painful body areas were assessed. Based on TSP and CPM four distinct groups were formed: Group 1 (n=85) had impaired CPM and facilitated TSP. Group 2 (n=148) had...... impaired CPM and normal TSP. Group 3 (n=45) had normal CPM and facilitated TSP. Group 4 (n=122) had normal CPM and normal TSP. Group 1 showed more pain regions compared with the other three groups (PCPM and facilitated TSP plays an important role in widespread pain. Group 1...

Compressed sensing along physically plausible sampling trajectories in MRI

International Nuclear Information System (INIS)

Chauffert, Nicolas

2015-01-01

. First, we propose continuous sampling schemes based on random walks and on travelling salesman (TSP) problem. Then, we propose a projection algorithm onto the space of constraints that returns the closest feasible curve of an input curve (eg, a TSP solution). Finally, we provide an algorithm to project a measure onto a set of measures carried by parameterizations. In particular, if this set is the one carried by admissible curves, the algorithm returns a curve which sampling density is close to the measure to project. This designs an admissible variable density sampler. The reconstruction results obtained in simulations using this strategy outperform existing acquisition trajectories (spiral, radial) by about 3 dB. They permit to envision a future implementation on a real 7 T scanner soon, notably in the context of high resolution anatomical imaging. (author) [fr

Comparison of gamma ray and electron beam irradiation on extraction yield, morphological and antioxidant properties of polysaccharides from tamarind seed

Energy Technology Data Exchange (ETDEWEB)

Choi, Jong-il [Advanced Radiation Technology Institute, Korea Atomic Energy Research Institute, Jeongeup 580-185 (Korea, Republic of); Kim, Jae-Kyung [Advanced Radiation Technology Institute, Korea Atomic Energy Research Institute, Jeongeup 580-185 (Korea, Republic of); Graduate school of Food and Biotechnology, Korea University, Seoul 146-701 (Korea, Republic of); Srinivasan, Periasamy; Kim, Jae-Hun [Advanced Radiation Technology Institute, Korea Atomic Energy Research Institute, Jeongeup 580-185 (Korea, Republic of); Park, Hyun-Jin [Graduate school of Food and Biotechnology, Korea University, Seoul 146-701 (Korea, Republic of); Byun, Myung-Woo [Advanced Radiation Technology Institute, Korea Atomic Energy Research Institute, Jeongeup 580-185 (Korea, Republic of); Lee, Ju-Woon [Advanced Radiation Technology Institute, Korea Atomic Energy Research Institute, Jeongeup 580-185 (Korea, Republic of)], E-mail: sjwlee@kaeri.re.kr

2009-07-15

Tamarind (Tamarindus indica L) seed polysaccharide (TSP) is of great important due to its various biological activities. The present investigation was carried out to compare extraction yield, morphological characteristics, average molecular weights and antioxidant activities of TSP from gamma- and electron beam (EB)-irradiated tamarind kernel powder. The tamarind kernel powder was irradiated with 0, 5 and 10 kGy by gamma ray (GR) and electron beam, respectively. The extraction yield of TSP was increased significantly by EB and GR irradiation, but there was no significant difference between irradiation types. Morphological studies by scanning electron microscope showed that TSP from GR-irradiated tamarind seed had a fibrous structure, different from that of EB irradiated with a particle structures. The average molecular weight of TSP was decreased by the irradiation, and EB treatment degraded more severely than GR. Superoxide radical scavenging ability and total antioxidant capacity of EB-treated TSP showed higher than those of GR-treated TSP.

Promotion of bone morphogenetic protein signaling by tetraspanins and glycosphingolipids.

Directory of Open Access Journals (Sweden)

Zhiyu Liu

2015-05-01

Full Text Available Bone morphogenetic proteins (BMPs belong to the transforming growth factor β (TGFβ superfamily of secreted molecules. BMPs play essential roles in multiple developmental and homeostatic processes in metazoans. Malfunction of the BMP pathway can cause a variety of diseases in humans, including cancer, skeletal disorders and cardiovascular diseases. Identification of factors that ensure proper spatiotemporal control of BMP signaling is critical for understanding how this pathway is regulated. We have used a unique and sensitive genetic screen to identify the plasma membrane-localized tetraspanin TSP-21 as a key new factor in the C. elegans BMP-like "Sma/Mab" signaling pathway that controls body size and postembryonic M lineage development. We showed that TSP-21 acts in the signal-receiving cells and genetically functions at the ligand-receptor level. We further showed that TSP-21 can associate with itself and with two additional tetraspanins, TSP-12 and TSP-14, which also promote Sma/Mab signaling. TSP-12 and TSP-14 can also associate with SMA-6, the type I receptor of the Sma/Mab pathway. Finally, we found that glycosphingolipids, major components of the tetraspanin-enriched microdomains, are required for Sma/Mab signaling. Our findings suggest that the tetraspanin-enriched membrane microdomains are important for proper BMP signaling. As tetraspanins have emerged as diagnostic and prognostic markers for tumor progression, and TSP-21, TSP-12 and TSP-14 are all conserved in humans, we speculate that abnormal BMP signaling due to altered expression or function of certain tetraspanins may be a contributing factor to cancer development.

Fuzzy Sets-based Control Rules for Terminating Algorithms

Directory of Open Access Journals (Sweden)

Jose L. VERDEGAY

2002-01-01

Full Text Available In this paper some problems arising in the interface between two different areas, Decision Support Systems and Fuzzy Sets and Systems, are considered. The Model-Base Management System of a Decision Support System which involves some fuzziness is considered, and in that context the questions on the management of the fuzziness in some optimisation models, and then of using fuzzy rules for terminating conventional algorithms are presented, discussed and analyzed. Finally, for the concrete case of the Travelling Salesman Problem, and as an illustration of determination, management and using the fuzzy rules, a new algorithm easy to implement in the Model-Base Management System of any oriented Decision Support System is shown.

Random Numbers and Monte Carlo Methods

Science.gov (United States)

Scherer, Philipp O. J.

Many-body problems often involve the calculation of integrals of very high dimension which cannot be treated by standard methods. For the calculation of thermodynamic averages Monte Carlo methods are very useful which sample the integration volume at randomly chosen points. After summarizing some basic statistics, we discuss algorithms for the generation of pseudo-random numbers with given probability distribution which are essential for all Monte Carlo methods. We show how the efficiency of Monte Carlo integration can be improved by sampling preferentially the important configurations. Finally the famous Metropolis algorithm is applied to classical many-particle systems. Computer experiments visualize the central limit theorem and apply the Metropolis method to the traveling salesman problem.

Optimization of fuel reloads for a BWR using the ant colony system; Optimizacion de recargas de combustible para un BWR usando el sistema de colonia de hormigas

Energy Technology Data Exchange (ETDEWEB)

Esquivel E, J. [Universidad Autonoma del Estado de Mexico, Facultad de Ingenieria, Cerro de Coatepec s/n, Ciudad Universitaria, 50110 Toluca, Estado de Mexico (Mexico); Ortiz S, J. J. [ININ, Carretera Mexico-Toluca s/n, 52750 Ocoyoacac, Estado de Mexico (Mexico)], e-mail: jaime.es.jaime@gmail.com

2009-10-15

In this work some results obtained during the development of optimization systems are presented, which are employees for the fuel reload design in a BWR. The systems use the ant colony optimization technique. As first instance, a system is developed that was adapted at travel salesman problem applied for the 32 state capitals of Mexican Republic. The purpose of this implementation is that a similarity exists with the design of fuel reload, since the two problems are of combinatorial optimization with decision variables that have similarity between both. The system was coupled to simulator SIMULATE-3, obtaining good results when being applied to an operation cycle in equilibrium for reactors of nuclear power plant of Laguna Verde. (Author)

Optimization of fuel reloads for a BWR using the ant colony system

International Nuclear Information System (INIS)

Esquivel E, J.; Ortiz S, J. J.

2009-10-01

In this work some results obtained during the development of optimization systems are presented, which are employees for the fuel reload design in a BWR. The systems use the ant colony optimization technique. As first instance, a system is developed that was adapted at travel salesman problem applied for the 32 state capitals of Mexican Republic. The purpose of this implementation is that a similarity exists with the design of fuel reload, since the two problems are of combinatorial optimization with decision variables that have similarity between both. The system was coupled to simulator SIMULATE-3, obtaining good results when being applied to an operation cycle in equilibrium for reactors of nuclear power plant of Laguna Verde. (Author)

High expression of testes-specific protease 50 is associated with poor prognosis in colorectal carcinoma.

Directory of Open Access Journals (Sweden)

Lei Zheng

Full Text Available BACKGROUND: Testes-specific protease 50 (TSP50 is normally expressed in testes and abnormally expressed in breast cancer, but whether TSP50 is expressed in colorectal carcinoma (CRC and its clinical significance is unclear. We aimed to detect TSP50 expression in CRC, correlate it with clinicopathological factors, and assess its potential diagnostic and prognostic value. METHODOLOGY/PRINCIPAL FINDINGS: TSP50 mRNAs and proteins were detected in 7 CRC cell lines and 8 CRC specimens via RT-PCR and Western blot analysis. Immunohistochemical analysis of TSP50, p53 and carcinoembryonic antigen (CEA with tissue microarrays composed of 95 CRCs, 20 colorectal adenomas and 20 normal colorectal tissues were carried out and correlated with clinicopathological characteristics and disease-specific survival for CRC patients. There was no significant correlation between the expression levels of TSP50 and p53 (P = 0.751 or CEA (P = 0.663. Abundant expression of TSP50 protein was found in CRCs (68.4% while it was poorly expressed in colorectal adenomas and normal tissues (P<0.0001. Thus, CRCs can be distinguished from them with high specificity (92.5% and positive predictive value (PPV, 95.6%. The survival of CRC patients with high TSP50 expression was significantly shorter than that of the patients with low TSP50 expression (P = 0.010, specifically in patients who had early-stage tumors (stage I and II; P = 0.004. Multivariate Cox regression analysis indicated that high TSP50 expression was a statistically significant independent risk factor (hazard ratio  = 2.205, 95% CI = 1.214-4.004, P = 0.009. CONCLUSION: Our data demonstrate that TSP50 is a potential effective indicator of poor survival for CRC patients, especially for those with early-stage tumors.

Polymorphisms A387P in thrombospondin-4 and N700S in thrombospondin-1 perturb calcium binding sites.

Science.gov (United States)

Stenina, Olga I; Ustinov, Valentin; Krukovets, Irene; Marinic, Tina; Topol, Eric J; Plow, Edward F

2005-11-01

Recent genetic studies have associated members of the thrombospondin (TSP) gene family with premature cardiovascular disease. The disease-associated polymorphisms lead to single amino acid changes in TSP-4 (A387P) and TSP-1 (N700S). These substitutions reside in adjacent domains of these highly homologous proteins. Secondary structural predictive programs and the homology of the domains harboring these amino acid substitutions to those in other proteins pointed to potential alterations of putative Ca2+ binding sites that reside in close proximity to the polymorphic amino acids. Since Ca2+ binding is critical for the structure and function of TSP family members, direct evidence for differences in Ca2+ binding by the polymorphic forms was sought. Using synthetic peptides and purified recombinant variant fragments bearing the amino acid substitutions, we measured differences in Tb3+ luminescence as an index of Ca2+ binding. The Tb3+ binding constants placed the TSP-1 region affected by N700S polymorphism among other high-affinity Ca2+ binding sites. The affinity of Ca2+ binding was lower for peptides (3.5-fold) and recombinant fragments (10-fold) containing the S700 vs. the N700 form. In TSP-4, the P387 form acquired an additional Ca2+ binding site absent in the A387 form. The results of our study suggest that both substitutions (A387P in TSP-4 and N700S in TSP-1) alter Ca2+ binding properties. Since these substitutions exert the opposite effects on Ca2+ binding, a decrease in TSP-1 and an increase in TSP-4, the two TSP variants are likely to influence cardiovascular functions in distinct but yet pathogenic ways.

Effect of hypoproteinemia (HP) upon FT4 and FT3 by kinetic radioligandassay (RLA)

International Nuclear Information System (INIS)

Bottger, I.G.; Schneck, H.J.

1985-01-01

HP, especially hypoalbuminemia (HA), has been associated with false low FT4 by RLA, predominantly of the analogue tracer type. Based upon previous more favourable findings in severe nonthyroidal illness (NTI), this study was designed to study this problem in more detail. Two groups of patients with severe NTI (polytrauma) were selected on the basis of their total serum protein (TSP) concentration and studied during intensive-care. Group I: N = 25, TSP 5.9 g/dl (6.0 - 7.7), A/G: 1.5, sera: N = 76. I and II: low-dose heparin (i.v. 5000 U/24 h), non-detectable in the periphery. The RLA kits used were: FT4/T4 and FT3/T3 (kinetic two-tube), and TBG, Corning Medical, rT3, Serono, TSH, Henning-Berlin, TSP/electrophoresis standard technique. The findings indicate: 1. Typical findings for follow-up of severe NTI; 2. No detection of a significant effect of HP/HA upon these RLAs for FT4 and FT3; and 3. The inter-group differences are most likely due to more severe NT1 in I (R/sub x/, A/G, rT3)

Exact and Heuristic Algorithms for Routing AGV on Path with Precedence Constraints

Directory of Open Access Journals (Sweden)

Liang Xu

2016-01-01

Full Text Available A new problem arises when an automated guided vehicle (AGV is dispatched to visit a set of customers, which are usually located along a fixed wire transmitting signal to navigate the AGV. An optimal visiting sequence is desired with the objective of minimizing the total travelling distance (or time. When precedence constraints are restricted on customers, the problem is referred to as traveling salesman problem on path with precedence constraints (TSPP-PC. Whether or not it is NP-complete has no answer in the literature. In this paper, we design dynamic programming for the TSPP-PC, which is the first polynomial-time exact algorithm when the number of precedence constraints is a constant. For the problem with number of precedence constraints, part of the input can be arbitrarily large, so we provide an efficient heuristic based on the exact algorithm.

ACOustic: A Nature-Inspired Exploration Indicator for Ant Colony Optimization

Directory of Open Access Journals (Sweden)

Rafid Sagban

2015-01-01

Full Text Available A statistical machine learning indicator, ACOustic, is proposed to evaluate the exploration behavior in the iterations of ant colony optimization algorithms. This idea is inspired by the behavior of some parasites in their mimicry to the queens’ acoustics of their ant hosts. The parasites’ reaction results from their ability to indicate the state of penetration. The proposed indicator solves the problem of robustness that results from the difference of magnitudes in the distance’s matrix, especially when combinatorial optimization problems with rugged fitness landscape are applied. The performance of the proposed indicator is evaluated against the existing indicators in six variants of ant colony optimization algorithms. Instances for travelling salesman problem and quadratic assignment problem are used in the experimental evaluation. The analytical results showed that the proposed indicator is more informative and more robust.

CMMI for Services (SVC): The Strategic Landscape for Service

Science.gov (United States)

2012-01-01

Genealogy Gutter maintenance Healthcare Home health care Home inspection Infrastructure management Internal process group Internet retail Internet...TSP national initiative COLOMBIA 64% Service Economy CHINA Government incentives MALAYSIA CMMI and TSP JAPAN TSP Strategic Partner SEI

A nuclear reactor core fuel reload optimization using Artificial-Ant-Colony Connective Networks

International Nuclear Information System (INIS)

Lima, Alan M.M. de; Schirru, Roberto

2005-01-01

A Pressurized Water Reactor core must be reloaded every time the fuel burnup reaches a level when it is not possible to sustain nominal power operation. The nuclear core fuel reload optimization consists in finding a burned-up and fresh-fuel-assembly pattern that maximizes the number of full operational days. This problem is NP-hard, meaning that complexity grows exponentially with the number of fuel assemblies in the core. Besides that, the problem is non-linear and its search space is highly discontinual and multimodal. In this work a parallel computational system based on Ant Colony System (ACS) called Artificial-Ant-Colony Networks is introduced to solve the nuclear reactor core fuel reload optimization problem. ACS is a system based on artificial agents that uses the reinforcement learning technique and was originally developed to solve the Traveling Salesman Problem, which is conceptually similar to the nuclear fuel reload problem. (author)

A nuclear reactor core fuel reload optimization using Artificial-Ant-Colony Connective Networks; Recarga de reatores nucleares utilizando redes conectivas de colonias de formigas artificiais

Energy Technology Data Exchange (ETDEWEB)

Lima, Alan M.M. de; Schirru, Roberto [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia. Programa de Engenharia Nuclear]. E-mail: alan@lmp.ufrj.br; schirru@lmp.ufrj.br

2005-07-01

A Pressurized Water Reactor core must be reloaded every time the fuel burnup reaches a level when it is not possible to sustain nominal power operation. The nuclear core fuel reload optimization consists in finding a burned-up and fresh-fuel-assembly pattern that maximizes the number of full operational days. This problem is NP-hard, meaning that complexity grows exponentially with the number of fuel assemblies in the core. Besides that, the problem is non-linear and its search space is highly discontinual and multimodal. In this work a parallel computational system based on Ant Colony System (ACS) called Artificial-Ant-Colony Networks is introduced to solve the nuclear reactor core fuel reload optimization problem. ACS is a system based on artificial agents that uses the reinforcement learning technique and was originally developed to solve the Traveling Salesman Problem, which is conceptually similar to the nuclear fuel reload problem. (author)

Fidelity-Based Ant Colony Algorithm with Q-learning of Quantum System

Science.gov (United States)

Liao, Qin; Guo, Ying; Tu, Yifeng; Zhang, Hang

2018-03-01

Quantum ant colony algorithm (ACA) has potential applications in quantum information processing, such as solutions of traveling salesman problem, zero-one knapsack problem, robot route planning problem, and so on. To shorten the search time of the ACA, we suggest the fidelity-based ant colony algorithm (FACA) for the control of quantum system. Motivated by structure of the Q-learning algorithm, we demonstrate the combination of a FACA with the Q-learning algorithm and suggest the design of a fidelity-based ant colony algorithm with the Q-learning to improve the performance of the FACA in a spin-1/2 quantum system. The numeric simulation results show that the FACA with the Q-learning can efficiently avoid trapping into local optimal policies and increase the speed of convergence process of quantum system.

Predictive model of thrombospondin-1 and vascular endothelial growth factor in breast tumor tissue.

Science.gov (United States)

Rohrs, Jennifer A; Sulistio, Christopher D; Finley, Stacey D

2016-01-01

Angiogenesis, the formation of new blood capillaries from pre-existing vessels, is a hallmark of cancer. Thus far, strategies for reducing tumor angiogenesis have focused on inhibiting pro-angiogenic factors, while less is known about the therapeutic effects of mimicking the actions of angiogenesis inhibitors. Thrombospondin-1 (TSP1) is an important endogenous inhibitor of angiogenesis that has been investigated as an anti-angiogenic agent. TSP1 impedes the growth of new blood vessels in many ways, including crosstalk with pro-angiogenic factors. Due to the complexity of TSP1 signaling, a predictive systems biology model would provide quantitative understanding of the angiogenic balance in tumor tissue. Therefore, we have developed a molecular-detailed, mechanistic model of TSP1 and vascular endothelial growth factor (VEGF), a promoter of angiogenesis, in breast tumor tissue. The model predicts the distribution of the angiogenic factors in tumor tissue, revealing that TSP1 is primarily in an inactive, cleaved form due to the action of proteases, rather than bound to its cellular receptors or to VEGF. The model also predicts the effects of enhancing TSP1's interactions with its receptors and with VEGF. To provide additional predictions that can guide the development of new anti-angiogenic drugs, we simulate administration of exogenous TSP1 mimetics that bind specific targets. The model predicts that the CD47-binding TSP1 mimetic dramatically decreases the ratio of receptor-bound VEGF to receptor-bound TSP1, in favor of anti-angiogenesis. Thus, we have established a model that provides a quantitative framework to study the response to TSP1 mimetics.

Improving phosphorus availability from Patos phosphate rock for Eucalyptus: a study with 32P radiotracer; Melhorando a disponibilidade de fosforo da rocha fosforica de Patos para eucalipto: um estudo com radiotracador 32P

Energy Technology Data Exchange (ETDEWEB)

Villanueva, Felipe Carlos Alvarez [Instituto de Investigaciones Fundamentales en Agriculturea Tropical (INIFAT), Santiago de las Vegas, La Habana (Cuba)]. E-mail: falvarez@cena.usp.br; Muraoka, Takashi; Trevizam, Anderson Ricardo [Centro de Energia Nuclear na Agricultura (CENA), Piracicaba, SP (Brazil). Lab. de Fertilidade do Solo; Franzini, Vinicius Ide [Sao Paulo Univ., Piracicaba, SP (Brazil). Escola Superior de Agricultura Luiz de Queiroz. Programa de Pos-graduacao em Solos e Nutricao de Plantas; Rocha, Alexandre Prado [Escola de Engenharia de Piracicaba, SP (Brazil)

2006-01-15

Eucalyptus plantation in Brazil is generally set on low fertility soils, therefore phosphorus (P) fertilization is mandatory and increases the cost of plantation operation. Using species that more efficiently uptake phosphorus from less soluble sources is an interesting option. However, little is known about eucalyptus regarding its ability of using less soluble forms of phosphorus. The use of P by eucalyptus (E. urophylla, E. grandis, and E. urophylla E. grandis) was studied in greenhouse using a loamy-textured, hipodystrophic Typic Haplustox from the Cerrado region, and 32P isotopic method. The P sources tested were triple superphosphate (TSP), phosphate rock (PR) and the triple superphosphate mixed with PR (TSP+PR). The effectiveness of P sources in terms of increasing dry matter yield was TSP = (TSP + PR) > PR, and the P uptake followed the order (TSP + PR) > TSP > PR for both species plus the hybrid. The increase in P uptake from PR due to TSP influence was 217.3% for E. urophylla, 235.7% for E. grandis, and 28.7% for E. urophylla E. grandis, indicating an enhancement effect of TSP on the effectiveness of PR. The hybrid E. urophylla E. grandis was the most efficient genotype on P soil use and E. grandis most exigent in P fertilizer. (author)

Improving phosphorus availability from Patos phosphate rock for Eucalyptus: a study with 32P radiotracer

International Nuclear Information System (INIS)

Villanueva, Felipe Carlos Alvarez; Muraoka, Takashi; Trevizam, Anderson Ricardo

2006-01-01

Eucalyptus plantation in Brazil is generally set on low fertility soils, therefore phosphorus (P) fertilization is mandatory and increases the cost of plantation operation. Using species that more efficiently uptake phosphorus from less soluble sources is an interesting option. However, little is known about eucalyptus regarding its ability of using less soluble forms of phosphorus. The use of P by eucalyptus (E. urophylla, E. grandis, and E. urophylla E. grandis) was studied in greenhouse using a loamy-textured, hipodystrophic Typic Haplustox from the Cerrado region, and 32P isotopic method. The P sources tested were triple superphosphate (TSP), phosphate rock (PR) and the triple superphosphate mixed with PR (TSP+PR). The effectiveness of P sources in terms of increasing dry matter yield was TSP = (TSP + PR) > PR, and the P uptake followed the order (TSP + PR) > TSP > PR for both species plus the hybrid. The increase in P uptake from PR due to TSP influence was 217.3% for E. urophylla, 235.7% for E. grandis, and 28.7% for E. urophylla E. grandis, indicating an enhancement effect of TSP on the effectiveness of PR. The hybrid E. urophylla E. grandis was the most efficient genotype on P soil use and E. grandis most exigent in P fertilizer. (author)

Thrombospondin-2 Influences the Proportion of Cartilage and Bone During Fracture Healing

OpenAIRE

Taylor, Douglas K; Meganck, Jeffrey A; Terkhorn, Shawn; Rajani, Rajiv; Naik, Amish; O'Keefe, Regis J; Goldstein, Steven A; Hankenson, Kurt D

2009-01-01

Thrombospondin-2 (TSP2) is a matricellular protein with increased expression during growth and regeneration. TSP2-null mice show accelerated dermal wound healing and enhanced bone formation. We hypothesized that bone regeneration would be enhanced in the absence of TSP2. Closed, semistabilized transverse fractures were created in the tibias of wildtype (WT) and TSP2-null mice. The fractures were examined 5, 10, and 20 days after fracture using ?CT, histology, immunohistochemistry, quantitativ...

Decreased astrocytic thrombospondin-1 secretion after chronic ammonia treatment reduces the level of synaptic proteins: in vitro and in vivo studies.

Science.gov (United States)

Jayakumar, Arumugam R; Tong, Xiao Y; Curtis, Kevin M; Ruiz-Cordero, Roberto; Shamaladevi, Nagarajarao; Abuzamel, Missa; Johnstone, Joshua; Gaidosh, Gabriel; Rama Rao, Kakulavarapu V; Norenberg, Michael D

2014-11-01

Chronic hepatic encephalopathy (CHE) is a major complication in patients with severe liver disease. Elevated blood and brain ammonia levels have been implicated in its pathogenesis, and astrocytes are the principal neural cells involved in this disorder. Since defective synthesis and release of astrocytic factors have been shown to impair synaptic integrity in other neurological conditions, we examined whether thrombospondin-1 (TSP-1), an astrocytic factor involved in the maintenance of synaptic integrity, is also altered in CHE. Cultured astrocytes were exposed to ammonia (NH₄Cl, 0.5-2.5 mM) for 1-10 days, and TSP-1 content was measured in cell extracts and culture media. Astrocytes exposed to ammonia exhibited a reduction in intra- and extracellular TSP-1 levels. Exposure of cultured neurons to conditioned media from ammonia-treated astrocytes showed a decrease in synaptophysin, PSD95, and synaptotagmin levels. Conditioned media from TSP-1 over-expressing astrocytes that were treated with ammonia, when added to cultured neurons, reversed the decline in synaptic proteins. Recombinant TSP-1 similarly reversed the decrease in synaptic proteins. Metformin, an agent known to increase TSP-1 synthesis in other cell types, also reversed the ammonia-induced TSP-1 reduction. Likewise, we found a significant decline in TSP-1 level in cortical astrocytes, as well as a reduction in synaptophysin content in vivo in a rat model of CHE. These findings suggest that TSP-1 may represent an important therapeutic target for CHE. Defective release of astrocytic factors may impair synaptic integrity in chronic hepatic encephalopathy. We found a reduction in the release of the astrocytic matricellular proteins thrombospondin-1 (TSP-1) in ammonia-treated astrocytes; such reduction was associated with a decrease in synaptic proteins caused by conditioned media from ammonia-treated astrocytes. Exposure of neurons to CM from ammonia-treated astrocytes, in which TSP-1 is over

Organic and elemental carbon bound to particulate matter in the air of printing office and beauty salon

Science.gov (United States)

Rogula-Kopiec, Patrycja; Pastuszka, Józef S.; Rogula-Kozłowska, Wioletta; Mucha, Walter

2017-11-01

The aim of this study was to determine the role of internal sources of emissions on the concentrations of total suspended particulate matter (TSP) and its sub-fraction, so-called respirable PM (PM4; fraction of particles with particle size ≤ 4 µm) and to estimate to which extent those emissions participate in the formation of PM-bound elemental (EC) and organic (OC) carbon in two facilities - one beauty salon and one printing office located in Bytom (Upper Silesia, Poland). The average concentration of PM in the printing office and beauty salon during the 10-day measurement period was 10 and 4 (PM4) and 8 and 3 (TSP) times greater than the average concentration of PM fractions recorded in the same period in the atmospheric air; it was on average: 204 µg/m3 (PM4) and 319 µg/m3 (TSP) and 93 µg/m3 (PM4) and 136 µg/m3 (TSP), respectively. OC concentrations determined in the printing office were 38 µg/m3 (PM4) and 56 µg/m3 (TSP), and those referring to EC: 1.8 µg/m3 (PM4) and 3.5 µg/m3 (TSP). In the beauty salon the average concentration of OC for PM4 and TSP were 58 and 75 µg/m3, respectively and in case of EC - 3.1 and 4.7 µg/m3, respectively. The concentrations of OC and EC within the those facilities were approximately 1.7 (TSP-bound EC, beauty salon) to 4.7 (TSP-bound OC, printing office) times higher than the average atmospheric concentrations of those compounds measured in both PM fractions at the same time. In both facilities the main source of TSP-and PM4-bound OC in the indoor air were the chemicals - solvents, varnishes, paints, etc.

Particulate matter over a seven year period in urban and rural areas within, proximal and far from mining and power station operations in Greece.

Science.gov (United States)

Triantafyllou, A G; Zoras, S; Evagelopoulos, V

2006-11-01

Lignite mining operations and lignite-fired power stations result in major particulate pollution (fly ash and fugitive dust) problems in the areas surrounding these activities. The problem is more complicated, especially, for urban areas located not far from these activities, due to additional contribution from the urban pollution sources. Knowledge of the distribution of airborne particulate matter into size fraction has become an increasing area of focus when examining the effects of particulate pollution. On the other hand, airborne particle concentration measurements are useful in order to assess the air pollution levels based on national and international air quality standards. These measurements are also necessary for developing air pollutants control strategies or for evaluating the effectiveness of these strategies, especially, for long periods. In this study an attempt is made in order to investigate the particle size distribution of fly ash and fugitive dust in a heavy industrialized (mining and power stations operations) area with complex terrain in the northwestern part of Greece. Parallel total suspended particulates (TSP) and particulate matter with an aerodynamic diameter less than 10 microm (PM10) concentrations are analyzed. These measurements gathered from thirteen monitoring stations located in the greater area of interest. Spatial, temporal variation and trend are analyzed over the last seven years. Furthermore, the geographical variation of PM10 - TSP correlation and PM10/TSP ratio are investigated and compared to those in the literature. The analysis has indicated that a complex system of sources and meteorological conditions modulate the particulate pollution of the examined area.

Interatrial septum thickness and difficulty with transseptal puncture during redo catheter ablation of atrial fibrillation.

Science.gov (United States)

Tomlinson, David R; Sabharwal, Nikant; Bashir, Yaver; Betts, Timothy R

2008-12-01

Patients undergoing catheter ablation for atrial fibrillation (AF) frequently require redo procedures, but there are no data reporting interatrial septum thickness (IAS) and difficulty during repeat transseptal puncture (TSP). Patients undergoing two separate AF ablation procedures had preprocedural fossa ovalis (FO) thickness measured using transesophageal echocardiography (TEE). "Difficult" TSP was defined by two observers as requiring excessive force, or conversion to TEE guidance. The study comprised 42 patients (37 male) with mean+/-SD age 55+/-9 years. Mean FO thickness was significantly greater at the time of redo TSP (2.2+/-1.6 mm vs 2.6+/-1.5 mm at redo, P=0.03); however, this finding was limited to those who underwent initial dual transseptal sheath procedures, FO thickness 2.0+/-1.5 mm and 2.5+/-1.4 mm for TEE 1 and 2, respectively (P=0.048). There was a trend for more frequent difficult redo TSP procedures, 7/42 (17%; 95% confidence interval [CI] 8-31) redo, versus 4/42 (10%; 95% CI 3-23) first TSP. On univariate analysis, FO thickness was not predictive of TSP difficulty; the only predictor of difficult redo TSP was diabetes. IAS thickness at the FO increased following catheter ablation of AF, yet on subgroup analysis this was limited to initial procedures utilizing dual transseptal sheaths. There was a trend toward more frequent difficulty during redo TSP, yet this was not associated with FO thickening. Diabetes may predispose to difficulty during redo TSP; this finding requires confirmation in a larger study population.

Altered extracellular matrix remodeling and angiogenesis in sponge granulomas of thrombospondin 2-null mice.

Science.gov (United States)

Kyriakides, T R; Zhu, Y H; Yang, Z; Huynh, G; Bornstein, P

2001-10-01

The matricellular angiogenesis inhibitor, thrombospondin (TSP) 2, has been shown to be an important modulator of wound healing and the foreign body response. Specifically, TSP2-null mice display improved healing with minimal scarring and form well-vascularized foreign body capsules. In this study we performed subcutaneous implantation of sponges and investigated the resulting angiogenic and fibrogenic responses. Histological and immunohistochemical analysis of sponges, excised at 7, 14, and 21 days after implantation, revealed significant differences between TSP2-null and wild-type mice. Most notably, TSP2-null mice exhibited increased angiogenesis and fibrotic encapsulation of the sponge. However, invasion of dense tissue was compromised, even though its overall density was increased. Furthermore, histomorphometry and biochemical assays demonstrated a significant increase in the extracellular distribution of matrix metalloproteinase (MMP) 2, but no change in the levels of active transforming growth factor-beta(1). The alterations in neovascularization, dense tissue invasion, and MMP2 in TSP2-null mice coincided with the deposition of TSP2 in the extracellular matrix of wild-type animals. These observations support the proposed role of TSP2 as a modulator of angiogenesis and matrix remodeling during tissue repair. In addition, they provide in vivo evidence for a newly proposed function of TSP2 as a modulator of extracellular MMP2 levels.

Possible etiologies for tropical spastic paraparesis and human T lymphotropic virus I-associated myelopathy

Directory of Open Access Journals (Sweden)

V. Zaninovic'

2004-01-01

Full Text Available The epidemiology of tropical spastic paraparesis/human T lymphotropic virus I (HTLV-I-associated myelopathy (TSP/HAM is frequently inconsistent and suggests environmental factors in the etiology of these syndromes. The neuropathology corresponds to a toxometabolic or autoimmune process and possibly not to a viral disease. Some logical hypotheses about the etiology and physiopathology of TSP and HAM are proposed. Glutamate-mediated excitotoxicity, central distal axonopathies, cassava, lathyrism and cycad toxicity may explain most cases of TSP. The damage caused to astrocytes and to the blood-brain barrier by HTLV-I plus xenobiotics may explain most cases of HAM. Analysis of the HTLV-I/xenobiotic ratio clarifies most of the paradoxical epidemiology of TSP and HAM. Modern neurotoxicology, neuroimmunology and molecular biology may explain the neuropathology of TSP and HAM. It is quite possible that there are other xenobiotics implicated in the etiology of some TSP/HAMs. The prevention of these syndromes appears to be possible today.

[Impact of atmospheric total suspended particulate pollution on photosynthetic parameters of street mango trees in Xiamen City].

Science.gov (United States)

Yu, Yu-xian; Chen, Jin-sheng; Ren, Yin; Li, Fang-yi; Cui, Sheng-hui

2010-05-01

With the development of urbanization, total suspended particulate (TSP) pollution is getting serious, and the normal physiological processes of urban vegetation are profoundly affected while adsorbing and purifying the particulates. In this study, four areas were selected, i.e., Tingxi reservoir (clean control area), Xiamen University (cultural and educational area), Xianyue (business area), and Haicang (industrial area), with their atmospheric TSP concentrations and the photosynthetic parameters of street Mango (Mangifera indica) trees monitored in April and May, 2009. The daily average concentration of TSP in Tingxi, Xiamen University, Xianyue, and Haicang was 0.061, 0.113, 0.120 and 0.205 mg x m(-3), respectively, and the impact of TSP stress on M. indica was in the sequence of Haicang > Xianyue > Xiamen University > Tingxi. TSP pollution negatively affected the net photosynthetic rate, stomatal conductance, and transpiration rate of M. indica, and induced intercellular CO2 concentration changed significantly. High TSP concentration could cause the decline of net photosynthetic rate via stomatal limitation.

Trace elements in atmospheric particulate matter over a coal burning power production area of western Macedonia, Greece.

Science.gov (United States)

Petaloti, Christina; Triantafyllou, Athanasios; Kouimtzis, Themistoklis; Samara, Constantini

2006-12-01

Total suspended particle (TSP) concentrations were determined in the Eordea basin (western Macedonia, Greece), an area with intensive lignite burning for power generation. The study was conducted over a one-year period (November 2000-November 2001) at 10 sites located at variable distances from the power plants. Ambient TSP samples were analyzed for 27 major, minor and trace elements. Annual means of TSP concentrations ranged between 47+/-33 microg m(-3) and 110+/-50 microg m(-3) at 9 out of the 10 sites. Only the site closest to the power stations and the lignite conveyor belts exhibited annual TSP levels (210+/-97 microg m(-3)) exceeding the European standard (150 microg m(-3), 80/779/EEC). Concentrations of TSP and almost all elemental components exhibited significant spatial variations; however, the elemental profiles of TSP were quite similar among all sites suggesting that they are affected by similar source types. At all sites, statistical analysis indicated insignificant (Pmining activities.

T CD4+ cells count among patients co-infected with human immunodeficiency virus type 1 (HIV-1 and human T-cell leukemia virus type 1 (HTLV-1: high prevalence of tropical spastic paraparesis/HTLV-1-associated myelopathy (TSP/HAM Contagens de células T CD4+ na co-infecção HIV-1 e HTLV-1: alta prevalência da paraparesia espástica tropical/mielopatia associada ao HTLV-1

Directory of Open Access Journals (Sweden)

Jorge Casseb

2007-08-01

Full Text Available INTRODUCTION: HIV positive patients co-infected with HTLV-1 may have an increase in their T CD4+ cell counts, thus rendering this parameter useless as an AIDS-defining event. OBJECTIVE: To study the effects induced by the co-infection of HIV-1 and HTLV-1 upon CD4+ cells. MATERIAL AND METHODS: Since 1997, our group has been following a cohort of HTLV-1-infected patients, in order to study the interaction of HTLV-1 with HIV and/or with hepatitis C virus (HCV, as well as HTLV-1-only infected asymptomatic carriers and those with tropical spastic paraparesis/HTLV-1 associated myelopathy (TSP/HAM. One hundred and fifty HTLV-1-infected subjects have been referred to our clinic at the Institute of Infectious Diseases "Emílio Ribas", São Paulo. Twenty-seven of them were also infected with HIV-1 and HTLV-1-infection using two ELISAs and confirmed and typed by Western Blot (WB or polymerase chain reaction (PCR. All subjects were evaluated by two neurologists, blinded to the patient's HTLV status, and the TSP/HAM diagnostic was based on the World Health Organization (WHO classification. AIDS-defining events were in accordance with the Centers for Disease Control (CDC classification of 1988. The first T CD4+ cells count available before starting anti-retroviral therapy are shown compared to the HIV-1-infected subjects at the moment of AIDS defining event. RESULTS: A total of 27 HIV-1/HTLV-1 co-infected subjects were identified in this cohort; 15 already had AIDS and 12 remained free of AIDS. The median of T CD4+ cell counts was 189 (98-688 cells/mm³ and 89 (53-196 cells/mm³ for co-infected subjects who had an AIDS-defining event, and HIV-only infected individuals, respectively (p = 0.036. Eight of 27 co-infected subjects (30% were diagnosed as having a TSP/HAM simile diagnosis, and three of them had opportunistic infections but high T CD4+ cell counts at the time of their AIDS- defining event. DISCUSSION: Our results indicate that higher T CD4+ cells

Study of heuristics in ant system for nuclear reload optimisation

International Nuclear Information System (INIS)

Lima, Alan M.M. de; Schirru, Roberto; Silva, Fernando C. da; Machado, Marcelo D.; Medeiros, Jose A.C.C.

2007-01-01

A Pressurized Water Reactor core must be reloaded every time the fuel burnup reaches a level when it is not possible to sustain nominal power operation. The nuclear core fuel reload optimization consists in finding a burned-up and fresh-fuel-assembly loading pattern that maximizes the number of effective full power days, minimizing the relationship cost/benefit. This problem is NP-hard, meaning that complexity grows exponentially with the number of fuel assemblies in the core. Besides that, the problem is non-linear and its search space is highly discontinual and multimodal. In this work a parallel computational system based on Ant Colony System (ACS) called Artificial-Ant-Colony Networks is used to solve the nuclear reactor core fuel reload optimization problem, with compatibles heuristics. ACS is a system based on artificial agents that uses the reinforcement learning technique and was originally developed to solve the Traveling Salesman Problem, which is conceptually similar to the nuclear fuel reload problem. (author)

Study of heuristics in ant system for nuclear reload optimisation

Energy Technology Data Exchange (ETDEWEB)

Lima, Alan M.M. de; Schirru, Roberto; Silva, Fernando C. da; Machado, Marcelo D.; Medeiros, Jose A.C.C. [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia (COPPE). Programa de Engenharia Nuclear]. E-mail: alan@lmp.ufrj.br; schirru@lmp.ufrj.br; fernando@con.ufrj.br; marcelo@lmp.ufrj.br; canedo@lmp.ufrj.br

2007-07-01

A Pressurized Water Reactor core must be reloaded every time the fuel burnup reaches a level when it is not possible to sustain nominal power operation. The nuclear core fuel reload optimization consists in finding a burned-up and fresh-fuel-assembly loading pattern that maximizes the number of effective full power days, minimizing the relationship cost/benefit. This problem is NP-hard, meaning that complexity grows exponentially with the number of fuel assemblies in the core. Besides that, the problem is non-linear and its search space is highly discontinual and multimodal. In this work a parallel computational system based on Ant Colony System (ACS) called Artificial-Ant-Colony Networks is used to solve the nuclear reactor core fuel reload optimization problem, with compatibles heuristics. ACS is a system based on artificial agents that uses the reinforcement learning technique and was originally developed to solve the Traveling Salesman Problem, which is conceptually similar to the nuclear fuel reload problem. (author)

Automatic optimization of a nuclear reactor reload using the algorithm Ant-Q; A otimizacao automatica da recarga nuclear utilizando o algoritmo Ant-Q

Energy Technology Data Exchange (ETDEWEB)

Machado, Liana; Schirru, Roberto [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia. Programa de Engenharia Nuclear

2002-07-01

The nuclear fuel reload optimization is a NP-Complete combinatorial optimization problem. For decades this problem was solved using an expert's knowledge. From the eighties, however there have been efforts to automatic fuel reload and the more recent ones show the Genetic Algorithm's (GA) efficiency on this problem. Following this trend, our aim is to optimization nuclear fuel reload using Ant-Q, artificial theory based algorithms. Ant-Q's results on the Traveling salesman Problem, which is conceptuality similar to fuel reload, are better than GA's. Ant-Q was tested in real application on the cycle 7 reload of Angra I. Comparing Ant-Q result with the GA's, it can be verified that, even without a local heuristics, the former algorithm, as it superiority comparing the GA in Angra I show. Is a valid technique to solve the nuclear fuel reload problem. (author)

75 FR 69026 - Employee Contribution Elections and Contribution Allocations; Uniformed Services Accounts; Death...

Science.gov (United States)

2010-11-10

... Services Accounts; Death Benefits; Thrift Savings Plan AGENCY: Federal Retirement Thrift Investment Board... Currently, a spouse beneficiary of a TSP participant must either transfer his or her TSP death benefit... spouse of a deceased participant to retain a lump sum death benefit payment in the TSP, subject to...