Sciweavers

203 search results - page 16 / 41
» Biogeography Migration Algorithm for Traveling Salesman Prob...
Sort
View
ICEC
1996
123views more  ICEC 1996»
13 years 9 months ago
Solving Symmetric and Asymmetric TSPs by Ant Colonies
- In this paper we present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We a...
Luca Maria Gambardella, Marco Dorigo
ANOR
2008
171views more  ANOR 2008»
13 years 7 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
ESA
1998
Springer
145views Algorithms» more  ESA 1998»
13 years 12 months ago
Moving-Target TSP and Related Problems
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
Christopher S. Helvig, Gabriel Robins, Alexander Z...
COR
2008
160views more  COR 2008»
13 years 6 months ago
Formulations and exact algorithms for the vehicle routing problem with time windows
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for...
Brian Kallehauge
HPCC
2005
Springer
14 years 1 months ago
Parallel Branch and Bound Algorithms on Internet Connected Workstations
By the use of the GRIBB software for distributed computing across the Internet, we are investigating the obstacles and the potential for efficient parallelization of Branch and Bou...
Randi Moe, Tor Sørevik