Results 81 to 90 of about 221,092 (272)

An efficient meta-heuristic algorithm for solving capacitated vehicle routing problem

open access: yesIJAIN (International Journal of Advances in Intelligent Informatics), 2018
This work aims to develop an enhanced Perturbation based Variable Neighborhood Search with Adaptive Selection Mechanism (PVNS ASM) to solve the capacitated vehicle routing problem (CVRP).
Alfian Faiz   +2 more
doaj   +1 more source

A Hybrid Method based on SA and VNS Algorithms for Solving DAP in DDS [PDF]

open access: yesComputer Science Journal of Moldova, 2021
Data allocation problem (DAP) is of great importance in distributed database systems (DDS). Minimizing the total cost of transactions and queries is the main objective of DAP which is mostly affected by the volume of transmitting data through the system.
Nasser Lotfi, Jamshid Tamouk
doaj  

Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem [PDF]

open access: yes, 2013
In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) is presented.
Maric, Miroslav
core  

Overview of molecular signatures of senescence and associated resources: pros and cons

open access: yesFEBS Open Bio, EarlyView.
Cells can enter a stress response state termed cellular senescence that is involved in various diseases and aging. Detecting these cells is challenging due to the lack of universal biomarkers. This review presents the current state of senescence identification, from biomarkers to molecular signatures, compares tools and approaches, and highlights ...
Orestis A. Ntintas   +6 more
wiley   +1 more source

Hybrid Variable Neighborhood HyperHeuristics for Exam Timetabling Problems [PDF]

open access: yes, 2005
This paper presents our work on analysing the high level search within a graph based hyperheuristic. The graph based hyperheuristic solves the problem at a higher level by searching through permutations of graph heuristics rather than the actual ...
Burke, Edmund, Qu, Rong
core   +3 more sources

A Decomposition, Construction and Post-Processing Approach for Nurse Rostering [PDF]

open access: yes, 2005
This paper presents our work on decomposing a specific nurse rostering problem by cyclically assigning blocks of shifts, which are designed considering both hard and soft constraints, to groups of nurses.
Brucker, Peter   +3 more
core   +1 more source

Enzymatic degradation of biopolymers in amorphous and molten states: mechanisms and applications

open access: yesFEBS Open Bio, EarlyView.
This review explains how polymer morphology and thermal state shape enzymatic degradation pathways, comparing amorphous and molten biopolymer structures. By integrating structure–reactivity principles with insights from thermodynamics and enzyme engineering, it highlights mechanisms that enable efficient polymer breakdown.
Anđela Pustak, Aleksandra Maršavelski
wiley   +1 more source

Neigborhood Selection in Variable Neighborhood Search

open access: yes, 2011
Variable neighborhood search (VNS) is a metaheuristic for solving optimization problems based on a simple principle: systematic changes of neighborhoods within the search, both in the descent to local minima and in the escape from the valleys which contain them. Designing these neighborhoods and applying them in a meaningful fashion is not an easy task.
Geiger, Martin Josef   +2 more
openaire   +2 more sources

Tumor‐stromal crosstalk and macrophage enrichment are associated with chemotherapy response in bladder cancer

open access: yesFEBS Open Bio, EarlyView.
Chemoresistance in bladder cancer: Macrophage recruitment associated with CXCL1, CXCL5 and CXCL8 expression is characteristic of Gemcitabine/Cisplatin (Gem/Cis) Non‐Responder tumors (right side) while Responder tumors did not show substantial tumor‐stromal crosstalk (left side). All biological icons are attributed to Bioicons: carcinoma, cancerous‐cell‐
Sophie Leypold   +11 more
wiley   +1 more source

The Double Traveling Salesman Problem with Multiple Stacks and a Choice of Container Types

open access: yesMathematics, 2020
The double traveling salesman problem with multiple stacks involves the transportation of goods between two regions. In one region, a vehicle carrying a container visits customers, where pallets of goods are loaded into the container.
Lars Magnus Hvattum   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy