Modified Hungarian Algorithm for Real-Time ALV Dispatching Problem in Huge Container Terminals

Abstract

It is a fundamental decision making process in container terminals to allocate container transporting works among ALVs. Nowadays, container terminals tend to be larger in storage space and more efficient in handling. As a result, estimations of ALV travel times could be inaccurate, the scale of ALV work allocation could be quite large, and a fixed handling sequence could be hardly ensured beforehand. Hence, it is presented a real-time dispatching method, consisting of an allocation model for instantaneous ALV dispatching, and a set of events which trigger a new instantaneous dispatching. A modified Hungarian Algorithm is applied to solve the instantaneous dispatching model, and it is verified that the modified Algorithm outperforms the original one, even CPLEX, in solving these allocation problems.

How to Reduce Software Development Cost with Personnel Assignment Optimization

“…Typically, AP can be classified as balanced AP and unbalanced AP. Although several mathematical methods have been proposed for balanced AP, HA is widely reported as the preferred solution for many real-life problems, such as transportation problems [25], dispatching problems [4], the set-classification task [19], and resource allocation problems [23]. Concerning unbalanced AP, Lin and Wen solved it using fuzzy interval number costs by applying a labeling algorithm [21], while Kadhirvel and Balamurugan adopted triangle fuzzy numbers in [15] [13].…”

“…However, unlike other applications of unbalanced AP, the developer-task assignment problem in software development and management is characterized as follows: (1) developers and tasks are pre-specified and remain unchanged within one stage of the SDLC. For a software manager, switching mid-stage developers from one task to another would most likely delay the delivery of a piece of software and even cause additional development cost; (2) in one SDLC stage or in a defined period of time during a given stage, one developer is responsible for only one task to guarantee best performance in the specified task; (3) each developer must be assigned to one task to assure his/her involvement in the given SDLC stage; (4) developers are encouraged to be relatively equally distributed in each task to maintain higher efficiency of software development. The traditional Hungarian Algorithm (HA) was originally proposed for balanced AP, and has been improved to solve unbalanced AP in the area of transportation research [25] and resource allocation optimization [23].…”