基于即时配送和收益激励的众包物流运力调度研究

基于参与众包物流配送模式的人员闲散、积极性不高,以及客户对即时配送要求并非完全刚性的特征,引入模糊时间窗,将客户满意度量化为众包物流配送人员到达客户位置时刻的模糊隶属度函数。在一定客户满意度下,以最大化众包物流配送人员收益为目标,构建了基于即时配送和收益激励的众包物流运力调度问题模型,考虑到机会、逾时、超载惩罚成本,利用带有动态权重的粒子群算法,通过算例验证分析,结果表明该模型在保证客户满意度和提高众包物流配送人员积极性方面具有可行性和有效性。     

基于客户信用度的物流配送车辆路径问题研究

针对当前城市物流配送过程中普遍存在的客户中途取消订单、无故退换货等交易违约问题,引入客户信用度的测度方法。根据客户历史交易违约数据计算客户信用值,并转化求解客户信用度,构建了包含车辆配送成本、租赁成本以及违反时间窗惩罚成本的配送路径优化模型。设计了一种遗传(GA)-禁忌搜索(TS)混合算法进行模型求解,在算法过程中应用精英保留策略进行循环迭代寻优。结合重庆某外卖物流配送网络的实例数据,验证了模型和算法的有效性和可行性。实验结果给出了不同服务策略下的物流配送调度方案,并进行了基于客户信用度的客户配送服务序列调整比较和敏感度分析。研究表明客户信用等级的合理划分可以有效降低物流配送成本和提高客户服务水平。     

Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care

This paper addresses a vehicle scheduling problem encountered in home health care logistics. It concerns the delivery of drugs and medical devices from the home care company’s pharmacy to patients’ homes, delivery of special drugs from a hospital to patients, pickup of bio samples and unused drugs and medical devices from patients. The problem can be considered as a special vehicle routing problem with simultaneous delivery and pickup and time windows, with four types of demands: delivery from depot to patient, delivery from a hospital to patient, pickup from a patient to depot and pickup from a patient to a medical lab. Each patient is visited by one vehicle and each vehicle visits each node at most once. Patients are associated with time windows and vehicles with capacity. Two mixed-integer programming models are proposed. We then propose a Genetic Algorithm (GA) and a Tabu Search (TS) method. The GA is based on a permutation chromosome, a split procedure and local search. The TS is based on route assignment attributes of patients, an augmented cost function, route re-optimization, and attribute-based aspiration levels. These approaches are tested on test instances derived from existing VRPTW benchmarks.     

A fuzzy clustering approach to real-time demand-responsive bus dispatching control

Quick response (QR) to passenger needs is a key objective for advanced public transportation systems (APTS), and it has become increasingly important for contemporary metropolitan bus operations to gain a competitive advantage over private transportation. This paper presents a real-time control methodology for demand-responsive bus operations that respond quickly to passenger needs. The proposed method primarily involves two levels of functionality: (1) short-term forecasting of passenger demands using time-series prediction models, and (2) identification of service strategies coupled with the associated bus service segments using fuzzy clustering technologies in response to variances in passenger demand attributes and traffic conditions. The proposed bus operations method identifies the demand-responsive vehicle service strategies primarily according to the predicted up-to-date attributes of passengers’ demands, rather than deterministic passenger arrival rates, which were generally used in previous literature. In addition, the variation of traffic conditions along bus lines is considered in the proposed method. Results from numerical studies using real data of passengers’ demands, including passenger volume at each bus stop and the passenger origin-destination (O-D) patterns, are presented to demonstrate the effectiveness of the proposed method for real-world applications.     

带时间窗的三维装载物流配送优化方法研究

针对城市物流配送优化研究在客户服务时间窗和货物装载方式合理结合方面存在的不足,考虑物流配送车厢货物装载方式与客户访问序列相关的特征对车厢空间进行合理的区域划分。首先,构建了包含配送中心的固定成本、配送车辆的运输成本、维修成本、租赁成本和违反时间窗惩罚成本的物流运营成本最小化和配送车辆空间利用率最大化的双目标优化模型;然后,提出一种结合遗传算法(GA)全局搜索能力和禁忌搜索算法(TS)局部搜索能力的GA-TS混合算法求解模型;最后,结合重庆市某配送中心的三维装载物流配送实例数据进行了优化计算,实验结果给出了带时间窗的三维装载物流配送路径优化方案,并进行了不同车厢空间分区模式下平均装载率、物流运营成本和车辆使用数的比较分析。研究表明,当客户需求货物种类数与车辆的空间区域划分数相等且按货物类型进行区域划分时,物流运营成本最小,配送车辆使用数最少和车辆平均装载率最高。     

