C D Waters. A solution procedure for the vehicle-scheduling problem based on iterative route improvement. Journal of the Operational Research Society, 38(9):833--839, 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Issues in Automated Negotiation and Electronic Commerce.. - Sandholm, Lesser (1995) (122 citations) (Correct)
....other tasks: there may be local optima, where no transfer of a single task between agents enhances the global solution, but transferring a larger set of tasks simultaneously does. The need for larger transfers is well known in centralized iterative refinement optimization [ Lin and Kernighan, 1971; Waters, 1987 ] but has been generally ignored in automated negotiation. TRACONET extended the CNP to handle task interactions by having the announcer cluster tasks into sets to be negotiated atomically. Alternatively, the bidder could have done the clustering by counterproposing. Our protocol generalizes ....
C D Waters. A solution procedure for the vehicle-scheduling problem based on iterative route improvement. Journal of the Operational Research Society, 38(9):833--839, 1987.
An Implementation of the Contract Net Protocol Based on Marginal .. - Sandholm (1993) (112 citations) (Correct)
....negotiations are directed in the opportunistic. When the number of vehicles is small, this approach does work, though. An example is given in (McElroy et al. 1989) where automatically guided vehicles transport items inside a factory. 3 Centralized versions of iterative routing are discussed in (Waters 1987) and (Wong Beasley 1984) 4 The system is implemented in an object oriented fashion using the C language and the X11 Window System on a network of HP 9000 workstations. Each agent is implemented as one HP UX (UNIX) process. The agents negotiate over the file system and share no memory. sense ....
Waters, C.D. 1987. A solution procedure for the vehiclescheduling problem based on iterative route improvement.
Contract Types for Satisficing Task Allocation: I Theoretical.. - Sandholm (1998) (21 citations) (Correct)
....This leads to C contracts avoiding some of the local optima of O contracts (O contract also avoid some of the local optima of C contracts) This issue is formalized later in Thrm 8. The need for larger transfers is well known in centralized iterative refinement optimization (Lin Kernighan 1971; Waters 1987), but has been historically ignored in automated negotiation. Recently, the TRACONET system extended the contract net to handle task interactions by having the announcer cluster tasks into sets to be negotiated atomically (Sandholm 1993) Alternatively, the bidder could have done the clustering by ....
Waters, C. D. 1987. A solution procedure for the vehiclescheduling problem based on iterative route improvement.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC