It is a long time that the Simulated Annealing (SA) procedure is introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules start...

It is a long time that the Simulated Annealing (SA) procedure is introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules start...

The purpose of this paper is to study traveling wave fronts of a two-dimensional (2D) lattice delayed differential equation with global interaction. Applying the comparison principle combined with the technical weighted-energy method, we prove that any given traveling wave front with large speed is time-asymptotically stable when the initial perturbation around the wave front need decay to zero...

We present an approximation algorithm for the Traveling Salesman Problem when the vehicle is constrained to move forward along paths with bounded curvature (Dubins’ vehicle). A deterministic algorithm returns in time O(n3) a tour within (( 1 + max { 8πρ Dmin , 14 3 }) log n ) of the optimum tour, where n is the number of points to visit, ρ is the minimum turning radius and Dmin is the minimum E...

In this paper, an improved self-organizing map approach to solving the traveling salesman problem is proposed by fixing the number of nodes in the output layer of neural network, modifying the neighhorhood function, and modifying the weight update rules. An overview of previous work on solving the traveling salesman problem is given. An extension of the prcposed algorithm can also be used to so...

We present an approximation algorithm for the traveling salesman problem when the vehicle is constrained to move forward along paths with bounded curvatures (Dubins’ vehicle). A deterministic algorithm returns in time O(n3) a tour within (( 1 + max { 8πρ Dmin , 14 3 }) log n ) of the optimum tour, where n is the number of points to visit, ρ is the minimum turn radius and Dmin is the minimum Euc...

Given a collection of cities and the cost of travel between each pair of them, the traveling salesman problem is to find the cheapest way of visiting all of the cities and returning to starting point. The simplicity of the statement of the problem is deceptive, the traveling salesman problem is one of the most intensely studied problems in computational mathematics and yet no effective solution...

We consider traveling wave solutions to spatially discrete reaction-diffusion equations with nonlocal variable diffusion and bistable nonlinearities. To find the traveling wave solutions we introduce an ansatz in which the wave speed depends on the underlying lattice as well as on time. For the case of spatially periodic diffusion we obtain analytic solutions for the traveling wave problem usin...

We present for the first time direct electrophysiological evidence of the phenomenon of traveling electrical waves produced by populations of interneurons within the spinal cord. We show that, during a fictive rhythmic motor task, scratching, an electrical field potential of spinal interneurons takes the shape of a sinuous wave, "sweeping" the lumbosacral spinal cord rostrocaudally with a mean ...

Recent studies have established and characterized the propagation of traveling electrical waves along the cat spinal cord during scratching, but the neuronal architecture that allows for the persistence of such waves even during periods of absence of bursts of motoneuron activity (deletions) is still unclear. Here we address this problem both theoretically and experimentally. Specifically, we m...