基于异步时间段的原油混输调度连续时间建模研究

采用严格的数学规划方法对沿海炼厂的原油混输调度问题进行了建模和求解,提出了一个基于异步时间段的连续时间混合整数非线性规划(MINLP)数学模型。该模型具有整型变量少,求解快的优点。采用求解一系列MILP来近似求解非凸的MINLP,避免了原油混输MILP模型产生的浓度不一致问题。文中采用提出的新模型和算法对文献中的9个实例进行了计算,相同计算条件的4个实例比离散时间模型效率提高86％-1011％。     

自动化仓库巷道网络AGV货区遍历优化——设计基于优先权遗传算法实现

针对自动化仓库、自动化车间及自动化码头等自动化局部物流存储系统仓库巷道网络中AGV（自动化导引车）对仓库货区遍历作业的路径优化问题,以搜索遍历所有货区的最短路径为目标,建立混合整数线性规划模型,并设计基于优先权的遗传算法求解。通过Matlab仿真实验分析比较算子性能,验证算法的有效性。     

Scheduling automated transport vehicles for material distribution systems

The rise of advanced manufacturing technology has led to enhanced, efficient material handling equipment in manufacturing and container terminal environments. In order to exploit the full potential of advanced material handling equipment in real-world industrial environments, novel scheduling approaches capable of ensuring integrated operations for multiple automated transport vehicles need to be developed. This research develops a methodology for scheduling automated transport vehicles to ensure the smooth flow of materials in production and container terminal environments. The procedure consists of a mixed-integer programming model and two meta-heuristic-based algorithms that are proposed to achieve quality schedules within a reasonable amount of time. The obtained results show a significant reduction in the earliness or lateness of material delivery tasks and an improvement in operational performance, demonstrating that the proposed approaches are capable of ensuring smooth material distribution by scheduling automated transport vehicles in an integrated manner.     

一种集成FMS零件分批与机器装载的新方法

提出一种解决FMS零件分批与机器装载问题的新思路.建立了问题的混合整数规划模型,研究了基于遗传算法的求解方案.在遗传算法的编码策略中,引入了虚工件和虚工序的概念,并设计了相应问题特征的交叉算子与变异算子.仿真结果验证了方案的有效性.     

Type II robotic assembly line balancing problem: An evolution strategies algorithm for a multi-objective model

In this paper a different type II robotic assembly line balancing problem (RALB-II) is considered. One of the two main differences with the existing literature is objective function which is a multi-objective one. The aim is to minimize the cycle time, robot setup costs and robot costs. The second difference is on the procedure proposed to solve the problem. In addition, a new mixed-integer linear programming model is developed. Since the problem is NP-hard, three versions of multi-objective evolution strategies (MOES) are employed. Numerical results show that the proposed hybrid MOES is more efficient.     

Clamps positioning and optimal holding positions in a DNC punchpress

A process planning problem typically encounted in flexible manufacturing systems (FMS) treating laminated material (e.g. metal sheets) is modeled and solved. In such production systems, computer-controlled clamps hold the material on a work table. Sheet repositioning represents an important proportion of the processing time. Models are developed that give, under various operational conditions, a minimal set of repositionings. The first formulation of the model calls for a medium-size mixed-integer programming problem. In a subsequent reformulation, the real-life problem is reduced to a set of simpler linear programming problems. Illustrations of the method, as currently implemented on a FMS, are provided     

Optimal control of polymer flooding based on mixed-integer iterative dynamic programming

Polymer flooding is one of the most important technologies for enhanced oil recovery. In this article, a mixed-integer optimal control model of distributed parameter systems (DPS) for the injection strategies is established, which involves the performance index as maximum of the profit, the governing equations as the fluid flow equations of polymer flooding and some inequalities constraints, such as polymer concentration and injection amount limitation. The control variables are the volume size, the injection concentration of each slug and the terminal flooding time. For the constant injection rate, the slug size is determined by the integer time stage length, and thus the integer variables are introduced in the DPS. To cope with the optimal control problem (OCP) of this DPS, a mixed-integer iterative dynamic programming incorporating a special truncation procedure to handle integer restrictions on stage lengths is proposed. First, the OCP with variable time stage lengths is transformed into a fixed time stage problem by introducing a normalised time variable. Then, the optimisation procedure is carried out at each stage and preceded backwards in a systematic way. Finally, the numerical results of an example illustrate the effectiveness of the proposed method.     

