Balancing the cardinality of clusters with a distance constraint: a fast algorithm

Calvete, Herminia I. (Universidad de Zaragoza) ; Galé, Carmen (Universidad de Zaragoza) ; Iranzo, José A. (Universidad de Zaragoza)

Resumen: Logistics companies partition the customers they serve into delivery zones as a tactical decision and manage the customers assigned to each zone as a cluster for the purpose of routing, workload allocation, etc. Frequently, this partition is made in accordance with customers’ geographical location, which can result in very unbalanced clusters in terms of the number of customers they include. In addition, in the day-to-day operations, not necessarily all customers need to be served every day so, even if the clusters originally created are balanced, daily needs may lead to unbalanced clusters. Given an a priori assignment of customers to clusters, improving the balance between clusters in advance of workload management is therefore a key issue. This paper addresses the problem of balancing clusters, when there is a distance constraint that prevents reassigning customers to clusters far away from their original pre-assignment. This problem is formulated as a lexicographic biobjective optimization model. The highest priority objective function minimizes the variance of the number of customers in the clusters. The second ranked objective function minimizes the total distance resulting from all reassignments. A fast and effective heuristic algorithm is developed, based on exploring customer reassignments, either by comparing clusters two by two or by extending the search to allow for sequential customer swaps among clusters. Both the quality of the solution and the computational time required encourage the use of this algorithm by logistics companies to balance clusters in real scenarios.

Idioma: Inglés

DOI: 10.1007/s10479-024-06017-1

Año: 2024

Publicado en: ANNALS OF OPERATIONS RESEARCH (2024), [22 pp.]
ISSN: 0254-5330

Financiación: info:eu-repo/grantAgreement/ES/DGA/E41-20R
Financiación: info:eu-repo/grantAgreement/ES/DGA/E41-23R
Financiación: info:eu-repo/grantAgreement/ES/MICINN/PID2019-104263RB-C43
Financiación: info:eu-repo/grantAgreement/ES/MICINN/PID2022-139543OB-C43

Tipo y forma: Artículo (Versión definitiva)

Área (Departamento): Área Estadís. Investig. Opera. (Dpto. Métodos Estadísticos)