Optimization of Food Composition for Hypertensive Patient using Variable Neighborhood Search

2017 ◽  
Vol 8 (2) ◽  
pp. 327
Author(s):  
Aprilia Nur Fauziyah ◽  
Wayan Firdaus Mahmudy
Keyword(s):  
Variable Neighborhood Search ◽  
Minimum Cost ◽  
Food Composition ◽  
Neighborhood Search ◽  
Minimal Cost ◽  
Neighborhood Structure ◽  
Healthy Life ◽  
Hypertensive Patients ◽  
Structure Selection ◽  
Neighborhood Structures

<em>Hypertension is a major symptom that cause other diseases appear such as non-communicable diseases, cancer, and diabetes if the nutrients on hypertensive patients not controlled from the actual nutrition need. One of healthy life effort for the patients is consuming healthy food that considers level of salt in the foods. The problem to determine the food composition that considers level of salt and minimum cost of the food is solved using Variable Neighborhood Search. This study compares 3 neighborhood structures: insertion, exchange, and 2-opt. The use of 2-opt neighborhood structure gives the highest fitness averages of other neighborhood structure. Selection and arrangement of neighborhood structure in every k neighborhood have effect on the solution is obtained. The result of this study contains composition of foods with nutrients which are close to the needs of hypertension patients with attentions the sodium and minimal cost within a day.</em>

scholarly journals An Order Effect of Neighborhood Structures in Variable Neighborhood Search Algorithm for Minimizing the Makespan in an Identical Parallel Machine Scheduling

2018 ◽  
Vol 2018 ◽  
pp. 1-8 ◽  
Author(s):  
Ibrahim Alharkan ◽  
Khaled Bamatraf ◽  
Mohammed A. Noman ◽  
Husam Kaid ◽  
Emad S. Abouel Nasr ◽  
...  
Keyword(s):  
Variable Neighborhood Search ◽  
Search Algorithm ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Order Effect ◽  
Initial Solution ◽  
Neighborhood Search ◽  
Neighborhood Structure ◽  
Identical Parallel Machine ◽  
Neighborhood Structures

Variable neighborhood search (VNS) algorithm is proposed for scheduling identical parallel machine. The objective is to study the effect of adding a new neighborhood structure and changing the order of the neighborhood structures on minimizing the makespan. To enhance the quality of the final solution, a machine based encoding method and five neighborhood structures are used in VNS. Two initial solution methods which were used in two versions of improved VNS (IVNS) are employed, namely, longest processing time (LPT) initial solution, denoted as HIVNS, and random initial solution, denoted as RIVNS. The proposed versions are compared with LPT, simulated annealing (SA), genetic algorithm (GA), modified variable neighborhood search (MVNS), and improved variable neighborhood search (IVNS) algorithms from the literature. Computational results show that changing the order of neighborhood structures and adding a new neighborhood structure can yield a better solution in terms of average makespan.

scholarly journals Hybrid Genetic Algorithm for Optimization of Food Composition on Hypertensive Patient

2018 ◽  
Vol 8 (6) ◽  
pp. 4673
Author(s):  
Aprilia Nur Fauziyah ◽  
Wayan Firdaus Mahmudy
Keyword(s):  
Genetic Algorithm ◽  
Hypertensive Patient ◽  
Hybrid Method ◽  
Variable Neighborhood Search ◽  
Hybrid Genetic Algorithm ◽  
Minimum Cost ◽  
Food Composition ◽  
Premature Convergence ◽  
Neighborhood Search

The healthy food with attention of salt degree is one of the efforts for healthy living of hypertensive patient. The effort is important for reducing the probability of hypertension change to be dangerous disease. In this study, the food composition is build with attention nutrition amount, salt degree, and minimum cost. The proposed method is hybrid method of Genetic Algorithm (GA) and Variable Neighborhood Search (VNS). The three scenarios of hybrid GA-VNS types had been developed in this study. Although hybrid GA and VNS take more time than pure GA or pure VNS but the proposed method give better quality of solution. VNS successfully help GA avoids premature convergence and improves better solution. The shortcomings on GA in local exploitation and premature convergence is solved by VNS, whereas the shortcoming on VNS that less capability in global exploration can be solved by use GA that has advantage in global exploration.

