查詢結果分析
相關文獻
- 影片製作問題之分支與界定法
- 隨機搜尋策略於影片製作之應用
- Distributed Broadcasting Algorithms in Rotator Graphs
- Machining Parameters Selection for Stock Removal Turning in Process Plans Using a Float Encoding Genetic Algorithm
- A Modified Multistart Method for Multimodal Optimization
- 線性軸幅路網接駁系統最適整合區位、路線與排班模式之研究
- Bayesian Estimation for the Optimum in Single Factor Quadratic Regression
- 衛星探空資料(SATEM)在中央氣象局有限區域預報系統之客觀分析模組的應用
- 二次元靜態連續體結構之最佳化:應用族群概念之基因演算法
- Optimization of Order-packing Travel Route in a Finished Goods Warehouse
頁籤選單縮合
題名 | 影片製作問題之分支與界定法=A New Branch-and-Bound Algorithm for Film Production Problem |
---|---|
作者 | 林妙聰; Lin, Miao-tsong; |
期刊 | 銘傳學刊 |
出版日期 | 19990100 |
卷期 | 10:1 1999.01[民88.01] |
頁次 | 頁101-110 |
分類號 | 494.542 |
語文 | chi |
關鍵詞 | 影片製作; 滯留成本; 最佳化; 分支與界定法; Film production; Holding cost; Optimization; Branch-and-bound algorithm; |
中文摘要 | 影片製作問題是某電影製作公司所實際面連的一項最佳化作業,其主要目的是排列一組拍片順序,以使得演員滯留成本能降至最小。此問題業已被證明為strongly NP-hard,之前亦有學者提出分支與界定法作為解題策略。在本文中,我們將設計擴充之實質效益,我們進行了電腦程式的實際模擬,而實驗結果也顯示此方法確實在縮減搜尋空間及時間上均有顯著效果。 |
英文摘要 | In this paper, we consider is an optimization problem that arises in the film industry. The film production problem seeks to find an arrangement of shooting days such that the holding costs of actors/actresses are minimized. This problem was previously shown to be NP-hard in the strong sense. Based on an existing branch-and-bound algorithm, we present in this paper a new one by incorporating a tighter lower bound function. A series of computational experiments are conducted, and the results reveal the practical significance of the proposed function. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。