Results 51 to 60 of about 496 (169)
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 +3 more
wiley +1 more source
Journal of Management Studies, EarlyView.Abstract We analyse the behaviour of multinational enterprises (MNEs) within a host nation – Australia – during deglobalization (1914–79). Deglobalization is often portrayed as a drastic event to which MNEs respond swiftly, probably through withdrawal from host countries.
Pierre Van der Eng +4 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
The ant colony metaphor for multiple knapsack problem
Journal of Computer Science and Technology, 2000 This paper presents an Ant Colony Optimisation (ACO) model for the Multiple Knapsack Problem (MKP). The ACO algorithms, as well as other evolutionary metaphors, are being applied successfully to diverse heavily constrained problems: Travelling Salesman ...
Marcelo Guillermo Cena +3 more
doaj
Time-Dependent Traveling Salesman Problem with Multiple Time Windows [PDF]
Annals of Computer Science and Information Systems, 2015 The TSP, VRP and OP problems with time constraints have one common sub-problem – the task of finding the minimum route duration for a given order of customers. While much work has been done on routing and scheduling problems with time windows, to this date only few articles considered problems with multiple time windows.
openaire +2 more sources
A Heavy‐Duty Vehicle Routing Problem With Temperature Constraints
Networks, Volume 87, Issue 2, Page 131-150, March 2026.ABSTRACT This article studies a vehicle routing problem involving a fleet of heavy‐duty vehicles and pickup‐and‐delivery requests for crude items that are both heavy and high‐temperature. The objective is to route the fleet in such a way that maximizes resource efficiency and operational efficiency while simultaneously avoiding thermal overload of any ...
Biljana Roljić, Yuan Chen
wiley +1 more source
OPTIMIZING MULTIPLE TRAVELLING SALESMAN PROBLEM CONSIDERING THE ROAD CAPACITY [PDF]
Journal of Computer Science, 2014 The Multiple Travelling Salesman Problems (MTSP) can be used in a wide range of discrete optimization problems. As the solution to this prob lem has wide applicability in many practical fields , this NP Hard problem highly raises the need for an efficient solution. The problem is determining a se t of routes for the salesmen that jointly visit a set of
openaire +1 more source
Qubit‐Efficient Quantum Local Search for Combinatorial Optimization
Advanced Quantum Technologies, Volume 9, Issue 3, March 2026.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
Sustainable Development, Volume 34, Issue S2, Page 132-153, March 2026.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
The Plant Genome, Volume 19, Issue 1, March 2026.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