Enriching the tactical network design of express service carriers with fleet scheduling characteristics

Express service carriers provide time-guaranteed deliveries of parcels via a network consisting of nodes and hubs. In this, nodes take care of the collection and delivery of parcels, and hubs have the function to consolidate parcels in between the nodes. The tactical network design problem assigns nodes to hubs, determines arcs between hubs, and routes parcels through the network. Afterwards, fleet scheduling creates a schedule for vehicles operated in the network. The strong relation between flow routing and fleet scheduling makes it difficult to optimise the network cost. Due to this complexity, fleet scheduling and network design are usually decoupled. We propose a new tactical network design model that is able to include fleet scheduling characteristics (like vehicle capacities, vehicle balancing, and drivers' legislations) in the network design. The model is tested on benchmark data based on instances from an express provider, resulting in significant cost reductions

Problem Reduction in Set Partitioning Problems

In this paper, several problem reduction techniques are discussed that can be used to reduce the solution time of set partitioning problems. These techniques can be applied in any solution algorithm for set partitioning problems. Besides a short review of the existing literature on preprocessing set partitioning problems, we also present several new techniques. The value of these techniques is illustrated by various computational experiments.algorithm;problem reducing

A Lagrangean Relaxtion Based Algorithm for Solving Set Partitioning Problems

In this paper we discuss a solver that is developed to solve set partitioning problems.The methods used include problem reduction techniques, lagrangean relaxation and primal and dual heuristics.The optimal solution is found using a branch and bound approach.In this paper we discuss these techniques.Furthermore, we present the results of several computational experiments and compare the performance of our solver with the well-known mathematical optimization solver Cplex.algorithm;integer programming

Insinking: A Methodology to Exploit Synergy in Transportation

vehicle routing;cooperative games;retailing;insinking;Shapley Monotonic Path;Logistic Service Providers

Enriching the Tactical Network Design of Express Service Carriers with Fleet Scheduling Characteristics

Express service carriers provide time-guaranteed deliveries of parcels via a network consisting of nodes and hubs. In this, nodes take care of the collection and delivery of parcels, and hubs have the function to consolidate parcels in between the nodes. The tactical network design problem assigns nodes to hubs, determines arcs between hubs, and routes parcels through the network. Afterwards, fleet scheduling creates a schedule for vehicles operated in the network. The strong relation between flow routing and fleet scheduling makes it difficult to optimise the network cost. Due to this complexity, fleet scheduling and network design are usually decoupled. We propose a new tactical network design model that is able to include fleet scheduling characteristics (like vehicle capacities, vehicle balancing, and drivers’ legislations) in the network design. The model is tested on benchmark data based on instances from an express provider, resulting in significant cost reductions.express service carriers;freight transportation;tactical hub network design;integer programming;fleet scheduling;heuristics

Factory Gate Pricing: An Analysis of the Dutch Retail Distribution

Factory Gate Pricing (FGP) is a relatively new phenomenon in retail distribution. Under FGP, products are no longer delivered at the retailer distribution center, but collected by the retailer at the factory gates of the suppliers. Owing to both the asymmetry in the distribution networks (the supplier sites greatly outnumber the retailer distribution centers) and the better inventory and transport coordination mechanisms, this is likely to result in high savings. A mathematical model was used to analyze the benefits of FGP for a case study in the Dutch retail sector. Extensive numerical results are presented to show the effect of the orchestration shift from supplier to retailer, the improved coordination mechanisms, and sector-wide cooperation.supply chain management;factory gate pricing;retail distribution

Advanced Planning Concepts in the Closed-Loop Container Network of ARN

In this paper we discuss a real-life case study in the optimization of the logistics network for the collection of containers from end-of-life vehicle dismantlers in the Netherlands.Advanced planning concepts like dynamic assignment of dismantlers to logistic service providers are analyzed by a simulation model.In this model, we periodically solve a vehicle routing problem to gain insight in the long-term performance of the system.The vehicle routing problem considered is a multi depot pickup and delivery problem with alternative delivery locations.We solve this problem with a heuristic based on route generation and set partitioning.Reverse logistics;Closed-loop supply chain mmanagement;vehicle routing;set partitioning;distribution planning

Joint Route Planning under Varying Market Conditions

Purpose - To provide empirical evidence on the level of savings that can be attained by joint route planning and how these savings depend on specific market characteristics.Design/methodology/approach - Joint route planning is a measure that companies can take to decrease the costs of their distribution activities. Essentially, this can either be achieved through horizontal cooperation or through outsourcing distribution to a Logistics Service Provider.The synergy value is defined as the difference between distribution costs in the original situation where all entities perform their orders individually, and the costs of a system where all orders are collected and route schemes are set up simultaneously to exploit economies of scale.This paper provides estimates of synergy values, both in a constructed benchmark case and in a number of real-world cases.Findings - It turns out that synergy values of 30% are achievable.Furthermore, intuition is developed on how the synergy values depend on characteristics of the distribution problem under consideration.Practical implications - The developed intuition on the nature of synergy values can help practitioners to find suitable combinations of distribution systems, since synergy values can quickly be assessed based on the characteristics of the distribution problem, without solving large and difficult Vehicle Routing Problems.Originality/value - this paper addresses a major impediment to horizontal cooperation: estimating operational savings upfront.Horizontal cooperation;Distribution;Outsourcing;Vehicle routing with time windows;Retail

Factory Gate Pricing: An Analysis of the Dutch Retail Distribution

Factory Gate Pricing (FGP) is a relatively new phenomenon in retail distribution.Under FGP, products are no longer delivered at the retailer distribution center, but collected by the retailer at the factory gates of the suppliers.Owing to both the asymmetry in the distribution networks (the supplier sites greatly outnumber the retailer distribution centers) and the better inventory and transport coordination mechanisms, this is likely to result in high savings.A mathematical model was used to analyze the benefits of FGP for a case study in the Dutch retail sector.Extensive numerical results are presented to show the effect of the orchestration shift from supplier to retailer, the improved coordination mechanisms, and sector-wide cooperation.pricing;retailing;distribution;supply chain management;Netherlands