A memetic algorithm for the corridor allocation problem

Read full text Summarise with VIRAT
Authors: Gintaras Palubeckis
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

The corridor allocation problem (CAP) consists of arranging n departments along both sides of a corridor without overlap and without gaps between adjacent departments. The objective is to minimize the weighted sum of the distances between all pairs of departments. The distance between two departments (with given lengths) is taken as the x-distance between their centers. Each distance is weighted by the material handling cost per distance unit between the corresponding departments. For solving the CAP, we have developed a memetic algorithm (MA) utilizing a fast local search procedure which is based on repeatedly applying insertion moves to the current solution. In addition, we introduced a new crossover mechanism that operates on two pairs of permutations through an encoding-decoding scheme, which enables a more effective recombination of high-quality solutions. The source code (in the C++ programming language, Borland version) of MA can be found in cap_ma.zip. The algorithm was tested on the CAP instances with up to 300 departments. The set of large-scale instances are stored in the archive cap_inst.zip. Instance is provided in the following format: - the number of departments; - the lengths of departments; - (Symmetric) matrix of material handling costs (its upper triangle is used in the objective function).

Fields of Study & Subjects

Advanced Manufacturing and Logistics Optimization Metaheuristic Optimization Algorithms Research Scheduling and Optimization Algorithms

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
23 March 2026
Language
EN