基于RS和SVM的动态供应链成员选择算法

良好的成员选择方法是动态供应链平稳运行的重要基础,针对动态供应链成员选择时面临决策属性多且可供决策分析数据样本少的难题,提出了基于粗糙集和支持向量机的动态供应链成员选择算法,核心是应用粗糙集进行属性约简,然后结合支持向量机进行链上成员分类.方法在保证不会降低分类性能的前提下,达到降低数据维数和分类过程中复杂度的目的.     

基于两阶段求解策略的动态电动车辆路径优化研究

由于政府对新能源汽车的补贴政策和市区对燃油车限行政策的实时,越来越多的物流公司在城市配送中广泛采用电动汽车。然而,电动车续航里程受限,需要在途充电或者换电,同时客户需求的动态性以及充/换电设施的排队等现实因素也应该被考虑。为此,提出了分阶段策略求解动态电动车辆路径优化问题,并建立了两阶段的EVRP模型。其中第一阶段针对静态客户建立了静态EVRP模型,第二阶段在设计了换电站及动态客户插入策略的基础上,建立了动态EVRP模型以路径更新策略。最后,设计改进的CW-TS混合启发式算法来求解静态模型,设计贪婪算法求解动态模型。实验结果表明,模型与算法具有较好的适用性和有效性。     

时变路网条件下联合配送的开放式车辆路径问题

针对城市物流系统中的多物流中心联合配送问题,设计一种多物流中心处理方法共享物流资源;分析城市路网的时变特性,设计路段行驶时间计算方法;综合考虑客户需求、时间窗、车辆不同出发时间、油耗、碳排放与联合配送模式等因素,以总成本最小为目标构建联合配送的开放式时变车辆路径规划模型,设计改进蚁群算法求解;实验结果表明以上方法具有可行性与有效性。     

Tracking customer portfolio composition: A factor analysis approach

In this paper, we address the changing composition of a customer portfolio taking into account actions undertaken by the company to adapt its service offer to market conditions and/or technological innovations. We present a specific methodology to identify clusters of customers in different periods and then compare them over time. The classification process takes into account both qualitative and quantitative aspects of the consumption levels of the services or products offered by the company. The possibility of period‐to‐period variation in the customer portfolio and the service or product offer is also considered, in order to achieve a more realistic scenario. The core of the proposed methodology is related to the family of exploratory factorial and cluster techniques. The customers are classified by using a bicriterial clustering methodology based on ‘tandem’ analysis (multiple factor analysis+cluster analysis of the main factors). The bicriterial approach allows for a compromise between customers' consumption levels (a quantitative criterion) and their consumption/non‐consumption pattern (a qualitative criterion). The evolution of the customer portfolio composition is explored through multiple correspondence analysis. This technique allows visual comparison of the position of different clusters against time and the identification of key changes in customer consumption behavior. The methodology is tested on realistic customer portfolio scenarios for a major telecommunication company. We simulate various scenarios to show the strengths of our proposal. Copyright © 2009 John Wiley & Sons, Ltd.     

考虑模糊时间和成熟度的跨区域鲜果电商配送模型研究

基于现实配送过程中配送时间存在着不确定性,通过配送时间模糊化处理构建出跨区域鲜果电商配送模糊网络流模型,进而根据实际配送时间与期望配送时间的偏离建立顾客满意度函数,然后构建由满意度降低引起的惩罚成本函数,并根据鲜果成熟度变化特性建立带有模糊时间和成熟度的跨区域鲜果电商配送最小成本路线优化模型。在求解过程中利用三种去模糊化方法(重心法、积分法和α-cut法)对模糊时间进行处理,并结合现有的整数规划算法对模型进行求解,得出最佳配送路线并进行对比分析。结果表明:(1)根据鲜果成熟度水平选择适当的配送路线可以有效降低配送成本,保证鲜果品质;(2)在去模糊化方面α-cut法比重心法和积分法所得结果更具有一般性。     

