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

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 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.

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.

Neighborhood decomposition-driven variable neighborhood search for capacitated clustering

2021 ◽  
pp. 105362
Author(s):  
Xiangjing Lai ◽  
Jin-Kao Hao ◽  
Zhang-Hua Fu ◽  
Dong Yue
Keyword(s):  
Variable Neighborhood Search ◽  
Neighborhood Search
Sign in / Sign up

Export Citation Format

Share Document