Displaying similar documents to “A distributed transportation simplex applied to a Content Distribution Network problem”

A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints

Lixin Miao, Qingfang Ruan, Kevin Woghiren, Qi Ruo (2012)

RAIRO - Operations Research

Similarity:

This paper addresses a Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) which combines a three-dimensional loading problem and vehicle routing problem in distribution logistics. The problem requires the combinatorial optimization of a feasible loading solution and a successive routing of vehicles to satisfy client demands, where all vehicles must start and terminate at a central depot. In spite of its clear practical...

A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints

Lixin Miao, Qingfang Ruan, Kevin Woghiren, Qi Ruo (2012)

RAIRO - Operations Research

Similarity:

This paper addresses a Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) which combines a three-dimensional loading problem and vehicle routing problem in distribution logistics. The problem requires the combinatorial optimization of a feasible loading solution and a successive routing of vehicles to satisfy client demands, where all vehicles must start and terminate at a central depot. In spite of its clear practical...

An improved ant algorithm for Multi-mode Resource Constrained Project Scheduling Problem

Peng Wuliang, Huang Min, Hao Yongping (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Many real-world scheduling problems can be modeled as Multi-mode Resource Constrained Project Scheduling Problems (MRCPSP). However, the MRCPSP is a strong NP-hard problem and very difficult to be solved. The purpose of this research is to investigate a more efficient alternative based on ant algorithm to solve MRCPSP. To enhance the generality along with efficiency of the algorithm, the rule pool is designed to manage numerous priority rules for MRCPSP. Each ant is provided with an...

Parallelization of artificial immune systems using a massive parallel approach via modern GPUs

Khun, Jiří, Šimeček, Ivan

Similarity:

Parallelization is one of possible approaches for obtaining better results in terms of algorithm performance and overcome the limits of the sequential computation. In this paper, we present a study of parallelization of the opt-aiNet algorithm which comes from Artificial Immune Systems, one part of large family of population based algorithms inspired by nature. The opt-aiNet algorithm is based on an immune network theory which incorporates knowledge about mammalian immune systems in...

An Adaptation of the Hoshen-Kopelman Cluster Counting Algorithm for Honeycomb Networks

Popova, Hristina (2014)

Serdica Journal of Computing

Similarity:

We develop a simplified implementation of the Hoshen-Kopelman cluster counting algorithm adapted for honeycomb networks. In our implementation of the algorithm we assume that all nodes in the network are occupied and links between nodes can be intact or broken. The algorithm counts how many clusters there are in the network and determines which nodes belong to each cluster. The network information is stored into two sets of data. The first one is related to the connectivity of the...

A modified K3M thinning algorithm

Marek Tabedzki, Khalid Saeed, Adam Szczepański (2016)

International Journal of Applied Mathematics and Computer Science

Similarity:

The K3M thinning algorithm is a general method for image data reduction by skeletonization. It had proved its feasibility in most cases as a reliable and robust solution in typical applications of thinning, particularly in preprocessing for optical character recognition. However, the algorithm had still some weak points. Since then K3M has been revised, addressing the best known drawbacks. This paper presents a modified version of the algorithm. A comparison is made with the original...