物流运作管理中的装载计划及物流调度
|
摘要
随着物流业的蓬勃发展,提高企业中的物流运作管理水平成为各个企业降低物流成本增加企业竞争力的有效手段。本论文首先以物流系统中的集装箱码头物流作业为研究背景,研究了具有代表性的集装箱装载计划问题以及卸载集装箱车辆调度与堆场空间分配问题；以制造系统中的钢铁企业物流为研究背景,研究了钢铁企业中产成品水运、铁运两种运输模式下装载计划以及拖车调度的建模、优化问题,同时开发了相应的自动装载计划决策支持系统并在某钢铁企业中得到应用。本文的主要工作如下：
1)研究了集装箱的装船计划问题,在考虑船体结构以及具体的装载要求的基础上来确定集装箱装载计划中每个集装箱在船舶上的具体空间位置。对此问题构建了整数规划模型,目标函数考虑了总的装载时间以及船舶上bay位之间的装载量。为了近似求解此问题,设计了禁忌搜索算法。在算法实施中,提出了大范围搜索和深度搜索的混合搜索策略用于改进算法,设计了基于计算目标函数改进量的加速策略。通过实验表明,提出的禁忌搜索算法与CPLEX所获得的最优解或下界进行比较,平均偏差值为1.95%。
2)研究了卸载集装箱堆场空间分配与车辆调度的集成作业问题。在该问题中,卸载集装箱动态到达,车辆循环使用,需要同时决策集装箱堆放位置及车辆的分配和路线。对此问题建立了整数规划数学模型,考虑了车辆调度约束以及堆场吊机操作等实际约束,目标函数为最小化makespan。根据问题的特点设计了两阶段禁忌搜索算法求解此问题,并在算法中采用了两种加速策略来改进算法。在实验中,通过将禁忌搜索算法的结果同标准优化软件CPLEX所求得的最优解或下界比较,算法求得了其中7组算例的最优解且剩余算例平均偏差小于5%,说明所设计的算法可以有效的解决该集成问题。
3)研究了钢铁企业拖车调度问题。在该问题中,拖车将被运件从成品库运到码头堆场,由于车体分离的特征,需要根据产品的形状配置适合的拖挂,因此除了考虑常规的卡车运输要求外,还需要考虑产成品与拖挂的匹配问题。在本论文研究的拖车调度问题中,多种类的拖挂可以多次分配给各个运输任务而且存在拖挂与钢铁产品不完全匹配也可以运输的情况。根据问题的特点,建立了多目标混合整数规划模型,考虑了车辆的连续性以及运输任务的连续性等约束,目标函数考虑了所用车辆数,运行距离以及产品与拖挂匹配度等。在研究中关于某运输任务最后一趟运输如何指派车辆的问题也进行了分析并提出了相关性质。对于该问题的求解,提出了带有继承性的禁忌搜索算法,其初始解通过基于实际经验的启发式算法获得。实验结果表明提出的算法可以有效求解此类问题,其结果要优于当前的人工调度结果。
4)研究了钢卷铁路运输装载计划问题。该问题与集装箱装载计划问题比较具有多车皮运输模式、车厢装载量下限要求、车厢装载高平衡性要求、钢卷允许存在剩余等特征。基于以上问题特征,首次建立了整数规划模型其目标函数不仅考虑了最大化装载量还考虑了最小化同一车皮内所装钢卷的库位差异量。对于此类NP难问题采用了改进的禁忌搜索算法来求解,其初始解通过两阶段启发式来求解,并在启发式中采用了多交换邻域搜索以增加装载卷数。在禁忌搜索中采用K链式移动作为算法的变化策略以获得更好的解。实验中所有的数据均来自国内某钢铁公司,其算法所求得的解与CPLEX软件所求最优解或下界进行了比较,比较结果显示在允许的时间内改进的禁忌搜索算法要优于软件并且效率更高。
5)研究了钢铁企业中钢卷水运装载计划问题。该问题在满足船的装载量及钢卷堆放规则的实际要求的同时,还需要考虑船舶在装载、航行和卸载过程当中的平衡稳定性要求,以确定计划装船的钢卷在给定的船舶上分配不同的空间位置,使得钢卷提取和卸载倒卷次数最小化、卸载效率最大化。根据船型的不同特点,建立了基于实际装载要求的整数规划模型,并分别设计了改进的禁忌搜索算法对其进行近似求解。在算法实施过程中设计了三阶段启发式算法形成初始解,同时基于问题特点提出了算法的强化策略以提高搜索质量并采用了加速策略提高求解效率。基于某钢铁企业实际集配计划数据的实验结果表明设计的禁忌搜索算法可以在允许的时间内有效解决钢卷水运装载计划问题,其结果要优于人工方法。
6)以钢铁企业产成品实际物流作业为背景,开发了钢铁产成品水运、铁运装载计划决策支持系统。系统中嵌入基于实际问题建立的整数规划模型并针对模型设计了改进的禁忌搜索算法以分别解决两种不同运输模式下的装载计划优化问题,同时开发了基于人机交互的图形界面和拖拽方式的编辑系统。该系统实现了计划数据的录入、增加、删除以及修改等数据维护功能,水运、铁运装载计划的自动生成和手工调整的功能,计划图形显示和评价等功能。设计并开发的决策支持系统可以帮助计划员以及调度人员制定相关运输工具的装载计划,通过与人工方式产生的方案相比较,产成品水运、铁运装载计划决策支持系统被证明是高效和可靠的,并已经在国内某钢铁企业实际使用,有效提高了运输工具发运效率。
Along with the vigorous development of logistics, it becomes an effective mean by improving the logistics operation management level to reduce the logistics cost and increase the enterprise competitiveness. In this dissertation, the product stowage planning problem of ship and train transportation, the truck and trailer scheduling problem are addressed by modeling and optimizing with taking the iron and steel industry logistics of manufacturing system as the first background, and the relevant stowage decision support system is designed and developed for ship and train transportation. The system has been put into practical use in certain domestic steel plant. The container stowage planning problem and the integrated scheduling problem with truck scheduling and storage allocation are studied with taking the container terminal logistics operation of logistics system as the second background. The main contents include:
1) The container stowage planning problem is researched and it considers the task of loading containers into the containership with a set of structural and operational restrictions. It is formulated as an integer programming model to minimize the number of shift, the total loading time and the weight difference between maximum loaded bay and minimum loaded bay. For solving this problem, the tabu search algorithm with two stages search including the intensification search and diversification search is proposed, and the speedup strategy based on computing the improvement of objective function is also designed. The experimental results that compare with optimal solution or lower bound calculating by CPLEX show that the average gap value of TS is1.95%.
2) The integrated problem with truck scheduling and storage allocation is researched in the dissertation. In the integrated problem, container's arrival is dynamic, truck can be used circularly, stacking position of containers and truck scheduling need to be decided. It is formulated as an integer programming model to minimize makespan of the whole discharging course and the truck scheduling constraints and operation constraints of stack crane are also considered. For solving this problem, two stages tabu search algorithm is designed and two kinds of speedup strategy are used in the algorithm. The experimental results comparing with software CPLEX11.0show that the two stage tabu search obtains optimal solution for seven cases of total cases and the average gap of left cases is less than5%, which indicates that this algorithm can solve this integrated problem effectively.
3) The truck and trailer scheduling problem is researched. In this problem, the product is transported from warehouse to dock yard and the matching problem between trailers and products is considered because of the character that truck and trailer can be separated arbitrarily. This problem with multiple types of vehicles which can be assigned to different tasks more than one time is considered and the vehicle can also transport the products that don't absolutely suit it. This problem is formulated as a mixed integer programming model to minimize the total cost by considering some practical factors, and the continuity of task and truck constraints are also considered. In this dissertation, the problem how to transport the last operation in appointed task is also analyzed and the property about the scheduling of last operation is put forward to optimize algorithm. An inherited composite neighborhood tabu search algorithm is developed to find a near-optimal scheduling where an initial solution is obtained based on the know-how knowledge. The results of experiment show that the proposed method could resolve the problem more effectively than current manual method.
4) The coil stowage planning problem is researched. Comparing with the container stowage problem, it has its own features such as multi-wagon transportation mode, restriction on the minimum weight of loaded coils of each wagon, planning coils do not have to be loaded completely and more strict balance constraints than containers. Considering the features mentioned above, a novel integer programming model is established where the objectives are both to maximize the total weight of loaded coils and to minimize the total times of different sections and column of each two coils in wagons. The NP-hardness of the problem and intractableness of optimally solving the model motivate us to develop an improved tabu search algorithm to solve it approximately. The algorithm is initiated by a two-stage heuristic. The multi-exchange neighborhood is designed to increase the loaded coils and K-chains move is used in TS to be regard as a diversification strategy. All of experiment data are collected from transportation department of iron and steel enterprise and the experimental results comparing with CPLEX show that the proposed mathematical model and the tabu search algorithm can obtain better solutions than CPLEX in an allowable time and resolve the problem more effectively.
5) The coil stowage planning problem for ship in a steel plant is researched. In this problem, it needs to be satisfied with the demand of ship loadage and stacking regular of coils in ship, the demand of ship stability of loading, sailing and unloading. Based on this, in order to minimize pick-up and unloading shift number, maximize the unloading efficiency, it should be fixed on the positions in ship of planning coils. For this problem of allocation planning coils in the hold of a ship, a mixed integer programming model based on the practical requirement is established, the objective function is to minimize the total cost by considering some practical issues and the different improved tabu search algorithms are designed to obtain the near-optimal solution based on different type of ship. A three-stage method according to the practical operation requests and experiences is proposed to obtain an initial solution, the intensification search strategy and two kinds of speed-up strategies are put forward to improve the search efficiency. The experimental results show that the proposed mathematical model and the tabu search algorithm can obtain satisfactory solutions in an allowable time and resolve the problem more effectively than current manual method.
6) The stowage decision support system of ship and train transportation is designed and developed with taking the transportation logistics of iron and steel industry as the background. The established integer programming model based on practical problem and improved tabu search algorithms are embedded in system to solve the stowage planning problems of two different transportation modes, moreover the schedule edit system with graphical human-machine interaction interface is provided. For all of them, it realizes function of recording, adding, deleting and amending plan data, the function of auto-making plans and manual adjustment, the function of displaying plan with figure and evaluation. The system can help planners and dispatchers to set down the stowage plan for ship and train. By comparing the schedule generated by the system with the manual schedule, the stowage decision support system for ship and train is proved to be effective and it is running in a domestic steel plant to improve the dispatch efficiency of conveyance.
1)研究了集装箱的装船计划问题,在考虑船体结构以及具体的装载要求的基础上来确定集装箱装载计划中每个集装箱在船舶上的具体空间位置。对此问题构建了整数规划模型,目标函数考虑了总的装载时间以及船舶上bay位之间的装载量。为了近似求解此问题,设计了禁忌搜索算法。在算法实施中,提出了大范围搜索和深度搜索的混合搜索策略用于改进算法,设计了基于计算目标函数改进量的加速策略。通过实验表明,提出的禁忌搜索算法与CPLEX所获得的最优解或下界进行比较,平均偏差值为1.95%。
2)研究了卸载集装箱堆场空间分配与车辆调度的集成作业问题。在该问题中,卸载集装箱动态到达,车辆循环使用,需要同时决策集装箱堆放位置及车辆的分配和路线。对此问题建立了整数规划数学模型,考虑了车辆调度约束以及堆场吊机操作等实际约束,目标函数为最小化makespan。根据问题的特点设计了两阶段禁忌搜索算法求解此问题,并在算法中采用了两种加速策略来改进算法。在实验中,通过将禁忌搜索算法的结果同标准优化软件CPLEX所求得的最优解或下界比较,算法求得了其中7组算例的最优解且剩余算例平均偏差小于5%,说明所设计的算法可以有效的解决该集成问题。
3)研究了钢铁企业拖车调度问题。在该问题中,拖车将被运件从成品库运到码头堆场,由于车体分离的特征,需要根据产品的形状配置适合的拖挂,因此除了考虑常规的卡车运输要求外,还需要考虑产成品与拖挂的匹配问题。在本论文研究的拖车调度问题中,多种类的拖挂可以多次分配给各个运输任务而且存在拖挂与钢铁产品不完全匹配也可以运输的情况。根据问题的特点,建立了多目标混合整数规划模型,考虑了车辆的连续性以及运输任务的连续性等约束,目标函数考虑了所用车辆数,运行距离以及产品与拖挂匹配度等。在研究中关于某运输任务最后一趟运输如何指派车辆的问题也进行了分析并提出了相关性质。对于该问题的求解,提出了带有继承性的禁忌搜索算法,其初始解通过基于实际经验的启发式算法获得。实验结果表明提出的算法可以有效求解此类问题,其结果要优于当前的人工调度结果。
4)研究了钢卷铁路运输装载计划问题。该问题与集装箱装载计划问题比较具有多车皮运输模式、车厢装载量下限要求、车厢装载高平衡性要求、钢卷允许存在剩余等特征。基于以上问题特征,首次建立了整数规划模型其目标函数不仅考虑了最大化装载量还考虑了最小化同一车皮内所装钢卷的库位差异量。对于此类NP难问题采用了改进的禁忌搜索算法来求解,其初始解通过两阶段启发式来求解,并在启发式中采用了多交换邻域搜索以增加装载卷数。在禁忌搜索中采用K链式移动作为算法的变化策略以获得更好的解。实验中所有的数据均来自国内某钢铁公司,其算法所求得的解与CPLEX软件所求最优解或下界进行了比较,比较结果显示在允许的时间内改进的禁忌搜索算法要优于软件并且效率更高。
5)研究了钢铁企业中钢卷水运装载计划问题。该问题在满足船的装载量及钢卷堆放规则的实际要求的同时,还需要考虑船舶在装载、航行和卸载过程当中的平衡稳定性要求,以确定计划装船的钢卷在给定的船舶上分配不同的空间位置,使得钢卷提取和卸载倒卷次数最小化、卸载效率最大化。根据船型的不同特点,建立了基于实际装载要求的整数规划模型,并分别设计了改进的禁忌搜索算法对其进行近似求解。在算法实施过程中设计了三阶段启发式算法形成初始解,同时基于问题特点提出了算法的强化策略以提高搜索质量并采用了加速策略提高求解效率。基于某钢铁企业实际集配计划数据的实验结果表明设计的禁忌搜索算法可以在允许的时间内有效解决钢卷水运装载计划问题,其结果要优于人工方法。
6)以钢铁企业产成品实际物流作业为背景,开发了钢铁产成品水运、铁运装载计划决策支持系统。系统中嵌入基于实际问题建立的整数规划模型并针对模型设计了改进的禁忌搜索算法以分别解决两种不同运输模式下的装载计划优化问题,同时开发了基于人机交互的图形界面和拖拽方式的编辑系统。该系统实现了计划数据的录入、增加、删除以及修改等数据维护功能,水运、铁运装载计划的自动生成和手工调整的功能,计划图形显示和评价等功能。设计并开发的决策支持系统可以帮助计划员以及调度人员制定相关运输工具的装载计划,通过与人工方式产生的方案相比较,产成品水运、铁运装载计划决策支持系统被证明是高效和可靠的,并已经在国内某钢铁企业实际使用,有效提高了运输工具发运效率。
Along with the vigorous development of logistics, it becomes an effective mean by improving the logistics operation management level to reduce the logistics cost and increase the enterprise competitiveness. In this dissertation, the product stowage planning problem of ship and train transportation, the truck and trailer scheduling problem are addressed by modeling and optimizing with taking the iron and steel industry logistics of manufacturing system as the first background, and the relevant stowage decision support system is designed and developed for ship and train transportation. The system has been put into practical use in certain domestic steel plant. The container stowage planning problem and the integrated scheduling problem with truck scheduling and storage allocation are studied with taking the container terminal logistics operation of logistics system as the second background. The main contents include:
1) The container stowage planning problem is researched and it considers the task of loading containers into the containership with a set of structural and operational restrictions. It is formulated as an integer programming model to minimize the number of shift, the total loading time and the weight difference between maximum loaded bay and minimum loaded bay. For solving this problem, the tabu search algorithm with two stages search including the intensification search and diversification search is proposed, and the speedup strategy based on computing the improvement of objective function is also designed. The experimental results that compare with optimal solution or lower bound calculating by CPLEX show that the average gap value of TS is1.95%.
2) The integrated problem with truck scheduling and storage allocation is researched in the dissertation. In the integrated problem, container's arrival is dynamic, truck can be used circularly, stacking position of containers and truck scheduling need to be decided. It is formulated as an integer programming model to minimize makespan of the whole discharging course and the truck scheduling constraints and operation constraints of stack crane are also considered. For solving this problem, two stages tabu search algorithm is designed and two kinds of speedup strategy are used in the algorithm. The experimental results comparing with software CPLEX11.0show that the two stage tabu search obtains optimal solution for seven cases of total cases and the average gap of left cases is less than5%, which indicates that this algorithm can solve this integrated problem effectively.
3) The truck and trailer scheduling problem is researched. In this problem, the product is transported from warehouse to dock yard and the matching problem between trailers and products is considered because of the character that truck and trailer can be separated arbitrarily. This problem with multiple types of vehicles which can be assigned to different tasks more than one time is considered and the vehicle can also transport the products that don't absolutely suit it. This problem is formulated as a mixed integer programming model to minimize the total cost by considering some practical factors, and the continuity of task and truck constraints are also considered. In this dissertation, the problem how to transport the last operation in appointed task is also analyzed and the property about the scheduling of last operation is put forward to optimize algorithm. An inherited composite neighborhood tabu search algorithm is developed to find a near-optimal scheduling where an initial solution is obtained based on the know-how knowledge. The results of experiment show that the proposed method could resolve the problem more effectively than current manual method.
4) The coil stowage planning problem is researched. Comparing with the container stowage problem, it has its own features such as multi-wagon transportation mode, restriction on the minimum weight of loaded coils of each wagon, planning coils do not have to be loaded completely and more strict balance constraints than containers. Considering the features mentioned above, a novel integer programming model is established where the objectives are both to maximize the total weight of loaded coils and to minimize the total times of different sections and column of each two coils in wagons. The NP-hardness of the problem and intractableness of optimally solving the model motivate us to develop an improved tabu search algorithm to solve it approximately. The algorithm is initiated by a two-stage heuristic. The multi-exchange neighborhood is designed to increase the loaded coils and K-chains move is used in TS to be regard as a diversification strategy. All of experiment data are collected from transportation department of iron and steel enterprise and the experimental results comparing with CPLEX show that the proposed mathematical model and the tabu search algorithm can obtain better solutions than CPLEX in an allowable time and resolve the problem more effectively.
5) The coil stowage planning problem for ship in a steel plant is researched. In this problem, it needs to be satisfied with the demand of ship loadage and stacking regular of coils in ship, the demand of ship stability of loading, sailing and unloading. Based on this, in order to minimize pick-up and unloading shift number, maximize the unloading efficiency, it should be fixed on the positions in ship of planning coils. For this problem of allocation planning coils in the hold of a ship, a mixed integer programming model based on the practical requirement is established, the objective function is to minimize the total cost by considering some practical issues and the different improved tabu search algorithms are designed to obtain the near-optimal solution based on different type of ship. A three-stage method according to the practical operation requests and experiences is proposed to obtain an initial solution, the intensification search strategy and two kinds of speed-up strategies are put forward to improve the search efficiency. The experimental results show that the proposed mathematical model and the tabu search algorithm can obtain satisfactory solutions in an allowable time and resolve the problem more effectively than current manual method.
6) The stowage decision support system of ship and train transportation is designed and developed with taking the transportation logistics of iron and steel industry as the background. The established integer programming model based on practical problem and improved tabu search algorithms are embedded in system to solve the stowage planning problems of two different transportation modes, moreover the schedule edit system with graphical human-machine interaction interface is provided. For all of them, it realizes function of recording, adding, deleting and amending plan data, the function of auto-making plans and manual adjustment, the function of displaying plan with figure and evaluation. The system can help planners and dispatchers to set down the stowage plan for ship and train. By comparing the schedule generated by the system with the manual schedule, the stowage decision support system for ship and train is proved to be effective and it is running in a domestic steel plant to improve the dispatch efficiency of conveyance.
引文
[1]唐纳德·鲍尔索克斯著,林国龙译.物流管理：供应链过程一体化[M],北京：机械工业出版社,1999.
[2]崔介何.物流学[M],北京：北京大学学出版社,2003.
[3]中华人民共和国国家标准物流术语,GB/18354-2001.
[4]菊池康也著,丁立言译.物流管理[M],北京清华大学出版社,1999.
[5]汝宜红等著,物流运作管理[M],北京清华大学出版社,2006.
[6]Etsuko N, Akio I, Stratos P. Berth Allocation planning in the public berth system by genetic algogrithms [J], European Journal of Operational Research,2001,131: 282-292.
[7]Akio I, Etsuko N, Stratos P. The dynamic berth allocation problem for a container port [J], Transportation Research Part B,2001,35:401-417.
[8]Akio I, Etsuko N, Stratos P. Berth allocation with service priority [J], Transportation Research Part B,2003,37:437-457.
[9]Kim KH, Chan MK. Berth scheduling by simulated amnealing [J], Transportation Research Part B,2003,37:541-560.
[10]Akio I, Sun X, Etsuko N. Berth allocation in a container port:using a continuous location space approach [J], Transportation Research Part B,2005,39:199-221.
[11]Akio I, Etsuko N, Hattori M. Berth allocation at indented berths for mega-containerships [J], European Journal of Operational Research,2007,179: 579-593.
[12]Wang F, Lim A. A stochastic beam search for the berth allocation problem [J], Decision Support Systems,2007,42(4):2186-2196.
[13]Daganzo CF. The crane scheduling problem [J], Transportation Research Part B,1989, 23:159-175.
[14]Peterkofsky RI, Daganzo CF. A branch and bound solution method for the crane scheduling problem [J], Transportation Research Part B,1990,24:159-172.
[15]Kim KH. A crane scheduling method for port container terminals [J], European Journal of operational research,2004,156:752-768.
[16]Lee DH, Wang HQ, Miao LX. Quay crane scheduling with non-interference constraints in port container terminals [J], Transportation Research Part E,2008,44(1):124-135.
[17]Akio I, Chen HC, Etsuko N. The simultaneous berth and quay crane allocation problem [J], Transportation Research Part E, In Press, Available online 5 July,2007.
[18]Liu CI, Ioannou P. A. A comparison of different AGV dispatching rules in an automated container terminal [C], The IEEE 5th Conference on Intelligent Transportation Systems, Singapore,2002.
[19]Vis, IFA. Minimum vehicle fleet size under time-window constraints at a container terminal [J], Transportation science,2005,39(2):249-260.
[20]Etsuko N, Akio I, Stratos. Yard trailer routing at a maritime container terminal [J], Transportation Research Part E,2005,41:53-76.
[21]杨静蕾.集装箱码头物流路径优化研究[J],水运工程,2006,1：32-35.
[22]Zhang CQ, Wan YW, Liu JY. Dynamic crane deployment in container storage yards [J], Transportation Research Part B,2002,36:537-555.
[23]Linna R, Liu JY, Wan YW. Rubber tired gantry crane deployment for container yard operation [J], Computers&Industrial Engineering,2003,45:429-442.
[24]韩晓龙.集装箱港口装卸中的龙门吊数量配置[J],系统工程,2005,23(10)：12-16.
[25]李建中,韩晓龙.集装箱港口轮胎式龙门起重机的动态优化配置[J],上海海事大学学报,2005,26(3)：44-48.
[26]Kim KH, Park YM, Ryu KR. Deriving decision rules to locate export containers in container yards [J], European Journal of Operational Research,2000,124:89-101.
[27]Kim KH, Preston P, Kozan E. An approach to determine storage locations of containers at seaport terminals [J], Computers&Operations Research,2001,28:983-995.
[28]Kim KH, Park KT. A note on a dynamic space-allocation method for outbound containers [J], European Journal of Operational Research,2003,148:92-101.
[29]Zhang CQ, Liu JY, Liu YW. Storage space allocation in container terminals. [J], Transportation Research Part B,2003,37:883-903.
[30]Ng WC, Mak KL. Yard crane scheduling in port container terminals [J], Applied Mathematical Modeling,2005,29:263-276.
[31]Ng WC. Crane scheduling in container yards with inter-crane interference [J], European Journal of Operational Research,2005,164:64-78.
[32]Kim KH, Lee KM, Hwang H. Sequencing delivery and receiving operations for yard cranes in port container terminals [J], Int. J. Production Economics,2003,84:283-292.
[33]韩晓龙.集装箱港口龙门吊最优路径问题[J],土海海事大学学报,2005,26(2)：39-41.
[34]Lee DH, Cao Z, Meng Q. Scheduling of two-transtainer systems for loading outbound containers in port container terminals with simulated annealing algorithm [J], International Journal of Production Economics,2007,107(1):115-124.
[35]Erhan K, Preston P. Genetic algorithms to schedule container transfers at multimodal terminals [J], International Transport in Operation Research,1999,6:311-329.
[36]Bish EK. A multiple-crane-constrained scheduling problem in a container terminal [J], European Journal of Operational Research,2003,144:83-107.
[37]康海贵,周鹏飞.集装箱船舶装卸作业时起吊设备-车辆的规划研究[J],大连理工大学学报,2006,46(3)：372-379.
[38]Chen L, Bostel N, Dejax P. A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal [J], European Journal of Operational Research,2007,181(1):40-58.
[39]Lau HYK, Zhao Y. Integrated scheduling of handling equipment at automated container terminals [J], International Journal of Production Economics, In Press, Available online 10,2007.
[40]Redwine CN, Wismer DA. A mixed integer programming model for scheduling orders in a steel mill [J], Journal of Optimization Theory and Application,1974,14:305-318.
[41]Amours SD, Montreuil B, Soumis F. Price-based planning and scheduling of multiproduct orders in symbiotic manufacturing networks [J], European Journal of Operational Research,1996,96:148-166.
[42]铃木节也,藤原羲已,西海建一.溶銑翰送管理システム[J],神户制钢技报,1995,30(2)：48-50.
[43]田村昌弘,稻葉佑三,古贺康彦,有阑德美,何合登,入谷英榭.溶銑物流夕システムの改善[J],神户制钢技报,1996,46(2)：15-18.
[44]Lubbecke ME. Engine scheduling by column generation [D], Braunschweig University of Technology,2001.
[45]Lubbecke ME, Zimmermann UT. Engine routing and scheduling at industrial in-plant railroads [J], Transportation Science,2003,37(2):183-197.
[46]Craiga IK, Camisani-Calzolaria FR, Pistoriusb PC. A contemplative stance on the automation of continuous casting in steel processing [J], Control Engineering Practive, 2001,9:1013-1020.
[47]Harjunkoski I, Grossmann IE. A decomposition approach for the scheduling of steel plant production [J], Computers and Chemical Engineering,2001,25:16447-1660.
[48]Roy R, Adesola BA, Thornton S. Development of a knowledge model of managing schedule disturbance in steel-making [J], International Journal of Production Research, 2004,42(18):3975-3994.
[49]Kumar V, Kumar S, Tiwari MK. Auction-based approach to resovle the scheduling problem in the steel making process [J], International Journal of Production Research, 2006,44(8):1503-1522.
[50]Wright JR, Houck MH. An application of systems modeling in steel production scheduling [C], In Proceedings of the 4th International Conference, Kensington Exhibition Center, London, England,1985,15:127-140.
[51]Balas E. The prize collecting traveling salesman problem [J], Networks,1989,19: 621-636.
[52]Kosiba ED, Wright JR, Cobbs AE. Discrete event sequencing as a traveling salesman problem [J], Computers in Industry,1992,19:317-327.
[53]Cowling P. Optimisation in steel hot rolling [M], Optimization in industry 3, Chichester, England:Wiley,1995.
[54]Lopez L, Carter MW, Gendreau M. The hot strip mill production scheduling problem: A tabu search approach [J], European Journal of Operational Research,1998,106: 317-335.
[55]Tang LX, Liu JY, Rong AY, Yang ZH. A multiple traveling salesman problem (MTSP) model for hot rolling scheduling in Shanghai Baoshan Iron and Steel Complex [J], European Journal of Operational Research,2000,124:267-282.
[56]Wang DD, Tieu AK, de Boer FG., Ma B, Yuen WYD. Toward a heuristic optimum design of rolling schedules for tandem cold rolling mills [J], Engineering Application of Artificial Intelligence,2000,13:397-406.
[57]Dixit US, Dixit PM. Application of fuzzy set theory in the scheduling of a tandem cold-rolling mill [J], Journal of Manufacturing Science and Engineering-Transactions of the ASME,2000,122:494-500.
[58]Okano H, Morioka T, Yoda K. A heuristic solution for the continuous galvanizing line scheduling problem in a steel mill [R], IBM Tokyo Research Laboratory,1623-14 Shimo-tsuruma, Yamato-shi, Kanagawa-ken 242-8508, Japan,2002.
[59]Verdejo VV, Alarco MAP, Sorli MPL. Scheduling in a continuous galvanizing line [J], Computers and Operations Research,2009,36(1):280-290.
[60]Kapanoglu M, Koc IO. A multi-population parallel genetic algorithm for highly constrained continuous galvanizing line scheduling [J], Lecture Note in Computer Science,2006,4030:28-41.
[61]Tang LX, Wang XP, Liu JY. Color-coating production scheduling for coils in inventory in steel industry [J], IEEE Transactions on Automation Science and Engineering,2008, 5(3):544-549.
[62]Wang XP, Tang LX. Color-coating production scheduling in the steel industry [C], In: Proceedings of CIMA 2005, Istanbul, Turkey,2005.
[63]Tang LX, Wang XP. A predictive reactive scheduling method for color-coating production in steel industry [J], International Journal of Advanced Manufacturing echnology,2008,35:633-645.
[64]Tang LX, Liu JY, Rong AY, Yang ZH. A review of planning and scheduling systems and methods for integrated steel production [J], European Journal of Operational Research, 2001,133:1-20.
[65]Lee HS, Murthy SS, Haider SW, Morse DV. Primary production scheduling at steelmaking industries [J], IBM Journal of Research and Development,1996,40, 231-252.
[66]Sun BR. The overseas progress of hot charge and direct rolling technology [J], Journal of Rolling Mill,1992,2:41-44.
[67]李耀华,胡国奋,王伟,宁树实.炼钢-连铸-热轧一体化生产计划编制方法研究[J],控制工程,2005,12(6)：549-552.
[68]Masaoka T. Casting-direct rolling technology applied to Sakai works of Nippon Steel Corporation [J], Nippon Technical Report,1994,70:97-100.
[69]Okano H, Davenport AJ, Trumbo M, Reddy C, Yoda K, Amano M. Finishing line scheduling in the steel industry [J], IBM Journal of Research and Development,2004, 48(5/6):811-830.
[70]Tang LX, Zhao YF. Scheduling a single semi-continuous batching machine [J], Omega, 2008,36:992-1004.
[71]李颢,邵惠鹤,任德祥,钱勤生.基于遗传算法的均热炉群装炉出炉调度[J],控制与决策,1999,2：135-139.
[72]Moon S, Hrymak AN. Scheduling of the batch annealing process - deterministic case [J], Computers and Chemical Engineering,1999,23(9):1193-1208.
[73]吴涛,陈荣秋.冷卷热处理生产调度模型的启发式算法[J],华中科技大学学报(自然科学版),2006,10：58-60..
[74]Samuel E. Kemp AR, Andrew JW, Jan DW. Artificial intelligence for automatic container stowage planning optimization [J], HANSA Schiffahrt Schiffbau Hafen,2004, 4:22-26.
[75]Webster WC, Van DP. Automated procedures for the allocation of containers on shipboard [C], Computer Aided Ship Design Engineering Summer Conference, Annals Arbor,1969.
[76]Scott DK, Chen DS. A loading model for a container ship [D], Matson:Navigation Cambridge,1978.
[77]Martin GL, Methodology Randhawa S U, and evaluation. McDowell E D. Compterised container ship load planning [J], Computer&Industry Engineer,1988,14(4):429-440.
[78]Avriel M, Penn M, Shpirer N. Stowage planning for container ships to reduce the number of shifts [J], Annals Operations Research,1998,76:55-71.
[79]Aslidis AH. Optimal container loading [D], Cambridge:Massachusetts Institute of Technology,1984.
[80]Botter RC, Brinati MA. Stowage container planning:a model for solution [J], Computer Applications in the Automation Design, IFIP Transactions B (Applications in Tech.) of Shipyard Getting Operation an Optimal and Ship,1992,217-229.
[81]Ambrosino D, Sciomachen A, Tanfani E. Stowing a containership:the master bay plan problem [J], Transportation Research Part A,2004,38:81-99.
[82]Wilson ID, Roach PA. Principles of combinatorial optimization applied to containership stowage planning [J], Journal of Heuristic,1999,5:403-418.
[83]Wilson ID, Roach PA, Ware JA container stowage preplanning:using search to generate solutions, a case study [J], Knowledge Based Systems,2001,14:137-145.
[84]Akio I, Dazuya S, Etsuko N. Multi-objective simultaneous stowage and load planning fro a container ship with container rehandle in yard stacks [J], European Journal of Operational Research,2005,171(3):373-389.
[85]Dillingham J, Perakis A N. Application of artificial intelligent in marine industry [R], Marad Report, MA-RD- 770-87015.
[86]Dillingham J, Dumbleton J. Expert system for container stowage planning [R], Proceedings-Ship Technology and Research (STAR) Symposium,21" Century — Ship and Offshore Vessel Design, Construction and Operation. New Orleans, Soc of Naval Architects&Marine Engineers,1989.
[87]Dillingham J, Perakis J. Design of an expert system for container stowage planning [C], Fleet Management Technology Conference, Baltimor,1987.
[88]Todd. DS, Sen P. A Multiple Criteria genetic algorithm for container ship loading [C], In Proceedings of the Seventh International Conference on Genetic Algorithms,1997.
[89]Ryu KR, Kim KH, Lee YH. Loading sequencing Algorithms for container ships by Using Meta-heuristics [C], In 16th International conference on Producton Research, 2001.
[90]Dubrovsky O, Levitin G, Penn M. A genetic algorithm with a compact solution encoding for the container ship stowage problem [J], Journal of Heuristics,2002,8: 585-599.
[91]丁以中,费红英,韩晓龙.港口集装箱流研究现状与分析[J],上海海运学院学报,2004,25(2)：45-54.
[92]王照宁.集装箱船舶自动配载系统管理模型的建立与研究[J],大连海运学院学报,1994,20(2)：70-74.
[93]邱文昌.集装箱船舶积载计划计算机评价系统[J],上海海运学院学报,1994,15(4)：33-39.
[94]司智荣.集装箱船舶配载的计算机管理[J],港口装载,1995,101：61-62.
[95]王宇,邢月华.集装箱码头生产作业计划决策支持系统[J],交通与计算机,1997,15(1)：27-31.
[96]顾宣炎,周瑞平.计算机辅助集装箱船舶配载[J],水运科技信息,1998,166(1)：19-21.
[97]周瑞平,肖志强.基于VB的集装箱船舶积载计算及程序编制[J],江苏船舶,1999,16(3)：29-32.
[98]杨宏,张金铭,秦士元.集装箱船计算机辅助排箱与配载研究[J],中国造船,1998,140(1)：81-86.
[99]王鸿鹏.基于知识的集装箱船自动配积载专家系统[J],上海海运学院学报,2002,23(1)：46-49.
[100]杨星,季永青.集装箱配载优化方法研究[J],武汉理工大学学报(交通科学与工程版),2002,26(2)：223-226.
[101]郝聚民.纪卓尚等.集装箱船舶实配过程的遗传算法解决策略[J],中国造船,1999,146(3)：8-15.
[102]Azar Y, Epstein L. On two dimensional packing [J], Journal of Algorithms,1997,25: 290-310.
[103]Martello S, Pisinger D, Vigo D. The three-dimensional bin packing problem [R], Technical Report DEIS-OR,1997,97-6.
[104]Friesen DK, Langston MA. Variable sized bin packing [J], SI AM Journal of Computing, 1986,15(1):222-230.
[105]Oh YF, Son SH. On a constrained bin-packing problem [R], Technical Report,1995, University of Virginia Charlottesville.
[106]Assman SB, Johnson DS, Kleitman DJ. and J.YT. Leung. On a dual version of the one-dimensional bin packing problem [J], Journal of Algorithms,1984,5(4):502-525.
[107]Kantorovich LV. Mathematical methods of organizing and planning production [J], Management Science,1990,6:366-422.
[108]Petra S, Gerhard W. The Bin-packing problem:a problem generator and some numerical experiments with FFD packing and MTP [J], International Transactions in Operational Research,1997,4(5/6):377-389.
[109]Miro G, Gortan R, Miorljub K. A hybrid approach for optimization of one-dimensional cutting [J], European Journal of Operational Research,1999,119(3):719-728.
[110]Zhang GH, Cai XQ, Wong CK. Linear time approximation algorithms for bin packing [J], Operations Research Letters,2000,26(5):217-222.
[111]Coffman EG, Garey MR, Johnson DS. Approximation algorithms for bin packing:a survey Approximation Algorithms for NP-Hard Problems [M], Boston:PWS Publishing,1997,46-93.
[112]Vasko FJ, Newhart DD, Kenneth LS. A hierarchical approach for one dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading [J], European Journal of Operational Research,1999,114(1):72-82.
[113]Dagli CH, Tatoglu MY. An approach to two dimensional cutting stocks problems [J], International Journal of Production Research,1987,25(2):175-190.
[114]Dagli C.Cutting stock problem:Combined use of heuristics and optimization methods [C], In Proceedings of the 9th International Conference on Production Research,1987, 843.
[115]Gilmore PC, Gomory RE. A linear programming approach to the cutting stock problem [J], Operations Research,1961,9(5):849-859.
[116]Christofides N, Whitlock C. An algorithm for two-dimensional cutting problems [J], Operations Research,1977,25(1):30-44.
[117]Beasley JE. An exact two-dimensional non-guillotine cutting tree search procedure [J], Operations Research,1985,33(1):49-64.
[118]Hifi M, Zissimopolous V. Constrained two-dimensional cutting:An improvement of Christofides and Whitlock's exact algorithm [J], Journal of the Operational Research Society,1997,48:324-331.
[119]Baker BS, Coffman JEG, Rivest RL. Orthogonal packing in two dimensions [J], SIAM Journal on Computing,1980,9:846-855.
[120]Pisinger D. Heuristics for the container loading problem [J], European Journal of Operational Research,2002.141:143-153.
[121]Bortfeldt A, Gehring H. A hybrid genetic algorithm for the container loading problem [J], European Journal of Operational Research,2001,131:143-161.
[122]Bischoff EE, Janetz F, Ratcliff MSW. Loading pallets with non-identical items [J], European Journal of Operational Research,1995,84:681-692.
[123]H. Gehring, A. Borifeldt. A genetic algorithm for solving the container loading problem [J], International Transactions in Operational Research,1997,4:401-418.
[124]Eley M. Solving container loading problems by block amangement [J], European Journal of Operational Research,2002,141:393-409.
[125]Bortfeldt A, Gehring H, Mack D. A parallel tabu search algorithm for solving the container loading problem [J], Parallel Computing,2003,29:641-662.
[126]Fanslau T, Andrews Bortfeldt. A tree algorithm for solving the container loading problem, Diskussionsbeitrage 2008.
[127]何大勇,查建中,姜义东.遗传算法求解复杂集装箱装载问题方法研究[J],软件学报,1995,12(9)：1380-1385.
[128]陆一平.查建中三维矩形块布局的序列三元组编码方法[J],软件学报,2002,13(11)：2183-2187.
[129]李广强,滕弘飞.装填布局的同构和非同构模式[J],计算机学报,2003,10：1248-1254.
[130]黄文奇,刘景发.基于欧氏距离的矩形Packing问题的确定性启发式求解算法[J],计算机学报,2006,5：734-739.
[131]Toyohiro U, Akira K, Masami K, Shinzo K, Shinji T. Optimiation search algorithm of allocation planning for strip coils in hold for shipment by using operational know-how [J],2001,41(5):446-453.
[132]李虎,霍佳震,陈瑶.一种求解船舶配载问题的混合遗传算法[J],工业工程与管理,2006,3：27-31.
[133]Daniela Ambrosino, Anna sciomachen and Elena Tanfani. Stowing acontainership:the master bay plan problem [J], Transportation Research Part A,2004,38:81-99.
[134]Avriel M, Penn M. Exact and approximate solutions of the container ship stowage problem [J], Computer Industry Engineer,1993,25:271-274.
[135]Saginaw DJ, Perakis AN. A decision support systemfor container ship stowage planning [J], Marine Technol,1989,26:47-61.
[136]Shin JY, Nam KC. Intelligent decision support system for container ship auto-stowage planning [J], J Korean Inst Port Res,1995,9:19-32.
[137]Golderg DE. Genetic algorithms in search, optimization and machine learning [R], Addison-Wesley Publishing Company, Inc.,Reading, MA,1989.
[138]Glover F. Tabu search-Part Ⅰ [J], ORSA Journal on Computing,1989 1(3):190-206.
[139]Glover F. Tabu search-Part Ⅱ [J], ORSA Journal on Computing,1990,2(1):4-32.
[140]Kirkpatrick S, Gelatt CD, Jr, Vecchi MP. Optimization by simulated annealing [J], Science,1983,220(4598):498-516.
[141]Daganzo, CF. Crane productivity and ship delay in ports [J], Transportation Research Record,1989,1251:1-9.
[142]Kim, KH, Kim, HB. The optimal sizing of the storage space and handling facilities for import containers [J], Transportation Research Part B,2002,36:821-835.
[143]Kim KY, Kim KH. A routing algorithm for a single straddle carrier to load export containers onto a containership [J], International Journal of Production Economics, 1999,59:425-433.
[144]Kim KH, Kim KY. Routing straddle carriers for the loading operation of containers using a beam search algorithm [J], Computers & Industrial Engineering 1999,36: 109-113.
[145]Hansen P. The steepest ascent mildest descent heuristic for combinatorial programming [C], Congress on numerical methods in combinatorial optimization, Capri, Italy.
[146]Dilek T, Laura IB. A two-phase tabu search approach to the location routing problem, [J], European Journal of Operational Research,1999,116(1):87-99.
[147]Danzig, GB, Ramser, JH. The Truck Dispatching Problem [J], Management Science, 1959,6:80-91.
[148]Tang LX, Wang GS, Liu JY. A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry [J], Computers & Operations Research: Available online,20 December 2005.
[149]Carpaneto, G, Dell'Amico M, Fischetti M, Toth P. A branch and bound algorithm for the multiple depot vehicle scheduling problem [J], Networks,1989,19:531-548.
[150]Forbes, MA, Holt JN, Watts AM. An exact algorithm for the multiple depot bus scheduling problem [J], European Journal of Operational Research,1994,72(1): 115-124.
[151]L6bel, A. Optimal vehicle scheduling in public transit [D], Ph.D. Dissertation, TU Berlin,1998a.
[152]Lobel, A. Vehicle scheduling in public transit and lagrangian pricing [J], Management Science,1998b,44:1637-1649.
[153]Funke B, Grunert T. Local search for vehicle routing and scheduling problems:Review and Conceptual Integration [J], Journal of Heuristics,2005,11:267-306.
[154]Yoshiyuki N, Minako I, Hiroshi I, Hiroshi H. The method of vehicle scheduling problem in iron and steel industry [J], Japan Operation Research,1994,3.
[155]Akio I, Chen HC, Etsuko N, Stratos P. The simultaneous berth and quay crane allocation problem [J], Transportation Research Part E,2008,44(5):900-920.
[156]Meisel F, Bierwirth C. Heuristics for the integration of crane productivity in the berth allocation problem [J], Transportation Research Part E,2009,45:196-209.
[157]WIT Press CA, Boston. A constraints satisfaction approach for master bay plans [J], Maritime Engineering and Ports,1998,155-164.
[158]OPHER D, GREGORY L, MICHAL P. A genetic algorithm with a compact solution encoding for the container ship stowage problem [J], Journal of Heuristics,2002,8: 585-599.
[159]Avriel M, Penn M, Shpirer N. Container ship stowage problem:complexity and connection to the coloring of circle graphs [J], Discrete Applied Mathematics,2000, 103:271-279.
[160]Akio I, Kazuya S, Etsuko N, Stratos P. Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks [J], European Journal of Operational Research,2006,171:373-386.
[161]Avriel M, Penn M, Shpirer N, Witteboon S. Stowage planning for container ships to reduce the number of shifts [J], Annals of Operations Research,1998,76:55-71.
[162]Huang WQ, He K. A new heuristic algorithm for cuboids packing with no orientation constraints [J], Computers & Operations Research,2007,36:425-432.
[163]Bortfeldt A, Mack D. A heuristic for the three-dimensional strip packing problem [J], European Journal of Operational Research,2007,183:1267-1279.
[164]Higgins AJ. A dynamic tabu search for large-scale generalised assignment problems [J], Computers & Operations Research,2001,28:1039-1048.
[165]Gan DQ, Qu ZH, Cai HZ. Large-scale var optimization and planning by tabu search [J], Electric Power Systems Research,1996,39:195-204.
[166]Waligora G Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation [J], European Journal of Operational Research, Available online,7 November 2007.
[167]Alan R. McKendall Jr. proved Tabu search heuristics for the dynamic space allocation problem [J], Computers & Operations Research,2008,35:3347-3359.
[168]Alan R. McKendall Jr, Jaramillo JR. A tabu search heuristic for the dynamic space allocation problem [J], Computers & Operations Research,2006,33:768-789.
[169]Ouzineb M, Nourelfath M, Gendreau M. Tabu search for the redundancy allocation problem of homogenous series-parallel multi-state systems [J], Reliability Engineering and System Safety,2008,93:1257-1272.
[170]黄迪明.C++程序设计基础[M],北京：电子工业出版社,2003,123-145.
[171]肖宏伟.专家门诊Visual C++开发答疑[M],北京：人民邮电出版社,2004,120-136.
[172]飞思科技产品开发中心.开发专家之数据库SQL Server 2000基础与提高[M],北京：电子工业出版社,2001,18-39.
[173]彭东.SQL Server 2000应用开发指南[M],北京：清华大学出版社,2001：25-46.
[174]启明工作室.Visual C+++SQL Server数据库应用系统开发与实例[M],北京：人民邮电出版社,2004,156-189.
[175]龚家骧.数据库需求分析与规划[M],北京：高等教育出版社,2004.
[2]崔介何.物流学[M],北京：北京大学学出版社,2003.
[3]中华人民共和国国家标准物流术语,GB/18354-2001.
[4]菊池康也著,丁立言译.物流管理[M],北京清华大学出版社,1999.
[5]汝宜红等著,物流运作管理[M],北京清华大学出版社,2006.
[6]Etsuko N, Akio I, Stratos P. Berth Allocation planning in the public berth system by genetic algogrithms [J], European Journal of Operational Research,2001,131: 282-292.
[7]Akio I, Etsuko N, Stratos P. The dynamic berth allocation problem for a container port [J], Transportation Research Part B,2001,35:401-417.
[8]Akio I, Etsuko N, Stratos P. Berth allocation with service priority [J], Transportation Research Part B,2003,37:437-457.
[9]Kim KH, Chan MK. Berth scheduling by simulated amnealing [J], Transportation Research Part B,2003,37:541-560.
[10]Akio I, Sun X, Etsuko N. Berth allocation in a container port:using a continuous location space approach [J], Transportation Research Part B,2005,39:199-221.
[11]Akio I, Etsuko N, Hattori M. Berth allocation at indented berths for mega-containerships [J], European Journal of Operational Research,2007,179: 579-593.
[12]Wang F, Lim A. A stochastic beam search for the berth allocation problem [J], Decision Support Systems,2007,42(4):2186-2196.
[13]Daganzo CF. The crane scheduling problem [J], Transportation Research Part B,1989, 23:159-175.
[14]Peterkofsky RI, Daganzo CF. A branch and bound solution method for the crane scheduling problem [J], Transportation Research Part B,1990,24:159-172.
[15]Kim KH. A crane scheduling method for port container terminals [J], European Journal of operational research,2004,156:752-768.
[16]Lee DH, Wang HQ, Miao LX. Quay crane scheduling with non-interference constraints in port container terminals [J], Transportation Research Part E,2008,44(1):124-135.
[17]Akio I, Chen HC, Etsuko N. The simultaneous berth and quay crane allocation problem [J], Transportation Research Part E, In Press, Available online 5 July,2007.
[18]Liu CI, Ioannou P. A. A comparison of different AGV dispatching rules in an automated container terminal [C], The IEEE 5th Conference on Intelligent Transportation Systems, Singapore,2002.
[19]Vis, IFA. Minimum vehicle fleet size under time-window constraints at a container terminal [J], Transportation science,2005,39(2):249-260.
[20]Etsuko N, Akio I, Stratos. Yard trailer routing at a maritime container terminal [J], Transportation Research Part E,2005,41:53-76.
[21]杨静蕾.集装箱码头物流路径优化研究[J],水运工程,2006,1：32-35.
[22]Zhang CQ, Wan YW, Liu JY. Dynamic crane deployment in container storage yards [J], Transportation Research Part B,2002,36:537-555.
[23]Linna R, Liu JY, Wan YW. Rubber tired gantry crane deployment for container yard operation [J], Computers&Industrial Engineering,2003,45:429-442.
[24]韩晓龙.集装箱港口装卸中的龙门吊数量配置[J],系统工程,2005,23(10)：12-16.
[25]李建中,韩晓龙.集装箱港口轮胎式龙门起重机的动态优化配置[J],上海海事大学学报,2005,26(3)：44-48.
[26]Kim KH, Park YM, Ryu KR. Deriving decision rules to locate export containers in container yards [J], European Journal of Operational Research,2000,124:89-101.
[27]Kim KH, Preston P, Kozan E. An approach to determine storage locations of containers at seaport terminals [J], Computers&Operations Research,2001,28:983-995.
[28]Kim KH, Park KT. A note on a dynamic space-allocation method for outbound containers [J], European Journal of Operational Research,2003,148:92-101.
[29]Zhang CQ, Liu JY, Liu YW. Storage space allocation in container terminals. [J], Transportation Research Part B,2003,37:883-903.
[30]Ng WC, Mak KL. Yard crane scheduling in port container terminals [J], Applied Mathematical Modeling,2005,29:263-276.
[31]Ng WC. Crane scheduling in container yards with inter-crane interference [J], European Journal of Operational Research,2005,164:64-78.
[32]Kim KH, Lee KM, Hwang H. Sequencing delivery and receiving operations for yard cranes in port container terminals [J], Int. J. Production Economics,2003,84:283-292.
[33]韩晓龙.集装箱港口龙门吊最优路径问题[J],土海海事大学学报,2005,26(2)：39-41.
[34]Lee DH, Cao Z, Meng Q. Scheduling of two-transtainer systems for loading outbound containers in port container terminals with simulated annealing algorithm [J], International Journal of Production Economics,2007,107(1):115-124.
[35]Erhan K, Preston P. Genetic algorithms to schedule container transfers at multimodal terminals [J], International Transport in Operation Research,1999,6:311-329.
[36]Bish EK. A multiple-crane-constrained scheduling problem in a container terminal [J], European Journal of Operational Research,2003,144:83-107.
[37]康海贵,周鹏飞.集装箱船舶装卸作业时起吊设备-车辆的规划研究[J],大连理工大学学报,2006,46(3)：372-379.
[38]Chen L, Bostel N, Dejax P. A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal [J], European Journal of Operational Research,2007,181(1):40-58.
[39]Lau HYK, Zhao Y. Integrated scheduling of handling equipment at automated container terminals [J], International Journal of Production Economics, In Press, Available online 10,2007.
[40]Redwine CN, Wismer DA. A mixed integer programming model for scheduling orders in a steel mill [J], Journal of Optimization Theory and Application,1974,14:305-318.
[41]Amours SD, Montreuil B, Soumis F. Price-based planning and scheduling of multiproduct orders in symbiotic manufacturing networks [J], European Journal of Operational Research,1996,96:148-166.
[42]铃木节也,藤原羲已,西海建一.溶銑翰送管理システム[J],神户制钢技报,1995,30(2)：48-50.
[43]田村昌弘,稻葉佑三,古贺康彦,有阑德美,何合登,入谷英榭.溶銑物流夕システムの改善[J],神户制钢技报,1996,46(2)：15-18.
[44]Lubbecke ME. Engine scheduling by column generation [D], Braunschweig University of Technology,2001.
[45]Lubbecke ME, Zimmermann UT. Engine routing and scheduling at industrial in-plant railroads [J], Transportation Science,2003,37(2):183-197.
[46]Craiga IK, Camisani-Calzolaria FR, Pistoriusb PC. A contemplative stance on the automation of continuous casting in steel processing [J], Control Engineering Practive, 2001,9:1013-1020.
[47]Harjunkoski I, Grossmann IE. A decomposition approach for the scheduling of steel plant production [J], Computers and Chemical Engineering,2001,25:16447-1660.
[48]Roy R, Adesola BA, Thornton S. Development of a knowledge model of managing schedule disturbance in steel-making [J], International Journal of Production Research, 2004,42(18):3975-3994.
[49]Kumar V, Kumar S, Tiwari MK. Auction-based approach to resovle the scheduling problem in the steel making process [J], International Journal of Production Research, 2006,44(8):1503-1522.
[50]Wright JR, Houck MH. An application of systems modeling in steel production scheduling [C], In Proceedings of the 4th International Conference, Kensington Exhibition Center, London, England,1985,15:127-140.
[51]Balas E. The prize collecting traveling salesman problem [J], Networks,1989,19: 621-636.
[52]Kosiba ED, Wright JR, Cobbs AE. Discrete event sequencing as a traveling salesman problem [J], Computers in Industry,1992,19:317-327.
[53]Cowling P. Optimisation in steel hot rolling [M], Optimization in industry 3, Chichester, England:Wiley,1995.
[54]Lopez L, Carter MW, Gendreau M. The hot strip mill production scheduling problem: A tabu search approach [J], European Journal of Operational Research,1998,106: 317-335.
[55]Tang LX, Liu JY, Rong AY, Yang ZH. A multiple traveling salesman problem (MTSP) model for hot rolling scheduling in Shanghai Baoshan Iron and Steel Complex [J], European Journal of Operational Research,2000,124:267-282.
[56]Wang DD, Tieu AK, de Boer FG., Ma B, Yuen WYD. Toward a heuristic optimum design of rolling schedules for tandem cold rolling mills [J], Engineering Application of Artificial Intelligence,2000,13:397-406.
[57]Dixit US, Dixit PM. Application of fuzzy set theory in the scheduling of a tandem cold-rolling mill [J], Journal of Manufacturing Science and Engineering-Transactions of the ASME,2000,122:494-500.
[58]Okano H, Morioka T, Yoda K. A heuristic solution for the continuous galvanizing line scheduling problem in a steel mill [R], IBM Tokyo Research Laboratory,1623-14 Shimo-tsuruma, Yamato-shi, Kanagawa-ken 242-8508, Japan,2002.
[59]Verdejo VV, Alarco MAP, Sorli MPL. Scheduling in a continuous galvanizing line [J], Computers and Operations Research,2009,36(1):280-290.
[60]Kapanoglu M, Koc IO. A multi-population parallel genetic algorithm for highly constrained continuous galvanizing line scheduling [J], Lecture Note in Computer Science,2006,4030:28-41.
[61]Tang LX, Wang XP, Liu JY. Color-coating production scheduling for coils in inventory in steel industry [J], IEEE Transactions on Automation Science and Engineering,2008, 5(3):544-549.
[62]Wang XP, Tang LX. Color-coating production scheduling in the steel industry [C], In: Proceedings of CIMA 2005, Istanbul, Turkey,2005.
[63]Tang LX, Wang XP. A predictive reactive scheduling method for color-coating production in steel industry [J], International Journal of Advanced Manufacturing echnology,2008,35:633-645.
[64]Tang LX, Liu JY, Rong AY, Yang ZH. A review of planning and scheduling systems and methods for integrated steel production [J], European Journal of Operational Research, 2001,133:1-20.
[65]Lee HS, Murthy SS, Haider SW, Morse DV. Primary production scheduling at steelmaking industries [J], IBM Journal of Research and Development,1996,40, 231-252.
[66]Sun BR. The overseas progress of hot charge and direct rolling technology [J], Journal of Rolling Mill,1992,2:41-44.
[67]李耀华,胡国奋,王伟,宁树实.炼钢-连铸-热轧一体化生产计划编制方法研究[J],控制工程,2005,12(6)：549-552.
[68]Masaoka T. Casting-direct rolling technology applied to Sakai works of Nippon Steel Corporation [J], Nippon Technical Report,1994,70:97-100.
[69]Okano H, Davenport AJ, Trumbo M, Reddy C, Yoda K, Amano M. Finishing line scheduling in the steel industry [J], IBM Journal of Research and Development,2004, 48(5/6):811-830.
[70]Tang LX, Zhao YF. Scheduling a single semi-continuous batching machine [J], Omega, 2008,36:992-1004.
[71]李颢,邵惠鹤,任德祥,钱勤生.基于遗传算法的均热炉群装炉出炉调度[J],控制与决策,1999,2：135-139.
[72]Moon S, Hrymak AN. Scheduling of the batch annealing process - deterministic case [J], Computers and Chemical Engineering,1999,23(9):1193-1208.
[73]吴涛,陈荣秋.冷卷热处理生产调度模型的启发式算法[J],华中科技大学学报(自然科学版),2006,10：58-60..
[74]Samuel E. Kemp AR, Andrew JW, Jan DW. Artificial intelligence for automatic container stowage planning optimization [J], HANSA Schiffahrt Schiffbau Hafen,2004, 4:22-26.
[75]Webster WC, Van DP. Automated procedures for the allocation of containers on shipboard [C], Computer Aided Ship Design Engineering Summer Conference, Annals Arbor,1969.
[76]Scott DK, Chen DS. A loading model for a container ship [D], Matson:Navigation Cambridge,1978.
[77]Martin GL, Methodology Randhawa S U, and evaluation. McDowell E D. Compterised container ship load planning [J], Computer&Industry Engineer,1988,14(4):429-440.
[78]Avriel M, Penn M, Shpirer N. Stowage planning for container ships to reduce the number of shifts [J], Annals Operations Research,1998,76:55-71.
[79]Aslidis AH. Optimal container loading [D], Cambridge:Massachusetts Institute of Technology,1984.
[80]Botter RC, Brinati MA. Stowage container planning:a model for solution [J], Computer Applications in the Automation Design, IFIP Transactions B (Applications in Tech.) of Shipyard Getting Operation an Optimal and Ship,1992,217-229.
[81]Ambrosino D, Sciomachen A, Tanfani E. Stowing a containership:the master bay plan problem [J], Transportation Research Part A,2004,38:81-99.
[82]Wilson ID, Roach PA. Principles of combinatorial optimization applied to containership stowage planning [J], Journal of Heuristic,1999,5:403-418.
[83]Wilson ID, Roach PA, Ware JA container stowage preplanning:using search to generate solutions, a case study [J], Knowledge Based Systems,2001,14:137-145.
[84]Akio I, Dazuya S, Etsuko N. Multi-objective simultaneous stowage and load planning fro a container ship with container rehandle in yard stacks [J], European Journal of Operational Research,2005,171(3):373-389.
[85]Dillingham J, Perakis A N. Application of artificial intelligent in marine industry [R], Marad Report, MA-RD- 770-87015.
[86]Dillingham J, Dumbleton J. Expert system for container stowage planning [R], Proceedings-Ship Technology and Research (STAR) Symposium,21" Century — Ship and Offshore Vessel Design, Construction and Operation. New Orleans, Soc of Naval Architects&Marine Engineers,1989.
[87]Dillingham J, Perakis J. Design of an expert system for container stowage planning [C], Fleet Management Technology Conference, Baltimor,1987.
[88]Todd. DS, Sen P. A Multiple Criteria genetic algorithm for container ship loading [C], In Proceedings of the Seventh International Conference on Genetic Algorithms,1997.
[89]Ryu KR, Kim KH, Lee YH. Loading sequencing Algorithms for container ships by Using Meta-heuristics [C], In 16th International conference on Producton Research, 2001.
[90]Dubrovsky O, Levitin G, Penn M. A genetic algorithm with a compact solution encoding for the container ship stowage problem [J], Journal of Heuristics,2002,8: 585-599.
[91]丁以中,费红英,韩晓龙.港口集装箱流研究现状与分析[J],上海海运学院学报,2004,25(2)：45-54.
[92]王照宁.集装箱船舶自动配载系统管理模型的建立与研究[J],大连海运学院学报,1994,20(2)：70-74.
[93]邱文昌.集装箱船舶积载计划计算机评价系统[J],上海海运学院学报,1994,15(4)：33-39.
[94]司智荣.集装箱船舶配载的计算机管理[J],港口装载,1995,101：61-62.
[95]王宇,邢月华.集装箱码头生产作业计划决策支持系统[J],交通与计算机,1997,15(1)：27-31.
[96]顾宣炎,周瑞平.计算机辅助集装箱船舶配载[J],水运科技信息,1998,166(1)：19-21.
[97]周瑞平,肖志强.基于VB的集装箱船舶积载计算及程序编制[J],江苏船舶,1999,16(3)：29-32.
[98]杨宏,张金铭,秦士元.集装箱船计算机辅助排箱与配载研究[J],中国造船,1998,140(1)：81-86.
[99]王鸿鹏.基于知识的集装箱船自动配积载专家系统[J],上海海运学院学报,2002,23(1)：46-49.
[100]杨星,季永青.集装箱配载优化方法研究[J],武汉理工大学学报(交通科学与工程版),2002,26(2)：223-226.
[101]郝聚民.纪卓尚等.集装箱船舶实配过程的遗传算法解决策略[J],中国造船,1999,146(3)：8-15.
[102]Azar Y, Epstein L. On two dimensional packing [J], Journal of Algorithms,1997,25: 290-310.
[103]Martello S, Pisinger D, Vigo D. The three-dimensional bin packing problem [R], Technical Report DEIS-OR,1997,97-6.
[104]Friesen DK, Langston MA. Variable sized bin packing [J], SI AM Journal of Computing, 1986,15(1):222-230.
[105]Oh YF, Son SH. On a constrained bin-packing problem [R], Technical Report,1995, University of Virginia Charlottesville.
[106]Assman SB, Johnson DS, Kleitman DJ. and J.YT. Leung. On a dual version of the one-dimensional bin packing problem [J], Journal of Algorithms,1984,5(4):502-525.
[107]Kantorovich LV. Mathematical methods of organizing and planning production [J], Management Science,1990,6:366-422.
[108]Petra S, Gerhard W. The Bin-packing problem:a problem generator and some numerical experiments with FFD packing and MTP [J], International Transactions in Operational Research,1997,4(5/6):377-389.
[109]Miro G, Gortan R, Miorljub K. A hybrid approach for optimization of one-dimensional cutting [J], European Journal of Operational Research,1999,119(3):719-728.
[110]Zhang GH, Cai XQ, Wong CK. Linear time approximation algorithms for bin packing [J], Operations Research Letters,2000,26(5):217-222.
[111]Coffman EG, Garey MR, Johnson DS. Approximation algorithms for bin packing:a survey Approximation Algorithms for NP-Hard Problems [M], Boston:PWS Publishing,1997,46-93.
[112]Vasko FJ, Newhart DD, Kenneth LS. A hierarchical approach for one dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading [J], European Journal of Operational Research,1999,114(1):72-82.
[113]Dagli CH, Tatoglu MY. An approach to two dimensional cutting stocks problems [J], International Journal of Production Research,1987,25(2):175-190.
[114]Dagli C.Cutting stock problem:Combined use of heuristics and optimization methods [C], In Proceedings of the 9th International Conference on Production Research,1987, 843.
[115]Gilmore PC, Gomory RE. A linear programming approach to the cutting stock problem [J], Operations Research,1961,9(5):849-859.
[116]Christofides N, Whitlock C. An algorithm for two-dimensional cutting problems [J], Operations Research,1977,25(1):30-44.
[117]Beasley JE. An exact two-dimensional non-guillotine cutting tree search procedure [J], Operations Research,1985,33(1):49-64.
[118]Hifi M, Zissimopolous V. Constrained two-dimensional cutting:An improvement of Christofides and Whitlock's exact algorithm [J], Journal of the Operational Research Society,1997,48:324-331.
[119]Baker BS, Coffman JEG, Rivest RL. Orthogonal packing in two dimensions [J], SIAM Journal on Computing,1980,9:846-855.
[120]Pisinger D. Heuristics for the container loading problem [J], European Journal of Operational Research,2002.141:143-153.
[121]Bortfeldt A, Gehring H. A hybrid genetic algorithm for the container loading problem [J], European Journal of Operational Research,2001,131:143-161.
[122]Bischoff EE, Janetz F, Ratcliff MSW. Loading pallets with non-identical items [J], European Journal of Operational Research,1995,84:681-692.
[123]H. Gehring, A. Borifeldt. A genetic algorithm for solving the container loading problem [J], International Transactions in Operational Research,1997,4:401-418.
[124]Eley M. Solving container loading problems by block amangement [J], European Journal of Operational Research,2002,141:393-409.
[125]Bortfeldt A, Gehring H, Mack D. A parallel tabu search algorithm for solving the container loading problem [J], Parallel Computing,2003,29:641-662.
[126]Fanslau T, Andrews Bortfeldt. A tree algorithm for solving the container loading problem, Diskussionsbeitrage 2008.
[127]何大勇,查建中,姜义东.遗传算法求解复杂集装箱装载问题方法研究[J],软件学报,1995,12(9)：1380-1385.
[128]陆一平.查建中三维矩形块布局的序列三元组编码方法[J],软件学报,2002,13(11)：2183-2187.
[129]李广强,滕弘飞.装填布局的同构和非同构模式[J],计算机学报,2003,10：1248-1254.
[130]黄文奇,刘景发.基于欧氏距离的矩形Packing问题的确定性启发式求解算法[J],计算机学报,2006,5：734-739.
[131]Toyohiro U, Akira K, Masami K, Shinzo K, Shinji T. Optimiation search algorithm of allocation planning for strip coils in hold for shipment by using operational know-how [J],2001,41(5):446-453.
[132]李虎,霍佳震,陈瑶.一种求解船舶配载问题的混合遗传算法[J],工业工程与管理,2006,3：27-31.
[133]Daniela Ambrosino, Anna sciomachen and Elena Tanfani. Stowing acontainership:the master bay plan problem [J], Transportation Research Part A,2004,38:81-99.
[134]Avriel M, Penn M. Exact and approximate solutions of the container ship stowage problem [J], Computer Industry Engineer,1993,25:271-274.
[135]Saginaw DJ, Perakis AN. A decision support systemfor container ship stowage planning [J], Marine Technol,1989,26:47-61.
[136]Shin JY, Nam KC. Intelligent decision support system for container ship auto-stowage planning [J], J Korean Inst Port Res,1995,9:19-32.
[137]Golderg DE. Genetic algorithms in search, optimization and machine learning [R], Addison-Wesley Publishing Company, Inc.,Reading, MA,1989.
[138]Glover F. Tabu search-Part Ⅰ [J], ORSA Journal on Computing,1989 1(3):190-206.
[139]Glover F. Tabu search-Part Ⅱ [J], ORSA Journal on Computing,1990,2(1):4-32.
[140]Kirkpatrick S, Gelatt CD, Jr, Vecchi MP. Optimization by simulated annealing [J], Science,1983,220(4598):498-516.
[141]Daganzo, CF. Crane productivity and ship delay in ports [J], Transportation Research Record,1989,1251:1-9.
[142]Kim, KH, Kim, HB. The optimal sizing of the storage space and handling facilities for import containers [J], Transportation Research Part B,2002,36:821-835.
[143]Kim KY, Kim KH. A routing algorithm for a single straddle carrier to load export containers onto a containership [J], International Journal of Production Economics, 1999,59:425-433.
[144]Kim KH, Kim KY. Routing straddle carriers for the loading operation of containers using a beam search algorithm [J], Computers & Industrial Engineering 1999,36: 109-113.
[145]Hansen P. The steepest ascent mildest descent heuristic for combinatorial programming [C], Congress on numerical methods in combinatorial optimization, Capri, Italy.
[146]Dilek T, Laura IB. A two-phase tabu search approach to the location routing problem, [J], European Journal of Operational Research,1999,116(1):87-99.
[147]Danzig, GB, Ramser, JH. The Truck Dispatching Problem [J], Management Science, 1959,6:80-91.
[148]Tang LX, Wang GS, Liu JY. A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry [J], Computers & Operations Research: Available online,20 December 2005.
[149]Carpaneto, G, Dell'Amico M, Fischetti M, Toth P. A branch and bound algorithm for the multiple depot vehicle scheduling problem [J], Networks,1989,19:531-548.
[150]Forbes, MA, Holt JN, Watts AM. An exact algorithm for the multiple depot bus scheduling problem [J], European Journal of Operational Research,1994,72(1): 115-124.
[151]L6bel, A. Optimal vehicle scheduling in public transit [D], Ph.D. Dissertation, TU Berlin,1998a.
[152]Lobel, A. Vehicle scheduling in public transit and lagrangian pricing [J], Management Science,1998b,44:1637-1649.
[153]Funke B, Grunert T. Local search for vehicle routing and scheduling problems:Review and Conceptual Integration [J], Journal of Heuristics,2005,11:267-306.
[154]Yoshiyuki N, Minako I, Hiroshi I, Hiroshi H. The method of vehicle scheduling problem in iron and steel industry [J], Japan Operation Research,1994,3.
[155]Akio I, Chen HC, Etsuko N, Stratos P. The simultaneous berth and quay crane allocation problem [J], Transportation Research Part E,2008,44(5):900-920.
[156]Meisel F, Bierwirth C. Heuristics for the integration of crane productivity in the berth allocation problem [J], Transportation Research Part E,2009,45:196-209.
[157]WIT Press CA, Boston. A constraints satisfaction approach for master bay plans [J], Maritime Engineering and Ports,1998,155-164.
[158]OPHER D, GREGORY L, MICHAL P. A genetic algorithm with a compact solution encoding for the container ship stowage problem [J], Journal of Heuristics,2002,8: 585-599.
[159]Avriel M, Penn M, Shpirer N. Container ship stowage problem:complexity and connection to the coloring of circle graphs [J], Discrete Applied Mathematics,2000, 103:271-279.
[160]Akio I, Kazuya S, Etsuko N, Stratos P. Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks [J], European Journal of Operational Research,2006,171:373-386.
[161]Avriel M, Penn M, Shpirer N, Witteboon S. Stowage planning for container ships to reduce the number of shifts [J], Annals of Operations Research,1998,76:55-71.
[162]Huang WQ, He K. A new heuristic algorithm for cuboids packing with no orientation constraints [J], Computers & Operations Research,2007,36:425-432.
[163]Bortfeldt A, Mack D. A heuristic for the three-dimensional strip packing problem [J], European Journal of Operational Research,2007,183:1267-1279.
[164]Higgins AJ. A dynamic tabu search for large-scale generalised assignment problems [J], Computers & Operations Research,2001,28:1039-1048.
[165]Gan DQ, Qu ZH, Cai HZ. Large-scale var optimization and planning by tabu search [J], Electric Power Systems Research,1996,39:195-204.
[166]Waligora G Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation [J], European Journal of Operational Research, Available online,7 November 2007.
[167]Alan R. McKendall Jr. proved Tabu search heuristics for the dynamic space allocation problem [J], Computers & Operations Research,2008,35:3347-3359.
[168]Alan R. McKendall Jr, Jaramillo JR. A tabu search heuristic for the dynamic space allocation problem [J], Computers & Operations Research,2006,33:768-789.
[169]Ouzineb M, Nourelfath M, Gendreau M. Tabu search for the redundancy allocation problem of homogenous series-parallel multi-state systems [J], Reliability Engineering and System Safety,2008,93:1257-1272.
[170]黄迪明.C++程序设计基础[M],北京：电子工业出版社,2003,123-145.
[171]肖宏伟.专家门诊Visual C++开发答疑[M],北京：人民邮电出版社,2004,120-136.
[172]飞思科技产品开发中心.开发专家之数据库SQL Server 2000基础与提高[M],北京：电子工业出版社,2001,18-39.
[173]彭东.SQL Server 2000应用开发指南[M],北京：清华大学出版社,2001：25-46.
[174]启明工作室.Visual C+++SQL Server数据库应用系统开发与实例[M],北京：人民邮电出版社,2004,156-189.
[175]龚家骧.数据库需求分析与规划[M],北京：高等教育出版社,2004.