Results 71 to 80 of about 863 (188)
Qubit‐Efficient Quantum Local Search for Combinatorial Optimization
We introduce a qubit‐efficient variational quantum algorithm for combinatorial optimization that adaptively uses from logarithmic to a linear number of qubits to implement quantum local search. The method encodes flip probabilities of spin groups into quantum amplitudes, enabling exploration of classically intractable neighborhoods while maintaining ...
Mikhail Podobrii +4 more
wiley +1 more source
Complexity indices for the travelling salesman problem and data mining [PDF]
In this survey paper we extend our previous work on complexity indices for the travelling salesman problem (TSP), summarized in cite{CvCK3}, using graph spectral techniques of data mining. A complexity index is an invariant of an instance $I$ by which we
Dragos Cvetković
doaj
MAPSOFT: A Multi-Agent based Particle Swarm Optimization Framework for Travelling Salesman Problem
This paper proposes a Multi-Agent based Particle Swarm Optimization (PSO) Framework for the Traveling salesman problem (MAPSOFT). The framework is a deployment of the recently proposed intelligent multi-agent based PSO model by the authors.
Blamah Nachamada Vachaku +3 more
doaj +1 more source
ABSTRACT Global municipal solid waste generation is projected to exceed 3.8 billion tonnes annually by 2050. This makes the need for smart, inclusive, and scalable waste valorization systems more urgent than ever. This review critically explores the shift from conventional waste management to intelligent, technology‐driven solutions aligned with ...
Segun E. Ibitoye +8 more
wiley +1 more source
Abstract After decades of intensive breeding, modern US soybean [Glycine max (L.) Merr.] varieties have achieved significant improvements in yield, quality, and stress tolerance, but these gains have come at the cost of severely reduced genetic diversity.
Qijian Song +3 more
wiley +1 more source
Analisis Hibridisasi Pencarian Lokal Dengan Populasi Dalam Travelling Salesman Problem (TSP)
Traveling Salesman Problem (TSP) merupakan sebuah permasalah optimasi yang dapat diterapkan pada berbagai kegiatan seperti pendistribusian barang, pengambilan tagihan listirk dan pedagang keliling.
Erdiwansyah Erdiwansyah* +3 more
doaj +1 more source
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
IMPLEMENTASI ALGORITMA BEE COLONY UNTUK OPTIMASI RUTE DISTRIBUSI CARICA NIDA FOOD WONOSOBO
“Nida Food” merupakan UMKM produksi carica, memiliki permasalahan dalam menentukan rute minimum untuk mendistribusikan produksi carica ke semua konsumen.
Muhammad Darwis Arifin, Arif Dwi Laksito
doaj +1 more source
The siege of Tobruk is one of the most well‐known Australian actions of the Second World War, enjoying special attention on Anzac Day. Its elevation within Australian national memory is by no means accidental. Rather, it is the result of decades of lobbying by the Rats of Tobruk Association (ROTA), which positioned veterans of the siege as the ...
Nicole Townsend
wiley +1 more source
Firefly Algorithm (FA) mimics the flashing light characteristic of fireflies to solve optimization problems. An area where its utilization is limited is Travelling Salesman Problem (TSP).
Ravneil Nand +2 more
doaj +1 more source

