Results 81 to 90 of about 30,647 (208)

ADAPTIVE SELECTION OF AUXILIARY OBJECTIVES IN MULTIOBJECTIVE EVOLUTIONARY ALGORITHMS [PDF]

Научно-технический вестник информационных технологий, механики и оптики, 2016
Subject of Research.We propose to modify the EA+RL method, which increases efficiency of evolutionary algorithms by means of auxiliary objectives.
I. A. Petrova, A. S. Buzdalova, A. A. Shalyto   +2 more
doaj   +1 more source

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

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, André Sammartino, Simon Ville, David Merrett, Monica Keneley   +4 more
wiley   +1 more source

Discrete Starfish Optimization Algorithm for Symmetric Travelling Salesman Problem

IEEE Access
This paper introduces a new discrete StarFish Optimization Algorithm (D-SFOA) to solve a complex discrete Symmetric Travelling Salesman Problem (STSP).
Muhammet Aktas, Fatih Kilic
doaj   +1 more source

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

International 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, Fayçal Belkaid, Nadjib Brahimi   +2 more
wiley   +1 more source

Three-dimensional Euclidian Distance to Neutrosophic Number for Travelling Salesman Problem [PDF]

Neutrosophic Sets and Systems
The main idea in this paper is to study the application of the novel greedy Dhouib Matrix-TSP1 (DM-TSP1) method to solve the Travel Salesman Problem with simple neutrosophic numbers. Here, the Euclidian distance is used to convert the neutrosophic number
Souhail Dhouib, Saima Dhouib, K. Saritha, R. Rajalakshmi, Mana Donganont, Prasanta Kumar Raut   +5 more
doaj   +1 more source

Quantifying Structural Complexity, Effort, and Performance: An Early Experiment Using Network Design Tasks

Systems Engineering, Volume 29, Issue 3, Page 387-405, May 2026.
ABSTRACT Structural Complexity is perceived as driving cost in system development, yet managing it effectively requires empirical understanding. This study investigates human decision‐making using a toy transportation‐style network design task, focusing on how Structural Complexity, Effort, and Performance interact. Seventy‐four participants (primarily
Alfonso Lanza, Joshua Sutherland, Marc‐Andre Chavy‐Macdonald, Olivier L. de Weck   +3 more
wiley   +1 more source

A new algorithm for the 2-period Balanced Traveling Salesman Problem in Euclidean graphs [PDF]

In a previous paper, we proposed two heuristic algorithms for the euclidean 2-period Balanced Travelling Salesman Problem (2B-TSP). In this problem, which arises from a similar one introduced by Butler et al., a certain number of customers must be ...
Francesco Mason, Tatiana Bassetto
core  

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

Optimizing Path of The Travelling Salesman Problem Through Modified Genetic Algorithms

NTU Journal of Pure Sciences
The Traveling Salesman Problem (TSP) stands as one of the earliest and most pervasive optimization challenges, aiming to streamline the salesman's travel route, ensuring efficiency and avoiding redundancy. With an extensive number of cities to visit and
Osama Hassani
doaj   +1 more source

Coordination of Pheromone Deposition Might Solve Time-Constrained Travelling Salesman Problem

Complexity, 2018
In this study, we develop two Ant Colony Optimization (ACO) models as new metaheuristic models for solving the time-constrained Travelling Salesman Problem (TSP).
Tomoko Sakiyama, Ikuo Arizono
doaj   +1 more source