A Matheuristic Approach Combining Local Search and Mathematical Programming

5Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A novel matheuristic approach is presented and tested on a well-known optimisation problem, namely, capacitated facility location problem (CFLP). The algorithm combines local search and mathematical programming. While the local search algorithm is used to select a subset of promising facilities, mathematical programming strategies are used to solve the subproblem to optimality. Proposed local search is influenced by instance-specific information such as installation cost and the distance between customers and facilities. The algorithm is tested on large instances of the CFLP, where neither local search nor mathematical programming is able to find good quality solutions within acceptable computational times. Our approach is shown to be a very competitive alternative to solve large-scale instances for the CFLP.

Cite

CITATION STYLE

APA

Lagos, C., Guerrero, G., Cabrera, E., Niklander, S., Johnson, F., Paredes, F., & Vega, J. (2016). A Matheuristic Approach Combining Local Search and Mathematical Programming. Scientific Programming, 2016. https://doi.org/10.1155/2016/1506084

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free