1 |
Simulation Study of a Semi-Dynamic AGV-Container Unit Job Deployment SchemeCheng, Yong Leong 01 1900 (has links)
Automated Guided Vehicle (AGV) Container-Job deployment is essentially a vehicle-dispatching problem. In this problem, the impact of vehicle dispatching polices on the ship makespan for discharging and/or loading operations is analyzed. In particular, given a storage location for each container to be discharged from the ship and given the current location of each container to be loaded onto the ship, the problem is to propose an efficient deployment scheme to dispatch vehicles to containers so as to minimize the makespan of the ship so as to increase the throughput. The makespan of the ship refers to the time a ship spends at the port for loading and unloading operations. In this paper, we will compare the performance of current deployment scheme used with the new proposed deployment scheme, both with deadlock prediction & avoidance algorithm done in previous study [1]. The prediction & avoidance algorithm predicts and avoids cyclic deadlock. The current deployment scheme, namely pmds makes use of a greedy heuristics which dispatches the available vehicle that will reach the quay with the minimum amount of time the vehicle has to spend waiting for the crane to discharge/load the container from/onto the ship. The new deployment scheme, namely mcf aims to formulate the problem as a minimum cost flow problem, which will then be solved by network simplex code. The two simulation models are implemented using discrete-event simulation software, AutoMod, and the performances of both deployment schemes are analyzed. The simulation results show that the new deployment scheme will result in a higher throughput and lower ship makespan than the current deployment scheme. / Singapore-MIT Alliance (SMA)
|
2 |
Energy-Aware Key Management in Wireless Ad-Hoc NetworksChang, Chia-Wen 26 July 2006 (has links)
In this thesis, we consider how to reduce the communication cost of the key exchange procedures as many as possible, while the secure group communication can still be achieved. Due to the energy consumption is usually proportional to the distance, we use the shortest paths algorithm to find the shortest communication paths between any pair of the secure group members. We first propose a straightforward heuristic named Minimum-Energy First-Selected ( MEFS ). MEFS tries to select the pair of group members which has less communication cost than all other pairs have at every time. Though MEFS performs better than random selecting, it still has some weakness in solving the energy-aware key management problem. So we use the concept of the minimum cost flow problem, and by appropriate transformation, then we get the optimal solution of the energy-aware key management problem under some constraints. At last, the simulation results proves that the minimum cost flow approach actually works better than MEFS does.
|
3 |
INTERFACE DE ANÁLISE DA INTERCONEXÃO EM UMA LAN USANDO CORBA / Software development (graphical user interface) that makes possible to analyze the interconnection in a LAN (Local Area Network) using CORBA (Common Object Request Broker Architecture)MONTEIRO, Milson Silva 07 June 2002 (has links)
Made available in DSpace on 2016-08-17T14:52:43Z (GMT). No. of bitstreams: 1
Milson Monteiro.pdf: 1924077 bytes, checksum: 78f931b493f756dec0edee7a465e1099 (MD5)
Previous issue date: 2002-06-07 / Conselho Nacional de Desenvolvimento Científico e Tecnológico / This works concern software development (graphical user interface) that makes
possible to analyze the interconnection in a LAN (Local Area Network) using CORBA (Common
Object Request Broker Architecture) on distributed and heterogeneous environment among
several outlying machines. This works presents paradigms of graphs theory: shortest paths
problems (Dijkstra-Ford-Moore-Belman), maximum flow problems (Edmonds-Karp) and
minimum cost flow problems (Busacker-Gowen) to formalize the interface development. We
discoursed on the graphs theory and networks flows that are essentials to guarantee theoretical
insight. / O objeto de estudo deste trabalho é o desenvolvimento de um software (interface
gráfica do usuário) que possibilita analisar a interconexão de uma LAN (Local Area Network)
usando CORBA (Common Object Request Broker Architecture) em ambientes distribuídos e
heterogêneos entre diversas máquinas periféricas. Este trabalho apresenta os paradigmas da teoria
de grafos: menor caminho (Dijkstra, Ford-Moore-Belman), fluxo máximo (Edmonds-Karp) e
fluxo de custo mínimo (Busacker-Gowen) para formalizar o desenvolvimento da interface.
Discorremos sobre a teoria de grafos e fluxos em redes que são relevantes para garantir o
embasamento teórico.
|
Page generated in 0.0612 seconds