A methodology for solving logistic optimization problems through simulation

Simulation

Volumn 86, Issue 5-6, 2010, Pages 369-389

  Narciso, Mercedes ^a   Piera, Miquel A ^a   Guasch, Antoni ^b  

^a UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Colored Petri nets; Decision support systems; Discrete event systems; Optimization problems; Scheduling

Indexed keywords

COLORED PETRI NET; COLORED PETRI NETS; CONCEPTUAL MODEL; DECISION PROBLEMS; DECISION SUPPORT TOOLS; DISCRETE EVENT SYSTEMS; METHODOLOGICAL APPROACH; OPERATIONAL RESEARCH; OPTIMIZATION PROBLEMS; RESEARCH FIELDS; SEARCH PROBLEM; SIMULATION MODEL; SYSTEM OPTIMIZATIONS;

COMPUTER WORMS; DECISION MAKING; DECISION SUPPORT SYSTEMS; DECISION THEORY; DISCRETE EVENT SIMULATION; GRAPH THEORY; OPTIMIZATION; PETRI NETS; SCHEDULING;

PROBLEM SOLVING;

EID: 77953216745     PISSN: 00375497     EISSN: 17413133     Source Type: Journal    
DOI: 10.1177/0037549709356011     Document Type: Conference Paper

References (45)

