Variable neighborhood search method for optimizing the emergency service network of police special forces units

DOI10.1016/J.ENDM.2012.10.025MaRDI QIDQ2840772zbMATH OpenOpenAlexFDO

Authors Igor Grujičić, Zorica Stanimirović

Publication date 23 July 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2012.10.025

zbMATH Keywords

metaheuristicsvariable neighborhood searchemergency-servicespolice special forces unit

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network
• Variable neighborhood search: Principles and applications
• A variable neighbourhood search method for solving the long-term care facility location problem
• Variable Neighborhood Search
• A new model and tabu search approach for planning the emergency service stations

Cites work

• scientific article; zbMATH DE number 1803764 (Why is no real title available?)
• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• Location analysis: a synthesis and survey
• Variable neighborhood search
• Variable neighborhood search: Principles and applications

Cited in

(3)

• Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations
• Variable neighborhood search for the pharmacy duty scheduling problem
• An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Variable neighborhood search method for optimizing the emergency service network of police special forces units

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