𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A heuristic for large-scale p-median instances

✍ Scribed by Pasquale Avella; Antonio Sassano; Igor Vasil'ev

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
92 KB
Volume
13
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A dynamic programming heuristic for the
A dynamic programming heuristic for the P-median problem
✍ Michelle Hribar; Mark S. Daskin πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 682 KB

A new heuristic algorithm is proposed for the P-median problem. The heuristic restricts the size of the state space of a dynamic programming algorithm. The approach may be viewed as an extension of the myopic or greedy adding algorithm for the P-median model. The approach allows planners to identify

Large-scale local search heuristics for
Large-scale local search heuristics for the capacitated vertex p-center problem
✍ Maria Paola Scaparra; Stefano Pallottino; Maria Grazia ScutellΓ  πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 296 KB

## Abstract This article investigates the application of very large neighborhood search techniques for solving the capacitated vertex __p__‐center problem. We characterize a local search neighborhood in terms of path and cyclic exchanges of customers among facilities, and exploit principles borrowe

A heuristic approach for large scale dis
A heuristic approach for large scale discrete stochastic transportation-location problems
✍ Larry J. LeBlanc πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 674 KB

An effective heuristic for determining plant locations and shipments to customers is described. It is assumed that there are a discrete number of possible locations and that the demand at each destination is a random variable. Thus the problem is to minimize expected holding and shortage costs, in a