Results 61 to 70 of about 17,281 (197)

A matheuristic for the traveling salesman problem with positional consistency constraints

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley   +1 more source

A novel hybrid approach for solving the multiple traveling salesmen problem

open access: yesArab Journal of Basic and Applied Sciences, 2019
The multiple Travelling Salesmen Problem (mTSP) is one of the most popular and important operational research problems. It is a problem where n salesmen have to visit m cities such that each salesman has to visit at least one city and all the cities ...
Youssef Harrath   +4 more
doaj   +1 more source

A formulation and a metaheuristic approach for the clustered vehicle routing problem with d‐relaxed priority rule

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract This paper investigates an extension of the vehicle routing problem in which, in addition to minimizing the distance traveled, the sequencing of customer visits is subject to precedence constraints that impose visiting priorities among customers.
Eduardo dos Santos Teixeira   +1 more
wiley   +1 more source

Parallel ACO with a Ring Neighborhood for Dynamic TSP

open access: yes, 2012
The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem. In the dynamic traveling salesman problem the distances between cities as travel times are no longer fixed.
A.Sameh   +9 more
core   +1 more source

Evaluation of drone system for thinning operations–a case study in Sweden

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract Thinning operations in forestry typically involve a two‐machine system (TMS) with a harvester and a forwarder. Its productivity in different forest conditions is well documented. To date, drones have been used for data collection and surveillance but not as an alternative to a TMS.
Mikael Rönnqvist   +3 more
wiley   +1 more source

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

open access: yesInternational 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

Ensuring connectedness for the maximum quasi‐clique and densest k‐subgraph problems

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract Given an undirected graph G$G$, a quasi‐clique is a subgraph of G$G$ with density at least γ$\gamma$ (0<γ≤1)$(0 < \gamma \le 1)$. Two optimisation problems can be defined for quasi‐cliques: the maximum quasi‐clique (MQC) problem, which finds a quasi‐clique with maximum vertex cardinality, and the densest k$k$‐subgraph (DKS) problem, which ...
Daniela Scherer dos Santos   +3 more
wiley   +1 more source

Keep on Keepin’ on Down Under: Administrative Heritage and the Strategic Realignment of Multinational Enterprises in Australia During Deglobalization, 1914–79

open access: yesJournal 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

Production routing decisions in a two‐echelon supply chain with multiple delivery modes

open access: yesInternational Transactions in Operational Research, Volume 33, Issue 5, Page 3385-3421, September 2026.
Abstract We study an original two‐echelon production routing problem with multiple delivery modes (2E‐PRP‐MDM). In the first echelon, the primary production facility is tasked with satisfying the demands of two distinct entities: a set of warehouses and a set of customers through direct shipments. In the second echelon, warehouses become delivery hubs,
Rachida Benfedel   +2 more
wiley   +1 more source

The ant colony metaphor for multiple knapsack problem

open access: yesJournal 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  

Home - About - Disclaimer - Privacy