Results 61 to 70 of about 21,266 (220)

Exact and metaheuristic approaches to minimizing makespan in parallel machine scheduling with conflicting jobs

International Transactions in Operational Research, EarlyView.
Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati, Dinh Quy Ta, Minh Hoàng Hà, Andrea Schaerf   +3 more
wiley   +1 more source

The team orienteering problem with variable time windows

International Transactions in Operational Research, Volume 33, Issue 3, Page 1705-1732, May 2026.
Abstract The orienteering problem is well‐established within the domain of operational research. This paper introduces the team orienteering problem with variable time windows (TOPVTW) as a new variant of the team orienteering problem with time windows. The distinguishing feature of the TOPVTW is the adaptive time windows, which evolve dynamically as a
Bibiana Granda, Begoña Vitoriano
wiley   +1 more source

Hybrid discrete coati optimization algorithm for solving large-scale multiple traveling salesman problem

Ain Shams Engineering Journal
The Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem and is also categorized as NP-hard problem. The Multiple Traveling Salesmen Problem (MTSP) represents a variant of TSP, which is more complex and holds greater practical
Lun Zhu, Yongquan Zhou, Qifang Luo
doaj   +1 more source

Market Insurance and Risk Pooling in U.S. Crop Insurance

Agricultural Economics, Volume 57, Issue 2, March 2026.
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, Yong Liu, A. Ford Ramsey, David J. Leatham   +3 more
wiley   +1 more source

Turning Energy-Aware Route Planning With an Extended TSP and Double-Layer State Graph: Experimental Evaluation With a Crawler Mobile Robot

IEEE Access
For mobile robots with multiple destinations that must be visited only once, the Traveling Salesman Problem (TSP) provides an optimal route. The optimality may not be achieved for crawler robots, which are often used in the forestry industry and have a ...
Namihei Adachi, Hisashi Date
doaj   +1 more source

A Memetic Algorithm Based on Breakout Local Search for the Generalized Traveling Salesman Problem

Applied Artificial Intelligence, 2020
The Traveling Salesman Problem (TSP) is one of the most popular Combinatorial Optimization Problem. It is well solicited for the large variety of applications that it can solve, but also for its difficulty to find optimal solutions.
Mehdi El Krari, Belaïd Ahiod, Bouazza El Benani   +2 more
doaj   +1 more source

A Genetic Algorithm with New Local Operators for Multiple Traveling Salesman Problems

International Journal of Computational Intelligence Systems, 2018
Multiple Traveling Salesman Problem (MTSP) is able to model and solve various real-life applications such as multiple scheduling, multiple vehicle routing and multiple path planning problems, etc.
Kin-Ming Lo, Wei-Ying Yi, Pak-Kan Wong, Kwong-Sak Leung, Yee Leung, Sui-Tung Mak   +5 more
doaj   +1 more source

Accelerate Incremental TSP Algorithms on Time Evolving Graphs with Partitioning Methods

Algorithms, 2022
In time-evolving graphs, the graph changes at each time interval, and the previously computed results become invalid. We addressed this issue for the traveling salesman problem (TSP) in our previous work and proposed an incremental algorithm where the ...
Shalini Sharma, Jerry Chou
doaj   +1 more source

Designing Memristive Materials for Artificial Dynamic Intelligence

Advanced Intelligent Discovery, Volume 2, Issue 1, February 2026.
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

Mapping Quantum Computing Techniques for NP‐Hard Problems in Operations Management and Operations Research

Engineering Reports, Volume 8, Issue 2, February 2026.
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, Patricia Gomes Ferreira da Costa, Thaís Spiegel, Hélcio de Oliveira Rocha   +3 more
wiley   +1 more source