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!
cited_by
cites cdi_FETCH-LOGICAL-p1417-16345a3757ceccc48a5db066f5f2cfc02299dc75a9a5f977386c256b1e18e8e73
container_end_page 537
container_issue 4
container_start_page 507
container_title Journal of heuristics
container_volume 22
creator Irawan, Chandra Ade
Salhi, Said
Drezner, Zvi
description 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.
doi_str_mv 10.1007/s10732-014-9277-7
format article
fullrecord <record><control><sourceid>proquest_sprin</sourceid><recordid>TN_cdi_proquest_journals_1890247108</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>4321887389</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1417-16345a3757ceccc48a5db066f5f2cfc02299dc75a9a5f977386c256b1e18e8e73</originalsourceid><addsrcrecordid>eNpNkLtOwzAUQC0EEqXwAWyWmA1-xLk2G0JAkSoYeKyR4zitqzQJtgtl4dtJKEOn-9C5Dx2Ezhm9ZJTCVWQUBCeUZURzAAIHaMIkcKKFhsMhF4oRxgU7RicxriilWkkxQT-z7zL4Cq9dMmTpNsHH5G3EXz4t8fvTCzZthd3W2DQiy66K19j0feOtSb5rcepwY8LC4U1ru7byY9M0f1P79acLyW1xT6xrU3C4D13ZuHU8RUe1aaI7-49T9HZ_93o7I_Pnh8fbmznpWcaAsFxk0giQYJ21NlNGViXN81rW3NaWcq51ZUEabWStAYTKLZd5yRxTTjkQU3Sx2zsc_ti4mIpVtwnDZ7FgSlOeAaNqoPiOin3w7cKFPYoWo-di57kYPBej5wLELxJ-cpo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1890247108</pqid></control><display><type>article</type><title>Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex p-centre problems</title><source>ABI/INFORM global</source><source>Springer Link</source><creator>Irawan, Chandra Ade ; Salhi, Said ; Drezner, Zvi</creator><creatorcontrib>Irawan, Chandra Ade ; Salhi, Said ; Drezner, Zvi</creatorcontrib><description>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.</description><identifier>ISSN: 1381-1231</identifier><identifier>EISSN: 1572-9397</identifier><identifier>DOI: 10.1007/s10732-014-9277-7</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>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</subject><ispartof>Journal of heuristics, 2016-08, Vol.22 (4), p.507-537</ispartof><rights>Springer Science+Business Media New York 2015</rights><rights>Journal of Heuristics is a copyright of Springer, 2016.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-p1417-16345a3757ceccc48a5db066f5f2cfc02299dc75a9a5f977386c256b1e18e8e73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/1890247108/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/1890247108?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,776,780,11667,27901,27902,36037,44339,74638</link.rule.ids></links><search><creatorcontrib>Irawan, Chandra Ade</creatorcontrib><creatorcontrib>Salhi, Said</creatorcontrib><creatorcontrib>Drezner, Zvi</creatorcontrib><title>Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex p-centre problems</title><title>Journal of heuristics</title><addtitle>J Heuristics</addtitle><description>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.</description><subject>Algorithms</subject><subject>Artificial Intelligence</subject><subject>Calculus of Variations and Optimal Control; Optimization</subject><subject>Customers</subject><subject>Heuristic</subject><subject>Management Science</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Methods</subject><subject>Neighborhoods</subject><subject>Operations Research</subject><subject>Operations Research/Decision Theory</subject><issn>1381-1231</issn><issn>1572-9397</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNpNkLtOwzAUQC0EEqXwAWyWmA1-xLk2G0JAkSoYeKyR4zitqzQJtgtl4dtJKEOn-9C5Dx2Ezhm9ZJTCVWQUBCeUZURzAAIHaMIkcKKFhsMhF4oRxgU7RicxriilWkkxQT-z7zL4Cq9dMmTpNsHH5G3EXz4t8fvTCzZthd3W2DQiy66K19j0feOtSb5rcepwY8LC4U1ru7byY9M0f1P79acLyW1xT6xrU3C4D13ZuHU8RUe1aaI7-49T9HZ_93o7I_Pnh8fbmznpWcaAsFxk0giQYJ21NlNGViXN81rW3NaWcq51ZUEabWStAYTKLZd5yRxTTjkQU3Sx2zsc_ti4mIpVtwnDZ7FgSlOeAaNqoPiOin3w7cKFPYoWo-di57kYPBej5wLELxJ-cpo</recordid><startdate>20160801</startdate><enddate>20160801</enddate><creator>Irawan, Chandra Ade</creator><creator>Salhi, Said</creator><creator>Drezner, Zvi</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PYYUZ</scope><scope>Q9U</scope></search><sort><creationdate>20160801</creationdate><title>Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex p-centre problems</title><author>Irawan, Chandra Ade ; Salhi, Said ; Drezner, Zvi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1417-16345a3757ceccc48a5db066f5f2cfc02299dc75a9a5f977386c256b1e18e8e73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Artificial Intelligence</topic><topic>Calculus of Variations and Optimal Control; Optimization</topic><topic>Customers</topic><topic>Heuristic</topic><topic>Management Science</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Methods</topic><topic>Neighborhoods</topic><topic>Operations Research</topic><topic>Operations Research/Decision Theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Irawan, Chandra Ade</creatorcontrib><creatorcontrib>Salhi, Said</creatorcontrib><creatorcontrib>Drezner, Zvi</creatorcontrib><collection>ProQuest Central (Corporate)</collection><collection>ABI商业信息数据库</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Database‎ (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>ProQuest Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM global</collection><collection>Computing Database</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>Journal of heuristics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Irawan, Chandra Ade</au><au>Salhi, Said</au><au>Drezner, Zvi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex p-centre problems</atitle><jtitle>Journal of heuristics</jtitle><stitle>J Heuristics</stitle><date>2016-08-01</date><risdate>2016</risdate><volume>22</volume><issue>4</issue><spage>507</spage><epage>537</epage><pages>507-537</pages><issn>1381-1231</issn><eissn>1572-9397</eissn><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.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10732-014-9277-7</doi><tpages>31</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1381-1231
ispartof Journal of heuristics, 2016-08, Vol.22 (4), p.507-537
issn 1381-1231
1572-9397
language eng
recordid cdi_proquest_journals_1890247108
source ABI/INFORM global; Springer Link
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
title Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex p-centre problems
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T12%3A43%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Hybrid%20meta-heuristics%20with%20VNS%20and%20exact%20methods:%20application%20to%20large%20unconditional%20and%20conditional%20vertex%20p-centre%20problems&rft.jtitle=Journal%20of%20heuristics&rft.au=Irawan,%20Chandra%20Ade&rft.date=2016-08-01&rft.volume=22&rft.issue=4&rft.spage=507&rft.epage=537&rft.pages=507-537&rft.issn=1381-1231&rft.eissn=1572-9397&rft_id=info:doi/10.1007/s10732-014-9277-7&rft_dat=%3Cproquest_sprin%3E4321887389%3C/proquest_sprin%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-p1417-16345a3757ceccc48a5db066f5f2cfc02299dc75a9a5f977386c256b1e18e8e73%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1890247108&rft_id=info:pmid/&rfr_iscdi=true