面向批量订单包装的物流箱规格优化问题研究

目的 针对面向仓储物流环境下多型号多批量产品的订单包装问题,提出一种预制物流箱规格优化模型及算法。方法 对产品订单建立订单分包规则,确定分包方案,以订单包装材料总成本最小为优化目标建立物流箱规格优化模型。针对该模型提出一种改进模拟退火算法,通过贪婪策略求解最优分包方案,降低模型计算复杂度,设计一种新型解更新算子,以提高算法寻优能力,设计一种自适应步长策略,以平衡算法前期全局搜索与后期局部搜索的能力。结果 通过实例证明,文中提出的算法相较于其他算法,具有更强的求解能力,与实例企业仓储包装现状相比,同批订单降低了17%的包装材料成本。结论 该方法可用于解决产品种类多、尺寸差异大、动态更新等应用场景下的系列运输包装纸箱规格优化问题,为企业物流运输管理提供了一种有效的包装优化思路和解决方法。     

基于信号传递模型的第四方物流分包及利益分配机制

在分析了第四方物流分包及利益分配重要意义的基础上,运用信号传递模型,研究了第四方物流分配任务及调整收益分配比例的问题.通过对结果的详细分析,得出了第四方物流的最优分配比例.     

大规模物流网络的组合遗传算法研究

在对遗传算法、生成树遗传算法和混合进化方法进行比较的基础上,提出组合遗传算法来解决大规模基本物流网络设计问题.该问题抽象为"选址-分派问题",并进一步分解,且将"分派"镶嵌在"选址"中."选址"和"分派"染色体分别使用二进制编码和矩阵编码、适值采用物流费用.运算结果显示该方法比混合进化方法结果更精确,且在大规模问题求解方面速度优于通常的遗传算法,因此是一种设计大规模物流网络的较好方法.     

基于信息熵多属性决策的物流供应商选择评价

生产商选择合适的物流供应商有利于降低营运成本,提高竞争优势.高效的第三方物流活动在增强企业核心竞争力、降低企业成本等方面起着重要作用.针对传统的熵值和熵权计算公式的不足,提出改进的熵权计算公式.同时把专家的主观权重和样本自身产生的熵权相结合,通过一定的方式混合加权作为不确定属性的权重.在此基础上结合多属性决策模型建立多属性决策评价方法.该方法将主、客观分析相结合,具有一定的优势：既减少了决策问题的主观性,又使得整个评价过程能够量化,有效解决了第三方物流供应商选择评价中的不确定多属性决策问题.最后通过实例分析证明该方法的可行性和有效性.     

一种新型物流服务供应链建模方法

提出了一种多目标混合整数规划模型来优化物流服务供应链网络.对物流服务的参与实体以及服务属性,如服务质量、服务能力、服务成本、交付时间等进行了定义并给出了计算公式.目标函数和约束条件的设定兼顾了物流服务的串行与并行过程.用案例验证了该模型的可解性.     

基于不确定语言信息的物流供应商选择

为解决传统供应商的选择与评价过程中专家评判的模糊性和不确定性问题,提出了一种基于不确定语言信息的物流服务供应商选择方法。该方法以不确定语言变量来表征专家的评判从而避免了决策信息的丢失。继而建立了物流服务质量评价属性的权重优化模型,并构造拉格朗日函数来求解该模型,得到评价属性的最优权重。接着利用不确定语言加权几何平均（ULWG）算子集结专家评判信息,则得到供应商的优先排序。给出了基于不确定语言信息的供应商选择的算法步骤和应用实例。     

基于粗糙集和支持向量机理论的物流需求预测研究

选择合适的预测模型来预测物流需求,对升级和优化物流产业具有重要的战略意义。常见的物流预测方法有:增长率法、移动平均法、时间序列法等,由于实际的物流预测数据常常具有多指标、非线性、小样本的特点,并且数据中存在冗余指标(噪声),导致在实际应用中,大多数预测方法的预测精度不高,难以保证有效性。针对这类物流预测问题,本文根据粗糙集属性约简中基于差别矩阵的算法,剔除冗余指标,基于约简的属性,改进了单一的SVM预测模型,并用遗传算法优化了SVM模型的输入参数,获得了较高的预测精度。本文给出了该方法的具体步骤,并用实际数据预测了广东省的货运总量,验证了该方法的有效性。     

物流能力外购的供应商选择模型及应用

把物流企业看作一个能力集合构建模型,用来解决物流服务总承包商如何从市场上的多个优势物流服务商中选择一个最优组合,从而既能够满足客户对物流能力的需求,又确保总外购成本最小.把对物流能力的评判作为一个模糊概念,引入模糊集合与能力质量函数,将经典模型演化为模糊数学模型.通过模糊集合运算与算子变换把模糊数学模型最终转化为一个0-1整数规划问题.应用规划软件LINGO对一个企业案例进行了求解.     

第四方逆向物流资源优化配置问题研究

