A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem
The dynamic single row facility layout problem (DSRFLP) is defined as the problem of arranging facilities along a straight line during a multi-period planning horizon with the objective of minimizing the sum of the material handling and rearrangement costs. The material handling cost is the sum of t...
Main Authors: | Gintaras Palubeckis, Armantas Ostreika, Jūratė Platužienė |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-06-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/10/13/2174 |
Similar Items
-
An Approach Integrating Simulated Annealing and Variable Neighborhood Search for the Bidirectional Loop Layout Problem
by: Gintaras Palubeckis
Published: (2020-12-01) -
Variable neighborhood search for maximum diverse grouping problem
by: Urošević Dragan
Published: (2014-01-01) -
A new variable neighborhood search approach for solving dynamic memory allocation problem
by: Ivanović Marija, et al.
Published: (2018-01-01) -
Solving Multi-Objective Paired Single Row Facility Layout Problem Using Hybrid Variable Neighborhood Search
by: Meilinda Fitriani Nur Maghfiroh
Published: (2021-12-01) -
A Variable Neighborhood Search Method with a Tabu List and Local Search for Optimizing Routing in Trucks in Maritime Ports
by: Luka Matijević, et al.
Published: (2023-08-01)