Results 71 to 80 of about 3,935 (225)
Market Insurance and Risk Pooling in U.S. Crop Insurance
ABSTRACT A common assumption is that multiple‐peril crop insurance markets suffer from market failures, thus justifying government intervention in the form of premium subsidies, operating allowances, and reinsurance agreements. One prominent rationale for intervention involves geographic correlation in agricultural production which leads to systemic ...
Fan Fan +3 more
wiley +1 more source
Evolutionary computation applied to combinatorial optimisation problems [PDF]
This thesis addresses the issues associated with conventional genetic algorithms (GA) when applied to hard optimisation problems. In particular it examines the problem of selecting and implementing appropriate genetic operators in order to meet the ...
Mitchell, George G.
core
Human Performance on Hard Non-Euclidean Graph Problems: Vertex Cover
Recent studies on a computationally hard visual optimization problem, the Traveling Salesperson Problem (TSP), indicate that humans are capable of finding close to optimal solutions in near-linear time.
Masson, Michael E. J. +2 more
core +1 more source
Study of TSP based on self-organizing map
Self-organizing map(SOM) proposed by Kohonen has obtained certain achievements in solving the traveling salesman problem(TSP).To improve Kohonen SOM,an effective initialization and parameter modification method is discussed to obtain a faster convergence
SONG Jin-juan +2 more
doaj
An Application of Assignment Problem in Traveling Salesman Problem (TSP)
Assignment problem (AP) is completely degenerate form of a transportation problem. It appears in somedecision-making situations, this paper focused on TSP for finding the shortest closed route. By using „ROAMethod" and „Ghadle and Muley Rule" will get optimal solution for TSP within few steps.
openaire +1 more source
A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
Abstract The traveling salesman (or salesperson) problem, short TSP, is of strong interest to many researchers from mathematics, economics, and computer science. Manifold TSP variants occur in nearly every scientific field and application domain: e.g., engineering, physics, biology, life sciences, and manufacturing.
Sophia Saller +2 more
openaire +3 more sources
A New Evolutionary Multiobjective Model for Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most classical NP-hard problems in the combinatorial optimization, as many practical problems, such as scheduling problems and vehicle-routing cost allocation problems can be abstracted. The introduction
Xuejiao Chen +5 more
doaj +1 more source
Designing Memristive Materials for Artificial Dynamic Intelligence
Key characteristics required of memristors for realizing next‐generation computing, along with modeling approaches employed to analyze their underlying mechanisms. These modeling techniques span from the atomic scale to the array scale and cover temporal scales ranging from picoseconds to microseconds. Hardware architectures inspired by neural networks
Youngmin Kim, Ho Won Jang
wiley +1 more source
Optimal tree for Genetic Algorithms in the Traveling Salesman Problem (TSP)
In this paper, the author proposes optimal tree as a "gauge" for the generation of the initial population at random in the Genetic Algorithms (GA) to benchmark against the good and the bad parent tours. Thus, without having the so-called bad parent tours in the initiate population, it will speed up the GA.
openaire +2 more sources
Quantum computing techniques such as Quantum Annealing and Quadratic Unconstrained Binary Optimization are effectively solving NP‐hard problems in operations management and research, particularly in logistics, manufacturing, and finance. This study maps these applications to present a framework for future adoption across industries. ABSTRACT This study
Daniel Bouzon Nagem Assad +3 more
wiley +1 more source

