Results 71 to 80 of about 28,852 (210)
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
Focusing on the Golden Ball Metaheuristic: An Extended Study on a Wider Set of Problems
The Scientific World Journal, 2014 Nowadays, the development of new metaheuristics for solving optimization problems is a topic of interest in the scientific community. In the literature, a large number of techniques of this kind can be found.
E. Osaba +4 more
doaj +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
Heuristics for the traveling repairman problem with profits [PDF]
, 2010 In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists of maximizing the total collected revenue.
Dewilde, Thijs +4 more
core +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
IEEE Access, 2020 The optimization of logistics distribution can be defined as the multiple traveling salesman problem (MTSP). The purpose of existing heuristic algorithms, such as Genetic Algorithm (GA), Ant Colony Algorithm (ACO), etc., is to find the optimal path in a ...
Min Wang +4 more
doaj +1 more source
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
On the Core of Multiple Longest Traveling Salesman Games [PDF]
In this paper we introduce multiple longest traveling salesman (MLTS) games. An MLTS game arises from a network in which a salesman has to visit each node (player) precisely once, except its home location, in an order that maximizes the total reward ...
Borm, P.E.M. +2 more
core +1 more source
Ain Shams Engineering JournalThe 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
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