Variable neighborhood search for minimum cost berth allocation

2008 ◽  
Vol 191 (3) ◽  
pp. 636-649 ◽  
Author(s):  
Pierre Hansen ◽  
Ceyda Oğuz ◽  
Nenad Mladenović
Keyword(s):  
Variable Neighborhood Search ◽  
Minimum Cost ◽  
Neighborhood Search ◽  
Berth Allocation

scholarly journals Buffer Allocation via Bottleneck-Based Variable Neighborhood Search

2020 ◽  
Vol 10 (23) ◽  
pp. 8569
Author(s):  
Sixiao Gao ◽  
Toshimitsu Higashi ◽  
Toyokazu Kobayashi ◽  
Kosuke Taneda ◽  
Jose I. U. Rubrico ◽  
...  
Keyword(s):  
Variable Neighborhood Search ◽  
Search Algorithm ◽  
Computation Time ◽  
State Probability ◽  
Neighborhood Search ◽  
Buffer Allocation ◽  
Neighborhood Structure ◽  
Production Lines ◽  
Solution Quality ◽  
Acceptable Solution

This study addresses the challenging problem of efficient buffer allocation in production lines. Suitable locations for buffer allocation are determined to satisfy the desired throughput, while a suitable balance between solution quality and computation time is achieved. A throughput calculation approach that yields the state probability of production lines is adopted to evaluate the effectiveness of candidate buffer allocation solutions. To generate candidate buffer allocation solutions, an active probability index based on state probability is proposed to rapidly detect suitable locations of buffer allocations. A variable neighborhood search algorithm is used to maintain acceptable solution quality; an additional neighborhood structure is used in the case where no satisfactory solution is generated in the initial neighborhood structure. Extensive numerical experiments demonstrate the efficacy of the proposed approach. The proposed approach can facilitate agile design of production lines in industry by rapidly estimating production line topologies.

scholarly journals Optimizing Computer Networks Communication with the Band Collocation Problem: A Variable Neighborhood Search Approach

Electronics ◽  
2020 ◽  
Vol 9 (11) ◽  
pp. 1860
Author(s):  
Isaac Lozano-Osorio ◽  
Jesus Sanchez-Oro ◽  
Miguel Ángel Rodriguez-Garcia ◽  
Abraham Duarte
Keyword(s):  
Variable Neighborhood Search ◽  
Simulated Annealing Algorithm ◽  
Previous Method ◽  
Point Of View ◽  
Telecommunication Networks ◽  
Neighborhood Search ◽  
Neighborhood Structures ◽  
Bandpass Problem ◽  
Search Approach ◽  
The Cost

The Band Collocation Problem appears in the context of problems for optimizing telecommunication networks with the aim of solving some concerns related to the original Bandpass Problem and to present a more realistic approximation to be solved. This problem is interesting to optimize the cost of networks with several devices connected, such as networks with several embedded systems transmitting information among them. Despite the real-world applications of this problem, it has been mostly ignored from a heuristic point of view, with the Simulated Annealing algorithm being the best method found in the literature. In this work, three Variable Neighborhood Search (VNS) variants are presented, as well as three neighborhood structures and a novel optimization based on Least Recently Used cache, which allows the algorithm to perform an efficient evaluation of the objective function. The extensive experimental results section shows the superiority of the proposal with respect to the best previous method found in the state-of-the-art, emerging VNS as the most competitive method to deal with the Band Collocation Problem.

scholarly journals Influence of a neighborhood shape on the efficiency of continuous variable neighborhood search

