Page 1. TRAVELING SALESMAN PROBLEM FOR SURVEILLANCE MISSION USING PARTICLE SWARM OPTIMIZATION THESIS ...
DTIC Science & Technology
... We call this problem the Prize Collecting Traveling Salesman Problem (PCTSP). This paper discusses structural, the convex hull of the solutions to ...
In the online traveling salesman problem requests for visits to cities (points in a metric space) arrive online while the salesman is traveling. The salesman moves at no more than unit speed and starts and ends his work at a designated origin. The objecti...
National Technical Information Service (NTIS)
... Traditional Voronoi diagrams are unbounded; ie , cells on the perimeter of the diagram are permitted to extend to infinity. ...
... Descriptors : *ALGORITHMS, *PROBLEM SOLVING, *TRAVEL TIME, COMPUTERS, PAPER, APPROACH, URBAN AREAS, TIME, QUANTITY. ...
... Abstract : The optimization of the traveling saleman problem continues to receive attention for three reasons: (1) its solution is computationally ...
The traveling salesman problem is a classic optimization problem in which one seeks to minimize the path taken by a salesman in traveling between N cities, where the salesman stops at each city one and only one time, never retracing his/her route. This implementation is designed to run on UNIX ...
NSDL National Science Digital Library
An efficient algorithm is presented, based on the well-known algorithm for the traveling salesman problem, for scheduling aircraft arrivals into major terminal areas. The algorithm permits, but strictly limits, reassigning an aircraft from its initial pos...
The Symmetric Circulant Traveling Salesman Problem (SCTSP) is the problem of finding a shortest tour through a number of cities where the distance matrix is symmetric and circulant. It is an open problem whether the SCTSP is NP hard or polynomially solvab...
We investigate the family of facet defining inequalities for the asymmetric traveling salesman (ATS) polytope obtainable by lifting the cycle inequalities. We establish several properties of this family that earmark it as the most important among the asym...
An approach for solving the traveling salesman problem as formulated in the AIAA Artificial Intelligence Design Challenge is presented. The approach is based on heuristic measures involving intecity fares, city values, and value to fare ratios. Other heur...
The traveling salesman problem (TSP) is a combinatorial optimization problem that is mathematically modeled as a binary integer program. The TSP is a very important problem for the operations research academician and practitioner. This research demonstrat...
... Title : Global Bifurcation Structure of Chaotic Neural Networks and its Application to Traveling Salesman Problems. Corporate Author : ...
... all cities are visited and the corresponding demands ... is the total number of units being demanded, then the average time to demand satisfaction can ...
Approach for the Time Dependent Traveling Saleman Problem, Electronic. Notes in Discrete Mathematics 36, 351�358 (2010). ...
E-print Network
Abstract: In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel ...
... algorithm for the traveling salesman problem with time windows, in which the objective is to minimize travel times. ... Visitors, Authors, More about us, Links ...
New branching rules and new methods to control the size of LP's resulted in a world's record for the solution of large traveling salesman problems.
The generalized traveling problem (GTSP) is an extension of the classical traveling salesman problem. The GTSP is known to be an NP-hard problem and has many interesting applications. In this paper we present a local-global approach for the generalized traveling salesman problem. Based on this ...
NASA Astrophysics Data System (ADS)
In the original traveling salesman problem, the traveling salesman has the task to find the shortest closed tour through a proposed set of nodes, touching each node exactly once and returning to the initial node at the end. For the sake of the tour length to be minimized, nodes close to each other might not be ...
... Such problems include the travelling salesman problem (TSP), the generalized assignment prob- lem (GAP), and vehicle routing problem (VRP). ...
... Personal Author(s) : Secrest, Barry R. Handle / proxy Url : Report Date : 20 MAR 2001. Pagination or Media Count : 131. ...
... Corporate Author : ARMY CECOM SIGNALS WARFARE DIRECTORATE VINT HILL FARMS STATION VA. Personal Author(s) : Cronin, TM. ...
Aug 14, 2003 ... With this in mind, we will not consider the generalized combs. any further ...... Journal of the Operational Research Society, 37(5):509 14, 1986. ...
In the symmetric case, costs do not depend on the direction of traversal. We study the ... Category 1: Combinatorial Optimization (Polyhedra ). Category 2: Integer ...
... Both Particle Swarm Optimization (PSO) and the Ant System (AS) have been shown to provide good solutions to Traveling Salesman Problem (TSP ...
... Accession Number : ADA261398. Title : Linear-Programming Tools in Integer Programming: The Traveling Salesman. Descriptive Note : Final rept. ...
... be tabular with very few variables 3) under isotropic environmental conditions ... equivalent to the traveling salesman problem, an NP hard problem [1 ...
Abstract: The Traveling Salesman Problem with Time Windows (TSPTW) is the problem of finding a minimum-cost path visiting a set of cities exactly once, where ...
Nov 10, 2009 ... The Traveling Salesman Problem with Time Windows (TSPTW) is the problem of finding a ... To obtain a good partition of the time windows, we ...
... Branch and Bound Algorithm for Solving Large Asymmetric Traveling Salesman Problems." .0 appear in Operations Research Letters, 8, 1989. 23. ...
... Title : A LIFO Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem using Held and Karp's 1-Tree Relaxation. ...
construction, Traveling Salesman, circular order, evolution 1 Introduction The construction of optimal�PAM unit is the amount of evolution which will change, on average, 1% of the amino acids.2 Assume this statement is wrong and there exists a tree T # with a lower score than T min . Assume further
The low-temperature regime of the Euclidean traveling salesman problem is studied numerically. The specific heat behavior is analyzed in terms of the number of cities and compared with that of spin-glasses. A properly defined order parameter shows the existence of freezing effects at low temperature. The Euclidean TSP behaves as a spin glass in two ...
Energy Citations Database
for Maximum Matchings and Maximum Traveling Salesman Problems by S#19; andor P. Fekete Henk Meijer Andr#19; e Rohe for Maximum Matchings and Maximum Traveling Salesman Problems S#19;andor P. Fekete #3; Henk Meijer y Andr#19;e Rohe z" and \\hard" problems #3; Fachbereich Mathematik, TU Berlin, 10623 Berlin, Germany, ...
The efficiency of the Misra-Fair algorithm for solution of the Traveling-Salesman problem is investigated. A FORTRAN language computer program is written for the Misra-Fair algorithm, Little et al.'s Branch-and-Bound algorithm and the Closest-Unvisited-Ci...
that the primary means for ants to form and maintain the line is a pheromone trail. Ants deposit a certain amount of pheromone while walking, and each ant probabilistically prefers to follow a direction rich in pheromone, the shorter path will receive a greater amount of pheromone per time unit and in turn a larger number of ants
? Of course, with respect to any single criterion, making the decision is easy. But with multiple criteriaApproximation Algorithms for Multi-criteria Traveling Salesman Problems Bodo Manthey1 and L f�ur Theoretische Informatik shankar.lakshminarayanan@ag.ch Abstract. In multi-criteria optimization
It is proposed here a LIFO implicit enumeration search algorithm for the symmetric traveling salesman problem which uses the 1-tree relaxation of Held and Karp. The proposed algorithm has significantly smaller memory requirements than Held and Karp's bran...
a parallelization of a higly e cient best- rst branch-and-bound algorithm to solve large symmetric traveling saleman
3.1 Local search for standard traveling salesman problem The standard traveling saleman problem (TSP
The optimization of the traveling saleman problem continues to receive attention for three reasons: (1) its solution is computationally difficult although the algorithm itself is easily expressed; (2) it is broadly applicable to a variety of engineering p...
Now G has a Hamiltonian cycle in G iff there is a tour of C with cost at most n. 3 ... has cost K iff Traveling Salesman tour of G1 is of cost nK. Such a graph can ...
algorithms (GAs) are randomized parallel search algorithms that search from a population of points [6]. We]. The first efforts to find near optimal solutions to TSPs by using GAs were those of Goldberg using Partial(TSP) is: given N cities, if a salesman starting from his home city is to visit each city exactly once
The method of quantum annealing (QA) is a promising way for solving many optimization problems in both classical and quantum information theory. The main advantage of this approach, compared with the gate model, is the robustness of the operations against errors originated from both external controls and the environment. In this work, we succeed in demonstrating experimentally an application of ...
This paper explores the feasibility of augmenting genetic algorithms with a long term memory. During a genetic algorithm run, we periodically store individuals in a database. When confronted with a new problem, instead of starting from scratch, we inject the solutions to previously solved similar problems (from the database) into the initial population of the genetic algorithm. We evaluate the ...
As an important extension of the classical traveling salesman problem (TSP), the multiple depot multiple traveling salesman problem (MDMTSP) is to minimize the total length of a collection of tours for multiple vehicles to serve all the customers, where each vehicle must start or stay at its distinct depot. Due to ...
A survey of solution methods for routing problems with time window constraints. Among the problems considered are the traveling salesman problem, the vehicle routing problem, the pickup and delivery problem, and the dial-a-ride problem. Optimization algor...
The surveillance mission requires aircraft to fly from a starting point through defended terrain to targets and return to a safe destination (usually the starting point). The process of selecting such a flight path is known as the Mission Route Planning (...
discrete represents discrete combinatorial problems. Typical here is the well�known Traveling Salesman of computation and available informa� tion. Note that combinatorial complexity, whether discrete or continuous. Fraenkel (1993) proved that a particular mathematical model (minimal energy) of protein�folding is NP
Many cost and reward allocation situations give rise to coalition games where the worth of each coalition is determined by solving a (combinatorial) optimization problem. Examples of such classes of games are discussed such as traveling salesman games, se...
We apply a Reactive Tabu Search (RTS) heuristic within a discrete event simulation to solve routing problems for Unmanned Aerial Vehicles (UAVs). Our formulation represents this problem as a Multiple Traveling Salesman Problem with Time Windows (MTSPTW), ...
, Mathematical Programming A, B, Naval Research Logistics, Operations Research, Operations Research Letters traveling salesman problem by branch and cut,'' Operations Research Letters, vol. 6, pp. 1�7, 1987. (with M
For the traveling salesman problem in which the distances satisfy the triangle inequality, Christofides' heuristic produces a tour whose length is guaranteed to be less than 3/2 times the optimum tour length. The performance of appropriate modifications o...
Using Monte Carlo simulations we examine the diffusive properties of the greedy algorithm in the d-dimensional traveling salesman problem. Our results show that for d=3 and 4 the average squared distance from the origin is proportional to the number of steps t. In the d=2 case such a scaling is modified with some logarithmic corrections, which ...
This paper reviews an approach for finding optimal solutions to the traveling salesman problem, a well-known problem in combinational optimization, and describes implementing the approach using the MAPLE computer algebra system. The method employed in this approach to the problem is similar to the way ant colonies manage to establish shortest route paths ...
ERIC Educational Resources Information Center
We studied planning behavior in a group of normal subjects and a group of closed head injury patients (CHI). A computerized version of the traveling salesman's problem was used as a visuospatial planning ability task. The program collected measurements of partial times, number of moves, and number of skipped subgoals. These measures allow us to calculate a ...
PubMed
As modular systems come into the forefront of robotic telesurgery, streamlining the process of selecting surgical tools becomes an important consideration. This paper presents a method for optimal queuing of tools in modular surgical tool systems, based on patterns in tool-use sequences, in order to minimize time spent changing tools. The solution approach is to model the set of tools as a graph, ...
This paper presents an improved extremal optimization (IEO) algorithm for solving the asymmetric traveling salesman problem (ATSP). At each update step, the IEO algorithm proceeds through two main steps: extremal dynamics and cooperative optimization. As an improvement of extremal optimization (EO), the IEO provides a general combinatorial optimization ...
The paper proposes an extended tabu search algorithm for the traveling salesman problem (TSP) with fuzzy edge weights. The algorithm considers three important fuzzy ranking criteria including expected value, optimistic value and pessimistic value, and performs a three-stage search towards the Pareto front, involving a preferred criterion at each stage. ...
A binary neuromorphic data structure is used to encode the N-city Traveling Salesman Problem (TSP). In this representation the computational complexity, in terms of number of neurons, is reduced from Hopfield and Tank's 0(N/sup 2/) to 0(N log/sub 2/N). A continuous synchronous neural network algorithm in conjunction with the Lagrange multiplier, ...
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 ...
DOE Information Bridge
this paper that metaheuristics based on GRASP and VNS can give good results for a generalization of the Traveling Salesman Problem (TSP) called Traveling Purchaser Problem (TPP) when compared with the Tabu Search algorithm proposed by Voss [13] for this algorithm, concerning the quality of solutions in similar execution times. In these ...
While it had been known for a long time how to transform an asymmetric traveling salesman (ATS) problem on the complete graph with n vertices into a symmetric traveling salesman (STS) problem on an incomplete graph with 2n vertices, no method was available for using this correspondence to derive facets of the ...
The paper introduces duty measure for optimization methods. Duty expresses the relationship between the quality of the result and the time required to obtain the result. The usefulness of the duty measure is demonstrated on a case study involving a local optimization of a large traveling salesman problem. Using duty, a deterministic method and a ...
The solution of an optimization problem through the continuous Hopfield network (CHN) is based on some energy or Lyapunov function, which decreases as the system evolves until a local minimum value is attained. A new energy function is proposed in this paper so that any 0-1 linear constrains programming with quadratic objective function can be solved. This problem, denoted as the generalized ...
An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call Ant System. We propose it as a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed computation, and the use of a constructive greedy heuristic. Positive feedback accounts for rapid discovery of ...
We explore the potential of parallel tempering as a combinatorial optimization method, applying it to the traveling salesman problem. We compare simulation results of parallel tempering with a benchmark implementation of simulated annealing, and study how different choices of parameters affect the relative performance of the two methods. We find that a ...
The mathematical model of a problem of minimization of a dose of an irradiation of the personnel which is carrying out dismantling of the completing block of a nuclear power plant is considered. Dismantling of elements of the block is carried out consistently. A brigade of workers having carried out dismantling of the next element of the block passes to similar work on other element of the block. ...
Optimization strategies based on simulated annealing and its variants have been extensively applied to the traveling salesman problem (TSP). Recently, there has appeared a new physics-based metaheuristic, called the microcanonical optimization algorithm (?O), which does not resort to annealing, and which has proven a superior alternative to the annealing ...
There has been growing interest in studying combinatorial optimization problems by clustering strategy, with a special emphasis on the traveling salesman problem (TSP). TSP naturally arises as a sub problem in much transportation, manufacturing and logistics application, this problem has caught much attention of mathematicians and computer scientists. A ...
We consider a problem in which we are given a domain, a cost function which depends on position at each point in the domain, and a subset of points (�cities�) in the domain. The goal is to determine the cheapest closed path that visits each city in the domain once. This can be thought of as a version of the traveling salesman problem, in which an ...
PubMed Central
We consider a problem in which we are given a domain, a cost function which depends on position at each point in the domain, and a subset of points ('cities') in the domain. The goal is to determine the cheapest closed path that visits each city in the domain once. This can be thought of as a version of the Traveling Salesman Problem, in ...
This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to TSP�s. Ants cooperate using an indirect form of communication mediated by a pheromone they deposit on the edges of the TSP graph while ...
A multi-agent approach to solving dynamic Traveling Salesman Problem (TSP) is presented. In the dynamic version of TSP cities can be dynamically added or removed. Proposed multi-agent approach is based on the Sensitive Stigmergic Agent System model refined with new type of messages between agents. The agents send messages every time a change occurs, for ...
The ability to find good solutions to the traveling salesman problem can benefit some biological organisms. Bacterial infection would, for instance, be eradicated most promptly if cells of the immune system minimized the total distance they traveled when moving between bacteria. Similarly, foragers would maximize their net energy gain ...
Ant algorithms are multi-agent systems in which the behavior of each single agent, called artificial ant or ant for short in the following, is inspired by the behavior of real ants. Ant algorithms are one of the most successful examples of swarm intelligent systems [3], and have been applied to many types of problems, ranging from the classical traveling ...
." In the prisoner's dilemma, the only pure Nash equilibrium is when both players choose "defect." Unfortunately problems that are suspected to be hard, including Nash. 2 "But what about the traveling salesman problemThe Complexity of Computing a Nash Equilibrium Constantinos Daskalakis Computer Science Division
We review here briefly some of our recent studies on neural network modelling. We discuss the studies on relaxation and growth of correlation in the Hopfield model, increase in memory loading capacity with an extended Hopfield-like model with delayed dynamics, the prediction capability of time series with a multi-layered network with supervised learning and studies on some generalised versions of ...
An HTML tutorial interspersed with applets for showing various heuristics to solve the TSP problem. Strengths: Very clear, very simple visualizations/ Weaknesses: Clearly a tutorial, you see what happens at a logical level, but not a lot of details for how it might be implemented. Recommended as lecture aide, standalone, self-study suppliment to tutorial or lecture.
a natural expression of the problem." *) The Principal of Minimal Alphabets Genetic Algorithms Chromosome Konstanz wilhelm.erben@htwg-konstanz.de Genetic Algorithms 2 The Travelling Salesman problemIV Mathematical FoundationsIII How Do Genetic Algorithms Work?II Optimisation ProblemsI Genetic Algorithms Table of Contents 3
A specialist in operations research and combinatorial optimization. Papers in PDF, PostScript, or HTML formats include articles on airline scheduling, set covering, and the traveling salesman problem. Resume and curriculum vitae and syllabus, project, and homework assignments for courses in deterministic operations research models, integer and ...
city so as to increase the tour length the least|did better. Several showed excellent perfor- mance in a GA that uses a weighted coding and the potential of such codings in GAs for combinatorial problems. 1 traveling salesman problem (TSP), which seeks a tour that visits each of a collection of cities exactly once
and prolonged polymerization were executed for 5 min each. Agarose gel electrophoresis was performed with 2. Compared Fig. 5. Experimental results of gel electrophoresis on 2% agarose gel (A�C) and 8% denaturing carriedoutseparatelysincethetwoprimersarecomple- mentary to each other. All PCR products were sieved by 2% agarose gel electrophoresis. After
solving the problem (e.g. [Greiner89, Subramanian90]). In the worst case we canresorttobrute reasonable solutions (e.g. traveling salesman problem [Held70]). Often we can take advantage of the structure- tionofaspecificmethodforeverycontrolpoint(e.g,STRAT = ). A control strategy determines the overall behavior
� posed modifications without actually solving the problem (e.g. [Greiner89, Subramanian90]). In the worst, in many practical sit� uations these complex problems have reasonable solutions (e.g. traveling salesman of a specific method for every control point (e.g, STRAT = ). A control strategy
Labs, 600 Mountain Avenue, Murray Hill, NJ 07974. chekuri@reserch.bell-labs.com Google Inc., 1440( n) approximation. Our main result is the following. Theorem 1.1 There is an O(log n) approximation the set cover problem [7]. This results in an approximation ratio of 2Hn where Hn is the n-th harmonic
Ant Colony Optimization (ACO) refers to the family of algorithms inspired by the behavior of real ants and used to solve combinatorial problems such as the Traveling Salesman Problem (TSP). Optimal Foraging Theory (OFT) is an evolutionary principle wherein foraging organisms or insect parasites seek...
Technology Transfer Automated Retrieval System (TEKTRAN)
COMMON IRW(~OO),RND(~OO),DSEED,IEVER(~~~). COMMON ICORD(lOO),IWT(lOO),IBSTORD( lOO),ICL(lOO). DIMENSION ICOST(7,7),JSTORE(6,10O),JSCORE(6),ICHECK(400) ...
NASA Website
In this paper, a new Random Combinational Selection Operator (RCSO) is presented. Three existing selection operators and our proposed selection method are applied to traveling salesman problems using MATLAB. The tours obtained using our selection method, are shorter than those that were obtained with existing selection operators for large numbers of ...
Technician National Institutes of Health*, Research Fellowship Recipient New York City Teaching Fellows Program Associate Merrill Lynch & Co., Inc.*, Analyst Morgan Stanley*, Emerging Markets Equity Sales Assistant NBC Universal, Inc.*, PAGE Program Associate New York City Office of Management & Budget, Budget
representations. All diploid individuals evolve without using any haploid stage. The performance of a diploid GA is compared with a haploid GA for both stationary and non-stationary environments. Our test problem is an updated form of Traveling Salesman Problem (TSP). For our integer representation, a simple haploid GA
...person to distribute meat products, vegetable products, fruit products, bakery products, beverages (other than milk), or laundry or dry-cleaning services. We consider you an agent-driver or commission-driver if you are paid a commission...
Code of Federal Regulations, 2011
... Accession Number : ADA029568. Title : Utilization of 'a priori' Estimates in ICBM Trajectory Determination. Descriptive Note : Final rept.,. ...
... Title : ON THE APPROXIMATE SOLUTION OF THE DIRICHLET PROBLEM FOR POISSON'S EQUATION USING A-PRIORI POINTWISE BOUNDS ...
This paper is the first to present a parallelization of a higly efficient best-first branch-and-bound algorithm to solve large symmetric traveling saleman problems on a massively parallel computer containing 1024 processors. The underlying sequential branch &bound algorithm is based on 1-tree relaxation introduced by Held and Karp (Lagrangean approach) and improved by ...
In order to efficiently obtain an approximate solution of the traveling salesman problem (TSP), extended changing crossover operators (ECXOs) which can substitute any crossover operator of genetic algorithms (GAs) and ant colony optimization (ACO) for another crossover operator at any time is proposed. In this investigation our ECXO uses both EX (or ACO) ...
Recently, Barvinok, Johnson, Woeginger, and Woodroofe have shown that the Maximum TSP, i. e., the problem of finding a traveling salesman tour of maximum length, can be solved in polynomial time, provided that distances are computed according to a polyhedral norm in IR d , for some fixed d. The most natural case of this class of problems arises for ...
Several problems, in particular the `travelling salesman' problem1 wherein one seeks the shortest route encompassing a randomly distributed group of cities, have been optimized by repeated random alteration (mutation) of a trial solution followed by selection of the cheaper (fitter) solution. Most non-trivial problems have complicated fitness functions, ...
: 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 sense of cooperative game theory. We give examples showing ...
In this paper we present an extension of MAX --MIN Ant System applying it to Traveling Salesman Problems and Quadratic Assignment Problems. The extension involves the use of a modified choice rule and a hybrid scheme allowing ants to improve their solution by local search. The computational results show that this algorithm can be used to efficiently find ...
BackgroundProtein-protein interaction information can be used to predict unknown protein functions and to help study biological pathways.ResultsHere we present a new approach utilizing the classic Traveling Salesman Problem to study the protein-protein interactions and to predict protein functions in budding yeast Saccharomyces cerevisiae. We apply the ...
A long-standing conjecture in combinatorial optimization says that the integrality gap of the famous Held-Karp relaxation of the symmetric TSP is precisely 4/3. In this paper, we show that a slight strengthening of this conjecture implies a tight 4/3 integrality gap for a linear programming relaxation of the asymmetric TSP. This is surprising since no constant-factor approximation is known for the ...
The Minimum-Backlog Problem Michael A. Bender, S�andor P. Fekete, Alexander Kr�oller, Vincenzo, in particular, makes the Traveling Salesman Problem, which #12;4 Bender, Fekete, Kr�oller, Liberatore, Mitchell performance (the proof is deferred to the full version). #12;6 Bender, Fekete, Kr�oller, Liberatore, Mitchell
Ant colony optimization metaheuristic (ACO) represents a new class of algorithms particularly suited to solve real- world combinatorial optimization problems. ACO algorithms, published for the first time in 1991 by M. Dorigo and his co-workers, have been applied, particularly starting from 1999 to several kind of optimization problems as the traveling ...
Some years ago, Bachem, Hochst�ttler, and Malich proposed a heuristic algorithm called Simulated Trading for the optimization of vehicle routing problems. Computational agents place buy-orders and sell-orders for customers to be handled at a virtual financial market, the prices of the orders depending on the costs of inserting the customer in the tour or for his removal. According to a proposed ...
Search space smoothing and related heuristic optimization algorithms provide an alternative approach to simulated annealing and its variants: while simulated annealing traverses barriers in the energy landscape at finite temperatures, search space smoothing intends to remove these barriers, so that a greedy algorithm is sufficient to find the global minimum. Several formulas for smoothing the ...
Ant System is a general purpose heuristic algorithm inspired by the foraging behavior of real ant colonies. Here we introduce an improved version of Ant System, that we called MAX-MIN Ant System. We describe the new features present in MAX-MIN Ant System, make a detailed experimental investigation on the contribution of the design choices to the improved performance and give computational ...
In this paper we introduce by means of examples a new technique for formulating compact (i.e. polynomial-size) LP relaxations in place of exponential-size models requiring separation algorithms. In the same vein as a celebrated theorem by Groetschel, Lovasz and Schrijver, we state the equivalence of compact separation and compact optimization. Among the examples used to illustrate our technique, ...
In this thesis, a new general adaptive algorithm for solving a wide variety of NP-Complete combinatorial problems is developed. The new technique is called Stochastic Evolution (SE). The SE algorithm is applied to Network Bisection, Vertex Cover, Set Partition, Hamilton Circuit, Traveling Salesman, Linear Ordering, Standard Cell Placement, and Multi-way ...
We demonstrate a computing system based on an amoeba of a true slime mold Physarum capable of producing rich spatiotemporal oscillatory behavior. Our system operates as a neurocomputer because an optical feedback control in accordance with a recurrent neural network algorithm leads the amoeba's photosensitive branches to search for a stable configuration concurrently. We show our system's ...
Traveling Salesman Problem (TSP) is a typical NP-Complete problem. This paper, through finding the solution of TSP, combining the use of high-efficiency gene regulatory algorithm , particle swarm optimization and ant colony optimization, proposes a kind of improved swarm intelligence algorithm GRPSAC. The GRPSAC overcomes the disadvantages of several ...
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 ...
We propose a modified model of pheromone updation for Ant-System, entitled as Adaptive Ant System (AAS), using the properties of basic Adaptive Filters. Here, we have exploited the properties of Least Mean Square (LMS) algorithm for the pheromone updation to find out the best minimum tour for the Travelling Salesman Problem (TSP). TSP library has been used ...
This paper describes a racing procedure for finding, in a limited amount of time, a configuration of a metaheuristic that performs as good as possible on a given instance class of a combinatorial optimization problem. Taking inspiration from methods proposed in the machine learning literature for model selection through cross-validation, we propose a procedure that empirically evaluates a ...
Consider the 2-matching problem defined on the complete graph, with edge costs which satisfy the triangle inequality. We prove that the value of a minimum cost 2-matching is bounded above by 4/3 times the value of its linear programming relaxation, the fractional 2-matching problem. This lends credibility to a long-standing conjecture that the optimal value for the traveling ...
The host-seeking behavior of mosquitoes is very interesting. In this paper, we propose a novel mosquito host-seeking algorithm (MHSA) as a new branch of biology-inspired algorithms for solving TSP problems. The MHSA is inspired by the host-seeking behavior of mosquitoes. We present the mathematical model, the algorithm, the motivation, and the biological model. The MHSA can work out the ...
IDA* algorith� m and identify reasons why existing IDA*�style algo� rithms perform well. In practice that the original IDA* does not perform well on the traveling�salesman problem, and suggested improvement by using is, therefore, n IDA\\Lambdas\\Gamma1 = f(` 1 )u L+s\\Gamma1 ` 1 2 + 1 u s \\Gamma 1 ' (9) (b) L ! ` n+1
The Cost-Constrained Traveling Salesman Problem (CCTSP) is a variant of the well-known Traveling Salesman Problem (TSP). In the TSP, the goal is to find a tour of a given set of cities such that the total cost of the tour is minimized. In the CCTSP, each city is given a value, and a fixed cost-constraint is ...
It is well known that the chromosome design is pivotal to solve the multiple traveling salesman problems with genetic algorithm. A well-designed chromosome coding can eliminate or reduce the redundant solutions. One chromosome and two chromosome design methods and a recently proposed two-part chromosome design are firstly introduced in this paper. Then the ...
The vehicle routing problem (VRP) is a variant of the familiar travelling salesman problem (TSP). In the VRP we are to perform a number of visits, using a limited number of vehicles, while minimizing the distance travelled. The VRP can be further complicated by associating time windows on visits, capacity constraints on vehicles, ...
In this dissertation, the problem of planning the motion of m Unmanned Vehicles (UVs) (or simply vehicles) through n points in a plane is considered. A motion plan for a vehicle is given by the sequence of points and the corresponding angles at which each point must be visited by the vehicle. We require that each vehicle return to the same initial location(depot) at the same heading after visiting ...
Vehicle Routing Problem (VRP), is an extension of the well known Traveling Salesman Problem (TSP) and has many practical applications in the fields of distribution and logistics. When the VRP consists of distance based constraints it is called Distance Constrained Vehicle Routing Problem (DVRP). However, the literature addressing on the DVRP is scarce. In ...
Metaheuristic search algorithms due to their heuristic nature usually need tuning of parameters, components and/or strategies to achieve acceptable performance on a particular problem. While there has been much work on tools and techniques to address this Tuning Problem, there has been relatively little work which takes advantage of putting humans in the metaheuristic analysis/evaluation loop. ...
. In this paper we evaluate the usefulness of seeding genetic algorithms (GAs) from a case-base. This is motivated by the expectation that the seeding will speed up the GA by starting the search in promising regions of the search space. We evaluate this case-based seeding on popular GA solutions to the Travelling Salesman Problem (TSP) and the Job-Shop ...
Most previous studies of the speedup of parallel branch-and-bound algorithms are based on the amount of work done in the parallel case and in the sequential case. Any evaluation of a parallel algorithm should include both the execution time and the synchronization delay. In this paper, a finite-population queueing model is used to capture the synchronization delay in parallel branch-and-bound ...
To explore possible forms of unconventional computers that have high capacities for adaptation and exploration, we propose a new approach to developing a biocomputer based on the photophobic reactions of microbes (Euglena gracilis), and perform the Monte-Carlo simulation of Euglena-based neural network computing, involving virtual optical feedback to the Euglena cells. The photophobic reactions of ...
A new optimization principle is presented. Solutions of problems are partly, but significantly, ruined and rebuilt or recreated afterwards. Performing this type of change frequently, one can obtain astounding results for classical optimization problems. The new method is particularly suited for more complex optimization problems (``discontinuous'' ones, problems with hard-to-find admissible ...
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics. A tree is constructed using a fully connected graph and the problem is approached similarly to the well-known traveling salesman problem. This methodology was used to develop an algorithm for constructing a phylogenetic tree using a ...
We investigate the electronic properties in tunneling-coupled double quantum wells, one of which has a large degree of disorder and the other of which is relatively clean, based on the spectral statistics of a quantum particle. When a small transfer between the double wells prevents our electronic system from being at the extreme quantum limit in two dimensions, a drastic transformation from a ...
Contents 1 Introduction 3 2 The environment of the experiment 5 2.1 The Orca language and implementation . . . . . . . . . . . . . . 5 2.2 The Amoeba processor pool . . . . . . . . . . . . . . . . . . . . . 6 2.3 The simulation of a clustered wide-area network . . . . . . . . . 7 2.4 Analyzing Orca programs . . . . . . . . . . . . . . . . . . . . . . 8 2.5 Compiling and running Orca programs . . ...
We present a manipulator placement algorithm for minimizing the length of the manipulator motion performing a visit-point task such as spot welding. Given a set of points for the tool of a manipulator to visit, our algorithm finds the shortest robot motion required to visit the points from each possible base configuration. The base configurations resulting in the shortest motion is selected as the ...
A general strategy is advanced for simplifying nonlinear optimization problems, the ant-lion method. This approach exploits shape modifications of the cost-function hypersurface which distend basins surrounding low-lying minima (including global minima). By intertwining hypersurface deformations with steepest-descent displacements, the search is concentrated on a small relevant subset of all ...
This paper presents a heuristic-search algorithm called Memory-bounded Anytime Window A? (MAWA?), which is complete, anytime, and memory bounded. MAWA? uses the window-bounded anytime-search methodology of AWA? as the basic framework and combines it with the memory-bounded A? -like approach to handle restricted memory situations. Simple and efficient versions of MAWA? targeted for tree search have ...
Various navigational factors involved in guidance of an asteroid mineral survey probe if launched on the Ariane 4 are considered. Any flyby of an asteroid will be subject to solar gravity, the velocity of the probe relative to the sun and the asteroid, and the orbit and the velocity of the asteroid relative to the sun. Use of a gravity assist by the earth or Mars is a way to gain added inertial ...
This thesis addresses a number of important problems that fall within the framework of the new discipline of Computational Geometry. The list of topics covered includes sorting and selection, convex hull algorithms, the L/sub 1/ hull, determination of the minimum encasing rectangle of a set of points, the Euclidean and L/sub 1/ diameter of a set of points, the metric traveling ...
A number of extensions of Ant System, the first ant colony optimization (ACO) algorithm, were proposed in the literature. These extensions typically achieve much improved computational results when compared to the original Ant System. However, many design choices of Ant System are left untouched including the fact that solutions are constructed, that real-numbers are used to simulate pheromone ...
In this paper, we propose a novel model, a delayed transiently chaotic neural network (DTCNN), and numerically confirm that the model performs better in finding the global minimum for the traveling salesman problem (TSP) than the traditional transiently chaotic neural network. The asymptotic stability and chaotic behavior of the dynamical system with time ...
Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based on advice received from consultants. Until now, CGS has been successfully applied to the Traveling Salesman Problem. Because a good metaheuristic should be able to tackle efficiently a ...
An important class of neural models is described as a set of coupled nonlinear differential equations with state variables corresponding to the axon hillock potential of neurons. Through a nonlinear transformation, these models can be converted to an equivalent system of differential equations whose state variables correspond to firing rates. The new firing rate formulation has certain ...
Artificial-intelligence methods were applied to the design and implementation of some decision and control systems. A so-called semantic approach to control and decisions was developed and artificial-intelligence methods were used to provide a realizable implementation. These concepts were tested using applications from robust identification and control of time-varying systems, intelligent ...
Artificial intelligence methods were applied to the design and implementation of some decision and control systems. A so-called semantic approach to control and decisions was developed and artificial intelligence methods were used to provide a realizable implementation. These concepts were tested using applications from robust identification and control of time-varying systems, intelligent ...
In this paper, a new self-organizing map (SOM) based adaptation procedure is proposed to address the multiple watchman route problem with the restricted visibility range in the polygonal domain W. A watchman route is represented by a ring of connected neuron weights that evolves in W, while obstacles are considered by approximation of the shortest path. The adaptation procedure considers a ...
Batch processing is the key to manufacturing flexibility and the production of small amounts of high value added products. Unfortunately, the development of schedules that can account for such factors as process set up costs, equipment constraints, inventory management and product delivery time windows is a complex problem. The emergence of parallel computers with sufficient raw power and new ...
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 real-life case study from Central Finland over several alternative ...
Based on the clonal selection principle proposed by Burnet, in the immune response process there is no crossover of genetic material between members of the repertoire, i. e., there is no knowledge communication during different elite pools in the previous clonal selection models. As a result, the search performance of these models is ineffective. To solve this problem, inspired by the concept of ...
To provide an ability to characterize local features for the chaotic neural network (CNN), Gauss wavelet is used for the self-feedback of the CNN with the dilation parameter acting as the bifurcation parameter. The exponentially decaying dilation parameter and the chaotically varying translation parameter not only govern the wavelet self-feedback transform but also enable the CNN to generate ...
FIR filter has some advantages, such as system stability, simple implement, and linear phase. It has been widely used in digital signal processing and other relative fields. Clonal selection algorithm has been applied successfully in solving problems like memory acquisition, multi-modal optimization and traveling salesman problem. This paper proposes a ...
Abstract. We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal ++). GELATO allows to easily develop and use hybrid meta-heuristic combining CP and LS phases (in particular Large Neighborhood Search). We tested some hybrid algorithms on different instances of the Asymmetric ...
A delivery route optimization that improves the efficiency of real time delivery or a distribution network requires to solve several tens to hundreds cities Traveling Salesman Problems (TSP) (1)(2) within interactive response time, with expert-level accuracy (less than about 3% of error rate). To meet these requirements, a multi-inner-world Genetic ...
. In order to sequence the tasks of a job shop problem (JSP) on a number of machines related to the technological machine order of jobs, a new representation technique -- mathematically known as "permutation with repetition" is presented. The main advantage of this single chromosome representation is -- in analogy to the permutation scheme of the traveling ...
newspaperman stewardess toxicologist slang babysitter conspirator womanizer mailman salesman bookkeeper
The productivity of machine tools is significantly improved by using microcomputer based CAD/CAM systems for NC program generation. Currently, many commercial CAD/CAM packages that provide automatic NC programming have been developed and applied to various cutting processes. Many cutting processes machined by CNC machine tools. In this paper, we attempt to find an efficient solution approach to ...
The aim of the present study is to elucidate how simulated annealing (SA) works in its finite-time implementation by starting from the verification of its conventional optimization scenario based on equilibrium statistical mechanics. Two and one supplementary experiments, the design of which is inspired by concepts and methods developed for studies on liquid and glass, are performed on two types ...
Spatial cognition is typically examined in non-human animals from the perspective of learning and memory. For this reason, spatial tasks are often constrained by the time necessary for training or the capacity of the animal's short-term memory. A spatial task with limited learning and memory demands could allow for more efficient study of some aspects of spatial cognition. The ...
Humans need to solve computationally intractable problems such as visual search, categorization, and simultaneous learning and acting, yet an increasing body of evidence suggests that their solutions to instantiations of these problems are near optimal. Computational complexity advances an explanation to this apparent paradox: (1) only a small portion of instances of such problems are actually ...
When restricted to cost arrays possessing the sum Monge property, many combinatorial optimization problems with sum objective functions become significantly easier to solve. Examples include the usual sum-objective-function versions of the assignment problem, the transportation problem, the traveling-salesman problem, and several shortest-path problems. Furthermore, the more ...
... a'priori range information represents environmental predictions of likely range bands based on alternate propagation paths (direct, 1st CZ, 2nd CZ ...
... eg biology, in nuclear reactor techniques, in ... of only u sub k, the k sub th ... BIOLOGY, PARABOLAS, NUCLEAR REACTORS, HEAT TRANSMISSION. ...
The psychostimulant effects of caffeine on school children Daniela Herzig Dr C Mohr Does cannibis consumption protect
... "A priori" this is a reason- able assumption as long as the activity levels of t1e sub units ... to determine for'what span of activity levels the linearity ...
and gas cooled nuclear reactors, the boundary temperature is unknown a-priori, though it is of critical importance from a structural design viewpoint. ...
) S'andor P. Fekete Matthias Schmitt Center for Parallel Computing Universitat zu Koln D -- 50931 Koln, Germany E-Mail: sandor@zpr.uni-koeln.de mschmitt@zpr.uni-koeln.de Abstract We propose the "Competing Salesmen Problem" (CSP), a 2-player competitive version of the classical Traveling Salesman Problem. This problem arises when we are considering two ...
A method is proposed that uses operations research techniques to optimize the routes of waste collection vehicles servicing dumpster or skip-type containers. The waste collection problem is reduced to the classic travelling salesman problem, which is then solved using the Concorde solver program. A case study applying the method to the collection system in ...
Investigated the role of "a priori" ideas in planning experiments and data processing leading to inferences. Thirty-one students (ages 11-13) observed a "combustion/candle in a closed container" experiment and were asked to interpret sets of measurements. Findings, among others, show that children preferentially experiment on factors about which they ...
The first chapter follows the origin of the concept of entropy in Thermodynamics and its probabilistic reinterpretation in Statistical Mechanics, tracking its more recent reappearance in Information Theory. In the second chapter, interest is focused on th...
The available kinetic, mechanistic, and product data for the gas-phase reactions of the OH radical with organic compounds are discussed and evaluated with an emphasis upon these data under atmospheric conditions. In addition, a-priori predictive techniques for the estimation of room-temperature rate constants for the reaction of OH radicals with organics are reviewed, and a ...
...respect to �any salesman, partsman, or mechanic primarily engaged in selling or servicing...available for salesmen, partsmen and mechanics, employed by the establishment...aircraft. (c) Salesman, partsman, or mechanic. (1) As used in section...
We are currently developing a new 3-D global tomography modeling framework with monitoring purposes at the forefront. The overall monitoring goal is to develop a seamless, 3-D global model capable of accurately locating seismic events from combined teleseismic and regional travel time observations. Such a model will eliminate the need to splice independent regional and/or ...
