Learn More
An intelligent agent-based framework that supports fourth-party logistics (4PL) operations on the web is proposed in this paper. In our system, customers specify job requests over the web dynamically. An e-Market Place allows intelligent third-party logistics (3PL) agents to bid for customers' job requests. The intelligence lies on the e-Market Place to(More)
In the pickup and delivery problem with time windows (PDPTW), vehicles have to transport loads from origins to destinations respecting capacity and time constraints. In this paper, we present a two-phase method to solve the PDPTW. In the first phase, we apply a novel construction heuris tics to generate an initial solution. In the second phase, a tabu(More)
Making software systems service-oriented is becoming the practice, and an increasingly large number of service systems play important roles in today's business and industry. Currently, not enough attention has been paid to the issue of optimization of service systems. In this paper, we argue that the key elements to be considered in optimizing service(More)
We study the problem of finding a length-constrained maximum-density path in a tree with weight and length on each edge. This problem was proposed in [R. Finding a length-constrained maximum-density path in a tree, Journal of Combinatorial Optimization 9 (2005) 147–156] and solved in O(nU) time when the edge lengths are positive integers, where n is the(More)
Researchers have used distributed constraint optimization problems (DCOPs) to model various multi-agent coordination and resource allocation problems. Very recently, Ottens et al. proposed a promising new approach to solve DCOPs that is based on confidence bounds via their Distributed UCT (DUCT) sampling-based algorithm. Unfortunately, its memory(More)
In this paper, we consider the two-dimensional variable-sized bin packing problem (2DVSBPP) with guillotine constraint. 2DVSBPP is a well-known NP-hard optimization problem which has several real applications. A mixed bin packing algorithm (MixPacking) which combines a heuristic packing algorithm with the Best Fit algorithm is proposed to solve the single(More)
This paper is motivated by a recent trend in logistics scheduling, called Available-to-Promise. We model this problem as the multi-period multi-dimensional knapsack problem. We provide some properties for a special case of a single-dimensional problem. Based on insights obtained from these properties, we propose a two-phase heuristics for solving the(More)
Metaheuristic search algorithms due to their heuristic nature usually need tuning of parameters, components and/or strategies to achieve acceptable performance on a particular problem. While there has been much work on tools and techniques to address this Tuning Problem, there has been relatively little work which takes advantage of putting humans in the(More)