Sciweavers

332 search results - page 38 / 67
» Traveling salesman path problems
Sort
View
MP
2007
97views more  MP 2007»
13 years 7 months ago
On the domino-parity inequalities for the STSP
Abstract One method which has been used very successfully for finding optimal and provably good solutions for large instances of the Symmetric Travelling Salesman Problem (STSP) i...
Sylvia C. Boyd, Sally Cockburn, Danielle Vella
DMGT
2011
94views more  DMGT 2011»
12 years 11 months ago
Closed k-stop distance in graphs
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...
MP
2006
138views more  MP 2006»
13 years 7 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...

Book
7793views
15 years 6 months ago
Introduction to Neural Networks for C#
"Introduction to Neural Networks fpr C#, Second Edition, introduces the C# programmer to the world of Neural Networks and Artificial Intelligence. Neural network architectures...
Jeff Heaton
LION
2007
Springer
139views Optimization» more  LION 2007»
14 years 2 months ago
Evolution of Fitness Functions to Improve Heuristic Performance
In this paper we introduce the variable fitness function which can be used to control the search direction of any search based optimisation heuristic where more than one objective ...
Stephen Remde, Peter I. Cowling, Keshav P. Dahal, ...