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

DOI10.1007/S10479-024-06017-1MaRDI QIDQ6945268zbMATH OpenFDO

Authors Herminia I. Calvete, Carmen Galé, José A. Iranzo

Publication date 9 August 2025

Published in Annals of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10479-024-06017-1

zbMATH Keywords

heuristic algorithmdistance constraintbalancing clusters

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Cites work

• A concise guide to existing and emerging vehicle routing problem variants
• A lexicographic minimax approach to the vehicle routing problem with route balancing
• An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
• An evolutionary algorithm for the vehicle routing problem with route balancing
• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
• Designing delivery districts for the vehicle routing problem with stochastic demands
• Equity measurement in facility location analysis: A review and framework
• Faster balanced clusterings in high dimension
• Inequality measures and equitable approaches to location problems
• Inequity averse optimization in operational research
• Introduction to algorithms.
• Location science
• Multi-objective microzone-based vehicle routing for courier companies: from tactical to operational planning
• Multicriteria Optimization
• Police districting problem: literature review and annotated bibliography
• Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles
• Solving a vehicle routing problem by balancing the vehicles time utilization.
• The bi-objective mixed capacitated general routing problem with different route balance criteria
• The collaborative consistent vehicle routing problem with workload balance
• The discrete facility location problem with balanced allocation of customers
• Towards a stochastic programming modeling framework for districting
• Workload equity in vehicle routing: the impact of alternative workload resources

This page was built for publication: Balancing the cardinality of clusters with a distance constraint: a fast algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6945268)