In this paper, we formulate the elevator dispatching problem as a stochastic bilevel optimization problem, where a group of elevators serves a set of transportation requests. In the upper level, the requests are assigned to the elevators. In the lower level, the route for each elevator is solved separately. The lower level problem predicts the optimal system state for a finite planning horizon ...

In this paper, two methods named distance and triangle methods are extended to evaluate the quality of approximation of the Pareto set from solving bi-objective problems. In order to use evaluation methods, a bi-objective problem is needed to define. It is considered the problem of scheduling jobs in a hybrid flow shop environment with sequence-dependent setup times and the objectives of minimi...

We consider the discrete time problem of optimally dispatching a single, nite capacity shuttle in a two terminal system under incomplete state observations. Passengers arrive to each terminal and must be moved to the other terminal. The durations of successive shuttle trips follow a general distribution, but have a lower bound D 1 . There is an information delay of I time units between the two ...

Container terminals, serving as the hubs between container ships and other transportations nodes, are of extreme importance in streamlining the ever increasing global trade. Many different factors affect the service efficiency in container terminals, which inspire great interest in both industrial and academic researches. This work focuses on vehicle dispatching problem which decides, for each ...

Despite their increasing availability on the Internet, networked peer assessment systems lack feasible automatic dispatching algorithm of student's assignments and ultimately inhibit the effectiveness of peer assessment. Therefore, this study presents a reviewer dispatching algorithm capable of supporting networked peer assessment system in order to automatically dispatch student's assignments ...

Local area packetized-power network (LAPPN) provides flexible local power dispatching in the future Energy Internet. With interconnections among multiple LAPPNs, power dispatching can be further extended to intraand inter-LAPPN power interchanges. It becomes a significant issue to schedule the two kinds of power interchanges as, from a system perspective high utilization of available scheduling...

We study an automated container terminal in which Automated Guided Vehicles (AGVs) are used to internally transport containers and Automated Stacking Cranes (ASCs) to store and retrieve containers. In designing container terminals, the terminal management has to consider the choice for interrelated AGV and ASC dispatching rules and the layout of the stack. In this paper, we, therefore, examine ...

The status selection planning system, which has been proposed by our group, is one of planning expert systems. The system uses two kinds of knowledge to solve a problem, that is, dispatching rules and a set of status selection rules. Dispatching rules mean fragmentary and convenient assignment algorithms. In this system, the most promising status from tentative statuses generated by applying th...

In the last years, real-time railway traffic optimization experienced an increasing interest due to the expected growth of traffic and the limited possibilities of enhancing the infrastructure, which ask for a more efficient use of resources and the application of more advanced decision support tools. This paper presents a computerized train dispatching system, called ROMA (Railway traffic Opti...

For finite-buffer manufacturing systems, the major stability issue is ‘deadlock’, rather than ‘bounded-buffer-length stability.’ The paper introduces the concept of ‘system deadlock,’ defined rigorously in Petri net terms, and system operation with uninterrupted part-flow is characterised in terms of the absence of this condition. For a large class of finite-buffer multiclass re-entrant flowlin...