Modeling and solving mixed-model assembly line balancing problem with setups. Part I: A mixed integer linear programming model

This paper is the first one of the two papers entitled “modeling and solving mixed-model assembly line balancing problem with setups”, which has the aim of developing the mathematical programming formulation of the problem and solving it with a hybrid meta-heuristic approach. In this current part, a mixed-integer linear mathematical programming (MILP) model for mixed-model assembly line balancing problem with setups is developed. The proposed MILP model considers some particular features of the real world problems such as parallel workstations, zoning constraints, and sequence dependent setup times between tasks, which is an actual framework in assembly line balancing problems. The main endeavor of Part-I is to formulate the sequence dependent setup times between tasks in type-I mixed-model assembly line balancing problem. The proposed model considers the setups between the tasks of the same model and the setups because of the model switches in any workstation. The capability of our MILP is tested through a set of computational experiments. Part-II tackles the problem with a multiple colony hybrid bees algorithm. A set of computational experiments is also carried out for the proposed approach in Part-II.     

Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: A mathematical formulation and an Anarchic Society Optimization algorithm

This paper addresses a ternary-integration scheduling problem that incorporates employee timetabling into the scheduling of machines and transporters in a job-shop environment with a finite number of heterogeneous transporters where the objective is to minimize the completion time of all jobs. The problem is first formulated as a mixed-integer linear programming model. Then, an Anarchic Society Optimization (ASO) algorithm is developed to solve large-sized instances of the problem. The formulation is used to solve small-sized instances and to evaluate the quality of the solutions obtained for instances with larger sizes. A comprehensive numerical study is carried out to assess the performance of the proposed ASO algorithm. The algorithm is compared with three alternative metaheuristic algorithms. It is also compared with several algorithms developed in the literature for the integrated scheduling of machines and transporters. Moreover, the algorithms are tested on a set of adapted benchmark instances for an integrated problem of machine scheduling and employee timetabling. The numerical analysis suggests that the ASO algorithm is both effective and efficient in solving large-sized instances of the proposed integrated job-shop scheduling problem.     

集装箱码头装卸桥调度优化模型与算法

研究装卸桥调度优化问题,以提高集装箱码头装卸效率。首先,建立了混合整数规划模型,模型充分考虑了集装箱装卸桥调度优化中的各种约束条件及特点。为了求解设计了基于遗传算法的求解方法,并且采用随机贪婪适应性搜索方法对算法进行改进。最后,通过实际算例对模型与算法的有效性进行了验证。     

Fuzzy programming for mixed-integer optimization problems

Mixed-integer optimization problems belong to the group of NP-hard combinatorial problems. Therefore, they are difficult to search for global optimal solutions. Mixed-integer optimization problems are always described by precise mathematical programming models. However, many practical mixed-integer optimization problems have inherited a more or less imprecise nature. Under these circumstances, if we take into account the flexibility of the constraints and the fuzziness of the objectives, the original mixed-integer optimization problems can be formulated as fuzzy mixed-integer optimization problems. Mixed-integer hybrid differential evolution (MIHDE) is an evolutionary search algorithm which has been successfully applied to many complex mixed-integer optimization problems. In this article, a fuzzy mixed-integer mathematical programming model is developed to formulate the fuzzy mixed-integer optimization problem. In addition the MIHDE is introduced to solve the fuzzy mixed-integer programming problem. Finally, the illustrative example shows that satisfactory results can be obtained by the proposed method. This demonstrates that MIHDE can effectively handle fuzzy mixed-integer optimization problems.     

求解炼钢连铸生产调度问题的改进算法

