Earliness–tardiness minimization on scheduling a batch processing machine with non-identical job sizes

This paper considers the scheduling problem of minimizing earliness–tardiness (E/T) on a single batch processing machine with a common due date. The problem is extended to the environment of non-identical job sizes. First, a mathematical model is formulated, which is tested effectively under IBM ILOG CPLEX using the constraint programming solver. Then several optimal properties are given to schedule batches effectively, and by introducing the concept of ARB (Attribute Ratio of Batch), it is proven that the ARB of each batch should be made as small as possible in order to minimize the objective, designed as the heuristic information for assigning jobs into batches. Based on these properties, a heuristic algorithm MARB (Minimum Attribute Ratio of Batch) for batch forming is proposed, and a hybrid genetic algorithm is developed for the problem under study by combining GA (genetic algorithm) with MARB. Experimental results demonstrate that the proposed algorithm outperforms other algorithms in the literature, both for small and large problem instances.     

The induced generalized aggregation operators for intuitionistic fuzzy sets and their application in group decision making

In this paper, we present the induced generalized intuitionistic fuzzy ordered weighted averaging (I-GIFOWA) operator. It is a new aggregation operator that generalized the IFOWA operator, including all the characteristics of both the generalized IFOWA and the induced IFOWA operators. It provides a very general formulation that includes as special cases a wide range of aggregation operators for intuitionistic fuzzy information, including all the particular cases of the I-IFOWA operator, GIFOWA operator and the induced intuitionistic fuzzy ordered geometric (I-IFOWG) operator. We also present the induced generalized interval-valued intuitionistic fuzzy ordered weighted averaging (I-GIIFOWA) operator to accommodate the environment in which the given arguments are interval-valued intuitionistic fuzzy sets. Further, we develop procedures to apply them to solve group multiple attribute decision making problems with intuitionistic fuzzy or interval-valued intuitionistic fuzzy information. Finally, we present their application to show the effectiveness of the developed methods.     

Short-term load forecasting using bayesian neural networks learned by Hybrid Monte Carlo algorithm

This paper presents a short term load forecasting model based on Bayesian neural network (shorted as BNN) learned by the Hybrid Monte Carlo (shorted as HMC) algorithm. The weight vector parameter of the Bayesian neural network is a multi-dimensional random variable. In learning process, the Bayesian neural network is considered as a special Hamiltonian dynamical system, and the weights vector as the system position variable. The HMC algorithm is used to learn the weight vector parameter with respect to Normal prior distribution and Cauchy prior distribution, respectively. The Bayesian neural networks learned by Laplace algorithm and HMC algorithm and the artificial neural network (ANN) learned by the BP algorithm were used to forecast the hourly load of 25 days of April (Spring), August (Summer), October (Autumn) and January (Winter), respectively. The roots mean squared error (RMSE) and the mean absolute percent errors (MAPE) were used to measured the forecasting performance. The experimental result shows that the BNNs learned by HMC algorithm have far better performance than the BNN learned by Laplace algorithm and the neural network learned BP algorithm and the BNN learned by HMC has powerful generalizing capability, it can welly solve the overfitting problem.     

Group decision making based on incomplete multiplicative and fuzzy preference relations

The main aim of this paper is to investigate the group decision making on incomplete multiplicative and fuzzy preference relations without the requirement of satisfying reciprocity property. This paper introduces a new characterization of the multiplicative consistency condition, based on which a method to estimate unknown preference values in an incomplete multiplicative preference relation is proposed. Apart from the multiplicative consistency property among three known preference values, the method proposed also takes the multiplicative consistency property among more than three values into account. In addition, two models for group decision making with incomplete multiplicative preference relations and incomplete fuzzy preference relations are presented, respectively. Some properties of the collective preference relation are further discussed. Numerical examples are provided to make a discussion and comparison with other similar methods.     

Integrated mathematical optimisation approach for the tower crane hook routing problem to satisfy material demand requests on-site

Optimising decisions around the location and operation of tower cranes can improve the workflow in construction projects. Traditionally, the location and allocation problems involved in tower crane operations in the literature have been solved separately from the assignment of material supply points to demand points and the scheduling of the crane’s activity sequence across supply and demand points on a construction site. To address the gap, this paper proposes a binary integer programming problem, where location of the tower crane, allocation of supply points to material-demanding regions, and routing of hook of the crane based on activity sequencing of the hook across supply and material-demanding regions on site are optimised. The novelty in this work is in the way the crane’s activity scheduling is modelled via mathematical programming, based on routing the hook movement to meet material demand, through minimising tower crane operating costs. A realistic case study is solved to assess the validity of the model. The model is contrasted with results obtained from other solving algorithms commonly adopted in the literature, along with a solution proposed by an experienced practitioner. Results indicate that all instances can be solved when compared to other meta-heuristics that fail to achieve an optimum solution. Compared to the solution proposed by the practitioner, the results of the proposed model achieve a 46% improvement in objective function value. Planners should optimise decisions related to the location of the crane, the crane’s hook movement to meet service requests, and supply points’ locations and assignment to material-demanding regions simultaneously for effective crane operations.     

