A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows

For VRP with time windows (VRPTW) solved by conventional cluster-first and route-second approach, temporal information is usually considered with vehicle routing but ignored in the process of clustering. We propose an alternative approach based on spatiotemporal partitioning to solving a large-scale VRPTW, considering jointly the temporal and spatial information for vehicle routing. A spatiotemporal representation for the VRPTW is presented that measures the spatiotemporal distance between two customers. The resulting formulation is then solved by a genetic algorithm developed for k-medoid clustering of large-scale customers based on the spatiotemporal distance. The proposed approach showed promise in handling large scale networks.     

The Self-Learning Particle Swarm Optimization approach for routing pickup and delivery of multiple products with material handling in multiple cross-docks

Vehicle Routing Problems (VRPs) in distribution centers with cross-docking operations are more complex than the traditional ones. This paper attempts to address the VRP of distribution centers with multiple cross-docks for processing multiple products. In this paper, the mathematical model intends to minimize the total cost of operations subjected to a set of constraints. Due to high complexity of model, it is solved by using a variant of Particle Swarm Optimization (PSO) with a Self-Learning strategy, namely SLPSO. To validate the effectiveness of SLPSO approach, benchmark problems in the literature and test problems are solved by SLPSO.     

An agile approach for supply chain modeling

This paper proposes the generic label correcting (GLC) algorithm incorporated with the decision rules to solve supply chain modeling problems. The rough set theory is applied to reduce the complexity of data space and to induct decision rules. This proposed approach is agile because by combining various operators and comparators, different types of paths in the reduced networks can be solved with one algorithm. Furthermore, the four cases of the supply chain modeling are illustrated.     

Dynamic electric power supply chains and transportation networks: An evolutionary variational inequality formulation

In this paper, we develop a static electric power supply chain network equilibrium model with known demands and establish the equivalence between the model and a transportation network equilibrium model with fixed demands over an appropriately constructed supernetwork. This equivalence yields a new interpretation of electric power supply chain network equilibria in path flows. We then exploit this equivalence to propose a dynamic electric power supply chain network model in which the demand varies over time using an evolutionary variational inequality formulation. Finally, we demonstrate how numerical dynamic electric power supply chain network problems can be solved utilizing recently obtained theoretical results in the unification of evolutionary variational inequalities and projected dynamical systems.     

A hybrid population heuristic for the heterogeneous vehicle routing problems

The heterogeneous vehicle routing problem (HVRP) plays an important role in supply chain logistics. Two variants of HVRP are treated in this paper: one with fixed and variable costs (HVRPFD), and the other with only variable cost (HVRPD). A hybrid population heuristic that is able to solve both variants is proposed, in which a population of solutions are progressively evolved by crossovers and local searches. Computational results on a set of eight benchmark test problems from literature show that the proposed heuristic produces excellent solutions in short computing times.     

基于连通可靠性的车辆路径问题

物流配送车辆路径问题(VRP)是一个NP-hard问题,很多求解方法仅考虑路网连通无穷大的情况,将其看成平均旅行时间问题,对于突发事件下造成路网拥堵情况下的车辆路径问题很少涉及,对此结合蚁群算法,对突发事件下各路段的连通可靠性进行比较后选择合适路段通过,用以提高路网的通行能力。     

Adaptive large neighborhood search heuristics for the vehicle routing problem with stochastic demands and weight-related cost

The vehicle routing problem (VRP) with stochastic demands and weight-related cost is an extension of the VRP. Although some researchers have studied the VRP with either stochastic demands or weight-related cost, the literature on this problem is quite limited. We adopt the a priori optimization to tackle this problem and propose a dynamic programming to compute the expected cost of each route. We develop the adaptive large neighborhood search heuristics equipped with several approximate methods for the problem. To evaluate our heuristics, we generate 84 test instances. Computational results demonstrate the performance of our heuristics and can serve as benchmarks for future researchers.     

基于遗传模拟退火算法的战时物流配送路径优化研究

综合考虑战时物流配送车辆路径问题（VRP）的多目标评价，提出多属性道路网络下战时物流配送的VRP算法，并建立完全分层优化模型。将进化算法与传统优化技术相结合，构造了模型的两层求解算法，第一层采用遗传算法和模拟退火算法混合的GASA算法，第二层采用枚举法。并以成品燃油配送为例进行了实验，结果表明算法较标准遗传算法更有效。     

