In this paper, we report on the application of systems engineering in initiating synthesis a participatory planning support system (PSS) for sustainable regional planning. The SPADE approach is applied model-based fashion to define and link development goals (SDGs) urban policies co-creative multi-stakeholder environment. demonstrated through case study from interregional climate, land-use, tra...

Reader network planning (RNP) problem of radio frequency identification (RFID) system is a combinational optimization problem. In this study, we propose a genetic algorithm (GA) to solve this RNP problem. We have tested the proposed GA on several RNP problems and compare with a particle swarm optimization (PSO) method by solving the same RNPs. The comparison results demonstrate that the propose...

The Vehicle Routing Problem (VRP) is a classical problem in Operations Research. It is a generalisation of the Travelling Salesman Problem in which a set of locations must be visted by one of a number of vehicles. All vehicles start and end at a depot location. The aim of the problem is to minimise the total distance covered by the trucks. There are many different variants of the VRP. For examp...

T h i s paper i s concerned w i t h a p l a n n i n g system f o r a r o b o t w i t h a hand and an eye w h i c h can m a n i p u l a t e b l o c k s . Two d i f f e r e n t k i n d s o f p r o b l e m s o l v e r s a r e used . One i s m a i n l y composed of a theorem p r o v e r based on t h e r e s o l u t i o n p r i n c i p l e , and the o t h e r c o n s i s t s o f a theorem p r o v e ...

Mark planning is one of the most important planning processes in garment industry. The major function is to generate a set of markers which is used as cutting guidelines or cutting templates in a cutting process. In other words, this process can be seen as a planning step of a cutting process which determines what sequence and how many parts will be cut. For the academic point of view, mark pla...

Planning is traditionally associated with the search for sequences of actions spread over time. In this paper we present a component placement problem (CPP), which is concerned with sequences of actions spread in the space of wide-area networks. We argue that, despite the lack of a time component, the CPP is a planning problem. We discuss complexity of the CPP and similarities between the CPP a...

(a) A policy of just playing item 3. This policy has depth 1. (b) A policy that plays item 2 first. If it is small, it plays item 1 whereas if it is large it plays item 3. After this, the final item is determined due to the fact that there are only 3 items in the problem. This policy has depth 2. Figure 4: Examples of policies in the simple 3 item, 2 sizes stochastic knapsack problem. Each blue...

The curfew planning problem is to design an annual timetable for railway track maintenance teams. Each team is capable of handling certain types of repairs and replacement jobs. The jobs are combined into a set of projects according to their locations and types. The timetable shows which project should be worked on by each team on a weekly basis throughout an entire year. Our objective is to de...

We introduce the Fortunate Artists Media Empire (FAME) problem domain to study approaches for solving key challenges in distributed planning such as dynamic environments, dynamic goals, uncertainty of actions and scalability. FAME is an artificial problem domain that allows us to focus on key domain-independent research issues. The FAME problem domain is focused on broadcast quality monitoring ...