方案偏好已知的三角模糊数型多属性决策方法

研究决策者对方案偏好已知、属性值以三角模糊数形式给出且属性权重信息不能完全确知的多属性决策问题.提出了基于模糊比例值的决策方法和基于模糊偏差度的决策方法,这两种方法首先建立一个线性规划模型,通过求解该模型获得属性权重;然后,基于三角模糊数两两比较的可能度公式及三角模糊数排序公式,对决策方案进行排序和择优;最后,通过实例验证了方法的可行性和有效性.     

C2C型拍卖网站模式及发展策略

从C 2C型拍卖网站角度出发,对其进行了介绍,并结合了我国目前C 2C拍卖网站的概况进行了分析;最后指出了拍卖网站应以用户为核心,提出了虚拟社群的经营发展策略。     

Constructive heuristics for the Mixed Capacity Arc Routing Problem under Time Restrictions with Intermediate Facilities

The Mixed Capacity Arc Routing Problem under Time Restrictions with Intermediate Facilities (MCARPTIF) is an extension of the Arc Routing Problem under Capacity and Length Restrictions with Intermediate Facilities (CLARPIF) with application in municipal waste collection. This paper evaluates four constructive heuristics capable of computing feasible solutions for the MCARPTIF with a primary objective to either minimise total cost or to minimise the fleet size. The heuristics were adapted from Path-Scanning and Improved-Merge for the Mixed Capacitated Arc Routing Problem, and compared against two Route-First-Cluster-Second heuristics for the MCARPTIF. The objective was to identify the best performing heuristic for application purposes. In practice, the CARP is often solved for real-time or near real-time decision support. Computational time required by the heuristics was thus also evaluated. Identifying the best heuristic proved difficult due to a lack of realistic MCARPTIF benchmark sets, with the two CLARPIF sets predominantly solved in the literature not resembling actual waste collection instances. Route-First-Cluster-Second heuristics, linked with a new vehicle reduction heuristic performed the worst on the two CLARPIF sets, yet performed the best on new waste collection sets taken from the literature and introduced in this paper. Improved-Merge performed the best on two existing CLARPIF sets and on a realistic set with Intermediate-Facilities incident with the vehicle depot, but struggled on all other sets and in minimising fleet size. Path-Scanning was the most robust heuristic, performing reasonably well on all benchmark sets and both objectives. Results further show that due to the high computational time of one of the Route-First-Cluster-Second heuristics, which was only exposed on realistically sized sets, the slightly worse version is the best alternative when real-time support is required for waste collection applications.     

Evolutionary multi-objective optimisation with preferences for multivariable PI controller tuning

Multi-objective optimisation design procedures have shown to be a valuable tool for control engineers. They enable the designer having a close embedment of the tuning process for a wide variety of applications. In such procedures, evolutionary multi-objective optimisation has been extensively used for PI and PID controller tuning; one reason for this is due to their flexibility to include mechanisms in order to enhance convergence and diversity. Although its usability, when dealing with multi-variable processes, the resulting Pareto front approximation might not be useful, due to the number of design objectives stated. That is, a vast region of the objective space might be impractical or useless a priori, due to the strong degradation in some of the design objectives. In this paper preference handling techniques are incorporated into the optimisation process, seeking to improve the pertinency of the approximated Pareto front for multi-variable PI controller tuning. That is, the inclusion of preferences into the optimisation process, in order to seek actively for a pertinent Pareto front approximation. With such approach, it is possible to tune a multi-variable PI controller, fulfilling several design objectives, using previous knowledge from the designer on the expected trade-off performance. This is validated with a well-known benchmark example in multi-variable control. Control tests show the usefulness of the proposed approach when compared with other tuning techniques.     

Beyond the BIM utopia: Approaches to the development and implementation of building information modeling

Building information modeling (BIM) refers to a combination or a set of technologies and organizational solutions that are expected to increase interorganizational and disciplinary collaboration in the construction industry and to improve the productivity and quality of the design, construction, and maintenance of buildings. In this paper we analyze first the rhetorical–promotional dimension of the BIM implementation sometimes characterized as a “BIM utopia.” Second, we analyze the views of the enhancement of BIM implementation. Although BIM visions and promises are needed for BIM implementation, they need to be complemented with a more realistic view of conditions of the implementation. For this we outline an activity–theoretical and evolutionary view by drawing conceptual tools from science and technology studies and other relevant social scientific literature. According to this view, in addition to standards and guidelines underlined by normative approaches, local experimentation and continuous learning play a central role in the implementation of BIM.