Results 81 to 90 of about 28,852 (210)
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
This paper considers a multi-objective version of the Multiple Traveling Salesman Problem (MOmTSP). In particular, two objectives are considered: the minimization of the total traveled distance and the balance of the working times of the traveling ...
Rubén Iván Bolaños +2 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
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
Equitable Routing -- Rethinking the Multiple Traveling Salesman Problem
The Multiple Traveling Salesman Problem (MTSP) generalizes the Traveling Salesman Problem (TSP) by introducing multiple salesmen tasked with visiting a set of targets from a single depot, ensuring each target is visited exactly once while minimizing total tour length. A key variant, the min-max MTSP, seeks to balance workloads by minimizing the longest
Bhadoriya, Abhay Singh +2 more
openaire +2 more sources
‘Good Enough’: The Use of Satisficing in the Design of Disruptive Innovation in Emerging Economies
ABSTRACT While design has been acknowledged as a fundamental driver of innovation, questions remain about how design affects disruptive innovation from the perspective of consumer perceptions. Drawing from Simon's insights of bounded rationality and satisficing applied within the technology acceptance model (TAM), we propose an integrated, customer ...
Jie Xue, K. Scott Swan
wiley +1 more source
Restricted Dynamic Programming Heuristic for Precedence Constrained Bottleneck Generalized TSP [PDF]
We develop a restricted dynamical programming heuristic for a complicated traveling salesman problem: a) cities are grouped into clusters, resp.
Salii, Y.
core
The ACO-BmTSP to Distribute Meals Among the Elderly
The aging of the Portuguese population is a multifaceted challenge that requires a coordinated and comprehensive response from society. In this context, social service institutions play a fundamental role in providing aid and support to the elderly ...
Sílvia de Castro Pereira +2 more
doaj +1 more source
Abstract The transformative potential of artificial intelligence (AI) ChatBots, leveraging natural language processing for information retrieval and knowledge synthesis, has garnered attention across diverse fields, including research. Recognizing AI's importance, researchers and policymakers are actively engaged in its development.
Cinzia Daraio +2 more
wiley +1 more source

