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

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

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

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

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.     

优先队列在物流配送管理中的应用研究

针对物流企业在配送管理业务流程中的要求与特点，提出了采用优先级队列来实现分拣配货的动态调度观点，并对涉及动态调度过程中的相关数据结构与算法进行了设计，采用此技术可以提高企业的经济与社会效益．     

基于语义WEB的四方物流管理系统中供应商检索的研究

文章在物流领域本体建立好的基础上,根据用户提交的货物属性的不同,对批量订单进行分类,然后重点介绍通过提交SPARQL查询请求,筛选出满足条件的供应商,实现第四方物流管理系统查全查准物流供应商,为第四方物流管理系统根据用户偏好确定合作供应商提供了准确筛选数据。     

废旧箱包逆向物流运作模式研究

随着我国经济水平不断提高以及电商时代的到来,产品更新速率加快,大量废旧物品不仅造成资源浪费现象,而且还会造成严重的环境污染.资源回收再处理问题已经成为当下的热点,逆向物流在这种环境下应运而生,选择和确定逆向物流回收模式是企业的关注重点,其中旅游箱包就是一个发展迅速而研究较少的领域,值得研究与推广.研究箱包公司物流发展对工业类企业减少成本,增加利润,提高回收运输效率等具有一定的指导意义.根据废旧箱包逆向物流结构链的特点,主要对生产商回收模式(Manufacturer Take-Back,MT)、销售商回收模(Retailer Take-Back,RT)、第三方回收模式(Third Party Take-Back,TPT)3种回收模式进行了量化对比分析,以箱包制造企业回收整体效益最高为最终目标,并运用SWOT-AHP结合的方法,对废旧箱包逆向物流回收模式进行了研究分析,构建了箱包逆向物流回收模式模型,为箱包企业逆向物流选择最佳回收模式提供了理论模型依据,得出第三方回收模式最优的结论.对箱包企业处理废旧产品工作而言具有一定参考意义.     

生鲜品多中心区域协作半开放式配送路径研究

针对生鲜产品区域配送问题,在新物流理念下,建立了区域协作下多中心半开放式配送路径.鉴于生鲜品配送的独特性,将时间窗及满意度考虑在内,构建在时间惩罚、满意度指标及路径约束条件下的成本优化模型.结合A生鲜企业数据,设计了一种改进的自适应遗传算法与变邻域搜索算法相结合的混合算法解决问题.通过仿真实验证明模型合理性以及算法实效性.实验表明,区域协作下多中心半开放式配送方案对比各区域独立封闭式配送方案具有改进性,提高了物流配送的效率,降低成本同时保证高客户满意度,有助于生鲜配送企业整体发展.并在此基础上,对生鲜配送企业进一步发展提出建议.