将炼钢连铸生产调度问题抽象为混和流水车间调度,建立了0-1型混合整数线性规划模型,并提出了一种遗传和线性规划相结合的求解方法。该模型通过优化钢水传搁时间来满足钢水的温度要求,通过最小化浇次开浇提前/拖期惩罚来协调连铸与热轧间的生产节奏。在算法设计中,给出了一种染色体编码来表示炉次设备指派与炉次在设备上的加工顺序方案,并探讨了相应的遗传操作。最后,仿真实验的结果表明了该算法的有效性。     

A robust green traffic-based routing problem for perishable products distribution

Nowadays, transportation and logistics are considered as the drivers of economic development in the countries due to their impacts on the main variables of the country's economy such as production, employment, price, and the cost of living. Statistics indicate that fuel consumption constructs a major part of transportation costs, where its optimization leads to the creation of an energy-efficient and sustainable transportation system. On the other hand, vehicles' traffic is also one of the main criteria affecting the travel time of vehicles between demand nodes in a supply chain, increasing fuel consumption, and, consequently, damaging effects of greenhouse gasses. In this paper, a novel robust mixed-integer linear programming model is developed for a green vehicle routing problem with intermediate depots considering different urban traffic conditions, fuel consumption, time windows of services, and uncertain demand for perishable products. To validate and solve the suggested model, CPLEX solver of GAMS software is employed as an exact method. Finally, a case study problem is investigated to evaluate the applicability of the proposed model and determine the optimal managerial insights and policies in the real-world conditions using sensitivity analyses. Moreover, a novel robustness threshold comparison is conducted to find the optimal level of budget assignment.     

Introducing a mixed-integer non-linear fuzzy model for risk management in designing supply chain networks

Nowadays, supply chains play an inevitable role in prompt handling of varying customers’ needs. Administration of a successful supply chain depends on how efficiently the network design is accomplished. Therefore, a supply chain network design problem is considered in this paper. The network addresses an uncertain environment threatened by different risk sources in order to captivate the real world conditions. A mixed-integer non-linear mathematical model is developed in which the uncertainties are represented by the fuzzy set theory. Benders decomposition is then applied to solve the proposed problem; consequently, the model is transformed into a mixed-integer one. Moreover, an interactive resolution method is applied to provide the decision maker with alternative decision plans in regard to different satisfaction degrees. Finally, the accuracy of the proposed model is checked by sensitivity analysis test and its performance is considered by different numerical examples.     

Mixed-integer linear programming models for batch sterilization of packaged-foods plants

Batch sterilization with individual retorts is a common mode of operation in many food-canning plants. Although high-speed processing with continuous rotary or hydrostatic retort systems is used in very large canning factories, such systems are not economically feasible in the majority of small- to medium-sized canneries. In such canneries, sterilization is carried out in a battery of retorts as a batch process. Although the unloading and reloading operations for each retort are labor intensive, a well-designed and managed plant can operate with surprising efficiency if it has the optimum number of retorts and scheduling of retort operation. The objective of this research was to present two mathematical models for sterilization scheduling in food-canning plants. The first model developed is for the case where given amount of different canned food products with specific quality requirements would be sterilized within a minimum plant operation time in an autoclave of given capacity. The second model addresses the problem of maximizing the amount of sterilized products in an autoclave of given capacity for given plant operation time. The developed models were based on mixed-integer linear programming and incorporated the possibility of simultaneous sterilization. Simultaneous sterilization applies mainly to small canneries with few retorts. In these situations, retorts often operate with only partial loads because of the small lot sizes, and they are severely under-utilized. In order to demonstrate the feasibility of the mixed-integer linear programming (MILP) models, several examples involving the sterilization of different products were included in this research. The methodology proposed in this study is of special relevance for small- and medium-sized food-canning plants that normally work with many different products at the same time.     

A mixed-integer programming model for evaluating distribution configurations in the steel industry

In this paper, a mixed-integer programming model is developed to aid management in the analysis of a distribution problem in the steel industry. In this problem, the company has seven service centers located in the northeastern part of the country. In order to maintain reasonable inventory levels and fast customer service, there is a considerable amount of transshipment between the service centers. The model takes as inputs supply and demand levels, transportation costs, loading/unloading costs and potential routes. The output of the model is a minimum cost distribution schedule. The model allows management to quickly evaluate various distribution scenarios, including the establishment of a central transfer facility.     

