Automated bilateral negotiation forms an important type of interaction in agent based systems for electronic commerce; it allows seller and customer to determine the terms and content of the trade iteratively and bilaterally. Consequently, deals may be highly customized (especially for complex...

We consider bargaining in a bipartite network of buyers and sellers, who can only trade with the limited number of people with whom they are connected. Such networks could arise due to proximity issues or restricted communication flows, as with information transmission of job openings, business...

The aim of this study is to investigate the solution algorithm for solving the problem of determining reliable shortest paths in road networks with stochastic travel times. The availability of reliable shortest paths enables travelers, in the face of travel time uncertainty, to plan their trips...

We introduce a journey planning problem in multi-modal transportation networks under uncertainty. The goal is to find a journey, possibly involving transfers between different transport services, from a given origin to a given destination within a specified time horizon. Due to uncertainty in...

Complex information systems are difficult to model and expensive to build. Numerous process modelling methodologies, such as action workflow, data flow diagrams, decision trees, entity relationship diagrams, process maps, role activity diagrams and role interaction nets, have been developed to...

In this paper we propose a hybrid memory adaptive heuristic for solving the Capacitated Minimum Spanning Tree (CMST) problem. We augment the problem formulation with additional non-redundant constraints via use of adaptive memory, to improve upon the performance of an elementary heuristic (the...