Results 71 to 80 of about 72,966 (206)
Evaluation of drone system for thinning operations–a case study in Sweden
International 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
Quantum heuristic algorithm for traveling salesman problem
, 2012 We propose a quantum heuristic algorithm to solve a traveling salesman problem by generalizing Grover search. Sufficient conditions are derived to greatly enhance the probability of finding the tours with extremal costs, reaching almost to unity and they
A. M. Childs +31 more
core +1 more source
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
Optimizing Movement Sequences for Step-and-Scan Lithography Equipment
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2013 The purpose of this work is to improve the throughput of step-and-scan lithography equipment to shorten the production time of a wafer. For this purpose, we propose a method for solving the MSOP (Movement Sequence Optimization Problem), which is the ...
Yuji SHINANO +3 more
doaj +1 more source
Ensuring connectedness for the maximum quasi‐clique and densest k‐subgraph problems
International 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
Traveling Salesman Problem [PDF]
, 2015 Práce se zaměřuje na úpravu známých postupů ACO a GA s ohledem na zvyšování efektivity nalézaných řešení. Jsou zde prezentovány dva nové přístupy pro řešení TSP. Pomocí jednoho z nich lze také vytvořit počáteční populaci pro GA. Je uveden konkrétní návrh
Šůstek, Martin
core
, 2017 For the Asymmetric Traveling Salesman Problem (ATSP), it is known that the Dantzig-Fulkerson-Johnson (DFJ) polytope is contained in the Miller-Tucker-Zemlin (MTZ) polytope. The analytic proofs of this fact are quite long.
Velednitsky, Mark
core +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
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