Optimizing inventory decisions in a multi-stage multi-customer supply chain: A note

In this paper, we propose an n-stage-multi-customer supply chain inventory model where there is a company that can supply products to several customers. We formulate the model for the simplest inventory coordination mechanism which is referred to as the same cycle time for all companies in the supply chain. We conclude that it is possible to use an algebraic approach to optimize the supply chain model without the use of differential calculus.     

A hierarchical clustering and routing procedure for large scale disaster relief logistics planning

We describe a hierarchical cluster and route procedure (HOGCR) for coordinating vehicle routing in large-scale post-disaster distribution and evacuation activities. The HOGCR is a multi-level clustering algorithm that groups demand nodes into smaller clusters at each planning level, enabling the optimal solution of cluster routing problems. The routing problems are represented as capacitated network flow models that are solved optimally and independently by CPLEX on a parallel computing platform. The HOGCR preserves the consistency among parent and child cluster solutions obtained at consecutive levels. We assess the performance of the algorithm by using large scale scenarios and find satisfactory results.     

Defining a conceptual model for high-speed vessels

High-speed vessels offer the opportunity for faster and more frequent delivery of smaller quantities of goods over shorter sea crossings. This paper reviews the role of high-speed vessels in the context of the total supply chain based on Fisher's product categorisation model. A mode choice process is presented here within the context of supply chain transport strategies. The model relates mode choice to volume supply, product cost, shipping distance, frequency of service, transit time and product type. The paper concludes that where the flexibility is the market winner high-speed vessels are required whereas where cost is the market winner conventional ships will suffice.     

Integrating the warehousing and transportation functions of the supply chain

Electronic commerce and associated business-to-business transaction capabilities have changed the way in which supply chains operate. The Internet has enabled information exchange on an unprecedented scale, often at a pace too fast for normal consumption. Companies are not equipped to make effective use of data from warehouse management systems––which contain information on supplier/customer warehouse inventory levels and key customer ordering patterns––and transportation management systems––within which information pertaining to the location of important supply chain assets such as products or vehicles is typically stored. These systems are key factors in integrating the physical flow of goods along the supply chain. The integration of these systems leads to global inventory visibility, which, in turn, leads to reduced costs and improved customer service by decreasing shipping and receiving cycle times, increasing shipment and inventory accuracy, and decreasing lead-time variability. This paper examines the total cost benefits that can be achieved by suppliers and warehouses through the increased global visibility provided by an integrated system. We develop a discrete event simulation model of a multi-product supply chain to examine the potential benefits to be gained from global inventory visibility and trailer yard dispatching and sequencing techniques. Experimental results demonstrate the potential for this integrated paradigm to improve customer service through improved efficiencies, reduced costs, and reduced lead-time variability.     

Supply chain network design under profit maximization and oligopolistic competition

In this paper, we model the supply chain network design problem with oligopolistic firms who are involved in the competitive production, storage, and distribution of a homogeneous product to multiple demand markets. The profit-maximizing firms select both the capacities associated with the various supply chain network activities as well as the product quantities. We formulate the governing Nash–Cournot equilibrium conditions as a variational inequality problem and identify several special cases of the model, notably, a generalization of a spatial oligopoly and a classical oligopoly problem to include design capacity variables. The proposed computational approach, which is based on projected dynamical systems, fully exploits the network structure of the problems and yields closed form solutions at each iteration. In order to illustrate the modeling framework and the algorithm, we also provide solutions to a spectrum of numerical supply chain network oligopoly design examples.This paper makes a contribution to game theoretic modeling of competitive supply chain network design problems in an oligopolistic setting.     

A generalized algebraic model for optimizing inventory decisions in a multi-stage complex supply chain

In this paper, we deal with more generalized inventory coordination mechanism in an n-stage, multi-customer, non-serial supply chain, where we extend and generalize pervious works that use algebraic methods to optimize this coordinated supply chain. We establish the recursive expressions for this multi-variable optimization problem. These expressions are used for the derivation of the optimal replenishment policy and the development of the solution algorithm. Further, we describe a simple procedure that can help in sharing the coordination cost benefits to induce all stages to adopt the inventory coordination mechanism. We provide a numerical example for illustrative purposes.     

