2

Multistart Search for the Cyclic Cutwidth Minimization Problem
The Cyclic Cutwidth Minimization Problem (CCMP) is a Graph Layout Problem that consists of finding an embedding of the vertices of a …
Citar DOI
On solving the order processing in picking workstations
The Order Processing in Picking Workstations is a real problem derived from the industry in the context of supply chain management. It …
Citar DOI
Optimization of a Steam Reforming Plant Modeled with Artificial Neural Networks
The objective of this research is to improve the hydrogen production and total profit of a real Steam Reforming plant. Given the …
Citar DOI
Optimizing Computer Networks Communication with the Band Collocation Problem: A Variable Neighborhood Search Approach
The Band Collocation Problem appears in the context of problems for optimizing telecommunication networks with the aim of solving some …
Citar DOI
Particle swarm grammatical evolution for energy demand estimation
Grammatical Swarm is a search and optimization algorithm that belongs to the more general Grammatical Evolution family, which works …
Citar DOI
Preface to the special issue on optimization in vehicle routing and logistics
This special issue of Networks is dedicated to the seventh conference of the EURO Working Group on Vehicle Routing and Logistics …
Citar DOI
Special issue on recent innovations in variable neighborhood search
Variable neighborhood search (VNS) is a so-called single-solution based metaheuristic. The main idea behind VNS is the use of …
Citar DOI
The four dimensions of social network analysis: An overview of research methods, applications, and software tools
Social network based applications have experienced exponential growth in recent years. One of the reasons for this rise is that this …
Citar DOI
A Multi-Objective Parallel Iterated Greedy for Solving the p-Center and p-Dispersion Problem
This paper generalizes the iterated greedy algorithm to solve a multi-objective facility location problem known as the Bi-objective …
Citar DOI
A Variable Neighborhood Search approach for the Hamiltonian p-median problem
The Hamiltonian -Median Problem (HpMP) is a generalization of the well-known Traveling Salesman Problem (TSP), where the goal is to …
Citar DOI