Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 748141, 11 pages
http://dx.doi.org/10.1155/2014/748141
Research Article

A Novel Algorithm Combining Finite State Method and Genetic Algorithm for Solving Crude Oil Scheduling Problem

Department of Automation and Key Laboratory of System Control and Information Processing, Shanghai Jiao Tong University, Ministry of Education of China, Shanghai 200240, China

Received 4 October 2013; Accepted 4 December 2013; Published 18 February 2014

Academic Editors: Q. Cheng and J. Yang

Copyright © 2014 Qian-Qian Duan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. M. Pinto, M. Joly, and L. F. L. Moro, “Planning and scheduling models for refinery operations,” Computers and Chemical Engineering, vol. 24, no. 9-10, pp. 2259–2276, 2000. View at Publisher · View at Google Scholar · View at Scopus
  2. J. Li, I. A. Karimi, and R. Srinivasan, “Recipe determination and scheduling of gasoline blending operations,” AIChE Journal, vol. 56, no. 2, pp. 441–465, 2010. View at Publisher · View at Google Scholar · View at Scopus
  3. J. Li, R. Misener, and C. A. Floudas, “Continuous-time modeling and global optimization approach for scheduling of crude oil operations,” AIChE Journal, vol. 58, no. 1, pp. 205–226, 2012. View at Publisher · View at Google Scholar · View at Scopus
  4. Z. Jia, M. Ierapetritou, and J. D. Kelly, “Refinery short-term scheduling using continuous time formulation: crude-oil operations,” Industrial and Engineering Chemistry Research, vol. 42, no. 13, pp. 3085–3097, 2003. View at Google Scholar · View at Scopus
  5. C. A. Méndez, I. E. Grossmann, I. Harjunkoski, and P. Kaboré, “A simultaneous optimization approach for off-line blending and scheduling of oil-refinery operations,” Computers and Chemical Engineering, vol. 30, no. 4, pp. 614–634, 2006. View at Publisher · View at Google Scholar · View at Scopus
  6. M. Pan, X. Li, and Y. Qian, “New approach for scheduling crude oil operations,” Chemical Engineering Science, vol. 64, no. 5, pp. 965–983, 2009. View at Publisher · View at Google Scholar · View at Scopus
  7. M. F. Cardoso, R. L. Salcedo, S. F. de Azevedo, and D. Barbosa, “A simulated annealing approach to the solution of minlp problems,” Computers and Chemical Engineering, vol. 21, no. 12, pp. 1349–1364, 1997. View at Google Scholar · View at Scopus
  8. I. E. Grossmann, “Review of nonlinear mixed-integer and disjunctive programming techniques,” Optimization and Engineering, vol. 3, no. 3, pp. 227–252, 2002. View at Publisher · View at Google Scholar
  9. E. L. Lawler and D. E. Wood, “Branch-and-bound methods: a survey,” Operations Research, vol. 14, no. 4, pp. 699–719, 1966. View at Publisher · View at Google Scholar
  10. M. A. Duran and I. E. Grossmann, “An outer-approximation algorithm for a class of mixed-integer nonlinear programs,” Mathematical Programming, vol. 36, no. 3, pp. 307–339, 1986. View at Publisher · View at Google Scholar · View at Scopus
  11. A. M. Geoffrion, “Generalized Benders decomposition,” Journal of Optimization Theory and Applications, vol. 10, no. 4, pp. 237–260, 1972. View at Publisher · View at Google Scholar · View at Scopus
  12. C. D'Ambrosio and A. Lodi, “Mixed integer nonlinear programming tools: a practical overview,” 4OR, vol. 9, no. 4, pp. 329–349, 2011. View at Publisher · View at Google Scholar · View at Scopus
  13. J. H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, The University of Michigan Press, Ann Arbor, Mich, USA, 1975.
  14. T. Yokota, M. Gen, and Y.-X. Li, “Genetic algorithm for non-linear mixed integer programming problems and its applications,” Computers and Industrial Engineering, vol. 30, no. 4, pp. 905–917, 1996. View at Publisher · View at Google Scholar · View at Scopus
  15. L. Costa and P. Oliveira, “Evolutionary algorithms approach to the solution of mixed integer non-linear programming problems,” Computers and Chemical Engineering, vol. 25, no. 2-3, pp. 257–266, 2001. View at Publisher · View at Google Scholar · View at Scopus
  16. J. M. Ponce-Ortega, M. Serna-González, and A. Jiménez-Gutiérrez, “Heat exchanger network synthesis including detailed heat exchanger design using genetic algorithms,” Industrial and Engineering Chemistry Research, vol. 46, no. 25, pp. 8767–8780, 2007. View at Publisher · View at Google Scholar · View at Scopus
  17. K.-M. Björk and R. Nordman, “Solving large-scale retrofit heat exchanger network synthesis problems with mathematical optimization methods,” Chemical Engineering and Processing: Process Intensification, vol. 44, no. 8, pp. 869–876, 2005. View at Publisher · View at Google Scholar · View at Scopus
  18. S. Mouret, I. E. Grossmann, and P. Pestiaux, “A novel priority-slot based continuous-time formulation for crude-oil scheduling problems,” Industrial and Engineering Chemistry Research, vol. 48, no. 18, pp. 8515–8528, 2009. View at Publisher · View at Google Scholar · View at Scopus
  19. H. Lee, J. M. Pinto, I. E. Grossmann, and S. Park, “Mixed-integer linear programming model for refinery short-term scheduling of crude oil unloading with inventory management,” Industrial and Engineering Chemistry Research, vol. 35, no. 5, pp. 1630–1641, 1996. View at Google Scholar · View at Scopus
  20. J. E. Hopcroft, Introduction to Automata Theory, Languages, and Computation, Pearson Education, India, New Delhi, India, 3rd edition, 2008.
  21. E. Roche and Y. Schabes, Finite-State Language Processing, The MIT Press, Cambridge, Mass, USA, 1997.
  22. L. Karttunen, “Constructing lexical transducers,” in Proceedings of the 15th conference on Computational Linguistics, vol. 1, Association for Computational Linguistics, 1994.
  23. L. Karttunen, “The replace operator,” in Proceedings of the 33rd Annual Meeting on Association for Computational Linguistics, Association for Computational Linguistics, 1995.
  24. L. Karttunen, “Directed replacement,” in Proceedings of the 34th Annual Meeting on Association for Computational Linguistics, Association for Computational Linguistics, 1996.
  25. L. Karttunen and K. R. Beesley, Two-Level Rule Compiler, Xerox Corporation, Palo Alto Research Center, 1992.
  26. G. van Noord, “FSA utilities: a toolbox to manipulate finite-state automata,” in Automata Implementation, pp. 87–108, Springer, New York, NY, USA, 1997. View at Google Scholar
  27. D. Gerdemann and G. van Noord, “Transducers from rewrite rules with backreferences,” in Proceedings of the 9th Conference on European Chapter of the Association for Computational Linguistics, Association for Computational Linguistics, 1999.
  28. Y.-C. Lin, K.-S. Hwang, and F.-S. Wang, “A mixed-coding scheme of evolutionary algorithms to solve mixed-integer nonlinear programming problems,” Computers and Mathematics with Applications, vol. 47, no. 8-9, pp. 1295–1307, 2004. View at Publisher · View at Google Scholar · View at Scopus