A genetic algorithm approach for solving a closed loop supply chain model: A case of battery recycling

Due to the implementation of government legislation, social responsibility, environmental concern, economic benefits and customer awareness the industries are under a great pressure not only to provide environmentally friendly products but also to take back the product after its use. The issue in reverse logistics is to take back the used products, either under warranty or at the end of use or at the end of lease, so that the products or its parts are appropriately disposed, recycled, reused or remanufactured. In order to overcome this issue, it is necessary to setup a logistics network for arising goods flow from end users to manufacturers. In this study, the optimum usage of secondary lead recovered from the spent lead–acid batteries for producing new battery is presented. The disposal in surface or sewage water or land of liquid content of the lead–acid batteries is strictly restricted. Because of the need for environmental protection and the lack of considerable lead resources, the spent batteries treatment and lead recovery are becoming crucial now-a-days. The objective of this paper is to develop a multi echelon, multi period, multi product closed loop supply chain network model for product returns and the decisions are made regarding material procurement, production, distribution, recycling and disposal. The proposed heuristics based genetic algorithm (GA) is applied as a solution methodology to solve mixed integer linear programming model (MILP). Finally the computational results obtained through GA are compared with the solutions obtained by GAMS optimization software. The solution reveals that the proposed methodology performs very well in terms of both quality of solutions obtained and computational time.     

Rating technical attributes in fuzzy QFD by integrating fuzzy weighted average method and fuzzy expected value operator

Quality function deployment (QFD) is a planning and problem-solving tool that is gaining acceptance for translating customer requirements into the technical attributes of a product. Deriving the rating order of technical attributes from input variables is a crucial step in applying QFD. When the relative weights of customer requirements and the relationship measures between customer requirements and technical attributes are expressed as fuzzy numbers, calculating the importance of each technical attribute falls into the category of fuzzy weighted average, in which the derived membership function of the fuzzy importance of each technical attribute is not explicitly known. Thus, most ranking methods are not suitable under these circumstances. A method is proposed in this paper using fuzzy weighted average method in the fuzzy expected value operator in order to rank technical attributes in fuzzy QFD. An example of a flexible manufacturing system design is cited to demonstrate the application of the proposed approach.     

Artificial immune algorithm-based credit evaluation for mobile telephone customers

The arrearage problem is a critical concern for China’s mobile communication services industry. Analysis of customer credit evaluation provides this study with a potential viable solution to the arrearage problem in China. By employing an artificial immune algorithm (AIA), a measure of customer credit based on customer attributes is proposed. This method was applied to one China mobile communication services company with approximately 400?000 customers yielding satisfying results. Utilizing traditional predictive accuracy and alternative metrics, performance comparisons of the proposed AIA were made using the feed-forward back propagation artificial neural network and the logistic regression model. A decision tree analysis of anticipated benefits was performed and indicates workability of the proposed method based on customer credit evaluation.     

考虑外协服务的车辆路径优化问题

降低零售企业的末端配送成本是控制物流成本的关键,共享经济的发展为此提供了新思路。因此,针对零售企业末端上门配送服务成本较高的情况,提出了考虑外协的车辆服务策略,将有意愿进行单次交付的线下客户作为协作车辆配合普通车辆来完成线上客户订单的配送,建立了以最小化普通车辆路径成本,普通车辆使用成本,时间窗惩罚成本和协作车辆补偿成本为目标函数的数学模型,并设计匹配算法和混合遗传算子的模拟退火算法对该模型进行求解,最后结合算例对提出的算法进行检验与分析。     

A Hybrid Taguchi–Immune approach to optimize an integrated supply chain design problem with multiple shipping

Supply chain network design is considered a strategic decision level problem that provides an optimal platform for the effective and efficient supply chain management. In this research, we have mathematically modeled an integrated supply chain design. To ensure high customer service levels, we propose the inclusion of multiple shipping/transportation options and distributed customer demands with fixed lead times into the supply chain distribution framework and formulated an integer-programming model for the five-tier supply chain design problem considered. The problem has been made additionally complex by including realistic assumptions of nonlinear transportation and inventory holding costs and the presence of economies of scale. In the light of aforementioned facts, this research proposes a novel solution methodology that amalgamates the features of Taguchi technique with Artificial Immune System (AIS) for the optimum or near optimum resolution of the problem at hand. The performance of the proposed solution methodology has been benchmarked against a set of test instances and the obtained results are compared against those obtained by Genetic Algorithm (GA), Hybrid Taguchi–Genetic Algorithm (HTGA) and AIS. Simulation results indicate that the proposed approach can not only search for optimal/near optimal solutions in large search spaces but also has good repeatability and convergence characteristics, thereby proving its superiority.     

