A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms

DOI10.1007/s12597-016-0296-zzbMath1397.90406OpenAlexW2568832798MaRDI QIDQ1788861

Behrooz Alizadeh, Somayeh Bakhteh

Publication date: 9 October 2018

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-016-0296-z

zbMATH Keywords

facility locationfirefly algorithminverse optimization\(p\)-Median problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (10)

On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks ⋮ Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms ⋮ Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks ⋮ The reverse selective balance center location problem on trees ⋮ On some inverse 1-center location problems ⋮ The inverse 1-center problem on cycles with variable edge lengths ⋮ Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks ⋮ Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems ⋮ Optimal algorithms for selective variants of the classical and inverse median location problems on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Inverse 1-median problem on block graphs with variable vertex weights
• A linear time algorithm for inverse obnoxious center location problems on networks
• The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• New heuristic algorithms for solving the planar \(p\)-median problem
• The inverse 1-median problem on tree networks with variable real edge lengths
• Inverse \(p\)-median problems with variable edge lengths
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• Inverse median location problems with variable coordinates
• Inverse center location problem on a tree
• The \(p\)-median problem: a survey of metaheuristic approaches
• A genetic algorithm for the \(p\)-median problem with pos/neg weights
• Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
• Genetic algorithms for solving the discrete ordered median problem
• The inverse 1-maxian problem with edge length modification
• The inverse 1-median problem on a cycle
• The inverse Fermat-Weber problem
• Inverse 1-center location problems with edge length augmentation on trees
• A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem
• The complexity analysis of the inverse center location problem
• 2-balanced flows and the inverse 1-median problem in the Chebyshev space
• Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
• A modified variable neighborhood search for the discrete ordered median problem
• Inverse median problems
• Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Firefly Algorithms for Multimodal Optimization
• An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions

This page was built for publication: A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms