Results 81 to 90 of about 72,557 (222)

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

Improved Cross Entropy Algorithm for the Optimum of Charge Planning Problem

Abstract and Applied Analysis, 2014
To solve the charge planning problem involving charges and the orders in each charge, a traveling salesman problem based charge planning model and the improved cross entropy algorithm are proposed. Firstly, the charge planning problem with unknown charge
Fan Yang, Qiqiang Li
doaj   +1 more source

THE DUBINS TRAVELING SALESMAN PROBLEM WITH CONSTRAINED COLLECTING MANEUVERS

Acta Polytechnica CTU Proceedings, 2016
In this paper, we introduce a variant of the Dubins traveling salesman problem (DTSP) that is called the Dubins traveling salesman problem with constrained collecting maneuvers (DTSP-CM).
Petr Váňa, Jan Faigl
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

On One Implementation of a Natural Approach to Solving the Traveling Salesman Problem

Кібернетика та комп'ютерні технології
Introduction. The relevance of the traveling salesman problem is associated with the need to develop computational schemes for use in situations that require the analysis of information of a sufficiently large volume.
Dmitri Terzi
doaj   +1 more source

Traveling Salesman Problem with Transportation [PDF]

Computer Science Journal of Moldova, 2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined – a synthesis of classical TSP and classical Transportation Problem.
Valeriu Ungureanu
doaj  

Didactic Visualization of Routing Problems

Education Sciences, 2020
The Traveling Salesman and Vehicle Routing Problems are integral parts of bachelor and master programs related to Operations Research/Management Science. This is due to their relevance in both practical applications and research.
Margaretha Gansterer, Veronika Klug
doaj   +1 more source

An empirical investigation into randomly generated Euclidean symmetric traveling salesman problems [PDF]

The traveling salesman problem is one of the most well-solved hard combinatorial optimization problems. Any new algorithm or heuristic for the traveling salesman problem is empirically evaluated based on its performance on standard test instances, as ...
Ghosh, Diptesh, Sharma, Megha
core  

Heuristic methods using grasp, path relinking and variable neighborhood search for the clustered traveling salesman problem

Revista Produção Online, 2013
The Clustered Traveling Salesman Problem (CTSP) is a generalization of the Traveling Salesman Problem (TSP) in which the set of vertices is partitioned into disjoint clusters and objective is to find a minimum cost Hamiltonian cycle such that the ...
Mário Mestria
doaj   +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