On Approximate Solutions for Combinatorial Optimization Problems

1990 ◽  
Vol 3 (2) ◽  
pp. 294-310 ◽  
Author(s):  
Hans Ulrich Simon
Keyword(s):  
Combinatorial Optimization ◽  
Optimization Problems ◽  
Approximate Solutions ◽  
Combinatorial Optimization Problems

scholarly journals Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems

2019 ◽  
Vol 5 (4) ◽  
pp. eaav2372 ◽  
Author(s):  
Hayato Goto ◽  
Kosuke Tatsumura ◽  
Alexander R. Dixon
Keyword(s):  
Combinatorial Optimization ◽  
Hamiltonian Systems ◽  
Large Scale ◽  
Optimization Problems ◽  
Approximate Solutions ◽  
Combinatorial Optimization Problems ◽  
Bifurcation Phenomena ◽  
Field Programmable ◽  
Max Cut Problem ◽  
Adiabatic Optimization

Combinatorial optimization problems are ubiquitous but difficult to solve. Hardware devices for these problems have recently been developed by various approaches, including quantum computers. Inspired by recently proposed quantum adiabatic optimization using a nonlinear oscillator network, we propose a new optimization algorithm simulating adiabatic evolutions of classical nonlinear Hamiltonian systems exhibiting bifurcation phenomena, which we call simulated bifurcation (SB). SB is based on adiabatic and chaotic (ergodic) evolutions of nonlinear Hamiltonian systems. SB is also suitable for parallel computing because of its simultaneous updating. Implementing SB with a field-programmable gate array, we demonstrate that the SB machine can obtain good approximate solutions of an all-to-all connected 2000-node MAX-CUT problem in 0.5 ms, which is about 10 times faster than a state-of-the-art laser-based machine called a coherent Ising machine. SB will accelerate large-scale combinatorial optimization harnessing digital computer technologies and also offer a new application of computational and mathematical physics.

scholarly journals AN OPTIMIZATION SPIKING NEURAL P SYSTEM FOR APPROXIMATELY SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS

2014 ◽  
Vol 24 (05) ◽  
pp. 1440006 ◽  
Author(s):  
GEXIANG ZHANG ◽  
HAINA RONG ◽  
FERRANTE NERI ◽  
MARIO J. PÉREZ-JIMÉNEZ
Keyword(s):  
Combinatorial Optimization ◽  
Optimization Problems ◽  
Approximate Solutions ◽  
Neural System ◽  
P Systems ◽  
P System ◽  
Spiking Neural P System ◽  
Combinatorial Optimization Problems ◽  
Evolutionary Operators ◽  
Computing Models

Membrane systems (also called P systems) refer to the computing models abstracted from the structure and the functioning of the living cell as well as from the cooperation of cells in tissues, organs, and other populations of cells. Spiking neural P systems (SNPS) are a class of distributed and parallel computing models that incorporate the idea of spiking neurons into P systems. To attain the solution of optimization problems, P systems are used to properly organize evolutionary operators of heuristic approaches, which are named as membrane-inspired evolutionary algorithms (MIEAs). This paper proposes a novel way to design a P system for directly obtaining the approximate solutions of combinatorial optimization problems without the aid of evolutionary operators like in the case of MIEAs. To this aim, an extended spiking neural P system (ESNPS) has been proposed by introducing the probabilistic selection of evolution rules and multi-neurons output and a family of ESNPS, called optimization spiking neural P system (OSNPS), are further designed through introducing a guider to adaptively adjust rule probabilities to approximately solve combinatorial optimization problems. Extensive experiments on knapsack problems have been reported to experimentally prove the viability and effectiveness of the proposed neural system.

Sign in / Sign up

Export Citation Format

Share Document