1. Lee, S. and I.E. Grossmann. 2000. New algorithms for nonlinear generalized disjunctive programming. Comput. Chem. Eng., 24: 2125-2141.
2. Grossmann, I.E., S.A. van den Heever and I. Harjunkoski. 2001. Discrete optimization methods and their role in the integration of planning and scheduling. Comput. Chem. Eng., 28: 1169-1192.
3. Kallrath, J. 2002. Planning and scheduling in the process industry. OR Spectrum, 24: 219-250.
4. Biegler, L.T. and I.E. Grossmann. 2004. Retrospective on optimization. Comput. Chem. Eng., 28: 1169-1192.
5. Méndez, C.A., J. Cerdá, I.E. Grossmann, et al. 2006. State-of-the-art review of optimization methods for short-term scheduling of batch processes. Comput. Chem. Eng., 30: 913-946.
6. Zanakis, S.H., J.R. Evans and A.A. Vazacopoulos. 1989. Heuristic methods and applications: a categorized survey. Eur. J. Oper. Res., 43: 88-110.
7. Voß, S. 2001. Meta-heuristics: the state of the art. In Local Search for Planning and Scheduling (Lecture Notes in Artificial Intelligence, Vol. 2148), Springer, Berlin, pp. 1-23.
8. Michalewicz, Z. and D.B. Fogel. 2002. How to Solve It: Modern Heuristics, Springer, Berlin.
9. Silver, E.A. 2004. An overview of heuristic solution methods. J. Oper. Res. Soc., 55 (9). 936-956.
10. Kondili, E., C.C. Pantelides and R.W.H. Sargent. 1993. A general algorithm for short-term scheduling of batch operations-I. MILP formulation. Comput. Chem. Eng., 17 (2). 211-227.
11. Pantelides, C.C. 1994. Unified frameworks for the optimal process planning and scheduling. In Proceedings on the Second Conference on Foundations of Computer Aided Operations, pp. 253-274.
12. Jensen, K. 1997. Coloured Petri Nets: Basics Concepts, Analysis Methods and Practical Use. Springer, Berlin.
13. Jensen, K., L.M. Kristensen and L. Wells. 2007. Coloured Petri nets and CPN tools for modelling and validation of concurrent systems. Int. J. Softw. Tools Technol. Trans., 9 (3). 213-254.
14. Proth, J.M., and X. Xie. 1996. Petri Nets: A Tool for Design and Management of Manufacturing Systems. Wiley, New York.
15. Tuncel, G. and G.M. Bayhan. 2007. Applications of Petri nets in production scheduling: a review. Int. J. Adv. Manuf. Technol., 34: 762-773.
16. Chien, C.-F. and C.-H. Chen. 2007. Using genetic algorithms (GA) and a coloured timed Petri net (CTPN) for modelling the optimization-based schedule generator of a generic production scheduling system. Int. J. Prod. Res., 45 (8). 1763-1789.
17. Ghaelib, M., P.A. Bahria, P. Leec, et al. 2005. Petri-net based formulation and algorithm for short-term scheduling of batch plants. Comput. Chem. Eng., 29: 249-259.
18. Silva, M. and R. Valette. 1989. Petri nets and flexible manufacturing. In Advances in Petri Nets (Lecture Notes in Computer Science, Vol. 424), Springer, Berlin, pp. 374-417.
19. Zimmermann, A., K. Dalkowski, and G. Hommel. 1996. A case study in modeling and performance evaluation of manufacturing systems using colored Petri nets. In Proceedings of the 8th European Simulation Symposium, Genoa, Italy, pp. 282-286.
20. Piera, M.A., M.E. Narciso and R. Buil. 2009. Flexible manufacturing systems. In Y. Merkuryev et al. (eds), Simulation-based Case Studies in Logistics: Education and Applied Research, Springer, London, pp. 109-126.
21. Kristensen, L.M. and M. Westergaard. 2007. The ASCoVeCo state space analysis platform: next generation of tool support for state space analysis. In Proceedings of the 8th Workshop on Practical Use of Coloured Petri Nets and the CPN Tools, Aarhus, Denmark, pp. 1-6. http://www.daimi.au.dk/CPnets/workshop07/ cpn/papers/Tutorial01.pdf.
22. Srinivasan, R. and V. Venkatasubramanian. 1998. Automating HA-ZOP analysis of batch chemical plants: Part I. The knowledge representation framework. Comput. Chem. Eng., 22 (9). 1345-1355.
23. Moore, K.E. and S.M. Gupta. 1995. Stochastic colored Petri net models of flexible manufacturing systems: material handling systems and machining. Comput. Ind. Eng., 29 (1-4). 333-337.
24. Chincholkar, K. and O.V. Krishnaiah Chetty. 1996. Stochastic coloured Petri nets for modelling and evaluation, and heuristic rule base for scheduling of FMS. Int. J. Adv. Manuf. Technol., 12: 339-348.
25. Mitchell, B., L.M. Kristensen and L. Zhang. 2007. Formal specification and state space analysis of an operational planning process. Int. J. Softw. Tools Technol. Trans., 9 (3-4). 255-267.
26. Reyes, A., H. Yu, G. Kelleher, et al. 2002. Integrating Petri nets and hybrid heuristic search for the scheduling of FMS. Comput. Ind., 47 (1). 123-138. (Pubitemid 33094244)
27. Yu, H., A. Reyes, S. Cang, et al. 2003. Combined Petri net modelling and AI-based heuristic hybrid search for flexible manufacturing systems-part I: Petri net modelling and heuristic search. Comput. Ind. Eng., 44 (4). 527-543.
28. Yu, H., A. Reyes, S. Cang, et al. 2003. Combined Petri net modelling and AI-based heuristic hybrid search for flexible manufacturing systems-part II: Heuristic hybrid search. Comput. Ind. Eng., 44 (4). 545-566.
29. Kristensen, L.M., P. Mechlenborg, L. Zhang, et al. 2008. Model-based development of a course of action scheduling tool. Int. J. Softw. Tools Technol. Trans., 10 (1). 5-14.
30. Piera, M.A., M. Narciso, A. Guasch, et al. 2004. Optimization of logistic and manufacturing systems through simulation: a colored Petri net-based methodology. Simul-T Soc. Mod. Sim., 80 (3). 121-130.
31. Konar, A. 2000. Artificial Intelligence and Soft Computing: Behavioral and Cognitive Modeling of the Human Brain. CRC Press, Boca Raton, FL.
32. Russell, S. and P. Norvig. 2003. Artificial Intelligence: A Modern Approach, 2 nd edn, Prentice Hall, Englewood Cliffs, NJ.
33. Narciso Farias, M.E., M.A. Piera Eroles and J. Figueras. 2005. Optimización de Sistemas Logísticos Mediante Simulación: Una Metodología Basada en Redes de Petri Coloreadas. Rev. Iberoam. Autom. In., 2 (4). 54-65.
34. Fisher H. and G.L. Thompson. 1963. Probabilistic learning combinations of local job-shop scheduling rules. In J.F. Muth and G.L. Thompson (eds), Industrial Scheduling, Prentice-Hall, Englewood Cliffs, NJ, pp. 225-251.
35. Dauzère-Péres S. and J.B. Lasserre. 1994. An integrated approach in production planning and scheduling. Lect. Notes Econ. Math., 411: 114-126.
36. Park, B.J., H.R. Choi and H.S. Kim. 2003. A hybrid genetic algorithm for the job shop scheduling problems. Comput. Ind. Eng., 45 (4). 597-613.
37. Udomsakdigool, A. and V. Kachitvichyanukul. Heterogenous ant algorithm for job shop scheduling. In Proceedings of the 2005 International Conference on Simulation and Modeling, Bangkok, Thailand, pp. 120-125.
38. Goncalves, J.F., J. J. de Magalhaes Mendes and M.G.C. Resende. 2005. A hybrid genetic algorithm for the job shop scheduling problem. Eur. J. Oper. Res., 167 (1). 77-95.
39. Kun Tu, Zhifeng Hao and Ming Chen. 2006. PSO with improved strategy and topology for job shop scheduling. In Advances in Natural Computation (Lecture Notes in Computer Science, Vol. 4222), Springer, Berlin, pp. 146-155.
40. Senthil Velmurugan, P. and V. Selladurai. 2007. A Tabu search algorithm for job shop scheduling problem with industrial scheduling case study. Int. J. Soft Comput., 2 (4). 531-537.
41. Pongchairerks, P. 2009. Particle swarm optimization algorithm applied to scheduling problems. ScienceAsia, 35: 89-94.
42. Beasley, J.E. 2009. OR-Library. http://people.brunel.ac.uk/∼1/ 4mastjjb/jeb/info.html.
43. Narciso, M.E., M.A. Piera and J.-C. Hennet. 2003. Generation de Plan par Exploration Selective d'un Arbre de Couverture. In Proceedings of 4e Conférence Francophone de Modélisation et Simulation, Toulouse, France.
44. Narciso, M.E., M.A. Piera, and A. Guasch. 2003. A knowledge representation approach suitable to support heuristic search methods. Fr. Art. Int., 100: 397-408.
45. Narciso, M.E., M.A. Piera and A. Guasch. 2004. A decision support system to tackle the vehicle routing problem. Fr. Art. Int., 113: 375-382.