为了克服第三方物流在处理逆向物流时难以达到规模经济的问题,将第四方物流服务模型引入零散、不确定的逆向物流服务中,提出第四方物流模式下物流任务与物流资源的优化匹配问题,并对此进行了初步的探索.提出了两级物流资源优化配置策略,即首先将具有相似属性的零散的逆向物流任务进行聚类整合,再将整合后的物流任务与第三方物流资源进行优化匹配.以总成本最小和完成时间最短为目标,建立了逆向物流资源优化配置模型,设计了求解该模型的遗传算法,最后用实例验证了模型和算法的有效性,为第四方逆向物流服务模式的实用化奠定了基础.     

基于Vague集的国有企业并购多属性拍卖决策研究

在分析国有企业并购中凸显问题的基础上,构建了国有企业并购多属性拍卖决策的属性集,提出了基于Vague集理论的国有企业并购多属性拍卖决策的一般模型。该决策模型相较传统的模糊集决策模型更具灵活性和实用性,为国有企业并购多属性拍卖决策提供了一种新的思路,总结提炼了国有企业并购多属性拍卖的决策控制要点。     

On combinatorial auction and Lagrangean relaxation for distributed resource scheduling

Most existing methods for scheduling are based on centralized or hierarchical decision making using monolithic models. In ihis study, we investigate a new method based on a distributed and locally autonomous decision structure using the notion of combinatorial auction. In combinatorial auction the bidders demand a combination of dependent objects with a single bid. We show that not only can we use this auction mechanism to handle complex resource scheduling problems, but there exist strong links between combinatorial auction and Lagrangean-based decomposition. Exploring some of these properties, we characterize combinatorial auction using auction protocols and payment functions. This study is a first step toward developing a distributed scheduling framework that maintains system-wide performance while accommodating local preferences and objectives. We provide some insights to this framework by demonstrating four different versions of the auction mechanism using job shop scheduling problems.     

Pricing combinatorial auctions by a set of linear price vectors

In combinatorial auctions, items are sold simultaneously. A substantial component of an auction mechanism is the pricing scheme. Prices determine the auctioneer’s revenue and, ideally, justify the outcome of the auction to the bidders. Each bidder should be able to see why he won or lost a certain bundle by comparing the determined price of a bundle and his bid’s value. In this paper, we pick up a non-linear anonymous pricing scheme from the literature that consists of a set of linear price vectors. We investigate whether this scheme can guarantee to find prices that support the winner allocation. Furthermore, we refine the pricing scheme by suggesting various objectives in order to evaluate different prices. We consider the computational complexity of the corresponding optimization problems and compare different objectives by means of a computational study using a well-established combinatorial auction test suite.     

Smart box-enabled product–service system for cloud logistics

Modern logistics takes significant progress and rapid developments with the prosperity of E-commerce, particularly in China. Typical challenges that logistics industry is facing now are composed by a lack of sharing, standard, cost-effective and environmental package and efficient optimisation method for logistics tasks distribution. As a result, it is difficult to implement green, sustainable logistics services. Three important technologies, Physical Internet (PI), product–service system (PSS) and cloud computing (CC), are adopted and developed to address the above issues. PI is extended to design a world-standard green recyclable smart box that is used to encapsulate goods. Smart box-enabled PSS is constructed to provide an innovative sustainable green logistics service, and high-quality packaging, as well as reduce logistics cost and environmental pollution. A real-time information-driven logistics tasks optimisation method is constructed by designing a cloud logistics platform based on CC. On this platform, a hierarchical tree-structure network for customer orders (COs) is built up to achieve the order-box matching of function. Then, a distance clustering analysis algorithm is presented to group and form the optimal clustering results for all COs, and a real-time information-driven optimisation method for logistics orders is proposed to minimise the unused volume of containers. Finally, a case study is simulated to demonstrate the efficiency and feasibility of proposed cloud logistics optimisation method.     

区域物流产业竞争力指标体系及其应用

基于物流产业的涵义和特点提出了产业竞争力的概念,根据物流产业的现状,提出了物流产业竞争力评价的多层指标体系,列举了主要的评价方法和具体步骤;针对具体的实例,从定性和定量两个角度,运用组合评价法确定了相关指标的权重,借助多层模糊评价法对一级指标进行了评价分析,有助于区域物流产业核心竞争力的确定.     

Scheduling at an auction logistics centre with physical internet

