Displaying similar documents to “A branch hash function as a method of message synchronization in anonymous P2P conversations”

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

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

Evaluating the Kernighan-Lin heuristic for hardware/software partitioning

Zoltán Mann, András Orbán, Viktor Farkas (2007)

International Journal of Applied Mathematics and Computer Science

Similarity:

In recent years, several heuristics have been proposed for the hardware/software partitioning problem. One of the most promising directions is the adaptation of the Kernighan-Lin algorithm. The Kernighan-Lin heuristic was originally developed for circuit partitioning, but it has been adapted to other domains as well. Moreover, numerous improvements have been suggested so that now several variants of the original algorithm exist. The aim of this paper is to systematically evaluate the...

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