Visiplan: A knowledge-based modelling tool

Author(s): M. Sepúlveda ; M. Nussbaum ; P. Levys
DOI: 10.1049/ip-cta:19960088

For access to this article, please select a purchase option:

Buy article PDF

Buy Knowledge Pack

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership

Recommend Title Publication to library

IEE Proceedings - Control Theory and Applications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Author(s): M. Sepúlveda ¹ ; M. Nussbaum ¹ ; P. Levys ¹
- Affiliations: 1: School of Engineering, Computer Science Department, Catholic University of Chile, Santiago 22, Chile
Source: Volume 143, Issue 1, January 1996, p. 73 – 84
DOI: 10.1049/ip-cta:19960088 , Print ISSN 1350-2379, Online ISSN 1359-7035

The paper presents Visiplan, a knowledge-based modelling language that is applied to resource allocation and sequencing problems. Expert knowledge is encapsulated throughout the whole modelling and problem solving process. This enables the user's effort to be targetted at defining what he or she wishes to solve (i.e. the problem) but not how to solve it (i.e. not the implementation details behind the optimisation technique). Approximation methods that mix artificial intelligence and operation research techniques are successfully used for solving combinatorial problems. The key elements of this approach are combined in a tool appropriate for solving resource allocation and sequencing problems.

References

1. 1)
  - Nussbaum, M., Ghidini, R., Sepúlveda, M.: `VISIPLAN: An expert system foroptimization problems', 3rd Pacific Rim international conference on Artificial Intelligence, 1994, Beijing, China.
2. 2)
  - T. Sager , S. Lin . A pruning procedure for exact graph coloring. ORSA J. Comp. , 3 , 226 - 230
3. 3)
  - K. Vishwanathan , A. Bagchi . Best-first search methods for constrained two-dimensionalcutting stock problems. Oper. Res. , 4 , 30 - 31
4. 4)
  - J. Bean . Genetic algorithms and randoms keys for sequencing and optimization. ORSA J. Comput. , 2 , 154 - 160
5. 5)
  - F. Glover . Tabu search. Part II. ORSA J. Comput. , 1 , 4 - 32
6. 6)
  - C. Papadimitriou , K. Steiglitz . Combinatorial optimization: algorithms and complexity.
7. 7)
  - A. Geoffrion . FW/SM: a prototype structured modeling environment. Manage. Sci. , 1513 - 1538
8. 8)
  - D. Applegate , W. Cook . A computational study of the job-shop scheduling problem. ORSA J. Comput. , 2 , 149 - 156
9. 9)
  - J. Stern . Simulated annealing with a temperature-dependent penalty function. ORSA J. Comput. , 3 , 311 - 319
10. 10)
  - L. Lu , M. Posner . An NP-hard open shop scheduling problem with polynomialaverage time complexity. Math. Oper. Res. , 1 , 12 - 38
11. 11)
  - Sepúlveda, M., Nussbaum, M., Laval, E.: `A shell for approximation methods', 3rd Pacific Rim international conference on Artificial Intelligence, 1994, Beijing, China.
12. 12)
  - A. Geoffrion . The formal aspects of structured modeling. Oper. Res. , 1 , 30 - 51
13. 13)
  - E. Lawler . Recent results in the theory of machine scheduling. Mathematical programming. The State of Art , 202 - 233
14. 14)
  - P. Horner . Where do we go from here? A candid look at careers, conflicts and crisesin thefield of OR/MS. OR/MS Today , 2 , 20 - 30
15. 15)
  - H. Simon . Artificial intelligence: Where has it been, and where is it going?. IEEE Trans. Knowl. Data Eng. , 2 , 128 - 135
16. 16)
  - J. Leung , G. Young . Minimazing total tardiness on a single machine with precedenceconstraints. ORSA J. Comput. , 4 , 346 - 352
17. 17)
  - A. Geoffrion . Introduction to structured modeling. Manage. Sci. , 547 - 588
18. 18)
  - A. Schilkrut , D. Wurmann . (1993) Desarollo de modelos matemáticos aplicados al transporteen el sector forestal.
19. 19)
  - S. Kirkpatrick , C.D. Gelatt , M.P. Vecchi . Optimization by simulated annealing. Science , 671 - 680
20. 20)
  - F. Murphy , E. Store , P. Ma . Composition rules for building linear programmingmodels from component models. Manage. Sci. , 7 , 948 - 963
21. 21)
  - W. Spangler . The role of artificial intelligence in understanding the strategic decision-makingprocess. IEE Trans. Knowl. Data Eng. , 2 , 149 - 159
22. 22)
  - U. Faigle , W. Kern . Some convergence results for probabilistic tabu search. ORSA J. Comput. , 1 , 32 - 37
23. 23)
  - F. Glover , H. Greenberg . New approaches for heuristic search: a bilateral linkagewith artificial intelligence. Europ. J. Oper. Res. , 2 , 119 - 130
24. 24)
  - F. Glover . Tabu search. Part I. ORSA J. Comput. , 3 , 190 - 206
25. 25)
  - G.B. Dantzig . (1963) Linear programming and extensions.
26. 26)
  - D.E. Goldberg . (1999) Genetic algorithms in search, optimization and machine learning.
27. 27)
  - S. Raghunathan , J. Ramayya . MODFORM: a knowledge-based tool to support themodeling process. Inf. Syst. Res. , 4 , 331 - 358
28. 28)
  - A. Geoffrion . The SML language for structured modeling. Levels 1,2,3,4. Oper. Res. , 1 , 38 - 75
29. 29)
  - W. Clancey . Model construction operators. Artif. Intell. , 1 , 1 - 115
30. 30)
  - P. Van Laarhoven . Job shop scheduling by simulated annealing. Oper. Res. , 1 , 113 - 125
31. 31)
  - B. Rich . (1983) Artificial intelligence.

Visiplan: A knowledge-based modelling tool

Visiplan: A knowledge-based modelling tool

Buy article PDF

Buy Knowledge Pack

Thank you

References

Related content