考虑堆场缓冲区容量的ASC与AGV集成调度

为提高自动化集装箱码头作业效率,针对卸船过程中自动化堆垛起重机(Automated Stacking Crane,ASC)与自动化导引小车(Automated Guided Vehicle,AGV)的集成调度问题,考虑缓冲区容量约束,以最小化总任务完成时间和总任务延迟时间为目标,建立带时间窗的混合整数规划模型,确定任务与缓冲位的分配关系,优化ASC的作业顺序。对比实验分析表明,在大规模算例上,遗传算法的目标函数值逐渐优于分支定界法,且遗传算法能在有限时间求出理想解,验证模型和算法的有效性。灵敏度实验分析表明,ASC作业时间的增加对总任务延迟时间有显著影响,总任务延迟时间的快速增加引起目标函数值的快速增加。     

An augmented self-adaptive parameter control in evolutionary computation: A case study for the berth scheduling problem

The demand for international seaborne trade has substantially increased over the last three decades and is predicted to continue increasing during the upcoming years. A marine container terminal, as an important node in supply chains, should be able to successfully cope with increasing demand volumes. Berth scheduling can significantly influence the general throughput of marine container terminals. In this study, a mixed-integer linear programming mathematical model is proposed for the berth scheduling problem, aiming to minimize the summation of waiting costs, handling costs, and late departure costs of the vessels that are to be served at a marine container terminal. An innovative Evolutionary Algorithm is designed to solve the developed mathematical model. The proposed solution algorithm relies on the augmented self-adaptive parameter control strategy, which is developed in order to effectively change the algorithmic parameters throughout the search process. Performance of the designed algorithm is evaluated against nine alternative state-of-the-art metaheuristic-based algorithms, which have been frequently used for berth scheduling in the marine container terminal operations literature. The results demonstrate that all the developed algorithms have a high level of stability and return competitive solutions at convergence. The computational experiments also prove superiority of the designed augmented self-adaptive Evolutionary Algorithm over the alternative algorithms in terms of different performance indicators.     

A two-stage heuristic for multi-activity and task assignment to work shifts

The multi-activity assignment problem consists of assigning interruptible activities to given work shifts so as to match as much as possible for each activity a demand curve in function of time. In this paper we consider an extension to this problem, called the multi-activity and task assignment problem, that additionally considers the assignment of uninterruptible pieces of work, called tasks. These possess properties such as worker qualifications, time windows for completion, fixed lengths and precedence relationships. We propose a mixed-integer programming formulation and a two-stage method to solve this problem. The first stage consists of an approximation mixed-integer programming model to assign tasks approximately taking into account the activities and the second involves a column generation heuristic for assigning activities and reassigning tasks at the same time. We suggest four different strategies for reassigning tasks. We conducted extensive computational tests on randomly generated instances in order to validate our method and to compare the various strategies. One strategy proved universally best when compared to the other three policies.     

An improved hybrid particle swarm optimization algorithm for fuzzy p-hub center problem

The p-hub center problem is useful for the delivery of perishable and time-sensitive system such as express mail service and emergency service. In this paper, we propose a new fuzzy p-hub center problem, in which the travel times are uncertain and characterized by normal fuzzy vectors. The objective of our model is to maximize the credibility of fuzzy travel times not exceeding a predetermined acceptable efficient time point along all paths on a network. Since the proposed hub location problem is too complex to apply conventional optimization algorithms, we adapt an approximation approach (AA) to discretize fuzzy travel times and reformulate the original problem as a mixed-integer programming problem subject to logic constraints. After that, we take advantage of the structural characteristics to develop a parametric decomposition method to divide the approximate p-hub center problem into two mixed-integer programming subproblems. Finally, we design an improved hybrid particle swarm optimization (PSO) algorithm by combining PSO with genetic operators and local search (LS) to update and improve particles for the subproblems. We also evaluate the improved hybrid PSO algorithm against other two solution methods, genetic algorithm (GA) and PSO without LS components. Using a simulated data set of 10 nodes, the computational results show that the improved hybrid PSO algorithm achieves the better performance than GA and PSO without LS in terms of runtime and solution quality.