11,778 research outputs found

    Web Services Support for Dynamic Business Process Outsourcing

    Get PDF
    Outsourcing of business processes is crucial for organizations to be effective, efficient and flexible. To meet fast-changing market conditions, dynamic outsourcing is required, in which business relationships are established and enacted on-the-fly in an adaptive, fine-grained way unrestricted by geographic distance. This requires automated means for both the establishment of outsourcing relationships and for the enactment of services performed in these relationships over electronic channels. Due to wide industry support and the underlying model of loose coupling of services, Web services increasingly become the mechanism of choice to connect organizations across organizational boundaries. This paper analyzes to which extent Web services support the dynamic process outsourcing paradigm. We discuss contract -based dynamic business process outsourcing to define requirements and then introduce the Web services framework. Based on this, we investigate the match between the two. We observe that the Web services framework requires further support for cross - organizational business processes and mechanisms for contracting, QoS management and process-based transaction support and suggest ways to fill those gaps

    A multi-agent platform for auction-based allocation of loads in transportation logistics

    No full text
    This paper describes an agent-based platform for the allocation of loads in distributed transportation logistics, developed as a collaboration between CWI, Dutch National Center for Mathematics and Computer Science, Amsterdam and Vos Logistics Organizing, Nijmegen, The Netherlands. The platform follows a real business scenario proposed by Vos, and it involves a set of agents bidding for transportation loads to be distributed from a central depot in the Netherlands to different locations across Germany. The platform supports both human agents (i.e. transportation planners), who can bid through specialized planning and bidding interfaces, as well as automated, software agents. We exemplify how the proposed platform can be used to test both the bidding behaviour of human logistics planners, as well as the performance of automated auction bidding strategies, developed for such settings. The paper first introduces the business problem setting and then describes the architecture and main characteristics of our auction platform. We conclude with a preliminary discussion of our experience from a human bidding experiment, involving Vos planners competing for orders both against each other and against some (simple) automated strategies

    Cloud service localisation

    Get PDF
    The essence of cloud computing is the provision of software and hardware services to a range of users in dierent locations. The aim of cloud service localisation is to facilitate the internationalisation and localisation of cloud services by allowing their adaption to dierent locales. We address the lingual localisation by providing service-level language translation techniques to adopt services to dierent languages and regulatory localisation by providing standards-based mappings to achieve regulatory compliance with regionally varying laws, standards and regulations. The aim is to support and enforce the explicit modelling of aspects particularly relevant to localisation and runtime support consisting of tools and middleware services to automating the deployment based on models of locales, driven by the two localisation dimensions. We focus here on an ontology-based conceptual information model that integrates locale specication in a coherent way

    Multi Agent Systems in Logistics: A Literature and State-of-the-art Review

    Get PDF
    Based on a literature survey, we aim to answer our main question: “How should we plan and execute logistics in supply chains that aim to meet today’s requirements, and how can we support such planning and execution using IT?†Today’s requirements in supply chains include inter-organizational collaboration and more responsive and tailored supply to meet specific demand. Enterprise systems fall short in meeting these requirements The focus of planning and execution systems should move towards an inter-enterprise and event-driven mode. Inter-organizational systems may support planning going from supporting information exchange and henceforth enable synchronized planning within the organizations towards the capability to do network planning based on available information throughout the network. We provide a framework for planning systems, constituting a rich landscape of possible configurations, where the centralized and fully decentralized approaches are two extremes. We define and discuss agent based systems and in particular multi agent systems (MAS). We emphasize the issue of the role of MAS coordination architectures, and then explain that transportation is, next to production, an important domain in which MAS can and actually are applied. However, implementation is not widespread and some implementation issues are explored. In this manner, we conclude that planning problems in transportation have characteristics that comply with the specific capabilities of agent systems. In particular, these systems are capable to deal with inter-organizational and event-driven planning settings, hence meeting today’s requirements in supply chain planning and execution.supply chain;MAS;multi agent systems

    An agent-based framework for selection of partners in dynamic virtual enterprises

    Get PDF
    Advances in computer networking technology and open system standards have made practically feasible to create and manage virtual enterprises. A virtual enterprise, VE, is usually defined as a temporary alliance of enterprises that come together to share their skills, core competencies, and resources in order to better respond to business opportunities, and whose cooperation is supported by computer networks. The materialization of this paradigm, although enabled by recent advances in communication technologies, computer networks and logistics, requires an appropriate architectural framework and support tools. In this paper we propose an agent-based model of a dynamic VE to support the different selection processes that are used in selecting the partners for a dynamic VE, where the partners of a VE are represented by agents. Such a framework will form the basis for tools that provide automated support for creation, and operation, of dynamic virtual enterprises

    Efficient Communication in Agent-based Autonomous Logistic Processes

    Get PDF
    Transportation of goods plays a vital role for the success of a logistics network. The ability to transport goods quickly and cost effectively is one of the major requirements of the customers. Dynamics involved in the logistics process like change or cancellation of orders or uncertain information about the orders add to the complexity of the logistic network and can even reduce the efficiency of the entire logistics process. This brings about a need of integrating technology and making the system more autonomous to handle these dynamics and to reduce the complexity. Therefore, the distributed logistics routing protocol (DLRP) was developed at the University of Bremen. In this thesis, DLRP is extended with the concept of clustering of transport goods, two novel routing decision schemes and a negotiation process between the cluster of goods and the vehicle. DLRP provides the individual logistic entities the ability to perform routing tasks autonomously e.g., discovering the best route to the destination at the given time. Even though DLRP seems to solve the routing problem in real-time, the amount of message flooding involved in the route discovery process is enormous. This motivated the author to introduce a cluster-based routing approach using software agents. The DLRP along with the clustering algorithm is termed as the cluster-based DLRP. In the latter, the goods are first clustered into groups based on criteria such as the common destination. The routing is now handled by the cluster head rather than the individual transport goods which results in a reduced communication volume in the route discovery. The latter is proven by evaluating the performance of the cluster-based DLRP approach compared to the legacy DLRP. After the routing process is completed by the cluster heads, the next step is to improve the transport performance in the logistics network by identifying the best means to transport the clustered goods. For example, to have better utilization of the transport capacity, clusters can be transported together on a stretch of overlapping route. In order to make optimal transport decisions, the vehicle calculates the correlation metric of the routes selected by the various clusters. The correlation metric aids in identifying the clusters which can be transported together and thereby can result in better utilization of the transport resources. In turn, the transportation cost that has to be paid to the vehicle can be shared between the different clusters. The transportation cost for a stretch of route is calculated by the vehicle and offered to the cluster. The latter can decide based upon the transportation cost or the selected route whether to accept the transport offer from the vehicle or not. In this regard, different strategies are developed and investigated. Thereby a performance evaluation of the capacity utilization of the vehicle and the transportation cost incurred by the cluster is presented. Finally, the thesis introduces the concept of negotiation in the cluster based routing methods. The negotiation process enhances the transport decisions by giving the clusters and the vehicles the flexibility to negotiate the transportation cost. Thus, the focus of this part of the thesis is to analyse the negotiation strategies used by the logistics entities and their role in saving negotiation time while achieving a favorable transportation cost. In this regard, a performance evaluation of the different proposed strategies is presented, which in turn gives the logistics practitioners an overview of the best strategy to be deployed in various scenarios. Clustering of goods aid in the negotiation process as on the one hand, a group of transport goods have a stronger basis for negotiation to achieve a favorable transportation price from the vehicle. On the other hand it makes it easier for the vehicle to select the packages for transport and helps the vehicle to operate close to its capacity. In addition, clustering enables the negotiation process to be less complex and voluminous. From the analytical considerations and obtained results in the three parts of this thesis, it can be concluded that efficient transport decisions, though very complex in a logistics network, can be simplified to a certain extent utilizing the available information of the goods and vehicles in the network

    Privacy Management Service Contracts as a New Business Opportunity for Operators

    Get PDF
    Recognizing the importance of privacy management as a business process and a business support process, this paper proposes the use of service level agreements (SLA’s) around privacy features, including qualitative and quantitative ones. Privacy metrics are defined by both parties with boundary values on each qualitative or qualitative feature. Their distribution is relying on stress distributions used in this field. The use of service level agreements also casts privacy management into a business perspective with benefits and costs to either party in a process. This approach is especially relevant for communications operators as brokers between content owners (individuals, businesses) and enterprise applications; in this context, the privacy SLA management would be carried out by the operator, while the terms and conditions of the SLA negotiation reside with the two external parties. This work was carried out as part of the large EU project PRIME www.prime.project.eu.org. on privacy enhancing technologies.Content Owners;Enterprise Business Processes;Managed Service Contracts;Privacy Agreements;Service Level Agreements (SLA's);Telecommunications Operators

    Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems

    Get PDF
    We consider the real-time scheduling of full truckload transportation orders with time windows that arrive during schedule execution. Because a fast scheduling method is required, look-ahead heuristics are traditionally used to solve these kinds of problems. As an alternative, we introduce an agent-based approach where intelligent vehicle agents schedule their own routes. They interact with job agents, who strive for minimum transportation costs, using a Vickrey auction for each incoming order. This approach offers several advantages: it is fast, requires relatively little information and facilitates easy schedule adjustments in reaction to information updates. We compare the agent-based approach to more traditional hierarchical heuristics in an extensive simulation experiment. We find that a properly designed multiagent approach performs as good as or even better than traditional methods. Particularly, the multi-agent approach yields less empty miles and a more stable service level

    Agent-based transportation planning compared with scheduling heuristics

    Get PDF
    Here we consider the problem of dynamically assigning vehicles to transportation orders that have di¤erent time windows and should be handled in real time. We introduce a new agent-based system for the planning and scheduling of these transportation networks. Intelligent vehicle agents schedule their own routes. They interact with job agents, who strive for minimum transportation costs, using a Vickrey auction for each incoming order. We use simulation to compare the on-time delivery percentage and the vehicle utilization of an agent-based planning system to a traditional system based on OR heuristics (look-ahead rules, serial scheduling). Numerical experiments show that a properly designed multi-agent system may perform as good as or even better than traditional methods
    corecore