4.5 Article

The gradual minimum covering location problem

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Management

The minimal covering location and sizing problem in the presence of gradual cooperative coverage

Mumtaz Karatas et al.

Summary: This paper introduces a novel facility location problem, extending existing research by allowing different facility sizes and coverage radii to evaluate their impact on network performance. It solves the problem using three integer linear programming formulations, with a focus on comparing solution time and quality, finding that approximations outperform exact methods in terms of quality.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)

Article Engineering, Industrial

Multiple obnoxious facilities location: A cooperative model

Tammy Drezner et al.

IISE TRANSACTIONS (2020)

Article Operations Research & Management Science

Gradual cover competitive facility location

Tammy Drezner et al.

OR SPECTRUM (2020)

Article Management

The multiple gradual cover location problem

Oded Berman et al.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2019)

Article Management

The planar multiple obnoxious facilities location problem: A Voronoi based heuristic

Zvi Drezner et al.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2019)

Article Computer Science, Interdisciplinary Applications

Revisiting simulated annealing: A component-based analysis

Alberto Franzin et al.

COMPUTERS & OPERATIONS RESEARCH (2019)

Proceedings Paper Computer Science, Theory & Methods

A Hybrid Swarm Intelligence Approach for Anti-Covering Location Problem

Preeti Ravindranath Khorjuvenkar et al.

2019 INNOVATIONS IN POWER AND ADVANCED COMPUTING TECHNOLOGIES (I-PACT) (2019)

Article Computer Science, Interdisciplinary Applications

The Weber obnoxious facility location model: A Big Arc Small Arc approach

Tammy Drezner et al.

COMPUTERS & OPERATIONS RESEARCH (2018)

Article Computer Science, Interdisciplinary Applications

Demand point aggregation method for covering problems with gradual coverage

Hoon Jang et al.

COMPUTERS & OPERATIONS RESEARCH (2015)

Article Engineering, Multidisciplinary

A threshold accepting algorithm for the uncapacitated single allocation hub location problem

Ching-Jung Ting et al.

JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS (2014)

Review Computer Science, Interdisciplinary Applications

Generalized coverage: New developments in covering location models

Oded Berman et al.

COMPUTERS & OPERATIONS RESEARCH (2010)

Article Operations Research & Management Science

A Stochastic Gradual Cover Location Problem

Tammy Drezner et al.

NAVAL RESEARCH LOGISTICS (2010)

Article Computer Science, Interdisciplinary Applications

Location of a facility minimizing nuisance to or from a planar network

Tammy Drezner et al.

COMPUTERS & OPERATIONS RESEARCH (2009)

Article Computer Science, Interdisciplinary Applications

The minimum weighted covering location problem with distance constraints

Oded Berman et al.

COMPUTERS & OPERATIONS RESEARCH (2008)

Article Management

Managing solid waste through discrete location analysis: A case study in central Portugal

A. P. Antunes et al.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2008)

Article Economics

Gradual location set covering with service quality

H.A. Eiselt et al.

SOCIO-ECONOMIC PLANNING SCIENCES (2008)

Article Public, Environmental & Occupational Health

Health impact of the Buncefield oil depot fire, December 2005 - Study of accident and emergency case records

M. R. Hoek et al.

JOURNAL OF PUBLIC HEALTH (2007)

Article Computer Science, Interdisciplinary Applications

Undesirable facility location problems on multicriteria networks

Marcos Colebrook et al.

COMPUTERS & OPERATIONS RESEARCH (2007)

Article Management

Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm

CD Tarantilis et al.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2005)

Article Operations Research & Management Science

The gradual covering problem

Z Drezner et al.

NAVAL RESEARCH LOGISTICS (2004)

Article Computer Science, Interdisciplinary Applications

A novel threshold accepting meta-heuristic for the job-shop scheduling problem

DS Lee et al.

COMPUTERS & OPERATIONS RESEARCH (2004)

Article Management

A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem

CD Tarantilis et al.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2003)