scholarly journals A Matheuristic for Joint Optimal Power and Scheduling Assignment in DVB-T2 Networks

Algorithms ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 27
Author(s):  
Fabio D’Andreagiovanni ◽  
Hicham Lakhlef ◽  
Antonella Nardin

Because of the introduction and spread of the second generation of the Digital Video Broadcasting—Terrestrial standard (DVB-T2), already active television broadcasters and new broadcasters that have entered in the market will be required to (re)design their networks. This is generating a new interest for effective and efficient DVB optimization software tools. In this work, we propose a strengthened binary linear programming model for representing the optimal DVB design problem, including power and scheduling configuration, and propose a new matheuristic for its solution. The matheuristic combines a genetic algorithm, adopted to efficiently explore the solution space of power emissions of DVB stations, with relaxation-guided variable fixing and exact large neighborhood searches formulated as integer linear programming (ILP) problems solved exactly. Computational tests on realistic instances show that the new matheuristic performs much better than a state-of-the-art optimization solver, identifying solutions associated with much higher user coverage.

2015 ◽  
Vol 54 ◽  
pp. 631-677
Author(s):  
Tatsuya Imai ◽  
Alex Fukunaga

We propose a new integer-linear programming model for the delete relaxation in cost-optimal planning. While a straightforward IP for the delete relaxation is impractical, our enhanced model incorporates variable reduction techniques based on landmarks, relevance-based constraints, dominated action elimination, immediate action application, and inverse action constraints, resulting in an IP that can be used to directly solve delete-free planning problems. We show that our IP model is competitive with previous state-of-the-art solvers for delete-free problems. The LP-relaxation of the IP model is often a very good approximation to the IP, providing an approach to approximating the optimal value of the delete-free task that is complementary to the well-known LM-cut heuristic. We also show that constraints that partially consider delete effects can be added to our IP/LP models. We embed the new IP/LP models into a forward-search based planner, and show that the performance of the resulting planner on standard IPC benchmarks is comparable with the state-of-the-art for cost-optimal planning.


2020 ◽  
Vol 6 (1) ◽  
Author(s):  
S Mohd Baki ◽  
Jack Kie Cheng

Production planning is often challenging for small medium enterprises (SMEs) company. Most of the SMEs are having difficulty in determining the optimal level of the production output which can affect their business performance. Product mix optimization is one of the main key for production planning. Many company have used linear programming model in determining the optimal combination of various products that need to be produced in order to maximize profit. Thus, this study aims for profit maximization of a SME company in Malaysia by using linear programming model. The purposes of this study are to identify the current process in the production line and to formulate a linear programming model that would suggest a viable product mix to ensure optimum profitability for the company. ABC Sdn Bhd is selected as a case study company for product mix profit maximization study. Some conclusive observations have been drawn and recommendations have been suggested. This study will provide the company and other companies, particularly in Malaysia, an exposure of linear programming method in making decisions to determine the maximum profit for different product mix.


Author(s):  
Konstantinos Kardaras ◽  
George I. Lambrou ◽  
Dimitrios Koutsouris

Background: In the new era of wireless communications new challenges emerge including the provision of various services over the digital television network. In particular, such services become more important when referring to the tele-medical applications through terrestrial Digital Video Broadcasting (DVB). Objective: One of the most significant aspects of video broadcasting is the quality and information content of data. Towards that end several algorithms have been proposed for image processing in order to achieve the most convenient data compression. Methods: Given that medical video and data are highly demanding in terms of resources it is imperative to find methods and algorithms that will facilitate medical data transmission with ordinary infrastructure such as DVB. Results: In the present work we have utilized a quantization algorithm for data compression and we have attempted to transform video signal in such a way that would transmit information and data with a minimum loss in quality and succeed a near maximum End-user approval. Conclusions: Such approaches are proven to be of great significance in emergency handling situations, which also include health care and emergency care applications.


1992 ◽  
Vol 43 (11) ◽  
pp. 1035-1045
Author(s):  
S O Duffuaa ◽  
J A Al-Zayer ◽  
M A Al-Marhoun ◽  
M A Al-Saleh

Sign in / Sign up

Export Citation Format

Share Document