We propose a two-phase Path-Relinking (PR) heuristic for the NP-hard Generalized Assignment Problem. The first phase of the algorithm combines LP-solving, cuts and local search for obtaining a population of solutions with guided diversity. The second phase applies the PR template to the population built at phase one. Both feasible and infeasible solutions are inserted in the reference set durin...

Distributed object computing forms the basis for nextgeneration application middleware. At the heart of distributed object computing are Object Request Brokers (ORBs), which automate many tedious and error-prone distributed programming tasks. Like many other distributed applications, conventional ORBs use statically configured software designs, which are hard to maintain, port, and optimize. Li...

In this paper we present a new evolutionary method for complex-process optimization. It is partially based on principles of the scatter search methodology, but it makes use of innovative strategies to be more effective in the context of complex-process optimization using a small number of tuning parameters. In particular, we introduce a new combination method based on path relinking, which cons...

Metaheuristics are widely employed to solve hard optimization problems, like vehicle routing problems (VRP), for which exact solution methods impractical. In particular, local search-based metaheuristics have been successfully applied the capacitated VRP (CVRP). The CVRP aims at defining minimum-cost delivery routes a given set of identical vehicles since each only travels one route and there i...

A new hybrid metaheuristic method for optimizing the objective function on a parallelepiped set of admissible solutions is proposed. It mimics behavior school river perch when looking food. The algorithm uses ideas several methods: frog-leaping method, migration algorithms, cuckoo and path-relinking procedure. As an application, wide class problems finding optimal control deterministic discrete...

We show how the traditional protocol stack, such as TCP/IP, can be eliminated for socket based high speed communication within a cluster. The SCI shared memory interconnect is used as an example, and we demonstrate how existing applications can utilize the new technology without relinking. This is done by dynamically remapping the TCP/IP socket implementation to our high performance SCILAN sock...

We show how the traditional protocol stack, such as TCP/IP, can be eliminated for socket based high speed communication within a cluster. The SCI shared memory interconnect is used as an example, and we demonstrate how existing applications can utilize the new technology without relinking. This is done by dynamically remapping the TCP/IP socket implementation to our high performance SCILAN sock...

Developing extensible, robust, and efficient distributed systems is a complex task. To help alleviate this complexity, we have developed the ADAPTIVE Service eXecutive (ASX) framework. ASX is an object-oriented framework composed of automated tools and reusable components. These tools and components help to simplify the development, configuration, and reconfiguration of applications in a distri...

Parcel delivery service by collect-on-delivery (COD, a.k.a. cash-on-delivery) companies is a new distribution mode in China. The design of the distribution network of a COD company in urban areas is of great importance and a relatively new research direction. In this paper, we aim to model this distribution network as a two-echelon location routing problem (2E-LRP) and propose a novel efficient...

Developing distributed applications that utilize multiprocessing and network services is a promising technique for increasing system performance, scalability, and cost effectiveness. However, designing and implementing efficient, robust, and extensible multi-threaded client/server applications is a complex and challenging task. The Service Configurator (SVC-CON) framework described in this pape...