.png){kind=icon}
Return
An efficient probability-based VNS algorithm for delivery territory design
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2024.106756.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper deals with the Delivery Territory Design Problem (DTDP), a districting problem that often occurs in delivery operations. The goal of the problem is to construct clusters of nodes (territories) such that the maximum diameter of a territory is minimized, while the territories designed are balanced w.r.t. some performance measures. We propose to solve the DTDP using a Probabilistic Variable Neighborhood Search (ProbVNS) algorithm based on two local search procedures: a tailored randomized shake procedure that targets both a reduction of infeasibility and diversification, and a deterministic local search based on a linear combination of objective and constraint violation. In addition to searching in different neighborhoods, the ProbVNS also changes the search direction by exploring different penalties for violating constraints. Numerical experiments show that ProbVNS outperforms a recent GRASP with the Path-Relinking (PR) algorithm proposed in the literature in terms of feasibility and objective value. In the tested instances, ProbVNS obtained a lower infeasibility measure in 90% of the instances. For these instances, the average decrease in the objective value was 8.3%, with a maximum decrease of 51%. Finally, the running times of ProbVNS are, on average, 2.7 times lower than those of PR.
Keywords:
Territory design
Clustering
Variable neighborhood search (VNS)
Randomized algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveFabrication and characterization of silver core and porous silica shell nanocomposite particles
PREAI
ShareSaveShareSaveShareSaveShareSave
View more