Pub Date : 2009-09-25DOI: 10.1109/LINDI.2009.5258764
Isaac Cano, V. Torra
A feasible solution for a container loading problem is the exact order, position and orientation in which the objects are loaded into the container. However, the more constraints are taken into account, the more complex the problem is. Several algorithms have been proposed to load objects with different shapes and taking into account a few constraints. Nevertheless, most of the approaches restrict the shape to be orthogonal (i.e., standard boxes) and constraints like stability or load bearing strength were not considered. The aim of this paper is to provide an approach to solve the problem of loading orthogonal and non-orthogonal boxes, considering them as polyhedral. In addition, our proposal deals with constraints on the dimensions of the container, whether every box can be rotated in any of the three dimensions, the maximum load bearing strength and also the minimum stability required. To solve the problem with the characteristics mentioned above a data structure is proposed to represent the i-th state of the container's loading process by storing the height values and the remaining load bearing strength of the objects inside the container.
{"title":"Container Loading for Nonorthogonal Objects with Stability and Load Bearing Strength Compliance","authors":"Isaac Cano, V. Torra","doi":"10.1109/LINDI.2009.5258764","DOIUrl":"https://doi.org/10.1109/LINDI.2009.5258764","url":null,"abstract":"A feasible solution for a container loading problem is the exact order, position and orientation in which the objects are loaded into the container. However, the more constraints are taken into account, the more complex the problem is. Several algorithms have been proposed to load objects with different shapes and taking into account a few constraints. Nevertheless, most of the approaches restrict the shape to be orthogonal (i.e., standard boxes) and constraints like stability or load bearing strength were not considered. The aim of this paper is to provide an approach to solve the problem of loading orthogonal and non-orthogonal boxes, considering them as polyhedral. In addition, our proposal deals with constraints on the dimensions of the container, whether every box can be rotated in any of the three dimensions, the maximum load bearing strength and also the minimum stability required. To solve the problem with the characteristics mentioned above a data structure is proposed to represent the i-th state of the container's loading process by storing the height values and the remaining load bearing strength of the objects inside the container.","PeriodicalId":306564,"journal":{"name":"2009 2nd International Symposium on Logistics and Industrial Informatics","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122208003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-09-25DOI: 10.1109/LINDI.2009.5258636
R. Grimm, Thorsten Edelhausser, G. Kókai
We introduce a new method to estimate the position and direction of receiving elements of a Real Time Locating System (RTLS). In an Angle of Arrival (AoA) system, we are able to reconstruct the antenna configuration using measurements at only three reference points. No further prior knowledge is required, and the computations are very lightweight. The localisation procedure is presented and the results of a simulated experiment setup are shown. We discuss possible usage scenarios and advantages of our solution as well as possible extensions.
{"title":"An Efficient Configuration Method for Real Time Locating Systems","authors":"R. Grimm, Thorsten Edelhausser, G. Kókai","doi":"10.1109/LINDI.2009.5258636","DOIUrl":"https://doi.org/10.1109/LINDI.2009.5258636","url":null,"abstract":"We introduce a new method to estimate the position and direction of receiving elements of a Real Time Locating System (RTLS). In an Angle of Arrival (AoA) system, we are able to reconstruct the antenna configuration using measurements at only three reference points. No further prior knowledge is required, and the computations are very lightweight. The localisation procedure is presented and the results of a simulated experiment setup are shown. We discuss possible usage scenarios and advantages of our solution as well as possible extensions.","PeriodicalId":306564,"journal":{"name":"2009 2nd International Symposium on Logistics and Industrial Informatics","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121855259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-09-25DOI: 10.1109/LINDI.2009.5258761
J. García-Nieto, E. Alba, Javier Apolloni
The efficient selection of predictive and accurate gene subsets for cell-type classification is nowadays a crucial problem in Microarray data analysis. The application and combination of dedicated computational intelligence methods holds a great promise for tackling the feature selection and classification. In this work we present a Differential Evolution (DE) approach for the efficient automated gene subset selection. In this model, the selected subsets are evaluated by means of their classification rate using a Support Vector Machines (SVM) classifier. The proposed approach is tested on DLBCL Lymphoma and Colon Tumor gene expression datasets. Experiments lying in effectiveness and biological analyses of the results, in addition to comparisons with related methods in the literature, indicate that our DE-SVM model is highly reliable and competitive. I. INTRODUCTION DNA Microarrays (MA) (13) allow the scientists to simulta- neously analyze thousands of genes, and thus giving important insights about cell's function, since changes in the physio-logy of an organism are generally associated with changes in gene ensembles of expression patterns. The vast amount of data involved in a typical Microarray experiment usually requires to perform a complex statistical analysis, with the important goal of making the classification of the dataset into correct classes. The key issue in this classification is to identify significant and representative gene subsets that may be used to predict class membership for new external samples. Furthermore, these subsets should be as small as possible in order to develop fast and low consuming processes for the future class prediction. The main difficulty in Microarray classification versus other domains is the availability of a relatively small number of samples in comparison with the number of genes in each sample (between 2,000 and more than 10,000 in MA). In addition, expression data are highly redundant and noisy, and of most genes are believed to be uninformative with respect to studied classes, as only a fraction of genes may present distinct profiles for different classes of samples. In this context, machine learning techniques have been applied to handle with large and heterogeneous datasets, since they are capable to isolate the useful information by rejecting redundancies. Concretely, feature selection is often considered as a necessary preprocess step to analyze large datasets, as this method can reduce the dimensionality of the datasets and often conducts to better analyses (9). Feature selection (gene selection in Biology) for gene expression analysis in cancer prediction often uses wrapper classification methods to discriminate a type of tumor (9), (11), to reduce the number of genes to investigate in case of a new patient, and also to assist in drug discovery and early diagnosis. The formal definition of the feature selection problem that we consider here is given as follows:
{"title":"Hybrid DE-SVM Approach for Feature Selection: Application to Gene Expression Datasets","authors":"J. García-Nieto, E. Alba, Javier Apolloni","doi":"10.1109/LINDI.2009.5258761","DOIUrl":"https://doi.org/10.1109/LINDI.2009.5258761","url":null,"abstract":"The efficient selection of predictive and accurate gene subsets for cell-type classification is nowadays a crucial problem in Microarray data analysis. The application and combination of dedicated computational intelligence methods holds a great promise for tackling the feature selection and classification. In this work we present a Differential Evolution (DE) approach for the efficient automated gene subset selection. In this model, the selected subsets are evaluated by means of their classification rate using a Support Vector Machines (SVM) classifier. The proposed approach is tested on DLBCL Lymphoma and Colon Tumor gene expression datasets. Experiments lying in effectiveness and biological analyses of the results, in addition to comparisons with related methods in the literature, indicate that our DE-SVM model is highly reliable and competitive. I. INTRODUCTION DNA Microarrays (MA) (13) allow the scientists to simulta- neously analyze thousands of genes, and thus giving important insights about cell's function, since changes in the physio-logy of an organism are generally associated with changes in gene ensembles of expression patterns. The vast amount of data involved in a typical Microarray experiment usually requires to perform a complex statistical analysis, with the important goal of making the classification of the dataset into correct classes. The key issue in this classification is to identify significant and representative gene subsets that may be used to predict class membership for new external samples. Furthermore, these subsets should be as small as possible in order to develop fast and low consuming processes for the future class prediction. The main difficulty in Microarray classification versus other domains is the availability of a relatively small number of samples in comparison with the number of genes in each sample (between 2,000 and more than 10,000 in MA). In addition, expression data are highly redundant and noisy, and of most genes are believed to be uninformative with respect to studied classes, as only a fraction of genes may present distinct profiles for different classes of samples. In this context, machine learning techniques have been applied to handle with large and heterogeneous datasets, since they are capable to isolate the useful information by rejecting redundancies. Concretely, feature selection is often considered as a necessary preprocess step to analyze large datasets, as this method can reduce the dimensionality of the datasets and often conducts to better analyses (9). Feature selection (gene selection in Biology) for gene expression analysis in cancer prediction often uses wrapper classification methods to discriminate a type of tumor (9), (11), to reduce the number of genes to investigate in case of a new patient, and also to assist in drug discovery and early diagnosis. The formal definition of the feature selection problem that we consider here is given as follows:","PeriodicalId":306564,"journal":{"name":"2009 2nd International Symposium on Logistics and Industrial Informatics","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115803762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-09-25DOI: 10.1109/LINDI.2009.5258763
A. Beham, M. Kofler, Stefan Wagner, M. Affenzeller
This work treats the topic of solving dynamic pickup and delivery problems, also known as dial-a-ride problems. A simulation model is introduced that describes how an agent is able to satisfy the transportation requests. The agent behavior is given in form of a complex dispatching rule, which is optimized by metaheuristic approaches. For this purpose, a fitness function is described which is used to evaluate the quality of a solution. The rule to be optimized is a weighted sum of several primitive dispatching rules where each describes a small part of the information available in the system at a given time. Given a good configuration of the weights, we will show that the agents are able to serve the transportation requests. The optimization of the weights was conducted with the generic, open, and extensible optimization framework HeuristicLab. Index Terms—simulation, pickup and delivery, dispatching, optimization
{"title":"Agent-Based Simulation of Dispatching Rules in Dynamic Pickup and Delivery Problems","authors":"A. Beham, M. Kofler, Stefan Wagner, M. Affenzeller","doi":"10.1109/LINDI.2009.5258763","DOIUrl":"https://doi.org/10.1109/LINDI.2009.5258763","url":null,"abstract":"This work treats the topic of solving dynamic pickup and delivery problems, also known as dial-a-ride problems. A simulation model is introduced that describes how an agent is able to satisfy the transportation requests. The agent behavior is given in form of a complex dispatching rule, which is optimized by metaheuristic approaches. For this purpose, a fitness function is described which is used to evaluate the quality of a solution. The rule to be optimized is a weighted sum of several primitive dispatching rules where each describes a small part of the information available in the system at a given time. Given a good configuration of the weights, we will show that the agents are able to serve the transportation requests. The optimization of the weights was conducted with the generic, open, and extensible optimization framework HeuristicLab. Index Terms—simulation, pickup and delivery, dispatching, optimization","PeriodicalId":306564,"journal":{"name":"2009 2nd International Symposium on Logistics and Industrial Informatics","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121869775","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-09-25DOI: 10.1109/LINDI.2009.5258755
M. Kucharzak, K. Walkowiak
In recent years Peer-to-Peer (P2P) systems gain much attention. Growing popularity in P2P based protocol imple- mentations for file sharing purposes caused that the P2P traffic exceeds Web traffic, once of the dominant traffic on the Internet. In fact of that, the use of P2P systems introduce many new problems related to traffic engineering or network optimization. In accordance to our previous works and defined linear models of flows and routing in system based on P2P architecture, this paper concerns on simulations of file sharing services in overlay-concept P2P network. Corresponding to BitTorrent-based systems be- haviour, in this work we consider different strategies for content distribution applications. We demonstrate the effectiveness of 5 modeled algorithms. Experimentation results compare transfer cost minimization in functions of seed location, "last peer" location and number of seeds in given mesh P2P topologies. For problem instances of small size we provide results with CPLEX solver. Index Terms—P2P, flows, network optimization
{"title":"File Sharing-Based Heuristics for Flow Assignment in P2P Systems","authors":"M. Kucharzak, K. Walkowiak","doi":"10.1109/LINDI.2009.5258755","DOIUrl":"https://doi.org/10.1109/LINDI.2009.5258755","url":null,"abstract":"In recent years Peer-to-Peer (P2P) systems gain much attention. Growing popularity in P2P based protocol imple- mentations for file sharing purposes caused that the P2P traffic exceeds Web traffic, once of the dominant traffic on the Internet. In fact of that, the use of P2P systems introduce many new problems related to traffic engineering or network optimization. In accordance to our previous works and defined linear models of flows and routing in system based on P2P architecture, this paper concerns on simulations of file sharing services in overlay-concept P2P network. Corresponding to BitTorrent-based systems be- haviour, in this work we consider different strategies for content distribution applications. We demonstrate the effectiveness of 5 modeled algorithms. Experimentation results compare transfer cost minimization in functions of seed location, \"last peer\" location and number of seeds in given mesh P2P topologies. For problem instances of small size we provide results with CPLEX solver. Index Terms—P2P, flows, network optimization","PeriodicalId":306564,"journal":{"name":"2009 2nd International Symposium on Logistics and Industrial Informatics","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123171545","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-09-25DOI: 10.1109/LINDI.2009.5258573
P. Gwóźdź, E. Szlachcic
We propose a meta-heuristic based on an evolutionary approach for a Capacitated Vehicle Routing Problem. The modifications concern a selection process and two new heuristics for crossover operators. The numerical results demonstrate the effectiveness of an adaptive selection evolutionary algorithm on the benchmark test problems. The main advantage is the possibility of arranging the proposed selection process and crossover operators in the space of feasible solutions. The presented results are very promising for solving bigger problems. number of customers is large. The largest problems which can be consistently solved by the most effective exact algorithms proposed so far contain about 50 customers, whereas larger instances may be solved only in particular cases. So instances with hundreds of customers, as those arising in practical applications, may only be tackled with heuristic or meta- heuristic methods (12). In meta-heuristics, the emphasis is on performing a deep exploration of the most promising regions of the solution space. The quality of solutions produced by these methods is much better than that obtained by classical heuristic methods. In the paper special attention is paid to meta-heuristics methods with evolutionary mechanisms based on the idea of natural search in biology (5,8,12). Our purpose is to propose an evolutionary search based meta-heuristic idea with modified tournament selection process for CVRP. We will describe an adaptive tournament selection and two new crossover operators for the discussed routing problem.
{"title":"An Adaptive Selection Evolutionary Algorithm for the Capacitated Vehicle Routing Problem","authors":"P. Gwóźdź, E. Szlachcic","doi":"10.1109/LINDI.2009.5258573","DOIUrl":"https://doi.org/10.1109/LINDI.2009.5258573","url":null,"abstract":"We propose a meta-heuristic based on an evolutionary approach for a Capacitated Vehicle Routing Problem. The modifications concern a selection process and two new heuristics for crossover operators. The numerical results demonstrate the effectiveness of an adaptive selection evolutionary algorithm on the benchmark test problems. The main advantage is the possibility of arranging the proposed selection process and crossover operators in the space of feasible solutions. The presented results are very promising for solving bigger problems. number of customers is large. The largest problems which can be consistently solved by the most effective exact algorithms proposed so far contain about 50 customers, whereas larger instances may be solved only in particular cases. So instances with hundreds of customers, as those arising in practical applications, may only be tackled with heuristic or meta- heuristic methods (12). In meta-heuristics, the emphasis is on performing a deep exploration of the most promising regions of the solution space. The quality of solutions produced by these methods is much better than that obtained by classical heuristic methods. In the paper special attention is paid to meta-heuristics methods with evolutionary mechanisms based on the idea of natural search in biology (5,8,12). Our purpose is to propose an evolutionary search based meta-heuristic idea with modified tournament selection process for CVRP. We will describe an adaptive tournament selection and two new crossover operators for the discussed routing problem.","PeriodicalId":306564,"journal":{"name":"2009 2nd International Symposium on Logistics and Industrial Informatics","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114140977","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-09-25DOI: 10.1109/LINDI.2009.5258568
W. Jacak, K. Proell
The paper presents methods that allow an intelligent multiagent system to coordinate and negotiate their actions in order to achieve a common goal.
本文提出了一种允许智能多智能体系统协调和协商它们的行动以达到共同目标的方法。
{"title":"Multiagent Architecture for Intelligent Autonomous Systems","authors":"W. Jacak, K. Proell","doi":"10.1109/LINDI.2009.5258568","DOIUrl":"https://doi.org/10.1109/LINDI.2009.5258568","url":null,"abstract":"The paper presents methods that allow an intelligent multiagent system to coordinate and negotiate their actions in order to achieve a common goal.","PeriodicalId":306564,"journal":{"name":"2009 2nd International Symposium on Logistics and Industrial Informatics","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124301267","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-09-25DOI: 10.1109/LINDI.2009.5258751
G. Kronberger, C. Feilmayr, M. Kommenda, Stephan M. Winkler, M. Affenzeller, T. Burgler
The blast furnace process is the most common form of iron ore reduction. The physical and chemical reactions in the blast furnace process are well understood on a high level of abstraction, but many more subtle inter-relationships between injected reducing agents, burden composition, heat loss in defined wall areas of the furnace, inhomogeneous burden movement, scaffolding, top gas composition, and the effect on the produced hot metal (molten iron) or slag are not totally understood. This paper details the application of data-based modeling methods: linear regression, support vector regression, and symbolic regression with genetic programming to create linear and non-linear models describing different aspects of the blast furnace process. Three variables of interest in the blast furnace process are modeled: the melting rate of the blast furnace (tons of produced hot metal per hour), the specific amount of oxygen per ton of hot metal, and the carbon content in the hot metal. The melting rate is largely determined by the qualities of the hot blast (in particular the amount of oxygen in the hot blast). Melting rate can be described accurately with linear models if data of the hot blast are available. Prediction of the required amount of oxygen per ton of hot metal and the carbon content in the hot metal is more difficult and requires non-linear models in order to achieve satisfactory accuracy.
{"title":"System Identification of Blast Furnace Processes with Genetic Programming","authors":"G. Kronberger, C. Feilmayr, M. Kommenda, Stephan M. Winkler, M. Affenzeller, T. Burgler","doi":"10.1109/LINDI.2009.5258751","DOIUrl":"https://doi.org/10.1109/LINDI.2009.5258751","url":null,"abstract":"The blast furnace process is the most common form of iron ore reduction. The physical and chemical reactions in the blast furnace process are well understood on a high level of abstraction, but many more subtle inter-relationships between injected reducing agents, burden composition, heat loss in defined wall areas of the furnace, inhomogeneous burden movement, scaffolding, top gas composition, and the effect on the produced hot metal (molten iron) or slag are not totally understood. This paper details the application of data-based modeling methods: linear regression, support vector regression, and symbolic regression with genetic programming to create linear and non-linear models describing different aspects of the blast furnace process. Three variables of interest in the blast furnace process are modeled: the melting rate of the blast furnace (tons of produced hot metal per hour), the specific amount of oxygen per ton of hot metal, and the carbon content in the hot metal. The melting rate is largely determined by the qualities of the hot blast (in particular the amount of oxygen in the hot blast). Melting rate can be described accurately with linear models if data of the hot blast are available. Prediction of the required amount of oxygen per ton of hot metal and the carbon content in the hot metal is more difficult and requires non-linear models in order to achieve satisfactory accuracy.","PeriodicalId":306564,"journal":{"name":"2009 2nd International Symposium on Logistics and Industrial Informatics","volume":"7 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133483238","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-09-25DOI: 10.1109/LINDI.2009.5258753
F. N. Beijderwellen, K. Herder, R. Pieters
{"title":"Toward Sustainable Transportation: More as Just Less","authors":"F. N. Beijderwellen, K. Herder, R. Pieters","doi":"10.1109/LINDI.2009.5258753","DOIUrl":"https://doi.org/10.1109/LINDI.2009.5258753","url":null,"abstract":"","PeriodicalId":306564,"journal":{"name":"2009 2nd International Symposium on Logistics and Industrial Informatics","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132266591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-09-25DOI: 10.1109/LINDI.2009.5258686
Wolfgang Seiringer
The production of goods and services has the common target to satisfy the needs of the customers. In contrast to goods, the modeling of services is connected with additional challenges. This involves finding models, which describe the content of services and reflect their complex nature. The complexity is founded on service characteristics like composition, heterogeneity and inheritance. With the growing economic importance of services, the companies need solutions for Service Management. These tools should enable them to describe services, to compare services and to manage them as it is standard for products. Service Management is not only important for companies out of the service sector. To manufacture products different services like engineering or logistics are necessary. In this paper we describe our service modeling approach which is based on two assumptions. The first one relates to the fact that the content of a service is defined by the value for the customer. The second assumption reflects the fact that the content of a service can be described by the entities and their relations, which are necessary to produce it. To get service models we investigate the production process of services and how the provision of services is carried out. We made a first prove of our concept with logistics services of a manufacturing company. The results are described in this paper.
{"title":"Service-Oriented Analysis of Logistics Services","authors":"Wolfgang Seiringer","doi":"10.1109/LINDI.2009.5258686","DOIUrl":"https://doi.org/10.1109/LINDI.2009.5258686","url":null,"abstract":"The production of goods and services has the common target to satisfy the needs of the customers. In contrast to goods, the modeling of services is connected with additional challenges. This involves finding models, which describe the content of services and reflect their complex nature. The complexity is founded on service characteristics like composition, heterogeneity and inheritance. With the growing economic importance of services, the companies need solutions for Service Management. These tools should enable them to describe services, to compare services and to manage them as it is standard for products. Service Management is not only important for companies out of the service sector. To manufacture products different services like engineering or logistics are necessary. In this paper we describe our service modeling approach which is based on two assumptions. The first one relates to the fact that the content of a service is defined by the value for the customer. The second assumption reflects the fact that the content of a service can be described by the entities and their relations, which are necessary to produce it. To get service models we investigate the production process of services and how the provision of services is carried out. We made a first prove of our concept with logistics services of a manufacturing company. The results are described in this paper.","PeriodicalId":306564,"journal":{"name":"2009 2nd International Symposium on Logistics and Industrial Informatics","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133320219","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：