Liner services network design and fleet deployment with empty container repositioning

Transportation demand of shipping container fluctuates due to the seasonality of international trade, thus, every 3–6 months, the liner company has to alter its current liner shipping service network, redeploy ships and design cargo routes with the objective of minimizing the total cost. To solve the problem, the paper presents a mixed integer linear program model. The proposed model incorporates several relevant constraints, such as weekly frequency, the transshipment of cargo between two or more service routes, and transport time. Extensive numerical experiments based on realistic date of Asia–Europe–Oceania shipping operations show that the proposed model can solve real-case problems efficiently by CPLEX. The results demonstrate that the model can reduce ship’s capacity consumption and raise ships’ capacity utilization.     

历史中心区复兴中的地域性问题与对策

本文以上海思南路47～48街坊改造为例,探讨城市形态更新与居民外迁问题,并期待相关地域性社会对策的出现。     

机器视觉在水稻空壳率统计中的应用研究

针对水稻空壳率的自动化检测问题,采用机器视觉技术,设计一种实验设备,利用稻谷的透光性,使用普通可见光照射,对获得的图像进行分析处理,并比较采用灰度特征以及YUV颜色模型两种方法进行统计的结果,表明该设备和相关图像处理算法完全可以胜任空壳率的自动统计工作,为后续发展实际的应用设备奠定基础。     

Lot streaming for product assembly in job shop environment

Assembly job shop scheduling problem (AJSP) is an extension of classical job shop scheduling problem (JSP). AJSP starts with JSP and appends an assembly stage to the completed jobs. Lot streaming (LS) technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. This paper combines, for the first time, LS and AJSP, extending LS applicability to both machining and assembly. To solve this complex problem, an efficient algorithm is proposed using genetic algorithms and simple dispatching rules. Experimental results suggest that equal size LS outperforms varied size LS with respect to the objective function.     

Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic

This paper presents a new algorithm for the dynamic multi-level capacitated lot sizing problem with setup carry-overs (MLCLSP-L). The MLCLSP-L is a big-bucket model that allows the production of any number of products within a period, but it incorporates partial sequencing of the production orders in the sense that the first and the last products produced in a period are determined by the model. We solve a model which is applicable to general bill-of-material structures and which includes minimum lead times of one period and multi-period setup carry-overs. Our algorithm solves a series of mixed-integer linear programs in an iterative so-called fix-and-optimize approach. In each instance of these mixed-integer linear programs a large number of binary setup variables is fixed whereas only a small subset of these variables is optimized, together with the complete set of the inventory and lot size variables. A numerical study shows that the algorithm provides high-quality results and that the computational effort is moderate.     

An efficient optimal algorithm for the quantity discount problem in material requirement planning

An optimal algorithm based on branch-and-bound approach is presented in this paper to determine lot sizes for a single item in material requirement planning environments with deterministic time-phased demand and constant ordering cost with zero lead time, where all-units discounts are available from vendors and backlog is not permitted. On the basis of the proven properties of optimal order policy, a tree-search procedure is presented to construct the sequence of optimal orders. Some useful fathom rules have been proven, which make the algorithm very efficient. To compare the performance of this algorithm with the other existing optimal algorithms, an experimental design with various environments has been developed. Experimental results show that the performance of our optimal algorithm is much better than the performance of other existing optimal algorithms. Considering computational time as the performance measure, this algorithm is considered the best among the existing optimal algorithms for real problems with large dimensions (i.e. large number of periods and discount levels).     

Lot scheduling on a single machine

In a practical situation, a manufacturer receives different orders from its customers. Different orders may contain different quantities of the product. Therefore, the manufacturer has to decide how to group these orders into different lots based on the capacity of the lot processing machine (such as integrated circuit tester, heated container, etc.) and then decides the sequence of these lots. In this paper, we study a lot scheduling problem with orders which can be split. The objective is to minimize the total completion time of all orders. We show that this problem can be solved in polynomial time.     

Hydrogen from empty cotton boll agro-waste via thermochemical route and feasibility study of operating an IC engine in continuous mode

Hydrogen can be cited as prospective source of clean power. In this work hydrogen rich syn-gas generated from the agro-waste, empty cotton bolls was injected into an IC engine in continuous mode along with gasoline. At the air-fuel ratio of 23.40, specific fuel consumption of 0.35 kg kWh^?1, the engine could be operated with higher efficiency than with gasoline alone. A distinct reduction in emission characteristics could also be seen. Empty cotton bolls derived after removal of cotton from the flower in field, was first studied for fuel properties. The reasonably high heating value (HHV) of 17.54 MJ kg^?1 suggested that it could be a precursor to hydrogen via two stepped thermo-chemical process. The first step involved slow pyrolysis of the biomass at 500 °C for 60 min at a heating rate of 10 °C min^?1 yielding 39.71% bio-char by weight. The C, H, N, S and O contents of the produced bio-char was 59.91, 2.91, 0.72, 0.47 and 35.99% respectively and its HHV was 26.7 MJ kg^?1. Steam gasification of this bio-char, at 700 °C and water flowrate of 7 mL min^?1 exhibited maximum hydrogen yield of 67.42% (v/v) in the syn-gas mixture. Subsequent enrichment of the gas using ethanolamine/ethylene diamine and KMnO₄ solutions resulted in more than 90% (v/v) hydrogen in the combustible gas mixture and the test engine could be effectively operated.     

Combined empty and loaded train scheduling for dedicated freight railway corridors

The efficient utilization of expensive rolling-stock has become imperative for all railroads. In this paper, we study the combined empty and loaded train-scheduling problem for the upcoming dedicated freight corridors in India. Existing optimization models either do not consider the simultaneous optimization of the loaded and empty flows or are not solvable for large railroads. Our model is the first of its kind to incorporate link capacity constraints in an IP formulation for this operational level problem. A simulated annealing algorithm hybridized with a constructive heuristic is proposed as the solution method. The computational experiments show that the proposed heuristic performs well both in terms of runtime and solution quality.     

An overview of empty fruit bunch from oil palm as feedstock for bio-oil production

Empty fruit bunch (EFB) from oil palm is one of the potential biomass to produce biofuels like bio-oil due to its abundant supply and favorable physicochemical characteristics. Confirming the assertion, this paper presents an overview of EFB as a feedstock for bio-oil production. The fundamental characteristics of EFB in terms of proximate analysis, ultimate analysis and chemical composition, as well as the recent advances in EFB conversion processes for bio-oil production like pyrolysis and solvolysis are outlined and discussed. A comparison of properties in terms of proximate analysis, ultimate analysis and fuel properties between the bio-oil from EFB and petroleum fuel oil is included. The major challenges and future prospects towards the utilization of EFB as a useful resource for bio-oil production are also addressed.