第五方物流的GIMIS对讲调度平台

综述了第五方物流及其相关技术发展,研究基于第五方物流的GIMIS中间件,提出基于第五方物流的GIMIS对讲调度运营平台.     

宁波物流信息化水平现状及其发展对策探讨

以宁波地区为背景,介绍了物流信息化及其必要性,分析了宁波物流信息化的现状,探讨了宁波物流信息化存在的问题,提出了相应的对策。     

建设太原矿用设备物流园 大力扶持生产性服务业发展

介绍了太原市的区位优势和产业优势,提出了打造太原矿用设备物流园的建议。     

连锁超市物流配送问题的研究

先分析国内连锁超市物流配送的现状,后指出连锁超市物流配送发展中存在的一些问题,最后针对存在的问题提出几点建议。希望对我国连锁超市物流配送体系的完善有所借鉴。     

现代工业工程与物流管理综合实验平台的构建

针对现代工业工程的发展趋势和培养目标,探讨了现代工业工程综合实验平台的建设思路.介绍了天津大学现代工业工程与物流综合实验室的主要建设内容、总体布局以及实验平台的建设.     

浅谈铁路基层企业物流活动中运输法律风险的防范

针对我国铁路基层企业物流活动的现状,分析了现阶段铁路基层企业物流活动中面临的法律风险,提出了应时运输中法律风险的相关措施.     

Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk,Part I: Applications and model

This paper formulates a model for finding a minimum cost routing in a network for a heterogeneous fleet of ships engaged in pickup and delivery of several liquid bulk products. The problem is frequently encountered by maritime chemical transport companies, including oil companies serving an archipelago of islands. The products are assumed to require dedicated compartments in the ship. The problem is to decide how much of each product should be carried by each ship from supply ports to demand ports, subject to the inventory level of each product in each port being maintained between certain levels that are set by the production rates, the consumption rates, and the storage capacities of the various products in each port. This important and challenging inventory constrained multi-ship pickup–delivery problem is formulated as a mixed-integer nonlinear program. We show that the model can be reformulated as an equivalent mixed-integer linear program with special structure. Over 100 test problems are randomly generated and solved using CPLEX 7.5. The results of our numerical experiments illuminate where problem structure can be exploited in order to solve larger instances of the model. Part II of the sequel will deal with new algorithms that take advantage of model properties.     

加强储运管理向物流质量要效益

物流流转形成物流系统,仓储和运输则是物流系统的两大支柱。目前在物流系统中尤其是在仓储和运输两大环节上存在许多严重的问题。这些问题的存在严重影响了物流质量,同时在这些问题的背后也隐藏着巨大的经济潜力。通过对物流系统尤其是储运环节的研究分析,来探索提高物流质量和挖掘物流系统经济潜力的有效途径。     

Batching deteriorating items with applications in computer communication and reverse logistics

We study two deterministic scheduling problems that combine batching and deterioration features. In both problems, there is a certain demand for identical good quality items to be produced in batches. In the first problem, each batch is assigned an individual machine that requires a cost and a time to be activated. All the machines are identical, work in parallel, and always produce good quality items. All the items are available at time zero and they deteriorate while waiting for production. Deterioration results in a linear increase of time and cost of production. In the second problem, there is a single machine that produces good quality as well as defective items in batches. Each batch is preceded by a setup time and requires a setup cost. Defective items have to be reworked on the same machine. They deteriorate while waiting for rework. At a time to be decided, the machine switches from production to rework defective items of the current batch. After rework, every defective item has the required good quality. In both problems, the objective is to find batch partitioning such that a linear combination of the production cost and production completion time is minimized. The two problems are observed at computer service providers and also reverse logistics. In computer service providers, machines and items correspond to communication service channels and information transfer tasks, respectively. We reduce both problems to minimizing a function of one variable representing the number of batches. In an optimal solution of either problem, there are at most two different batch sizes. Linear time algorithms are proposed for both problems.     

A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector

Effective routing of vehicles remains a focal goal of all modern enterprises, thriving for excellence in project management with minimal investment and operational costs. This paper proposes a metaheuristic methodology for solving a practical variant of the well-known Vehicle Routing Problem, called Heterogeneous Fixed Fleet VRP (HFFVRP). Using a two-phase construction heuristic, called GEneralized ROute Construction Algorithm (GEROCA), the proposed metaheuristic approach enhances its flexibility to easily adopt various operational constraints. Via this approach, two real-life distribution problems faced by a dairy and a construction company were tackled and formulated as HFFVRP. Computational results on the aforementioned case studies show that the proposed metaheuristic approach (a) consistently outperforms previous published metaheuristic approaches we have developed to solve the HFFVRP, and (b) substantially improves upon the current practice of the company. The key result that impressed both companies’ management was the improvement over the bi-objective character of their problems: the minimization of the total distribution cost as well as the minimization of the number of the given heterogeneous number of vehicles used.