کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6894991 1445935 2018 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A new binary formulation of the restricted Container Relocation Problem based on a binary encoding of configurations
ترجمه فارسی عنوان
فرمول باینری جدیدی از مشکل انتقال مجدد کانتینر بر اساس رمزگذاری دودویی تنظیمات
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
چکیده انگلیسی
The Container Relocation Problem (CRP), also called Block Relocation Problem (BRP), is concerned with finding a sequence of moves of containers that minimizes the number of relocations needed to retrieve all containers, while respecting a given order of retrieval. The restricted CRP enforces that only containers blocking the target container can be relocated. We improve upon and enhance an existing binary encoding and using it, formulate the restricted CRP as a binary integer programming problem in which we exploit structural properties of the optimal solution. This integer programming formulation reduces significantly the number of variables and constraints compared to existing formulations. Its efficiency is shown through computational results on small and medium sized instances taken from the literature.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 267, Issue 2, 1 June 2018, Pages 467-477
نویسندگان
, , ,