Browsing by Subject "discrete decision process"

Now showing 1 - 2 of 2

Access status: Open Access ,
Algorytm planowania tras dostaw dla wielu komiwojażerów
(Wydawnictwa AGH, 2010) Dutkiewicz, Lidia; Kucharska, Edyta
The aim of the article is presenting a heuristic algorithm for NP-hard problem of planning delivery routes to multi-branch firms. This problem is a modification of well-known multiple TSP problem with additional constrains related to need of visiting some cities to make other ones available. The algebraic-logical model of the given problem is presented in the article. The proposed algorithm is based on the optimization task substituting method which uses general scheme of an algebraic-logical model. Characteristic elements of the algorithm are described: transitional goals, its priorities and way of choosing in each state a number of the goals to be accomplished. Results of experiment are also presented.
Access status: Open Access ,
Model algebraiczno-logiczny problemu planowania tras dostaw dla m komiwojażerów
(Wydawnictwa AGH, 2008) Dutkiewicz, Lidia; Kucharska, Edyta
In the article a concept of algebraic-logical model for problem of planning delivery routes to multi-branch companies. This problem is a modification of the well-known m-TSP problem. The algebraic-logical model corresponds to a formal representation of a multistage decision process connected with simulation of a discrete process. There are presented: a state of the system, a set of goal states and a set of not-admissible states. For the current state of the system there are introduced some sets of system elements with analogous features, which are useful in defining other components of the system. There are also specified: a notion of the decision, a set of possible decisions and a set of admissible decisions. Components of the transition function are given: a method of identifying a moment of the next process state and a method of determining values of coordinates of the next state.