cs.NENov 11, 2026

Matrix-Based Ant Colony Search with Batched Decoding for Hierarchical Replenishment Routing: A Stylized Case Study Based on Korean City Data

Authors: Jun Zhang, Wei-Jie Yu, Tong Qian, Eui Jeong Kwak, Sang-Woon Jeon, Hua Ding, Qijia Jiang, Hu Jin, 

Organizations: Hanyang University ERICA Campus · Nankai University · Zhejiang Normal University · Chaoyang University of Technology · 

Abstract

We study a stylized single-vehicle replenishment-routing problem in which the cities of a national logistics network are both demand points and supply points: a vehicle of limited capacity delivers to every city once, and when its load is insufficient for the next city it must detour to a city already served that can still supply goods. A 100-node benchmark is built from Korean population and geographic data, with the cities divided into 10 levels; the per-visit supply coefficient and the allowed number of stops decrease geometrically with the level. Building on matrix-based ant colony optimization, we keep the states of the whole colony in arrays, couple route construction with a fixed greedy replenishment-decoding policy, and evaluate the candidate moves of a local search in batches. With frozen parameters and 30 runs on seeds never used for tuning, the matrix-based ant colony search with the batch local search (MACO) reaches a mean total distance of 3081.7 km; a genetic algorithm equipped with the same local search at the same frequency reaches 3074.9 km (no significant difference), and a MAX-MIN ant system with the same local search 3142.2 km. Ablation identifies the batch local search as the main contributor to solution quality; a load-aware transition factor gives no significant gain. Within the parameter ranges tested, raising the supply coefficients of the cities below the top level shortens the route more than relaxing the stop limits, which are not binding here.

Figures & tables

Explore similar work

CardsList
  1. COMPASS: Ordered Clustered Routing at 100K Scale

    Sep 17, 2026Ido Greenberg, Hugo Linsenmaier, Piotr Sielski +4Traveling Salesperson ProblemCombinatorial Optimization

  2. Learning to Optimize: Joint Routing and Flow Allocation on Sparse Non-Euclidean Networks

    Jul 26, 2026Haomiao Sun, Fang He, Congyuan Ji +1Graph Attention NetworksLearning to Optimize

  3. Multi-Agent Route Planning as a QUBO Problem

    Feb 8, 2026Renáta Rusnáková, Martin Chovanec, Juraj GazdaMulti-Objective Optimization