| Description |
1 online resource (211 p.) |
| Contents |
Cover -- Half Title -- Title Page -- Copyright Page -- Contents -- Preface -- Acknowledgments -- Author Bios -- CHAPTER 1: Introduction -- 1.1. APPLICATIONS OF NODE DEPLOYMENT PROBLEM -- 1.1.1. Unmanned Systems -- 1.1.2. Wireless Sensor Networks -- 1.1.3. Healthcare -- 1.1.4. Public Sectors -- 1.1.5. Railway Network Design -- 1.1.6. Distributed Simulation Systems -- 1.2. FUNDAMENTAL ISSUES OF NODE DEPLOYMENT PROBLEM -- 1.2.1. Task -- 1.2.2. Node -- 1.2.3. Environment -- 1.3. RESEARCH PROGRESS OF NODE DEPLOYMENT MODELING -- 1.3.1. Deployment Space -- 1.3.1.1. Candidate Locations |
|
1.3.1.2. Deployment Formation -- 1.3.2. Constraints -- 1.3.3. Objective Functions -- 1.3.3.1. Node Deployment in Wireless Sensor Networks -- 1.3.3.2. Node Deployment in Air Defense -- 1.3.3.3. Other Types of Optimization Objective -- 1.4. RESEARCH PROGRESS OF NODE DEPLOYMENT METHODS -- 1.4.1. Encoding -- 1.4.2. Constraints Handling -- 1.4.3. Multi-Objective Handling -- 1.4.4. Algorithms -- 1.4.4.1. Exact Algorithm -- 1.4.4.2. Metaheuristic Algorithm -- 1.5. MAIN ISSUES AND CHALLENGES -- 1.6. BOOK OUTLINE -- CHAPTER 2: Stochastic Node Deployment for Area Coverage Problem -- 2.1. INTRODUCTION |
|
2.2. PROBLEM FORMULATION -- 2.2.1. Detection Models -- 2.2.1.1. Binary Detection Model -- 2.2.1.2. Probabilistic Detection Model -- 2.2.2. Network Model -- 2.2.3. Problem Statement -- 2.2.4. NP-Hardness Proof -- 2.3. SOLUTION ALGORITHMS -- 2.3.1. D-VFCPSO -- 2.3.2. Other PSO-Based Algorithm for Area Coverage Problem -- 2.3.3. Complexity Analysis -- 2.4. EXPERIMENTS AND DISCUSSION -- 2.4.1. Test Instances -- 2.4.2. Parameter Setting -- 2.4.3. Analysis of Results -- 2.5. CONCLUSION -- CHAPTER 3: Stochastic Dynamic Node Deployment for Target Coverage Problem -- 3.1. INTRODUCTION |
|
3.2. PROBLEM FORMULATION -- 3.2.1. Mathematical Model -- 3.2.2. Scenario-Based Model Reformulation -- 3.3. SOLUTION ALGORITHMS -- 3.3.1. NSGA-II -- 3.3.2. MOPSO -- 3.3.2.1. Personal Best Selection -- 3.3.2.2. Non-Dominated Solutions Maintaining and Global Best Selection -- 3.3.2.3. Diversity Maintaining -- 3.3.3. Complexity Analysis -- 3.4. EXPERIMENTS AND DISCUSSION -- 3.4.1. Test Instances -- 3.4.2. Performance Metrics -- 3.4.3. Parameter Turning -- 3.4.4. Analysis of Results -- 3.5. CONCLUSION -- CHAPTER 4: Robust Node Deployment for Cooperative Coverage Problem -- 4.1. INTRODUCTION |
|
4.2. PROBLEM FORMULATION -- 4.2.1. The Deterministic and Uncertain Two-Level Cooperative Set Covering Problem -- 4.2.1.1. Two-Level Cooperative Set Covering Problem -- 4.2.1.2. Generalized Uncertain Two-Level Cooperative Set Covering Problem -- 4.2.2. Modeling the Robust Uncertain Two-Level Cooperative Set Covering Problem -- 4.2.2.1. Compact Formulation of the RUTLCSCP -- 4.3. SOLUTION ALGORITHMS -- 4.3.1. Dealing with Subproblem -- 4.3.2. Rule-Based Heuristic for RUTLCSCP -- 4.3.2.1. Processing Procedure -- 4.3.2.2. Complexity Analysis of MRBCH-k -- 4.3.3. Proposed SaDE for RUTLCSCP |
| Notes |
Description based upon print version of record |
|
4.3.3.1. Encoding |
| Subject |
Business logistics.
|
|
Business logistics
|
| Form |
Electronic book
|
| Author |
Chen, Chen
|
|
Zhang, Qi
|
|
Xin, Bin
|
|
Pardalos, Panos M
|
| ISBN |
9781000432916 |
|
1000432912 |
|
