Results 61 to 70 of about 72,557 (222)
An immune system based genetic algorithm using permutation-based dualism for dynamic traveling salesman problems [PDF]
, 2009 Copyright @ Springer-Verlag Berlin Heidelberg 2009.In recent years, optimization in dynamic environments has attracted a growing interest from the genetic algorithm community due to the importance and practicability in real world applications. This paper
C. Li +7 more
core +1 more source
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
OPTIMAL TOUR CONSTRUCTIONS FOR MULTIPLE MOBILE ROBOTS [PDF]
Journal of Engineering Science and Technology, 2011 The attempts to use mobile robots in a variety of environments are currently being limited by their navigational capability, thus a set of robots must be configured for one specific environment. The problem of navigating an environment is the fundamental
AMIR A. SHAFIE
doaj
Parallel DNA Algorithms of Generalized Traveling Salesman Problem-Based Bioinspired Computing Model
International Journal of Computational Intelligence Systems, 2020 Generalized traveling salesman problem (GTSP) is a classical combinatorial optimization problem, in which the optimization goal is the minimum route combination. Since the GTSP is a more complex problem than the traveling salesman problem (TSP), the GTSP
Xiaomin Ren +3 more
doaj +1 more source
Journal of Marine Science and Engineering, 2023 Sea transportation such as that by container ships has an essential role in the economy both locally and internationally. Ships are a major commodity in distributing goods over long distances due to their relatively low price compared to air shipping ...
Gunawan +4 more
doaj +1 more source
Convergent Duality for the Traveling Salesman Problem [PDF]
, 1989 A constructive method is presented for optimizing exactly the Traveling Salesman Problem as a sequence of shortest route problems. The method combines group theoretic and Lagrangean relaxation constructions.
Shapiro, Jeremy F., 1939-
core
The statistical mechanics of combinatorial optimization problems with site disorder [PDF]
, 2005 We study the statistical mechanics of a class of problems whose phase space is the set of permutations of an ensemble of quenched random positions. Specific examples analyzed are the finite temperature traveling salesman problem on several different ...
A. Barvinok +9 more
core +4 more sources
Box-counting by Hölder’s traveling salesman [PDF]
Archiv der Mathematik, 2019 11 ...
Zoltán M. Balogh, Roger Züst
openaire +3 more sources
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 +2 more
wiley +1 more source
Revista Produção Online, 2014 In this paper, we propose new heuristic methods for solver the Clustered Traveling Salesman Problem (CTSP). The CTSP is a generalization of the Traveling Salesman Problem (TSP) in which the set of vertices is partitioned into disjoint clusters and ...
Mário Mestria
doaj +1 more source