6 search results - page 1 / 2 » Accelerating convergence in the Fermat-Weber location proble... |
ORL
1998
13 years 6 months ago
1998
This paper presents a simple procedure for accelerating convergence in a generalized Fermat–Weber problem with lp distances. The main idea is to multiply the predetermined step ...
ORL
1998
13 years 6 months ago
1998
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
CEC
2010
IEEE
13 years 4 months ago
2010
IEEE
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
GECCO
2006
Springer
13 years 10 months ago
2006
Springer
We present a modified version of Differential Evolution (DE) for locating the global minimum at a higher convergence velocity. The proposed model differs from conventional DE by a...
ICCV
2005
IEEE
14 years 5 days ago
2005
IEEE
We address the problem of seeking the global mode of a density function using the mean shift algorithm. Mean shift, like other gradient ascent optimisation methods, is susceptible...