An ant colony optimization for continues domain algorithm for greenmultiple route job shop scheduling problem
Publish place: 3rd International Conference on Challenges and New Solutions in Industrial Engineering, Management and Accounting
Publish Year: 1401
Type: Conference paper
Language: English
View: 299
This Paper With 12 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
CSIEM03_497
Index date: 5 December 2022
An ant colony optimization for continues domain algorithm for greenmultiple route job shop scheduling problem abstract
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 Keywords:
An ant colony optimization for continues domain algorithm for greenmultiple route job shop scheduling problem authors
Amir Reza haji arbabi
MSC, Tafresh University, Tehran,Iran