Abstract: The Traveling Salesman Problem (TSP) is a classic discrete optimization problem that finds widespread application in logistics, route planning, and other fields. Although traditional ...
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) ...