Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks

DOI10.1016/J.COR.2015.02.001MaRDI QIDQ337548zbMATHOpenAlexFDO

Authors M. Emre Keskin, İ. Kuban Altınel, Necati Aras

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2015.02.001

zbMATH Keywords

simulated annealingLagrangian relaxationlifetime maximizationweighted Dantzig-Wolfe decompositionwireless sensor network design

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Communication networks in operations research (90B18)

Recommendations

• Optimal placement, scheduling, and routing to maximize lifetime in sensor networks
• A column generation heuristic for optimal wireless sensor network design with mobile sinks
• A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks
• Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks
• Maximizing lifetime of a wireless sensor network via joint optimizing sink placement and sensor-to-sink routing

Cites work

• scientific article; zbMATH DE number 1062478 (Why is no real title available?)
• A branch-and-price algorithm for the capacitated facility location problem
• A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks
• Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks
• Decomposition Principle for Linear Programs
• Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks
• Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks
• Optimal placement, scheduling, and routing to maximize lifetime in sensor networks
• Optimization by simulated annealing
• The Decomposition Algorithm for Linear Programs
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

Cited in

(7)

• An integer linear programming-based tool for wireless sensor networks
• Reliable wireless multimedia sensor network design: comparison of hybrid metaheuristics and a matheuristic
• Online self-organizing network control with time averaged weighted throughput objective
• Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks
• Optimal relay node placement in delay constrained wireless sensor network design
• A column generation heuristic for optimal wireless sensor network design with mobile sinks
• Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems

Describes a project that uses

Uses Software

• Gurobi
• OMNet++

This page was built for publication: Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks

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