scholarly journals L1 rotation averaging using the Weiszfeld algorithm

CVPR 2011 ◽  
2011 ◽  
Author(s):  
Richard Hartley ◽  
Khurrum Aftab ◽  
Jochen Trumpf
Keyword(s):  
Weiszfeld Algorithm

An improved particle swarm optimization algorithm in selection of e-commerce distribution center

2020 ◽  
Vol 39 (6) ◽  
pp. 8783-8793
Author(s):  
Chang Yong ◽  
Yun Lu
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Reference Value ◽  
Distribution Center ◽  
Swarm Optimization ◽  
Weiszfeld Algorithm ◽  
Public Health Emergencies

Under the influence of COVID-19, the efficiency of e-commerce distribution in public health emergencies has become the key to ensuring people’s normal lives. With the development of e-commerce, the location of distribution center is becoming more and more important, which is related to the healthy and long-term development of e-commerce. However, the traditional location efficiency is low, which cannot play an immediate role in the development of e-commerce. This paper combines weiszfeld algorithm, improves particle swarm optimization algorithm, improves the operation efficiency and location accuracy, and finally gets a relatively satisfactory result. Results data analysis shows that the improvement and integration of the algorithm is reasonable and effective. This method has important reference value for e-commerce location.

A projected Weiszfeld algorithm for the box-constrained Weber location problem

2011 ◽  
Vol 218 (6) ◽  
pp. 2932-2943 ◽  
Author(s):  
Elvio A. Pilotta ◽  
Germán A. Torres
Keyword(s):  
Location Problem ◽  
Weiszfeld Algorithm

scholarly journals Further notes on convergence of the Weiszfeld algorithm

2003 ◽  
Vol 13 (2) ◽  
pp. 199-206 ◽  
Author(s):  
Jack Brimberg
Keyword(s):  
Iterative Procedure ◽  
Convergence Property ◽  
Location Theory ◽  
Weber Problem ◽  
Weiszfeld Algorithm

The Fermat-Weber problem is one of the most widely studied problems in classical location theory. In his previous work, Brimberg (1995) attempts to resolve a conjecture posed by Chandrasekaran and Tamir (1989) on a convergence property of the Weiszfeld algorithm, a well-known iterative procedure used to solve this problem. More recently, Canovas, Marin and Canavate (2002) provide counterexamples that appear to reopen the question. However, they do not attempt to reconcile their counterexamples with the previous work. We now show that in the light of these counterexamples, the proof is readily modified and the conjecture of Chandrasekaran and Tamir reclosed. .

A geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problem

2016 ◽  
Vol 50 (1) ◽  
pp. 157-173 ◽  
Author(s):  
Helder Manoel Venceslau ◽  
Marilis Bahr Karam Venceslau ◽  
Adilson Elias Xavier ◽  
Nelson Maculan
Keyword(s):  
Weber Problem ◽  
Weiszfeld Algorithm
Sign in / Sign up

Export Citation Format

Share Document