Results 51 to 60 of about 21,266 (220)
A Niching Memetic Algorithm for Multi-Solution Traveling Salesman Problem
IEEE Transactions on Evolutionary Computation, 2020 Multi-solution problems extensively exist in practice. Particularly, the traveling salesman problem (TSP) may possess multiple shortest tours, from which travelers can choose one according to their specific requirements.
Ting Huang +4 more
semanticscholar +1 more source
N-body Approach to the Traveling Salesman Problem (TSP)
, 2019 19 pages, 19 figures, 2 ...
Seay, Johnny +4 more
openaire +2 more sources
Revisiting Traveling Salesman Problem (TSP): Analysis of GA and SA based Solutions
International Journal of Recent Contributions from Engineering, Science & IT (iJES), 2021 The purpose of this study to analyze genetic algorithm (GA) and simulated an-nealing (SA) based approaches applied to well-known Traveling Salesman Prob-lem (TSP). As a NP-Hard problem, the goal of TSP is to find the shortest route possible to travel all the cities, given a set of cities and distances between cities.
Darius Bethel, Hakki Erhan Sevil
openaire +2 more sources
A Graph Neural Network Assisted Monte Carlo Tree Search Approach to Traveling Salesman Problem
IEEE Access, 2020 We tackle the classical traveling salesman problem (TSP) by combining a graph neural network and Monte Carlo Tree Search. We adopt a greedy algorithm framework to derive a promising tour by adding the vertices successively.
Zhihao Xing, Shikui Tu
semanticscholar +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 +2 more
wiley +1 more source
Unconventional GVNS for Solving the Garbage Collection Problem with Time Windows
Technologies, 2019 GVNS, which stands for General Variable Neighborhood Search, is an established and commonly used metaheuristic for the expeditious solution of optimization problems that belong to the NP-hard class. This paper introduces an expansion of the standard GVNS
Christos Papalitsas, Theodore Andronikos
doaj +1 more source
Algorithms, 2023 With the increasing demand for online shopping and home delivery services, optimizing the routing of electric delivery vehicles in urban areas is crucial to reduce environmental pollution and improve operational efficiency.
Yusef Ahsini +6 more
doaj +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
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 +1 more
wiley +1 more source
New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP) [PDF]
Journal of Optimization in Industrial Engineering, 2010 Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution.
Ellips Masehian
doaj