A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements

@article{Gendron2003APH,
  title={A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements},
  author={Bernard Gendron and Jean-Yves Potvin and Patrick Soriano},
  journal={Parallel Computing},
  year={2003},
  volume={29},
  pages={591-606}
}
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 processes communicate through adaptive memories. Numerical results are reported on different types of randomly generated instances, using an increasing number of processors and different… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 22 references

An introduction to variable neighborhood search

  • P. Hansen, N. Mladenovi c
  • 1999
2 Excerpts

Tabu search with exact neighbor evaluation for multicommodity location with balancing requirements

  • J.-Y. Potvin B. Gendron, P. Soriano
  • 1999

Tabu search with exact neighbor evaluation for multicommodity location with balancing requirements, INFOR

  • B. Gendron, J.-Y. Potvin, P. Soriano
  • 1999
2 Excerpts

Similar Papers

Loading similar papers…