Solution of a Bi-Objective Purchasing Scheduling Problem with Constrained Funds using Pareto Optimization

@article{Orta2015SolutionOA,
  title={Solution of a Bi-Objective Purchasing Scheduling Problem with Constrained Funds using Pareto Optimization},
  author={Jos{\'e} Francisco Delgado Orta and Laura Cruz Reyes and Alejandro Palacios Espinosa and Christian Ayala Esquivel},
  journal={Res. Comput. Sci.},
  year={2015},
  volume={104},
  pages={41-50}
}
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 Pareto's optimization principle in which elements of multi-objective representation for computing a feasible solution are incorporated to the… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 18 REFERENCES
Pareto Ant Colony Optimization: A Metaheuristic Approach to Multiobjective Portfolio Selection
TLDR
Pareto Ant Colony Optimization is introduced as an especially effective meta-heuristic for solving the portfolio selection problem and its performance is compared to other heuristic approaches (i.e., Pareto Simulated Annealing and the Non-Dominated Sorting Genetic Algorithm) by means of computational experiments with random instances.
A new Approach based on Ant Colony Optimization (ACO) to Determine the Supply Chain (SC) Design for a Product Mix
TLDR
The strategy of letting the best-so-far ant deposit pheromone over the PM accelerates the algorithm to get the optimal POS although the number of ants in the colony is small, resulting in solutions with lower time and cost than SMP.
Evolution of hyperheuristics for the biobjective 0/1 knapsack problem by multiobjective genetic programming
TLDR
The contribution of this paper is to show that a genetic programming system can evolve a set of heuristics that can give solutions on the Pareto front for multiobjective combinatorial problems.
CSET automated negotiation model for optimal supply chain formation
In an effort to compose an optimal supply chain (SC), this paper tries to bring forward a new collaborative agent-based single machine earliness/tardiness (SET) model. It includes the sub-agents,
Ant colony system: a cooperative learning approach to the traveling salesman problem
TLDR
The results show that the ACS outperforms other nature-inspired algorithms such as simulated annealing and evolutionary computation, and it is concluded comparing ACS-3-opt, a version of the ACS augmented with a local search procedure, to some of the best performing algorithms for symmetric and asymmetric TSPs.
What is the “right” inventory management approach for a purchased item?
Purpose – How should a firm decide which of four choices – i.e. inventory speculation, inventory postponement, inventory consignment, and reverse inventory consignment – is most appropriate to adopt
Lower bounds and reduction procedures for the bin packing problem
A Product Quality — Supply Chain Integration Framework
TLDR
The results provide considerable support for the product quality-supply chain integration framework that can be used in the manufacturing sector.
Modified Lagrangian Methods for Separable Optimization Problems
We propose a convergence analysis of a new decomposition method to solve structured optimization problems. The proposed scheme is based on a class of modified Lagrangians combined with the allocation
Product feature categorization with multilevel latent semantic association
TLDR
This paper proposes an unsupervised product-feature categorization method with multilevel latent semantic association that achieves better performance compared with the existing approaches and is language- and domain-independent.
...
...