Results 51 to 60 of about 3,935 (225)

A comparison of heuristic and human performance on open versions of the traveling salesperson problem. [PDF]

, 2006
We compared the performance of three heuristics with that of subjects on variants of a well-known combinatorial optimization task, the Traveling Salesperson Problem (TSP). The present task consisted of finding the shortest path through an array of points
MacGregor, James N., Chronicle, Edward P., Edward P. Chronicle, Thomas C. Ormerod, James N. Macgregor, Ormerod, ThomasC., Ormerod, Thomas C.   +6 more
core   +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, Volume 33, Issue 6, Page 3714-3743, November 2026.
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

Hybrid discrete coati optimization algorithm for solving large-scale multiple traveling salesman problem

Ain Shams Engineering Journal
The Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem and is also categorized as NP-hard problem. The Multiple Traveling Salesmen Problem (MTSP) represents a variant of TSP, which is more complex and holds greater practical
Lun Zhu, Yongquan Zhou, Qifang Luo
doaj   +1 more source

Analisis Hibridisasi Pencarian Lokal Dengan Populasi Dalam Travelling Salesman Problem (TSP)

Jurnal Serambi Engineering, 2018
Traveling Salesman Problem (TSP) merupakan sebuah permasalah optimasi yang dapat diterapkan pada berbagai kegiatan seperti pendistribusian barang, pengambilan tagihan listirk dan pedagang keliling.
Erdiwansyah Erdiwansyah*, Yeni yanti, Munawir Munawir, Raihan Islamadina   +3 more
doaj   +1 more source

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

International Transactions in Operational Research, Volume 33, Issue 5, Page 3385-3421, September 2026.
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

Turning Energy-Aware Route Planning With an Extended TSP and Double-Layer State Graph: Experimental Evaluation With a Crawler Mobile Robot

IEEE Access
For mobile robots with multiple destinations that must be visited only once, the Traveling Salesman Problem (TSP) provides an optimal route. The optimality may not be achieved for crawler robots, which are often used in the forestry industry and have a ...
Namihei Adachi, Hisashi Date
doaj   +1 more source

Ordered Median Traveling Salesman Problem

Networks, Volume 88, Issue 1, Page 59-84, July 2026.
ABSTRACT This paper introduces a novel combinatorial optimization problem with ordering constraints, termed the Ordered Median Traveling Salesman Problem (OMTSP). The OMTSP integrates key elements from both the classic Traveling Salesman Problem (TSP) and the Ordered Median Location Problem.
Ivana Ljubić, Alfredo Marín, Justo Puerto, Francisco Temprano   +3 more
wiley   +1 more source

Implementasi Algoritma Cheapest Insertion Heuristic (CIH) dalam Penyelesaian Travelling Salesman Problem (TSP)

JOIN: Jurnal Online Informatika, 2018
Traveling salesman problem (TSP) is the problem of a salesman to visit the city of each city connected to each other and there is the weight of travel between the cities so as to form a complete weighted graph.
Rio Guntur Utomo, Dian Sa’adillah Maylawati, Cecep Nurul Alam   +2 more
doaj   +1 more source

A Memetic Algorithm Based on Breakout Local Search for the Generalized Traveling Salesman Problem

Applied Artificial Intelligence, 2020
The Traveling Salesman Problem (TSP) is one of the most popular Combinatorial Optimization Problem. It is well solicited for the large variety of applications that it can solve, but also for its difficulty to find optimal solutions.
Mehdi El Krari, Belaïd Ahiod, Bouazza El Benani   +2 more
doaj   +1 more source

Navigating Knowledge: Effects of State Curiosity on Children's Word Learning and Information Seeking

Developmental Science, Volume 29, Issue 4, July 2026.
ABSTRACT Early learning takes place within complex, multimodal environments where curiosity plays a critical role in guiding exploratory behaviors and supporting cognitive development. While trait curiosity shapes children's early learning experiences, state curiosity is context‐dependent fostering early learning, in‐part, through information seeking ...
Anna Caunt, Shaun Dordoy, Rana Abu‐Zhaya, Alastair Smith   +3 more
wiley   +1 more source