Tools for enterprises collaboration in virtual enterprises

Virtual Enterprise (VE) is an organizational collaboration concept which provides a competitive edge in the globalized business environment. The life cycle of a VE consists of four stages i.e. opportunity identification (Pre-Creation), partner selection (Creation), operation and dissolution. The success of VEs depends upon the efficient execution of their VE-lifecycles along with knowledge enhancement for the partner enterprises to facilitate the future formation of efficient VEs. This research aims to study the different issues which occur in the VE lifecycle and provides a platform for the formation of high performance enterprises and VEs. In the pre-creation stage, enterprises look for suitable partners to create their VE and to exploit a market opportunity. This phase requires explicit and implicit information extraction from enterprise data bases (ECOS-ontology) for the identification of suitable partners. A description logic (DL) based query system is developed to extract explicit and implicit information and to identify potential partners for the creation of the VE. In the creation phase, the identified partners are analysed using different risks paradigms and a cooperative game theoretic approach is used to develop a revenue sharing mechanism based on enterprises inputs and risk minimization for optimal partner selection. In the operation phases, interoperability remains a key issue for seamless transfer of knowledge information and data. DL-based ontology mapping is applied in this research to provide interoperability in the VE between enterprises with different domains of expertise. In the dissolution stage, knowledge acquired in the VE lifecycle needs to be disseminated among the enterprises to enhance their competitiveness. A DL-based ontology merging approach is provided to accommodate new knowledge with existing data bases with logical consistency. Finally, the proposed methodologies are validated using the case study. The results obtained in the case study illustrate the applicability and effectiveness of proposed methodologies in each stage of the VE life cycle

Ontology mapping using description logic and bridging axioms

In the last decade various proposals have been made to promote fruitful and efficient collaboration among small and medium sized enterprises (SMEs) in the form of virtual enterprises (VEs). The success of VEs depends on seamless interoperability of knowledge and data sharing. Ontology implementation is becoming an essential and successful tool for VE operation but commonly ontology mapping is also required to achieve interoperability. The current state of the art in ontology mapping indicates that mapping systems require a great deal of human intervention as mapping brings various types of conflicts and inconsistencies. The ontology mapping method proposed in this paper uses description logic (DL) based bridging axioms between the ontologies. Atomic concept level similarity has been taken as input to establish the complex concepts and roles level mapping. Manufacturing and marketing enterprise ontologies are considered and their mapping has been demonstrated as an example of the proposed mapping process. © 2012 Elsevier B.V

Description logic-based knowledge merging for concrete- and fuzzy- domain ontologies

Enterprises, especially virtual enterprises, are nowadays becoming more knowledge intensive and adopting efficient knowledge management systems to boost their competitiveness. The major challenge for knowledge management for virtual enterprises is to acquire, extract and integrate new knowledge with the existing source. Ontologies have been proved to be one of the best tools for representing knowledge with class, role and other characteristics. It is imperative to accommodate the new knowledge in the current ontologies with logical consistencies as it is tedious and costly to construct new ontologies every time after acquiring new knowledge. This article introduces a mechanism and a process to integrate new knowledge into the current system (ontology). Separate methods have been adopted for fuzzy- and concrete-domain ontologies. The process starts by finding the semantic and structural similarities between the concepts usingWordNet and description logic. Description logic–based reasoning is used next to determine the position and relationships between the incoming and existing knowledge. The experimental results provided show the efficacy of the proposed method

Designing multi-period supply chain network considering risk and emission: a multi-objective approach

This research formulates a multi-objective problem (MOP) for supply chain network (SCN) design by incorporating the issues of social relationship, carbon emissions, and supply chain risks such as disruption and opportunism. The proposed MOP includes three conflicting objectives: maximization of total profit, minimization of supply disruption and opportunism risks, and minimization of carbon emission considering a number of supply chain constraints. Furthermore, this research analyses the effect of social relationship levels between different tiers of SCN on the profitability, risk, and emission over the time. In this regard, we focus on responding to the following questions. (1) How does the evolving social relationship affect the objectives of the supply chain (SC)? (2) How do the upstream firms’ relationships affect the relationships of downstream firms, and how these relationships influence the objectives of the SC? (3) How does the supply disruption risk interact with the opportunism risk through supply chain relationships, and how these risks affect the objectives of the SC? (4) How do these three conflicting objectives trade-off? A Pareto-based multi-objective evolutionary algorithm–non-dominated sorting genetic algorithm-II (NSGA-II) has been employed to solve the presented problem. In order to improve the quality of solutions, tuning parameters of the NSGA-II are modulated using Taguchi approach. An illustrative example is presented to manifest the capability of the model and the algorithm. The results obtained evince the robust performance of the proposed MOP