{"corpus_id":115133472,"paper_sha":"de4153b0f42fd99980176bc601fb114fb42ec1e8","doi":"10.1155/2017/8306732","arxiv_id":null,"pmid":null,"pmcid":null,"mag_id":2625381362,"dblp_id":null,"acl_id":null,"title":"Application of Heuristic and Metaheuristic Algorithms in Solving Constrained Weber Problem with Feasible Region Bounded by Arcs","year":2017,"publication_date":null,"venue":"","journal":{"name":"Mathematical Problems in Engineering","pages":null,"volume":"2017"},"journal_issn":null,"journal_title":null,"publication_types":[],"pubmed_pub_types":null,"s2_fields_of_study":["Mathematics","Computer Science","Engineering"],"reference_count":64,"citation_count":28,"influential_citation_count":1,"is_open_access":true,"arxiv_categories":null,"arxiv_license":null,"arxiv_journal_ref":null,"mesh_headings":null,"chemicals":null,"comments_corrections":null,"source_flags":1,"s2_open_access_pdf_url":"http://downloads.hindawi.com/journals/mpe/2017/8306732.pdf","s2_open_access_landing_url":"https://www.semanticscholar.org/paper/de4153b0f42fd99980176bc601fb114fb42ec1e8","s2_open_access_license":"CCBY","s2_open_access_status":"GOLD","pmc_open_access_pdf_url":null,"pmc_open_access_landing_url":null,"pmc_open_access_license":null,"pmc_open_access_status":null,"unpaywall_open_access_pdf_url":null,"unpaywall_open_access_landing_url":null,"unpaywall_open_access_license":null,"unpaywall_open_access_status":null,"abstract":"The continuous planar facility location problem with the connected region of feasible solutions bounded by arcs is a particular case of the constrained Weber problem. This problem is a continuous optimization problem which has a nonconvex feasible set of constraints. This paper suggests appropriate modifications of four metaheuristic algorithms which are defined with the aim of solving this type of nonconvex optimization problems. Also, a comparison of these algorithms to each other as well as to the heuristic algorithm is presented. The artificial bee colony algorithm, firefly algorithm, and their recently proposed improved versions for constrained optimization are appropriately modified and applied to the case study. The heuristic algorithm based on modified Weiszfeld procedure is also implemented for the purpose of comparison with the metaheuristic approaches. Obtained numerical results show that metaheuristic algorithms can be successfully applied to solve the instances of this problem of up to 500 constraints. Among these four algorithms, the improved version of artificial bee algorithm is the most efficient with respect to the quality of the solution, robustness, and the computational efficiency.","claims":[{"public_id":"cl_3df86db9f16f2c411b1e0d173376128c","status":"active","text":"Four metaheuristic algorithms (artificial bee colony, firefly, and their improved versions) were modified to solve this problem and compared to a heuristic algorithm based on the modified Weiszfeld procedure.","confidence":0.95,"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":391,"public_id":"x53qfq3ny9","public_label":"kafkapple (x53qfq3ny9)","roles":["review"],"url":"https://sah.borca.ai/u/x53qfq3ny9"}],"url":"https://sah.borca.ai/claims/cl_3df86db9f16f2c411b1e0d173376128c"},{"public_id":"cl_3becaa7b1b895651f64e009fc67c0b4f","status":"active","text":"Metaheuristic algorithms can successfully solve instances of this problem with up to 500 constraints.","confidence":0.9,"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":391,"public_id":"x53qfq3ny9","public_label":"kafkapple (x53qfq3ny9)","roles":["review"],"url":"https://sah.borca.ai/u/x53qfq3ny9"}],"url":"https://sah.borca.ai/claims/cl_3becaa7b1b895651f64e009fc67c0b4f"},{"public_id":"cl_6a919b1fa27395c56b79c947a908d452","status":"active","text":"The constrained Weber problem with a feasible region bounded by arcs is a continuous nonconvex optimization problem.","confidence":0.95,"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":391,"public_id":"x53qfq3ny9","public_label":"kafkapple (x53qfq3ny9)","roles":["review"],"url":"https://sah.borca.ai/u/x53qfq3ny9"}],"url":"https://sah.borca.ai/claims/cl_6a919b1fa27395c56b79c947a908d452"},{"public_id":"cl_c6daa423b414129618c857803fae50ea","status":"active","text":"The improved version of the artificial bee algorithm is the most efficient among the four metaheuristic algorithms in terms of solution quality, robustness, and computational efficiency.","confidence":0.9,"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":391,"public_id":"x53qfq3ny9","public_label":"kafkapple (x53qfq3ny9)","roles":["review"],"url":"https://sah.borca.ai/u/x53qfq3ny9"}],"url":"https://sah.borca.ai/claims/cl_c6daa423b414129618c857803fae50ea"}],"concepts":[{"public_id":"co_31b0b1530a624f856c68262af60f8034","status":"active","name":"solution quality","description":"The quality of the solution obtained by an algorithm, used as a metric for comparison.","types":["metric"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":391,"public_id":"x53qfq3ny9","public_label":"kafkapple (x53qfq3ny9)","roles":["review"],"url":"https://sah.borca.ai/u/x53qfq3ny9"}],"url":"https://sah.borca.ai/concepts/co_31b0b1530a624f856c68262af60f8034"},{"public_id":"co_42fb88a0c36ca2f223d530bda8440e6d","status":"active","name":"improved artificial bee colony algorithm","description":"A recently proposed improved version of the artificial bee colony algorithm for constrained optimization.","types":["method"],"aliases":["improved ABC algorithm"],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":391,"public_id":"x53qfq3ny9","public_label":"kafkapple (x53qfq3ny9)","roles":["review"],"url":"https://sah.borca.ai/u/x53qfq3ny9"}],"url":"https://sah.borca.ai/concepts/co_42fb88a0c36ca2f223d530bda8440e6d"},{"public_id":"co_47231ebf86601632973a6a95e1e17cc1","status":"active","name":"metaheuristic algorithms","description":"General high-level algorithmic frameworks for solving optimization problems, here applied to the constrained Weber problem.","types":["method class"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":391,"public_id":"x53qfq3ny9","public_label":"kafkapple (x53qfq3ny9)","roles":["review"],"url":"https://sah.borca.ai/u/x53qfq3ny9"}],"url":"https://sah.borca.ai/concepts/co_47231ebf86601632973a6a95e1e17cc1"},{"public_id":"co_66d9a0f72f3bd47dde1ac1f657daf10e","status":"active","name":"improved firefly algorithm","description":"A recently proposed improved version of the firefly algorithm for constrained optimization.","types":["method"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":391,"public_id":"x53qfq3ny9","public_label":"kafkapple (x53qfq3ny9)","roles":["review"],"url":"https://sah.borca.ai/u/x53qfq3ny9"}],"url":"https://sah.borca.ai/concepts/co_66d9a0f72f3bd47dde1ac1f657daf10e"},{"public_id":"co_8c722f40ce1d929562e94c14a590fc9c","status":"active","name":"nonconvex optimization problem","description":"An optimization problem whose feasible set is nonconvex, as in the constrained Weber problem with arcs.","types":["problem type"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":391,"public_id":"x53qfq3ny9","public_label":"kafkapple (x53qfq3ny9)","roles":["review"],"url":"https://sah.borca.ai/u/x53qfq3ny9"}],"url":"https://sah.borca.ai/concepts/co_8c722f40ce1d929562e94c14a590fc9c"},{"public_id":"co_8cec2d72523985796f04820b0bbafb84","status":"active","name":"heuristic algorithm based on modified Weiszfeld procedure","description":"A heuristic algorithm used for comparison, based on a modified version of the Weiszfeld procedure.","types":["method"],"aliases":["modified Weiszfeld procedure"],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":391,"public_id":"x53qfq3ny9","public_label":"kafkapple (x53qfq3ny9)","roles":["review"],"url":"https://sah.borca.ai/u/x53qfq3ny9"}],"url":"https://sah.borca.ai/concepts/co_8cec2d72523985796f04820b0bbafb84"},{"public_id":"co_c34c3d5423955f8178c498d46c583b8b","status":"active","name":"constrained Weber problem","description":"A continuous planar facility location problem with a connected feasible region bounded by arcs.","types":["problem"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":391,"public_id":"x53qfq3ny9","public_label":"kafkapple (x53qfq3ny9)","roles":["review"],"url":"https://sah.borca.ai/u/x53qfq3ny9"}],"url":"https://sah.borca.ai/concepts/co_c34c3d5423955f8178c498d46c583b8b"},{"public_id":"co_c38432d75a0d6af87fc063447b95506d","status":"active","name":"feasible region bounded by arcs","description":"The set of feasible solutions in the constrained Weber problem, which is connected and bounded by arcs.","types":["constraint"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":391,"public_id":"x53qfq3ny9","public_label":"kafkapple (x53qfq3ny9)","roles":["review"],"url":"https://sah.borca.ai/u/x53qfq3ny9"}],"url":"https://sah.borca.ai/concepts/co_c38432d75a0d6af87fc063447b95506d"},{"public_id":"co_c5175fa8ef98f3f256d40b1d195dd291","status":"active","name":"firefly algorithm","description":"A metaheuristic algorithm inspired by the flashing behavior of fireflies, modified for constrained optimization.","types":["method"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":391,"public_id":"x53qfq3ny9","public_label":"kafkapple (x53qfq3ny9)","roles":["review"],"url":"https://sah.borca.ai/u/x53qfq3ny9"}],"url":"https://sah.borca.ai/concepts/co_c5175fa8ef98f3f256d40b1d195dd291"},{"public_id":"co_e2773df25fd44fdab0cf78d76ea1b6d7","status":"active","name":"computational efficiency","description":"The speed or resource usage of an algorithm, used as a metric for comparison.","types":["metric"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":391,"public_id":"x53qfq3ny9","public_label":"kafkapple (x53qfq3ny9)","roles":["review"],"url":"https://sah.borca.ai/u/x53qfq3ny9"}],"url":"https://sah.borca.ai/concepts/co_e2773df25fd44fdab0cf78d76ea1b6d7"},{"public_id":"co_f94807b07798b6d7abe517cc2047dd70","status":"active","name":"artificial bee colony algorithm","description":"A metaheuristic algorithm inspired by the foraging behavior of honey bees, modified for constrained optimization.","types":["method"],"aliases":["ABC algorithm"],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":391,"public_id":"x53qfq3ny9","public_label":"kafkapple (x53qfq3ny9)","roles":["review"],"url":"https://sah.borca.ai/u/x53qfq3ny9"}],"url":"https://sah.borca.ai/concepts/co_f94807b07798b6d7abe517cc2047dd70"},{"public_id":"co_fee27bb8df1296348a6053000968098c","status":"active","name":"robustness","description":"The stability or reliability of an algorithm's performance across different problem instances.","types":["metric"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":391,"public_id":"x53qfq3ny9","public_label":"kafkapple (x53qfq3ny9)","roles":["review"],"url":"https://sah.borca.ai/u/x53qfq3ny9"}],"url":"https://sah.borca.ai/concepts/co_fee27bb8df1296348a6053000968098c"}],"external_ids":{"DOI":"10.1155/2017/8306732","ArXiv":null,"PubMed":null,"PubMedCentral":null,"MAG":2625381362,"DBLP":null,"ACL":null},"open_access":{"is_open_access":true,"pdf_url":"http://downloads.hindawi.com/journals/mpe/2017/8306732.pdf","landing_url":"https://www.semanticscholar.org/paper/de4153b0f42fd99980176bc601fb114fb42ec1e8","source":"semantic_scholar","pdf_url_source":"semantic_scholar_open_access_pdf","license":"CCBY","status":"GOLD","reason":null},"reference_availability":{"status":"available","references_indexed":true,"full_text_available":false,"full_text_source":null,"count_basis":"semantic_scholar_metadata","extraction_status":"not_applicable","reason":null},"source":{"provider":"episteme2","base_corpus":"semantic_scholar_dump","freshness_mode":"unknown","basis":["semantic_scholar_metadata","postgres_metadata"],"limits":["paper metadata is based on indexed upstream scholarly datasets","claims and concepts are available only for extracted papers","absence of claims or concepts means no extracted graph data is available in this response"],"status":"available","degraded":false,"degraded_reasons":[],"diagnostics":{"status":"available","degraded":false,"degraded_reasons":[],"metadata_status":"available","graph_status":"available","abstract_status":"available"},"source_flags":1},"paper_id":636925,"paper_uid":"d79658d5-4144-443b-8c10-3e627b991346","canonical_identity":{"paper_id":636925,"paper_uid":"d79658d5-4144-443b-8c10-3e627b991346","identity_status":"available","lookup_basis":"semantic_scholar_external_id","compatibility_path":"corpus_id"},"url":"https://sah.borca.ai/papers/115133472"}