DINAS: Computer-assisted system for multi-criteria transportation and location analyses
DINAS (Dynamic Interactive Network Analysis System) is an interactive system to aid in the solution of various multiobjective transportation problems with facility location. DINAS utilizes an extension of the reference point approach for interactive handling multiple objectives. In this approach the decision-maker forms his requirements in terms of aspiration and reservation levels, i.e., he specifies acceptable and required values for given objectives. A special solver was developed to provide DINAS with solutions to single-objective problems. It is based on the branch and bound scheme with a pioneering implementation of the simplex special ordered network (SON) algorithm with implicit representation of the simple and variable upper bounds (SUB & VUB). DINAS is prepared for IBM-PC XT/AT or compatibles as a menu-driven and easy in usage system equipped with a special network editor which reduces to minimum effort associated with data input for real-life problems.
KeywordsFacility Location Efficient Solution Transportation Problem Implicit Representation Cost Coefficient
Unable to display preview. Download preview PDF.
- F. Glover and D. Klingman, "The simplex SON method for LP/embedded network problems". Mathematical Programming Study 15 (1981) 148–176.Google Scholar
- W.Ogryczak, K.Studzinski and K.Zorychta, "Dynamic Interactive Network Analysis System DINAS Version 2.1 (1988): User's Manual". WP-88-114, IIASA, Laxenburg 1988.Google Scholar
- W. Ogryczak, K. Studzinski and K. Zorychta, "A solver for the multiobjective transshipment problem with facility location". European Journal of Operational Research, 43 (1989) 53–64.Google Scholar
- W. Ogryczak, K. Studzinski, K. Zorychta: A Generalized Reference Point Approach to Multiobjective Transshipment Problem with Facility Location, in: Aspiration Based Decision Support Systems — Theory, Software and Applications, A. Lewandowski and A. Wierzbicki (eds.), Lecture Notes in Economics and Mathematical Systems 331, Springer Verlag, Berlin, New York 1989, pp.t213–229.Google Scholar
- L. Schrage, "Implicit representation of variable upper bounds in linear programming". Mathematical Programming Study 4 (1975) 118–132.Google Scholar
- A.P. Wierzbicki, "A mathematical basis for satisficing decision making". Math. Modelling 3 (1987) 391–405.Google Scholar