Juan C. Salazar-Acosta’s scientific contributions

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (2)


Table 2 . Evaluation of adaptive memory on DU05 instances.
Table 4 . Evaluation of strategic oscillation on DU10 instances.
Table 5 . Evaluation of strategic oscillation on DU05 instances.
A GRASP with Strategic Oscillation for a Commercial Territory Design Problem with a Routing Budget Constraint
  • Conference Paper
  • Full-text available

November 2011

·

91 Reads

·

25 Citations

Lecture Notes in Computer Science

Roger Z. Ríos-Mercado

·

Juan C. Salazar-Acosta

This paper addresses a commercial districting problem arising in the bottled beverage distribution industry. The problem consists of grouping a set of city blocks into territories so as to maximize territory compactness. As planning requirements, the grouping seeks to balance both number of customers and product demand across territories, maintain connectivity of territories, and limit the total cost of routing. A combinatorial optimization model for this problem is introduced. Work on commercial territory design has particularly focused on design decisions. This work is, to the best of our knowledge, the first to address both design and routing decisions simultaneously by considering a budget constraint on the total routing cost in commercial territory design. A greedy randomized adaptive search procedure that incorporates advanced features such as adaptive memory and strategic oscillation is developed. Empirical evidence over a wide set of randomly generated instances based on real-world data show a very positive impact of these advanced components. Solution quality is significantly improved as well.

Download

Territory Design with Network Distances: A heuristic Approach

14 Reads

The objective of a beverage distribution company is to build compact territories from a series of geographical units (city blocks) sub-ject to multiple node activity balancing requirements, and contiguity constraints. Existing approaches are based on a Euclidean distance me-tric. In this work we introduce a dispersion measure based on network distances. This is a more realistic approach, but more difficult to handle due to contiguity constraints. A GRASP (Greedy Randomized Adapta-tive Search Procedure) algorithm is presented as a solution method. Our empirical work considers the evaluation of the algorithm performance. We experiment on instances randomly extracted from real-world com-pany data.

Citations (1)


... Ríos-Mercado and Salazar-Acosta [65] study a commercial districting problem arising in the bottled beverage distribution industry and introduce a combinatorial optimization model for it. The problem comprises grouping a set of city blocks into territories to maximize territory compactness. ...

Reference:

A novel districting design approach for on-time last-mile delivery: An application on an express postal company
A GRASP with Strategic Oscillation for a Commercial Territory Design Problem with a Routing Budget Constraint

Lecture Notes in Computer Science