Please use this identifier to cite or link to this item:
|Title:||A Comparative Study of Dynamic Multi Zone Dispatching Via Dynamic Programming and Simulated Annealing Algorithms||Authors:||Luangpaiboon, P.
|Issue Date:||2007||Publisher:||University of the Thai Chamber of Commerce||Source:||P. Luangpaiboon, P. Suwanwatin (2007) A Comparative Study of Dynamic Multi Zone Dispatching Via Dynamic Programming and Simulated Annealing Algorithms.||Conference:||Proceedings of the 2nd International Conference on Operations and Supply Chain Management||Abstract:||The use of dynamic multi zone dispatching problem(DMZD) is an alternative way for increasing theefficiency of transportation management system. Thisproblem concentrates on the quantities of inbound andoutbound in each area. The factors of the rearrangementpenalty of the area, in each zone, including time periodsare also considered. The objective of this research is tomanage zones with minimal imbalance scenario.Dynamic Programming (DPA) and Simulated Annealing(SAA) algorithms have been used for solving thistransportation system. A comparison of these twomethods has been performed by using computerprogramming. The systems have various levels of areas,zones, inbound, outbound and interval time. The resultsshowed that DPA is the most effective method formanagement of areas. However, there is the limitation oftime to reach the results on the DMZD problems. SAA isthen used for solving DMZD problems for reducing thetime limitation and appears to have the satisfied resultswithin the reasonable time. The suitable levels of SAAfactors have been also determined via the design ofexperiment on the early phase of the study.||URI:||https://scholar.utcc.ac.th/handle/6626976254/930||Rights:||This work is protected by copyright. Reproduction or distribution of the work in any format is prohibited without written permission of the copyright owner.|
|Appears in Collections:||conference_item|
Show full item record Recommend this item
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.