Auction logistics centre (ALC) performs transshipment operation on auction products from their inbound-from-supplier transporters to their outbound-to-client transporters with goods trading functions. Major third-party trading service providers have solved technological problems of dealing with millions of simultaneous biddings. But logistics that fulfils the massive and lumpy auction demands in the centre is still challengeable. The lack of process visibility and synchronised schedule has made the congestion on material flow, especially for the trolley loading and auction trading stages. Space resource is wasted and auction products deteriorate as holding time increases. This paper aims to provide a first demonstration of scheduling for auctions of perishable goods using Physical Internet (PI). PI-enabled scheduling is vital to facilitate the decision-making process while ensuring required throughput time with large trading volumes. A PI-ALC is created to automate the flow of information and enable the flexible implementation of scheduling. Following the hybrid flowshop classification, a timely operation scheduling model is developed. A heuristic-based solution approach is proposed to minimise either makespan or value loss using a set of dispatching rules. Simulation experiments show that the dispatching–picking mechanisms have statistically significant interaction impacts on both performance criteria. Decision-makers should strike a balance between minimising makespan and value loss based upon the growth in the frozen buffer size. Finally, the sensitivity analyses justify that schedulers can flexibly select dispatching rules under various demand patterns and operation time windows, as well as system configurations and trolley sizes.     

第三方物流联盟中物流任务的优化调度

为了提高物流服务水平、降低物流运作成本,针对由多个第三方物流服务商组建而成的第三方物流联盟中物流任务与物流服务资源的优化调度问题展开研究,综合考虑各第三方物流服务商资源节点提供物流活动服务成本和物流服务总时间,以时间最短和成本最低为优化目标,提出了基于时间和成本的多目标优化调度模型,针对目前物流任务调度优化模型中只考虑各物流服务资源节点本身的服务成本和时间,而未考虑执行各个物流活动之间的物流资源节点之间的衔接时间与衔接成本的问题,提出一种计算不同物流服务资源节点之间的物流服务衔接时间和衔接成本的方法,在模型中,考虑了物流资源服务时间窗限制问题.最后提出了一个改进的遗传算法进行模型求解,并通过算例验证了研究的有效性.     

Auction-theoretic coordination of production planning in the supply chain

Most planning and optimization methods in manufacturing logistics assume centralized or hierarchical decision-making using monolithic models. Motivated by the increasing needs to coordinate diverse decision processes and systems, we investigate an auction-theoretic mechanism for production coordination in a supply chain. Our effort focuses on structural mappings between mathematical decomposition and iterative auction mechanisms wherein agents compete based on their local utilities, announced conflict pricing, and production targets. Building upon the rich literature in optimization and auction-theoretic analysis, we investigate the advantages and limitations of this distributed decision scheme on a large set problem in supply chain production planning. Experimental results show that the proposed auction mechanism provides impressive improvement over the traditional monolithic method without significant degradation to the solution quality.     

Toward resilient cloud warehousing via a blockchain-enabled auction approach

Cloud warehousing service (CWS) has emerged as a promising third-party logistics service paradigm driven by the widespread use of e-commerce. The current CWS billing method is typically based on a fixed rate in a coarse-grained manner. This method cannot reflect the true service value under the fluctuating e-commerce logistics demand and is not conducive to CWS resilience management. Accordingly, a floating mechanism can be considered to introduce more flexible billing. A CWS provider lacks sufficient credibility to implement floating mechanisms because it has vested interests in terms of fictitious demand. To address this concern, this report proposes a blockchain-enabled floating billing management system as an overall solution for CWS providers to enhance the security, credibility, and transparency of CWS. A one-sided Vickrey–Clarke–Groves (O-VCG) auction mechanism model is designed as the underlying floating billing mechanism to reflect the real-time market value of fine-grained CWS resources. A blockchain-based floating billing prototype system is built as an experimental environment. Our results show that the O-VCG mechanism can effectively reflect the real-time market value of CWSs and increase the revenue of CWS providers. When the supply of CWS providers remains unchanged, allocation efficiency increases when demand increases. By analyzing the performance of the O-VCG auction and comparing it with that of the fixed-rate billing model, the proposed mechanism has more advantages. Moreover, our work provides novel managerial insights for CWS market stakeholders in terms of practical applications.     

Allocation of advertising space by a web service provider using combinatorial auctions

Advertising is a critical process for promoting both products and services in global trade. Internet has emerged as a powerful medium for trade and commerce. Online advertising over the internet has increased more than hundred-fold since 2001. In the present work, we address problems faced by online advertisement service providers. In this paper, we propose a multi-slot and multi-site combinatorial auction for allocating scarce advertisement slots available on multiple sites. We observe that combinatorial auctions serve as effective mechanisms for allocating advertising slots over the internet. We resort to “ant” systems (ant — social insect/intelligent agent) to solve the aboveNP- hard combinatorial optimization problem which involves winner-determination in multi-item and multi-unit combinatorial auctions.     

基于退火算法的物流配送网的求优研究

模拟退火算法是一种启发式算法,是受到加热紧缩的退火过程所启发而提出来一种求解组合优化问题的一种逼近算法。算法要优于传统的贪婪算法,避免了陷入局部最优的可能,从而达到全局最优解。在物流配送网络中经常为有一些寻求最短路径等问题出现,为了能够达到最短、最优、最经济等,需要进行物流配送路径寻优。文中采用模拟退火算法进行一个示例的验证,效果证明可行。