An Ant Colony System Metaheuristic Algorithm for Solving a Bi-Objective Purchasing Scheduling Problem
نویسندگان
چکیده
منابع مشابه
An Ant Colony System Metaheuristic Algorithm for Solving a Bi-Objective Purchasing Scheduling Problem
In this work the Purchasing Scheduling Problem (PSP) is presented, based in study cases of public and private sectors. PSP models the purchasing process in both scenarios through an optimization approach. It is based on the multi-objective formulation of the knapsack problem. Therefore, PSP is defined as a based-graph problem with two objectives: maximization of satisfied demands and minimizati...
متن کاملA HYBRID GENETIC ALGORITHM FOR A BI-OBJECTIVE SCHEDULING PROBLEM IN A FLEXIBLE MANUFACTURING CELL
This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...
متن کاملAN ANT COLONY SYSTEM ALGORITHM FOR THE TIME DEPENDENT NETWORK DESIGN PROBLEM
Network design problem is one of the most complicated and yet challenging problems in transportation planning. The Bi-level, non-convex and integer nature of network design problem has made it into one of the most complicated optimization problems. Inclusion of time dimension to the classical network design problem could add to this complexity. In this paper an Ant Colony System (ACS) has been ...
متن کاملAnt Colony Algorithm for Surgery Scheduling Problem
Considering the complete process of surgery including the preoperative and postoperative stages, multiple resource constraints involved and the integration of surgical upstream and downstream resources, surgery scheduling was described as an extended multi-resource constrained flexible job-shop scheduling problem and an optimization approach was proposed based on an improved ant colony algorith...
متن کاملAn ant colony optimization algorithm for job shop scheduling problem
The nature has inspired several metaheuristics, outstanding among these is Ant Colony Optimization (ACO), which have proved to be very effective and efficient in problems of high complexity (NP-hard) in combinatorial optimization. This paper describes the implementation of an ACO model algorithm known as Elitist Ant System (EAS), applied to a combinatorial optimization problem called Job Shop S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research in Computing Science
سال: 2014
ISSN: 1870-4069
DOI: 10.13053/rcs-82-1-2