REAL

Optimizing Collection Center Location on a Heatmap Using the Weiszfeld Algorithm for the Fermat-Weber Problem

Bányai, Tamás (2025) Optimizing Collection Center Location on a Heatmap Using the Weiszfeld Algorithm for the Fermat-Weber Problem. ADVANCED LOGISTIC SYSTEMS: THEORY AND PRACTICE, 19 (1). pp. 5-16. ISSN 1789-2198

[img]
Preview
Text
ALS19_No1_p5_16_BanyaiT.pdf - Published Version

Download (831kB) | Preview

Abstract

Facility location problems play an important role in logistics, particularly in the design of collection and distribution centers. This study presents a novel approach to determining the optimal location of a collection center based on existing collection tasks, represented by coordinates and associated quantities. The proposed method models the entire area using a heatmap, capturing the spatial distribution of goods to be collected. Based on this heatmap, the optimal location of the collection point is identified by solving the Fermat-Weber Problem (FWP) using the Weiszfeld Algorithm (WA), ensuring minimal materials handling costs. The study demonstrates how the heatmap representation enables a more flexible and dynamic facility location strategy compared to traditional point-based optimization approach. Numerical example shows that the locations derived from the heatmap closely approximate those computed directly from discrete collection points, making this approach suitable for collection tasks with dynamic and continuously changing demand patterns.

Item Type: Article
Uncontrolled Keywords: accelerate convergence, cost function, facility location, Fermat-Weber Problem, singularity issues, Weiszfeld algorithm
Subjects: T Technology / alkalmazott, műszaki tudományok > T2 Technology (General) / műszaki tudományok általában
SWORD Depositor: MTMT SWORD
Depositing User: MTMT SWORD
Date Deposited: 07 Nov 2025 09:35
Last Modified: 07 Nov 2025 09:35
URI: https://real.mtak.hu/id/eprint/228463

Actions (login required)

Edit Item Edit Item