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

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 technique...

Full description

Saved in:
Bibliographic Details
Published in:Journal of heuristics 2016-08, Vol.22 (4), p.507-537
Main Authors: Irawan, Chandra Ade, Salhi, Said, Drezner, Zvi
Format: Article
Language:English
Subjects:
Algorithms
Artificial Intelligence
Calculus of Variations and Optimal Control
Optimization
Customers
Heuristic
Management Science
Mathematics
Mathematics and Statistics
Methods
Neighborhoods
Operations Research
Operations Research/Decision Theory
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1381-1231
1572-9397
DOI:10.1007/s10732-014-9277-7