Skip to main content
SpringerLink
Log in
Book cover

Computer Aided Systems Theory — CAST '94 pp 423–437Cite as

Illustrating constraint programming systems in logistic planning

  • CAST Tools and Environments
  • Conference paper
  • First Online:

  • 168 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1105))

Abstract

Logistic systems analysts use a wide array of modeling systems such as algebraic and logic programs. Two simple examples show how they mesh as Constraint Logic programs, emphasizing the visual style of formulation. A facility location problem is solved in Prolog. Its standard mathematical programming formulation is then represented in CLP(ℜ) to reach an optimal solution faster. The examples are chosen to raise systemic issues such as model re-use and adaptability that are at the heart of logistic analysis and planning.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • Baker, T.W. and D.J. Biddel, “A Hierarchical/Relational Approach in Modeling”, Chesapeake Decision Sciences, Inc., presented at ORSA/TIMS Joint National Meeting, Miami Beach, 1986.

    Google Scholar 

  • Balas, E., “An Additive Algorithm for Solving Linear Programs with Zero-One Variables”, Operations Research 13, pp. 517–546, 1965.

    Google Scholar 

  • Balas, E., “Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems”, SIAM Journal of Algebraic and Discrete Methods, 6, pp. 466–486, 1985.

    Google Scholar 

  • Balinski, M.L. and P. Wolfe, “On Benders Decomposition and a Plant Location Problem”, Mathematica, ARO-27, 1963.

    Google Scholar 

  • Beale, E.M.L., “Integer Programming”, Computational Mathematical Programming, K. Schittkowski, ed., Springer-Verlag, pp. 1–24, 1985.

    Google Scholar 

  • Bixby, R.E., “Implementing the Simplex Method: The Initial Basis,” ORSA Journal on Computing, 4, pp. 267–284, 1990.

    Google Scholar 

  • Blair, C., R.G. Jeroslow and J. Lowe, “Some Results and Experiments in Programming Techniques for Prepositional Logic”, Computers and OR, 13(5), 1986.

    Google Scholar 

  • Boehning, R.L., R.M. Butler and B.E. Gillet, “A Parallel Integer Linear Programming Algorithm”, European Journal of Operational Research, 34(3), pp. 393–398, 1988.

    Google Scholar 

  • Bonner & Moore Management Science, “RPMS, The Refinery and Petrochemical Modeling System — A System Description”, Houston, 1979.

    Google Scholar 

  • Bowman, E.H., “Production Scheduling by the Transportation Method of Linear Programming”, Operations Research, 4, 1956.

    Google Scholar 

  • Brooke A., D. Kendrick and A. Meeraus, GAMS, A User's Guide, The Scientific Press, Redwood City, Ca., 1988.

    Google Scholar 

  • Burroughs Corporation, “Model Development Language and Report Writer (MODELER), User's manuel”, Detroit Mich, 1980.

    Google Scholar 

  • Cannon, T.L. and K.L. Hoffman, “Large-Scale 0-1 Linear Programming on Distributed Workstations”, Annals of Operations Research, 22(3), pp. 181–217, 1990.

    Google Scholar 

  • Carstens, D., “Parallel processing for large scale linear programming and other applications programs”, presented at ORSA/TIMS joint national meeting, Los Angeles (1978) and IX International Symposium on Mathematical Programming, Montreal 1979.

    Google Scholar 

  • Cheng, Y.C., D.J. Houck, J.-M. Liu, M.S. Meketon, L. Slutsman, R.J. Vanderbei, P. Wang, “The AT&T Korbx System”, AT&T Technical Journal, 68(1), pp. 7–19, 1989.

    Google Scholar 

  • Cho, D. C., E. L. Johnson, M. W. Padberg and M. R. Rao, “On the Incapacitated Plant Location Problem I: Valid Inequalities and Facets”, Mathematics of Operations Research, 8(4), pp. 579–589, 1983.

    Google Scholar 

  • Cho, D. C., M. W. Padberg and M. R. Rao, “On the Uncapacitated Plant Location Problem II: Facets and Lifting Theorems”, Mathematics of Operations Research, 8(4) pp. 590–612, 1983.

    Google Scholar 

  • Clark, K.L. and S.-A. Tärnlund, A First Order Theory of Data and Programs, Proceedings of IFIP, North Holland, pp. 939–944, 1977.

    Google Scholar 

  • Cohen, J., “Constraint Logic Programming Languages”, Communication of the ACM, 33(7), pp. 52–68, 1990.

    Google Scholar 

  • Colmerauer, A., Kanoui, H., Roussel, P. and Pasero, R. Un système de communication homme-machine en français. Rapport préliminaire. Groupe d'Intelligence Artificielle, Université d'Aix-Marseille, 1972.

    Google Scholar 

  • Conery, J.S., Parallel execution of logic programs, Kluwer Academic Publishers, Boston, 1987.

    Google Scholar 

  • Cornuéjols, G. and J.-M. Thizy, “Some Facets of the Simple Plant Location Polytope”, Mathematical Programming, 23 (1), pp. 50–74, 1982.

    Google Scholar 

  • Cunningham, K. and L. Schrage, “The LINGO Modeling Language”, Technical Report, University of Chicago, 1989.

    Google Scholar 

  • Dickson, J.C., “On keeping both storage and I/O requirements low in linear programming”, paper presented to the VII International Symposium on Mathematical Programming, Stanford, CA, 1973.

    Google Scholar 

  • Dutta, A., H. J. Siegel and A. E. Whinston, “On the Application of Parallel Architectures to a Class of Operations Research Problems”, RAIRO Operations Research, 17(4), pp. 317–341, 1983.

    Google Scholar 

  • Dutta, M. and S. Shen, “Parallel Computer Architectures for Combinatorially Hard Problems”, Graduate School of Management, The University of Rochester, ca. 1983.

    Google Scholar 

  • Efroymson, M.A. and T.L. Ray, “A Branch-and-Bound Algorithm for Plant Location”, Operations Research, 14, pp. 361–368, 1966.

    Google Scholar 

  • Forrest, J.J.H., J.P.H. Hirst and J.A. Tomlin, “Practical Solution of Large Mixed Integer Programming Problems with Umpire”, Management Science 20, pp. 736–773, 1974.

    Google Scholar 

  • Foster, I., Systems programming in parallel logic languages, Prentice Hall, New York, 1990.

    Google Scholar 

  • Fourer, R., D.M. Gay, and B.W. Kernighan, “A Modeling Language for Mathematical Programming”, Management Science, pp. 519–554, 1990.

    Google Scholar 

  • Geoffrion, A.M., “Lagrangian Relaxation for Integer Programming”, Mathematical Programming Study, 2, pp. 82–114, 1974.

    Google Scholar 

  • Gregory, S., Parallel Logic Programming in PARLOG — The Language and Its Implementation, Addison-Wesley, 1987.

    Google Scholar 

  • Guignard, M., “Fractional vertices, Cuts and Facets of the Simple Plant Location Problem”, Mathematical Programming Study, 12, pp. 150–162, 1980.

    Google Scholar 

  • Haverly Systems, Inc., MaGen, Denville, NJ, 1977.

    Google Scholar 

  • Haverly Systems, Inc., Omni Linear Programming System: User and Operating Manual, 1st ed. Denville, NJ, 1976.

    Google Scholar 

  • Hirshfeld, D.S., “Mathpro Usage Guide”, Mathpro Inc., 1989.

    Google Scholar 

  • Hogger, C. (1980). “Concurrent logic programming”, in Logic Programming, APIC Studies in Data Processing No. 16, K.L. Clark and S.-A. Tärnlund eds., Academic Press, London, pp. 212–228, 1982.

    Google Scholar 

  • Hooker, J.N., “Resolution vs. Cutting Plane Solution of Inference Problems: Some Computational Experience”, Operations Research Letters, 7(1), pp. 1–7, 1988.

    Google Scholar 

  • Hooker, J.N. and C. Fedjki, “Branch-and-Cut Solution of Inference Problems In Propositional Logic”, Annals of Mathematics and AI, 1, pp. 123–139, 1990.

    Google Scholar 

  • IBM World Trade Corporation, “Matrix Generator and Report Writer (MGRW) Program Reference Manual”, New York, 1972.

    Google Scholar 

  • IBM World Trade Corporation, “IBM Mathematical Programming System Extended/370 (MPSX/370) Program Reference Manual”, 2nd ed., New York and Paris, 1976.

    Google Scholar 

  • IBM Corporation, “Optimization Subroutine Library: Guide and Reference”, Research Triangle Park, NC, 1991.

    Google Scholar 

  • Jaffar, J. and J.L. Lassez, CLP(ℜ), “Constraint Logic Programming”, Proceedings of the Conference on Principles of Programming Languages, Munich, 1987.

    Google Scholar 

  • Jaffar, J., S. Michaylov, P. Stuckey and R. Yap, “The CLP(ℜ) Language and System”, ACM Transactions on Programming Languages 14(3), pp. 339–395, 1992.

    Google Scholar 

  • Jeroslow, R.G., “Computation-oriented Reductions of Predicate to Propositional logic”, Decision Support Systems, 4(2), pp. 183–197, 1988.

    Google Scholar 

  • Jeroslow, R.G., “Logic-based Decision Support; Mixed Integer Model Formulation”, Annals of Discrete Mathematics, 40, 1989.

    Google Scholar 

  • Johnson, L.A. and D.C. Montgomery, Operations Research in Production Planning, Scheduling and Inventory Control, John Wiley and Sons, New York, 1974.

    Google Scholar 

  • Kallio, K., “On Designing LP Interface Structures”, Proceedings of BIFOA Symposium, Szyperski, N. and Grochla, E., eds., Sijthoff & Noordhoff, 1979.

    Google Scholar 

  • Karg, R.L. and G.L. Thompson, “A Heuristic Approach to Solving Traveling Salesman problems”, Management Science, 10, pp. 225–248, 1964.

    Google Scholar 

  • Ketron, Inc., “Dataform Users Manual”, Arlington, Va, 1987.

    Google Scholar 

  • Ketron, Inc., “MPSIII User Manual”, Arlington, Va, 1992.

    Google Scholar 

  • Khumawala, B.M., “An Efficient Heuristic Procedure for the Uncapacitated Warehouse Location Problem”, Naval Research Logistics Quaterly, 20, 109–121, 1973.

    Google Scholar 

  • Kowalski R., Logic for Problem Solving, New York: Elsevier North Holland, 1979.

    Google Scholar 

  • Krabek, C.B., R.J. Sjoquist and D.C. Sommer, “The APEX Systems: Past and Future”, SIGMAP Bull, 29, pp. 3–23, 1980.

    Google Scholar 

  • Marsten, R.E., “The Design of the XMP Linear Programming Library”, ACM Transactions on Mathematical Software 7(4), pp. 481–497, 1981.

    Google Scholar 

  • McKinnon, K.I.M., “Constructing Integer Programming Models in the Predicate Calculus”, Annals of Operations Research, 1988.

    Google Scholar 

  • Mohamed, R.A.K., “Parallel Branch and Bound for Mixed Integer Programming”, Technical Report 92-CSE-10, Department of Computer Science and Engineering, Southern Methodist University, 1992.

    Google Scholar 

  • Morris, J.G., “On the extent to which certain Fixed Charge Depot Location Problems can be solved by LP”, Journal of the Operational Research Society, 29, pp. 71–76, 1978.

    Google Scholar 

  • Murtagh, B.A. and M.A. Saunders, “Large-Scale Linearly Constrained Optimization”, Mathematical Programming 14, pp. 41–72, 1978.

    Google Scholar 

  • Orchard-Hays, W., “History of Mathematical Programming Systems” In Design and Implementation of Optimization Software, Harvey J. Greenberg, ed., Sijthoff & Noordhoff (Alphen aan den Rijn, The Netherlands, pp. 1–26, 1978.

    Google Scholar 

  • Orchard-Hays, W., “Scope of Mathematical Programming Software” Ibid., pp. 27–40.

    Google Scholar 

  • Orchard-Hays, W., “Anatomy of a Mathematical Programming System” Ibid., pp. 41–102.

    Google Scholar 

  • Palmer, K., A Model Management Framework for Mathematical Programming, Wiley, New York, 1984.

    Google Scholar 

  • Pruul, E.A., G.L. Nemhauser and R.A. Rushmeier, “Branch-and-Bound and Parallel Computation: A Historical Note”, Operations Research Letters, 7(2), 1988.

    Google Scholar 

  • Saraswat, V.A. Concurrent Constraint Programming Languages, MIT Press, Cambridge, Ma., 1993.

    Google Scholar 

  • Schrage, L. LINDO, An Optimization Modeling System, The Scientific Press, Redwood City, Ca., 1991.

    Google Scholar 

  • Shapiro, E., Concurrent Prolog — Collected Papers, The MIT Press Series in Logic Programming, Cambridge, Ma., 1987.

    Google Scholar 

  • Simons, R.V., “Mathematical Programming Modeling Using MGG”, IMAJ, Math Management 1, pp. 267–276, 1987.

    Google Scholar 

  • Sperry Univac Computer Systems, “GAMMA 3.4 Programmer Reference”, St Paul, Mn, 1977.

    Google Scholar 

  • Van Hentenryck, P. Constraint Satisfaction in Logic Programming, MIT Press, Cambridge, Ma., 1989.

    Google Scholar 

  • Welch, J.S., Jr., “PAM — A Practioner's Approach to Modeling”, Management Science, 33(5), 1987.

    Google Scholar 

  • Zenios, S.A., S. Nielsen and M. Pinar, “On the use of advanced architecture computers via high-level modeling languages, in The Impact of Recent Computing Advances on Operations Research, pp. 507–518, Operations Research Series 9, Elsevier Science, 1989.

    Google Scholar 

  • Zenios, S.A., “Integrating Network Optimization Capabilities into a High-Level Modeling Language, ACM Transactions on Mathematical Software, 16(2), pp. 113–142, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Systems Science Programme, University of Ottawa, K1N6N5, On, Canada

    Jean-Michel Thizy

Authors
  1. Jean-Michel Thizy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

George J. Klir Tuncer I. Ören

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thizy, JM. (1996). Illustrating constraint programming systems in logistic planning. In: Klir, G.J., Ören, T.I. (eds) Computer Aided Systems Theory — CAST '94. Lecture Notes in Computer Science, vol 1105. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61478-8_93

Download citation

  • DOI: https://doi.org/10.1007/3-540-61478-8_93

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61478-4

  • Online ISBN: 978-3-540-68600-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation