سیویلیکا را در شبکه های اجتماعی دنبال نمایید.

An ant colony optimization for continues domain algorithm for greenmultiple route job shop scheduling problem

سال انتشار: 1401
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 304

فایل این مقاله در 12 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

CSIEM03_497

تاریخ نمایه سازی: 14 آذر 1401

چکیده مقاله An ant colony optimization for continues domain algorithm for greenmultiple route job shop scheduling problem

This paper addresses the green multiple-route job shop scheduling problem to minimize cost and makespan. The problemis recognized to be extremely difficult because of its combinatorial nature of integer optimization and the large size ofthe real problem. The goal is, thus, to obtain near-optimal schedules in a computationally efficient manner. In the firstmathematical formulation is presented. Then an approach based on ACOR is proposed. In order to evaluate theeffectiveness of the proposed approach, 30 problems are designed and solved using the proposed approach. Problemsare also solved using Lingo software and the results are compared. The results show that the proposed algorithm yieldsbetter results than Lingo in terms of both solution and response time.

کلیدواژه های An ant colony optimization for continues domain algorithm for greenmultiple route job shop scheduling problem:

نویسندگان مقاله An ant colony optimization for continues domain algorithm for greenmultiple route job shop scheduling problem

Amir Reza haji arbabi

MSC, Tafresh University, Tehran,Iran