A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem

DOI10.1007/978-3-540-70807-0_18MaRDI QIDQ3625026zbMATH OpenOpenAlexFDO

Authors Bryant A. Julstrom

Publication date 7 May 2009

Published in Recent Advances in Evolutionary Computation for Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70807-0_18

zbMATH Keywords

facility locationgreedy decoderheuristicspermutation codingplant locationwarehouse location

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Discrete location and assignment (90B80) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Single row facility layout problem using a permutation-based genetic algorithm
• Neighborhood search heuristics for the uncapacitated facility location problem
• scientific article; zbMATH DE number 2209653
• scientific article; zbMATH DE number 1560330
• A genetic algorithm for solving a capacitated \(p\)-median problem

Cited in

(1)

• An exact cooperative method for the uncapacitated facility location problem

Describes a project that uses

Uses Software

• PSPLIB
• TSPLIB
• CALMA
• LKH
• LINGO

This page was built for publication: A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem

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