Models for relief routing: Equity, efficiency and efficacy

In humanitarian relief operations, vehicle routing and supply allocation decisions are critically important. Similar routing and allocation decisions are studied for commercial settings where efficiency, in terms of minimizing cost, is the primary objective. Humanitarian relief is complicated by the presence of multiple objectives beyond minimizing cost. Routing and allocation decisions should result in quick and sufficient distribution of relief supplies, with a focus on equitable service to all aid recipients. However, quantifying such goals can be challenging. In this paper, we define and formulate performance metrics in relief distribution. We focus on efficacy (i.e., the extent to which the goals of quick and sufficient distribution are met) and equity (i.e., the extent to which all recipients receive comparable service). We explore how efficiency, efficacy, and equity influence the structure of vehicle routes and the distribution of resources. We identify trends and routing principles for humanitarian relief based on the analytical properties of the resulting problems and a series of computational tests.     

The e-supply chain portal: a core business model

Information technology can help to overcome the problems that plague many supply chains. Electronic exchange of information leads to reduction of errors and increased efficiency of the work processes. When one company can use the information of other companies in the supply chain, the negative effects of uncertainty can be mitigated in theory. In practice, however, the exchange of information between companies is not as easy as it seems. Many different systems and standards are used, the number of peer-to-peer relations with other companies in the network is usually too large to manage, most systems are not open for easy exchange of information with other systems, and most companies are very reluctant to share information with other companies in the first place.A portal looks like a good solution to overcome these problems. Standardized interactions with one portal are easier to manage than are many peer-to-peer relations. The portal can take the role of a trusted party. What is needed to accomplish portal effectiveness is a review of the business processes when dealing with other companies. In this paper, we advocate a radical simplification of these business processes, and provide support for the end-to-end character of the supply chain in real time. Specifically, we report on a pilot project for the US Department of Defense to create a portal for supply chain integration. The project showed the feasibility of real-time support for end-to-end supply chain management in a complex organization.     

基于电子商务的供应链管理集成技术研究

针对传统的供应链管理难以实现企业与合作伙伴间对信息的实时同步共享,不能充分支持和体现供应链管理的战略优势和系统特征的问题,在分析基于电子商务的供应链管理集成模式的基础上,给出以BizTalk为主要开发平台的电子商务供应链管理系统集成的技术架构,使供应链上的节点企业可以真正实现与供应商、经销商和客户的信息共享。     

The equilibrium of closed-loop supply chain supernetwork with time-dependent parameters

In this paper, we develop a closed-loop supply chain supernetwork model including suppliers, manufacturers, retailers and consumers at demand market, in which the demand for product is seasonal (t), and the sensitivity (w) of demand to price is another key factor which effects consumers’ demand. Moreover, the manufacturers invest the reverse distribution channel for incenting consumers to return more used products. Based on the Evolutionary Variational Inequalities (EVI) theory and Projected Dynamical Systems (PDS), the equilibrium condition of closed-loop supply chain is formulated, and the model is verified reasonably by numerical example.     

Designing a new supply chain for competition against an existing supply chain

We develop a bi-level model for designing an entrant supply chain (SC) in the presence of a pre-existing competing SC where demand is elastic with respect to price and distance. The model assumes dynamic competition between the new and pre-existing SCs in retailers’ level and probabilistic customers’ behavior. Strategic facility location and flow decisions are made while considering inventory carrying costs incurred on the operational level. We formulate the problem and propose exact and metaheuristic algorithms to solve it. The model is solved using data from a real-life case and also randomly generated test problems to extract managerial insights.     

Optimizing road network daily maintenance operations with stochastic service and travel times

This paper studies optimization methods for a routing problem encountered in daily maintenance operations of a road network. Stochastic service and travel times on road segments are considered. The problem is formulated as a variation of the capacitated arc routing problem (CARP). A chance-constrained programming model is firstly developed and solved by a branch-and-cut algorithm. A stochastic programming model with recourse is also proposed to take into account the recourse costs in case of route failure. The problem is solved by an adaptive large neighborhood search algorithm. The computational experiments demonstrate the effectiveness of the algorithm.