4.5 Article

An evolutionary approach for obnoxious cooperative maximum covering location problem

Related references

Note: Only part of the references are listed.
Article Computer Science, Artificial Intelligence

Focus distance-aware lifetime maximization of video camera-based wireless sensor networks

Andre Rossi et al.

Summary: The study addresses the issue of maximizing the lifetime of a wireless sensor network using video cameras to monitor targets, introducing an efficient solution based on optical properties and a column generation algorithm.

JOURNAL OF HEURISTICS (2021)

Review Computer Science, Interdisciplinary Applications

A Survey of Learning-Based Intelligent Optimization Algorithms

Wei Li et al.

Summary: This paper comprehensively discusses learning-based intelligent optimization algorithms (LIOAs), including statistical analysis, classification of learning methods, applications in various scenarios, and engineering applications, as well as future insights and development directions.

ARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING (2021)

Article Computer Science, Artificial Intelligence

A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem

Kavita Singh et al.

SOFT COMPUTING (2020)

Article Computer Science, Artificial Intelligence

Two hybrid metaheuristic approaches for the covering salesman problem

Venkatesh Pandiri et al.

NEURAL COMPUTING & APPLICATIONS (2020)

Article Engineering, Industrial

Multiple obnoxious facilities location: A cooperative model

Tammy Drezner et al.

IISE TRANSACTIONS (2020)

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

A survey on new generation metaheuristic algorithms

Tansel Dokeroglu et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2019)

Article Management

A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem

Kavita Singh et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (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, Artificial Intelligence

A hybrid artificial bee colony algorithm for the cooperative maximum covering location problem

B. Jayalakshmi et al.

INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS (2017)

Article Computer Science, Artificial Intelligence

Hybrid evolutionary approaches for the single machine order acceptance and scheduling problem

Sachchida Nand Chaurasia et al.

APPLIED SOFT COMPUTING (2017)

Article Management

Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem

J. Manuel Colmenar et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)

Article Computer Science, Hardware & Architecture

Mixed Planar and Network Single-Facility Location Problems

Zvi Drezner et al.

NETWORKS (2016)

Article Computer Science, Hardware & Architecture

Cooperative Covering Problems on Networks

Igor Averbakh et al.

NETWORKS (2014)

Article Engineering, Multidisciplinary

Matheuristic approaches for Q-coverage problem versions in wireless sensor networks

Alok Singh et al.

ENGINEERING OPTIMIZATION (2013)

Article Engineering, Industrial

Cooperative cover location problems: The planar case

Oded Berman et al.

IIE TRANSACTIONS (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)