Results 51 to 60 of about 863 (188)

On random symmetric travelling salesman problems [PDF]

The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2003
Let the edges of the complete graph Kn be assigned independent uniform [0, 1] random edge weights. Let ZTSP and Z2FAC be the weights of the minimum length travelling salesman tour and minimum weight 2-factor, respectively. We show that whp |ZTSP − Z2FAC| = o(1).
openaire   +1 more source

Understanding Visitor Path Choice and Enhancing Wayfinding in Museums: A Critical Review of a Century of Research

Curator: The Museum Journal, EarlyView.
ABSTRACT The paths taken by visitors in museums influence what they see, do, learn, and experience. Poorly designed museums can lead to missed goals and opportunities. In this article, I critically review visitor studies published since the 1930s to evaluate explanations for visitor path choice in museums, namely, the location and attractiveness of ...
Gareth Davey
wiley   +1 more source

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

International Transactions in Operational Research, EarlyView.
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

A matheuristic for the traveling salesman problem with positional consistency constraints

International 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 formulation and a metaheuristic approach for the clustered vehicle routing problem with d‐relaxed priority rule

International 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, Silvio Alexandre de Araujo   +1 more
wiley   +1 more source

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, Patrik Flisberg, Gert Andersson, Petrus Jönsson   +3 more
wiley   +1 more source

Can the Agent with Limited Information Solve Travelling Salesman Problem?

Complexity, 2017
Here, we develop new heuristic algorithm for solving TSP (Travelling Salesman Problem). In our proposed algorithm, the agent cannot estimate tour lengths but detect only a few neighbor sites. Under the circumstances, the agent occasionally ignores the NN
Tomoko Sakiyama, Ikuo Arizono
doaj   +1 more source

The Metric Travelling Salesman Problem: The Experiment on Pareto-optimal Algorithms

Труды Института системного программирования РАН, 2018
The Metric Travelling Salesman Problem is a subcase of the Travelling Salesman Problem (TSP), where the triangle inequality holds. It is a key problem in combinatorial optimization.
S. M. Avdoshin, E. N. Beresneva
doaj   +1 more source

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

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