2020 ◽  
Vol 30 (1) ◽  
pp. 3-17
Author(s):  
Milan Drazic
Keyword(s):  
Global Optimization ◽  
Variable Neighborhood Search ◽  
Optimization Problems ◽  
Continuous Variable ◽  
Efficient Algorithms ◽  
Geometric Shape ◽  
Neighborhood Search ◽  
High Dimensional ◽  
Neighborhood Structures ◽  
Continuous Global Optimization

The efficiency of a Variable neighborhood search metaheuristic for continuous global optimization problems greatly depends on geometric shape of neighborhood structures used by the algorithm. Among the neighborhoods defined by balls in ?p, 1 ?p ? ? metric, we tested the ?1, ?2, and ?? ball shape neighborhoods, for which there exist efficient algorithms for obtaining uniformly distributed points. On many challenging high-dimensional problems, our exhaustive testings showed that, popular and the easiest for implementation, ?? ball shape of neighborhoods performed the worst, and much better efficiency was obtained with ?1 and ?2.

Synchronizing Trucks and Trailers in a Multiresource Problem with Variable Neighborhood Search

2017 ◽  
Vol 2610 (1) ◽  
pp. 28-34 ◽  
Author(s):  
Ulrike Ritzinger ◽  
Bin Hu ◽  
Hannes Koller ◽  
Melitta Dragaschnig
Keyword(s):  
Real World ◽  
Variable Neighborhood Search ◽  
Container Terminal ◽  
Time Windows ◽  
Search Space ◽  
Neighborhood Search ◽  
Routing Problem ◽  
Real World Problem ◽  
Neighborhood Structures ◽  
The Given

A real-world container drayage problem in which containers are transported between an intermodal terminal, a container terminal, and customer locations is considered. The problem was modeled as a multi-resource routing problem (MRRP) that included trucks, trailers, and containers. Given a fleet of trucks and trailers, the goal is to use these resources most efficiently to complete a number of given orders. Orders consisted of several tasks with time windows, such as picking up a container at the terminal, delivering it to a customer, and bringing the processed container back. A challenging aspect of this problem is the management of trailers, which are required to transport the containers. Here, the compatibility between container types and trailer types must be considered. Thus, the decision of which trailer should be attached to which truck depends on the containers that must be transported, the day of availability of trailers, and the toll costs of the truck and trailer combination on the highways. This paper presents an efficient way to model this problem and proposes a metaheuristic approach based on a variable neighborhood search. It uses a compact solution representation and tailored neighborhood structures to reduce the search space. Classical MRRP neighborhood structures, as well as problem-specific ones, were used in combination and contributed to the overall success. The results show that the given real-world problem can be solved efficiently, and it can be shown that with proper planning, the utilization of resources can be increased.

scholarly journals Resilient overlay design in DWDM systems

2016 ◽  
Vol 26 (3) ◽  
pp. 343-360
Author(s):  
Cecilia Parodi ◽  
Franco Robledo ◽  
Pablo Romero ◽  
Carlos Testuri
Keyword(s):  
Cost Reduction ◽  
Variable Neighborhood Search ◽  
Real Life ◽  
Minimum Cost ◽  
Transport Network ◽  
Neighborhood Search ◽  
Multicommodity Flow ◽  
Original Formulation ◽  
Decomposition Approach ◽  
Overlay Design

The goal of this work is to design a minimum cost resilient overlay network, where a data network is on top of a transport network. Two major challenges are addressed. On one hand, a single failure in the transport network causes multiple simultaneous failures; on the other, the multicommodity flow must respect integrality. An integer programming formulation is presented to design an overlay, meeting the previous constraints. We prove the problem belongs to the class NP-Hard. Then, a decomposition approach is introduced, where the problem is solved in two steps by means of relaxations of the original formulation. Experiments carried out with real-life instances, coming from the Uruguayan telecommunication operator, show that the approach is competitive with respect to previous metaheuristics, to know, Tabu-Search (TS) and Variable Neighborhood Search (VNS). A modest percentage of cost-reduction is achieved in some instances, which means millionaire savings in practice.

Sign in / Sign up

Export Citation Format

Share Document