Results 71 to 80 of about 166,209 (267)
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
The random link approximation for the Euclidean traveling salesman problem [PDF]
, 1997 The traveling salesman problem (TSP) consists of finding the length of the shortest closed tour visiting N ``cities''. We consider the Euclidean TSP where the cities are distributed randomly and independently in a d-dimensional unit hypercube.
Bohigas, O. +4 more
core +7 more sources
Random gravitational emulation search algorithm (RGES (in scheduling traveling salesman problem
International Journal of Industrial Engineering and Production Research, 2018 this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem.
Ahmad Sheibat Alhamdi +1 more
doaj +2 more sources
Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm [PDF]
Journal of Optimization in Industrial Engineering, 2014 The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution.
Hossein Larki, Majid Yousefikhoshbakht
doaj
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
Penentuan Rute Distribusi Teh Botol Menggunakan Metode Traveling Salesman Problem (Tsp) Untuk Minimasi Biaya Distribusi [PDF]
, 2014 PT. Sinar Sosro merupakan salah satu Perusahaan yang bergerak dalam produk minuman yang terletak di Jl. Cangkir KM 21 Driyorejo Gresik, ada pun macam-macam produknya seperti Teh Botol, Fruit Tea, Cuntry Choice, Tebs dll.
& Sumiati, Fahmi Fuadi Al Akbar
core
Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution
, 2006 We report a new statistical general property in traveling salesman problem, that the $n$th-nearest-neighbor distribution of optimal tours verifies with very high accuracy an exponential decay as a function of the order of neighbor $n$.
Brooke +21 more
core +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
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
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