Reverse logistics network design for product recovery and remanufacturing

Due to environmental concerns, reverse logistics now is becoming an important strategy to increase customer satisfaction. This research develops a generic mixed integer nonlinear programming model (MINLP) for reverse logistics network design. This is a multi-echelon reverse logistics model. It maximizes total profit by handling products returned for repair, remanufacturing, recycling, reuse, or incineration/landfill. A hybrid genetic algorithm (GA) is proposed to solve the problem. The designed model is validated and tested by using a real-life example of recycling bulk waste in Taoyuan City, Taiwan. Sensitivity analyses are conducted on various parameters to illustrate the capabilities of the proposed model. Post-optimality analysis and comparison show that the proposed model performs better than current reverse logistic operations and the proposed hybrid GA demonstrates the efficiency of solving the complex reverse logistics problem.     

A multi-layer demand-responsive logistics control methodology for alleviating the bullwhip effect of supply chains

This paper presents a multi-layer demand-responsive logistics control strategy for alleviating, effectively and efficiently, the bullwhip effect of a supply chain. Utilizing stochastic optimal control methodology, the proposed method estimates the time-varying demand-oriented logistics system states, which originate directly and indirectly downstream to the targeted member of a supply chain, and associate these estimated demands with estimates of different time-varying weights under the goal of systematically optimizing the logistical performance of chain members. In addition, an experimental design is conducted where the proposed method is evaluated with the two specified criteria. Numerical results indicate that the proposed method permits alleviating, to a great extent, the bullwhip effect in comparison with the existing logistics management strategies. Furthermore, the methodology presented in this study is expected to help address issues regarding the uncertainty and complexity of the distortion of demand-related information existing broadly among supply chain members for an efficient supply chain coordination.     

An optimization model for the design of a capacitated multi-product reverse logistics network with uncertainty

In this work the design of a reverse distribution network is studied. Most of the proposed models on the subject are case based and, for that reason, they lack generality. In this paper we try to overcome this limitation and a generalized model is proposed. It contemplates the design of a generic reverse logistics network where capacity limits, multi-product management and uncertainty on product demands and returns are considered. A mixed integer formulation is developed which is solved using standard B&B techniques. The model is applied to an illustrative case.     

A goal programming approach to vehicle routing problems with soft time windows

The classical vehicle routing problem involves designing a set of routes for a fleet of vehicles based at one central depot that is required to serve a number of geographically dispersed customers, while minimizing the total travel distance or the total distribution cost. Each route originates and terminates at the central depot and customers demands are known. In many practical distribution problems, besides a hard time window associated with each customer, defining a time interval in which the customer should be served, managers establish multiple objectives to be considered, like avoiding underutilization of labor and vehicle capacity, while meeting the preferences of customers regarding the time of the day in which they would like to be served (soft time windows). This work investigates the use of goal programming to model these problems. To solve the model, an enumeration-followed-by-optimization approach is proposed which first computes feasible routes and then selects the set of best ones. Computational results show that this approach is adequate for medium-sized delivery problems.     

Simulation model of multi-compartment distribution in the catering supply chain

An efficient distribution system of high performance is needed to anticipate market developments in the catering supply chain (CSC) in the Netherlands. A simulation model was developed to analyse a multi-compartment distribution system which should satisfy customer demands for shorter lead times, increased delivery frequency and improved quality of process and product. The simulation model quantifies logistic and financial performances in various alternative logistic scenarios for multi-compartment distribution in the catering supply chain. This stochastic simulation model was constructed on the basis of a value chain analysis yielding activities and performance indicators (PIs). The model proved to be accurate in its predictions when applied to a case situation taken from the Dutch CSC. It is concluded that discrete event simulation is an effective tool to evaluate promising logistic scenarios. The new, multi-compartment method of distribution allowed for a 14% decrease in total costs in the Dutch CSC while satisfying customer demands.