Planning Large Supply Chain Scenarios with "Quant-based Combinatorial Optimization"

Logistic Optimization of Chemical Production Processes

Volumn , Issue , 2008, Pages 57-91

  Plapp, Christoph ^a   Surholt, Dirk ^a   Syring, Dietmar ^a  

^a Axxom Software AG   (Germany)

Author keywords

Additional modeling elements; Chemical production process; Constraints; Industrial solutions; Limits of traditional LP; Logistic optimization; Planning large supply chain scenarios; Quant based combinatorial optimization

Indexed keywords

EID: 84889335835     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9783527622771.ch4     Document Type: Chapter

References (46)

1. Aboudi, R., Hallefjord, Å. and Jørnsten, K. (1991) A facet generation and relaxation technique applied to an assignment problem with side constraints. Eur J Oper Res, 0 (3), 335-344.
2. Aboudi, R. and Hallefjord, K. (1990) Resource constrained assignment problems. Discr Appl Math, 26 (2/3), 175-191.
3. Ahuja, R., Magnanti, T. and Orlin, J. (1993) Network Flows - Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ.
4. Behrmann, G., Hendriks, M., Mader, M. and Brinksma, E. (2005) Axxom scheduling with uppaal. Technical report, AMETIST.
5. Bellman, R. (1958) On a routing problem. Q Appl Math, 16 (1), 87-90.
6. Bertsekas, D. and Castañon, D. (1991) Parallel synchronous and asynchronous implementation of the auction algorithm. Parallel Comput, 17 (6/7), 707-732.
7. Bertsekas, D., Castañon, D. and Tsaknakis, H. (1993) Reverse auction and the solution of inequality constrained assignment problems. SIAM J Optim, 3, 268-299.
8. Bertsekas, D. (1990) The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial, 20 (4), 133-149.
9. Bertsekas, D. (1994) Mathematical equivalence of the auction algorithm for assignment and the ε-relaxation (preflow-push) method for min cost flow, in Large Scale Optimization. State-of-the-Art (ed. W.W. Hager), Papers Presented at the Conference, held 15-17 February 1993 at the University of Florida, Gainesville, FL, pp. 20-44.
10. Blazewicz, J., Ecker, K., Pesch, E. et al. (1996) Scheduling Computer and Manufacturing Processes, Springer, Berlin.
11. Bierwirth, C. and Mattfeld, D. (1999) Production scheduling and rescheduling with genetic algorithms. Evol Comput, 7, 1-17.
12. Bohnenkamp, H.C., Hermanns, H., Klaren, R. et al. (2004, September) Synthesis and stochastic assessment of schedules for lacquer production. Proceedings of QEST'04, LNCS.
13. Brucker, P. (1995) Scheduling Algorithms, Springer, New York.
14. Catoni, O. (1998) Solving scheduling problems by simulated annealing. SIAM J Contr Optim, 36, 1539-1575.
15. Cavalieri, S. and Gaiardelli, P. (1998) Hybrid genetic algorithms for a multiple-objective scheduling problem. J Intell Manuf, 9, 361-367.
16. Chakrabarti, P. (1999) Partial precedence constrained scheduling. IEEE Trans Comput, 48, 1127-1131.
17. Chandrachoodan, N., Bhattacharyya, S. and Liu, K. (2001) Adaptive negative cycle detection in dynamic graphs. Proc Intl Symp Circ Syst (ISCAS 2001), V, 163-166.
18. Cherkassky, B. and Goldberg, A. (1996) Negative-cycle detection algorithms. Eur Symp Algorithm, 349-363.
19. Cherkassky, B., Goldberg, A. and Radzik, T. (1994) Shortest paths algorithms: Theory and experimental evaluation. SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms).
20. Cook, W., Cunningham, W., Pulleyblank, W. and Schrijver, A. (1998) Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley, New York.
21. Cormen, T., Leiserson, C. and Rivest, R. (1990) Introduction to Algorithms, McGraw-Hill, New York.
22. Engell, S. and Panek, S. (2003, May) Mathematical model formulation for the Axxom case study. Technical report, University of Dortmund.
23. Ford, L. and Fulkerson, D. (1962) Flows in Networks, Princeton University Press, Princeton, NJ.
24. Graham, R., Lawler, E., Lenstra, J. and Kann, A. (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math, 287-326.
25. Goldberg, A., Oldham, J., Plotkin, S. and Stein, C. (1997) An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow, Springer, London.
26. Goldberg, A. and Kennedy, R. (1995) An efficient cost scaling algorithm for the assignment problem. Math Prog, 71, 153-178.
27. Goldberg, A. (1997) An efficient implementation of a scaling minimum-cost algorithm. J Algorithms, 22, 1-29.
28. Heistermann, J. (1994) Genetische Algorithmen - Theorie u. Praxis evolutionärer Optimierung.
29. Goldberg, A. and Radzik, T. (1993) A heuristic improvement of the bellmanford algorithm. AMLETS: Appl Math Lett, 6, 3-6.
30. Herroelen, W. and Demeulemeester, E. (1998) Resource-constrained project scheduling: a survey of recent developments. Comput Ops Res, 25, 279-302.
31. Holland, J. (1975) Adaption in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI.
32. Kinnebrock, W. (1994) Optimierung mit genetischen und selektiven Algorithmen.
33. Kernler, H. (1995) PPS der 3. Generation: Grundlagen, Methoden, Anregungen.
34. Ku, D. and De Micheli, G. (1992) Relative scheduling under timing constraints: Algorithms for highlevel synthesis of digital circuits. IEEE Trans Comput Aided Des, 11 (6), 696-718.
35. Moore, E. (1959) The shortest path through a maze. Proceedings of the International Symposium on the Theory of Switching, pp. 285-292.
36. Pallottino, S. (1994) Shortest-path methods: Complexity, interrelations and new propositions. Networks, 14, 257-267.
37. Panek, S., Engell, S. and Lessner, C. (2005) Scheduling of a pipeless multiproduct batch plant using mixed-integer programming combined with heuristics. Proceedings of European Symposium on Computer Aided Process Engineering, ESCAPE 15.
38. Pape, U. (1974) Implementation and efficiency of moore-algorithms for the shortest route problem. Math Progr, 7, 212-222.
39. Pratt, V. (1977) Two easy theories whose combination is hard. Technical report.
40. Ramalingam, G., Song, J., Joscovicz, L. and Miller, R. (1995) Solving Difference Constraints Incrementally.
41. Späth, M. (2001) Heuristische und kombinatorische Verfahrenselemente für Suchalgorithmen in der Prozeßoptimierung.
42. Morad, N. and Zalzala, A. (1999) Genetic algorithms in integrated process planning and scheduling. J Intell Manuf, 10, 169-181.
43. Rechenberg, I. (1973) Evolutionsstrategie.
44. Shue, L. and Zamani, R. (1999) An intelligent search method for project scheduling problems. J Intell Manuf, 10, 279-288.
45. Tinhofer, G. (1999) Kombinatorische Optimierung, Vorlesungsskriptum.
46. AMETIST (2005) Case Study 4: Value Chain Optimization - Final Report, available at: http://ametist.cs.utwente. nl/INTERNAL/PUBLICATIONS/ DELIVERABLES/del3.4.2.pdf.