MDMoshe Dror

Moshe Dror

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Moshe Dror has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Randomized distributed access to mutually exclusive resources

    by Moshe Dror, Bruce Hartman, Gary Knotts, Daniel Zeng

    Many systems consist of a set of agents which must acquire exclusive access to resources from a shared pool. Coordination of agents in such systems is often implemented in the form of a centralized mechanism. The intervention of this type of mechanism, however, typically introduces significant computational overhead and reduces the amount of concurrent activity. Alternatives to centralized mechanisms exist, but they generally suffer from the need for extensive interagent communication. In this paper, we develop a randomized approach to make multiagent resource-allocation decisions with the objective of maximizing expected concurrency measured by the number of the active agents. This approach does not assume a centralized mechanism and has no need for interagent communication. Compared to existing autonomous-decentralized-decision-making (ADDM)-based approaches for resource-allocation, our work emphasizes achieving the highest degree of agent autonomy and is able to handle more general resource requirements.


  • Agent-based project scheduling: computational study of large problems

    by Gary Knotts, Moshe Dror

    We present in this paper the results of a computational study for project scheduling based on new ideas for project representation taken from digital circuit technology (Knotts et al. , 1998a) and a solution approach based on the artificial intelligence notion of agent technology. We experimented with projects with up to 10 000 stochastic duration activities which can be executed in a number of modes requiring renewable, nonrenewable, and periodically renewable resources. This study is about agent implementation in a project scheduling domain. It compares agent types and priority rules with respect to their impact on project schedule duration and computational performance. This work demonstrates: (i) that artificial intelligence concepts of agent technology can be successfully implemented for project scheduling; and (ii) in conducting project scheduling studies we can experiment successfully with large project networks. Both points made in this research are new.


  • Polygon plate-cutting with a given order

    by Moshe Dror

    This note is a complement to the paper by Hoeft and Palekar [1] which describes the problem of cutting polygonal shapes from large plates of metal or glass. More specifically, we focus on polynomial time solvability for a number of subproblems of the more general plate-cutting problem. A primary result of this note is the polynomial time solvability for the plalecutting problem with a given order and convex polygons.


  • A branch and cut algorithm for the VRP with satellite facilities

    by Jonathan F. Bard, Liu Huang, Moshe Dror, Patrick Jaillet

    An important aspect of the vehicle routing problem (VRP) that has been largely overlooked is the use of satellite facilities to replenish vehicles during a route. When possible, satellite replenishment allows the drivers to continue making deliveries until the close of their shift without necessarily returning to the central depot. This situation arises primarily in the distribution of fuels and certain retail items. When demand is random, optimizing customer routes a priori may result in significant additional costs for a particular realization of demand. Satellite facilities are one way of safeguarding against unexpected demand. This paper presents a branch and cut methodology for solving the VRP with satellite facilities subject to capacity and route time constraints. We begin with a mixed-integer linear programming formulation and then describe a series of valid inequalities that can be used to cut off solutions to the linear programming relaxation. Several separation heuristics are then outlined that are used to generate the cuts. Embedded in the methodology is a VRP heuristic for finding good feasible solutions at each stage of the computations. Results are presented for a set of problems derived from our experience with a leading propane distributor.