Alejandro Palacios Espinosa

Learn More
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:(More)
In this paper the Purchasing Scheduling Problem (PSP) with limited funds is presented. PSP is formulated through the optimization of two objectives based on the inventory-supply process: maximization of satisfied demands and minimization of purchasing costs. The problem is solved using two variants of the Ant Colony System algorithm (ACS), designed under(More)
  • 1