Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex p-centre problems

Chandra Irawan, Said Salhi, Zvi Drezner

Research output: Contribution to journalArticlepeer-review

109 Downloads (Pure)

Abstract

Large-scale unconditional and conditional vertex p-centre problems are solved using two meta-heuristics. One is based on a three-stage approach whereas the other relies on a guided multi-start principle. Both methods incorporate Variable Neighbourhood Search, exact method, and aggregation techniques. The methods are assessed on the TSP dataset which consist of up to 71,009 demand points with p varying from 5 to 100. To the best of our knowledge, these are the largest instances solved for unconditional and conditional vertex p-centre problems. The two proposed meta-heuristics yield competitive results for both classes of problems.
Original languageEnglish
JournalJournal of Heuristics
Early online date6 Jan 2015
DOIs
Publication statusPublished - 2015

Keywords

  • Large unconditional and conditional vertex p-centre problems
  • aggregation
  • variable neighbourhood search
  • exact method
  • WNU

Fingerprint

Dive into the research topics of 'Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex p-centre problems'. Together they form a unique fingerprint.

Cite this