id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_l56qdmdo5ffbheakeupbix4od4	Roger Z. Ríos-Mercado	GRASP with path relinking for commercial districting	2016	31	.pdf	application/pdf	10600	1175	71	The problem of grouping basic units into larger geographic territories subject to dispersion, connectivity, and balance requirements is addressed. territory design problem, a greedy randomized adaptive search procedure (GRASP) that incorporates a novel construction procedure where territories are formed simultaneously in two main stages Salazar-Acosta and Ŕıos-Mercado [29] present a heuristic based on GRASP and adaptive memory programming for a CTDP that considers the minimization of a p-Center Problem function This section introduces the proposed GRASP heuristic with path relinking for the commercial territory design problem (GPR CTDP). Figure 3: Solution found after applying the local search procedure for an instance of the CTDP. iteration of the GRASP a solution is constructed and improved with local search, XS. This section describes results of experiments designed to evaluate the effect of the proposed construction and local search procedures. Figure 7: Solutions obtained by the construction, local search and static PR procedures for a	./cache/work_l56qdmdo5ffbheakeupbix4od4.pdf	./txt/work_l56qdmdo5ffbheakeupbix4od4.txt