کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
481048 1446027 2014 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
An inventory–routing problem with the objective of travel time minimization
ترجمه فارسی عنوان
مشکل موجود در مسیریابی با هدف کمینه شدن زمان سفر
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
چکیده انگلیسی


• We consider an inventory and routing problem to minimize maximum route travel time.
• We present tabu search algorithm with efficient improvement method in each iteration.
• Lagragian relaxation algorithm is proposed to obtain the lower bounds.
• It shows that results of tabu search are very close to the lower bounds.

In this paper, we consider an inventory–routing problem (IRP) in a large petroleum and petrochemical enterprise group. Compared to many other IRPs, the problem in this paper includes some special aspects due to the operational constraints, such as hours-of-service regulations of the company and the industry. Also, in some cases, it is more important to avoid stock out for any station, rather than purely focusing on transportation cost minimization. The objective is to minimize the maximum of the route travel time, which is not addressed in the literature so far. We present a tabu search algorithm to tackle the problem, which builds in an efficient and effective procedure to improve the search quality in each iteration. Moreover, lower bounds of reasonable sized problems, which are intractable in the formulated mathematical model by existing optimization software, are obtained via Lagrangian relaxation technique. Computational results indicate that the lower bounds are tight and the tabu search is capable of providing near optimal, close-to-lower-bound solutions in a computational time effective manner.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 236, Issue 3, 1 August 2014, Pages 936–945
نویسندگان
, , , ,