𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A repeated matching heuristic for the single-source capacitated facility location problem

✍ Scribed by Mikael Rönnqvist; Suda Tragantalerngsak; John Holt

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
278 KB
Volume
116
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lagrangian heuristics for the two-echelo
Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
✍ Suda Tragantalerngsak; John Holt; Mikael Ro¨nnqvist 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 969 KB

Facility location problems form an important class of integer programming problems, with application in the distribution and transportation industries. In this paper we are concerned with a particular type of facility location problem in which there exist two echelons of facilities. Each facility in

An exact algorithm for the capacitated f
An exact algorithm for the capacitated facility location problems with single sourcing
✍ Kaj Holmberg; Mikael Rönnqvist; Di Yuan 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 168 KB

Facility location problems are often encountered in many areas such as distribution, transportation and telecommunication. We describe a new solution approach for the capacitated facility location problem in which each customer is served by a single facility. An important class of heuristic solution

A parallel hybrid heuristic for the mult
A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements
✍ Bernard Gendron; Jean-Yves Potvin; Patrick Soriano 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 156 KB

In this paper, a parallel hybrid heuristic is developed for the multicommodity capacitated location problem with balancing requirements. The hybrid involves variable neighborhood descent (VND) and slope scaling (SS). Both methods evolve in parallel within a master-slave architecture where the slave