Abstract: The Traveling Salesman Problem (TSP) is a challenging combinatorial optimization problem classified as NP-hard. This paper investigates the performance of various meta-heuristic algorithms, ...
This repository provides a solution to the standard Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). In a CVRPTW, we aim to optimize the routes of a fleet of vehicles serving customers ...
Abstract: This paper presents a novel neural network-based optimization framework, NNDE, to solve the traveling salesman problem (TSP). The core idea is to use a radial basis function network (RBFN) ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback