A simulated annealing heuristic for the facility location problem

DOI10.1504/IJMMNO.2013.056532MaRDI QIDQ2446764zbMATH OpenOpenAlexFDO

Authors Fatemeh Mobasheri, Hasan Hosseini Nasab

Publication date 22 April 2014

Published in International Journal of Mathematical Modelling and Numerical Optimisation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijmmno.2013.056532

zbMATH Keywords

alternative processing routesduplicationfacility location problemFLPmathematical modellingnumerical optimisationsimulated annealing

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: A facility location problem (FLP) is considered by the possibility of duplications for each machine type in the presence of alternative processing routes for each product. The objective of this study is to minimise the total distance that is travelled by the products. According to the NP-hardness of the problem, a simulated annealing (SA) is proposed to solve the FLP. Considering two kinds of mutation operator in generating neighbourhood solution makes the SA as an efficient approach to solve large size FLP problems.

Recommendations

• Simulated annealing and genetic algorithms for the facility layout problem: A survey
• A new simulated annealing algorithm for the facility layout problem
• Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
• Two-level modified simulated annealing based approach for solving facility layout problem
• Simulated annealing heuristics for the dynamic facility layout problem

Cited in

(9)

• Simulated annealing and genetic algorithms for the facility layout problem: A survey
• Fast simulated annealing for single-row equidistant facility layout
• Location of facility based on simulated annealing and ``ZKW algorithms
• A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
• A simulated annealing heuristic for the open location-routing problem
• Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
• scientific article; zbMATH DE number 151871 (Why is no real title available?)
• Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
• SIMULATED ANNEALING SCHEME INCORPORATING MOVE DESIRABILITY TABLE FOR SOLUTION OF FACILITY LAYOUT PROBLEMS

This page was built for publication: A simulated annealing heuristic for the facility location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446764)