Sciweavers

4313 search results - page 9 / 863
» Using time travel to diagnose computer problems
Sort
View
EVOW
2004
Springer
15 years 3 months ago
A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem
Abstract. The implementation of an evolutionary algorithm necessarily involves the selection of an appropriate set of genetic operators. For many real-world problem domains, an inc...
Wouter Boomsma
DISOPT
2006
110views more  DISOPT 2006»
14 years 9 months ago
New facets of the STS polytope generated from known facets of the ATS polytope
While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on a...
Egon Balas, Robert Carr, Matteo Fischetti, Neil Si...
EOR
2010
219views more  EOR 2010»
14 years 9 months ago
The Attractive Traveling Salesman Problem
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
Günes Erdogan, Jean-François Cordeau, ...
NCA
2008
IEEE
14 years 9 months ago
Neurodynamic programming: a case study of the traveling salesman problem
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...
SAC
2003
ACM
15 years 3 months ago
Manpower Scheduling with Time Windows
In this paper, we propose a manpower allocation model with time windows which is of practical interest to serviceman scheduling operations. Specifically, this problem originates f...
Andrew Lim, Brian Rodrigues, Lei Song