The information value of logistics platforms in a freight matching market

The information asymmetry in the freight matching of the long-haul trucking industry usually pushes shippers to join a logistics platform that has better knowledge of truckers’ cost information. A logistics platform that is plugged into a freight transportation system helps shippers overcome their information disadvantage but produces the double marginalization effect. We investigate the equilibrium characteristics of a shipper and logistics platform in the freight matching market and find that the shipper prefers to cooperate with the logistics platform in a small-scale sales market but searches for truckers by himself in a large-scale sales market. We show that the information value of a logistics platform for the freight system consists of two aspects: (i) employ low-cost truckers for the shipper and avoid the shipper’s inefficient expansion of the selling quantity in a moderate-scale sales market with greatly heterogeneous truckers, and (ii) improve both the total profit and social welfare of the freight system in a small-scale sales market. We further find that the shipper’s private information may hurt the logistics platform and the logistics platform can mitigate her double marginalization disadvantage by improving value-added services or lowering the logistics price in a large-scale market. Our findings provide guidelines for the shipper and logistics platform on how to choose the appropriate transportation strategy and employment strategy in different logistics markets.     

考虑码头内外堆场竞争的集装箱堆存定价模型

针对由于集装箱吞吐量增加造成翻箱成本增加与码头堆场拥堵,考虑内外堆场竞争,构建集装箱堆存定价模型,研究内外堆场竞争下的堆存定价决策和货主移箱决策,分析码头堆场操作成本、场外堆场运输成本、货主需求参数和码头堆场收益的内在关系。算例结果表明:一旦过了免费期立即移箱到场外堆场,货主成本最小。随着场外堆场运输成本的增加,码头堆场的堆存定价和箱量增加,提高码头堆场收益。随着码头堆场操作成本降低,码头堆场堆存价格随之下降,但码头堆存箱量增加,提高码头堆场收益。此外降低堆场定价对货主需求的影响参数以及提高运输成本对货主需求的影响系数,有利于提高码头堆场收益。     

Reputation-based winner determination problem for combinatorial transportation procurement auctions

This paper proposes a reputation-based winner determination problem for transportation procurement auctions where the allocation of long-term contracts to carriers is decided with respect to both bid ask-prices and carriers reputation. The objective is to manage the trade-off between transport costs and the quality of service during operations. Carriers reputation is translated into unexpected hidden cost that represents the possible additional cost that the shipper may incur when dealing with a set of winning carriers. This cost depends essentially on the carriers reputation as evaluated by the shipper running the auction. To evaluate carriers reputations, the shipper uses a number of service attributes with different weights depending on shipping contracts.     

基于前景理论的众包物流配送方行为决策演化博弈分析——基于发货方视角

考虑个体有限理性特征,基于前景理论构建众包物流参与者感知收益博弈矩阵。从发货方视角,推理出众包物流配送方发挥较高努力水平的条件。通过引入保价制度,建立保价条件下配送方的行为决策模型,并运用数值仿真技术验证模型的有效性。结果发现:(1)配送方的努力成本、不努力的收入、处罚力度等指标直接影响其努力水平;(2)配送方努力工作的成本前景值要小于受到处罚与不努力收入前景值之和,同时要小于努力工作时所得的收益;(3)保价金额变动在一定条件下会影响配送方的努力水平,但是并不能达到完全控制的目的,甚至造成负面影响。因此在保价基础上,发货方可以通过增加监测力度或者加大处罚力度,有效保证配送方的努力水平。     

On characterization of the core of lane covering games via dual solutions

The lane covering game (LCG) is a cooperative game where players cooperate to reduce the cost of cycles that cover their required lanes on a network. We discuss the possibilities/impossibilities of a complete characterization of the core via dual solutions in LCGs played among a collection of shippers, each with a number of service requirements along some lanes, and show that such a complete characterization is possible if each shipper has at most one service requirement.     

Collaboration among small shippers in a transportation market

Intense competition in markets is pushing companies to increase their operational efficiency. One possible way to achieve increased efficiency is through cooperation with other companies. We study the coalition formation among small shippers in a transportation market characterized by uncertain demand. We analyze the decisions taken by the coalition and study the effect of shipper characteristics on the benefit of collaboration. Analysis shows that the shippers always benefit from the coalition, but when the benefits are to be allocated, the coalition may not always guarantee the budget balance, which is elementary for sustainability of any coalition. Using a game theoretical approach this study proposes saving allocation mechanisms and discusses the conditions that lead to a balanced budget.     

Transportation pricing of a truckload carrier

Freight transportation is a major component of logistical operations. Due to the increase in global trade, fierce competition among shippers and raising concerns about energy, companies are putting more emphasis on effective management and usage of transportation services. This paper studies the transportation pricing problem of a truckload carrier in a setting that consists of a retailer, a truckload carrier and a less than truckload carrier. In this setting, the truckload carrier makes his/her pricing decision based on previous knowledge on the less than truckload carrier’s price schedule and the retailer’s ordering behavior. The retailer then makes a determination of his/her order quantity through an integrated model that explicitly considers the transportation alternatives, and the related costs (i.e., bimodal transportation costs) and capacities. In the paper, the retailer’s replenishment problem and the truckload carrier’s pricing problem are modeled and solved based on a detailed analysis. Numerical evidence shows that the truckload carrier may increase his/her gainings significantly through better pricing and there is further opportunity of savings if the truckload carrier and the retailer coordinate their decisions.     

Buyer’s response to a temporary price reduction incorporating freight costs

In this paper, we characterize the buyer’s response to a temporary price reduction. Although there have been many studies that have considered the above problem, most of those studies assume that the buyer orders FOB (free on board) destination and that the freight charges are included in the supplier’s unit price. Our model thus becomes applicable for a buyer whose strategy is to include transportation costs in their purchase decisions. The buyer may want direct control on his inbound logistics costs. The company may have outsourced its logistics function and as a result is charged for freight as invoiced by the public motor carrier. In some cases, the supplier may only allow for orders that are FOB origin. Our model allows for less-than-truckload as well as truckload rates. Freight cost for a LTL shipment is modeled using tariffs set by public carriers in practice. These tariffs generally involve 6–7 breakpoints in terms of the weight of the shipment. Another complication in practice is that the shipper/buyer has an option to over-declare the weight of the shipment.     

Supplier-initiated outsourcing: A methodology to exploit synergy in transportation

Over the last decades, transportation has been evolving from a necessary, though low priority function to an important part of business that can enable companies to attain a competitive edge over their competitors. To cut down transportation costs, shippers often outsource their transportation activities to a logistics service provider of their choice. This paper proposes a new procedure that puts the initiative with the service provider instead: supplier-initiated outsourcing. This procedure is based on both operations research and game theoretical insights. To stress the contrast between the traditional push approach of outsourcing, and the here proposed pull approach where the service provider is the initiator of the shift of logistics activities from the shipper to the logistics service provider, we will refer to this phenomenon as insinking. Insinking has the advantage that the logistics service provider can proactively select a group of shippers with a strong synergy potential. Moreover, these synergies can be allocated to the participating shippers in a fair and sustainable way by means of a so-called Shapley Monotonic Path of customized tariffs. Insinking is illustrated by means of a practical example based on data from the Dutch grocery transportation sector.     

Alternate mode dispatching: the impact of cost minimisation

When a shipper may use a variety of trucks to ship less-than-truckload shipments, shipping cost is the relevant criterion for evaluating alternate dispatches. This point is demonstrated by optimally solving 15 dispatching problems from industry in two ways, once minimising distance, and second time minimising costs, when a mixed private fleet and a common carrier are available. The distance minimising dispatches are, on the average, 35% more expensive than the corresponding cost minimising ones, but part of this difference stems from assumptions which are necessary to compare these two criteria.     

Efficient elementary and restricted non-elementary route pricing

Column generation is involved in the current most efficient approaches to routing problems. Set partitioning formulations model routing problems by considering all possible routes and selecting a subset that visits all customers. These formulations often produce tight lower bounds and require column generation for their pricing step. The bounds in the resulting branch-and-price are tighter when elementary routes are considered, but this approach leads to a more difficult pricing problem. Balancing the pricing with route relaxations has become crucial for the efficiency of the branch-and-price for routing problems. Recently, the ng-routes relaxation was proposed as a compromise between elementary and non-elementary routes. The ng-routes are non-elementary routes with the restriction that when following a customer, the route is not allowed to visit another customer that was visited before if they belong to a dynamically computed set. The larger the size of these sets, the closer the ng-route is to an elementary route. This work presents an efficient pricing algorithm for ng-routes and extends this algorithm for elementary routes. Therefore, we address the Shortest Path Problem with Resource Constraint (SPPRC) and the Elementary Shortest Path Problem with Resource Constraint (ESPPRC). The proposed algorithm combines the Decremental State-Space Relaxation technique (DSSR) with completion bounds. We apply this algorithm for the Generalized Vehicle Routing Problem (GVRP) and for the Capacitated Vehicle Routing Problem (CVRP), demonstrating that it is able to price elementary routes for instances up to 200 customers, a result that doubles the size of the ESPPRC instances solved to date.     

Less-Than-Truckload carrier collaboration problem: modeling framework and solution approach

Less-Than-Truckload (LTL) carriers generally serve geographical regions that are more localized than the inter-city line-hauls served by truckload carriers. That localization can lead to urban freight transportation routes that overlap. If trucks are traveling with less than full loads, there typically exist opportunities for carriers to collaborate over such routes. We introduce a two stage framework for LTL carrier collaboration. Our first stage involves collaboration between multiple carriers at the entrance to the city and can be formulated as a vehicle routing problem with time windows (VRPTW). We employ guided local search for solving this VRPTW. The second stage involves collaboration between carriers at transshipment facilities while executing their routes identified in phase one. For solving the second stage problem, we develop novel local search heuristics, one of which leverages integer programming to efficiently explore the union of neighborhoods defined by new problem-specific move operators. Our computational results indicate that integrating integer programming with local search results in at least an order of magnitude speed up in the second stage problem. We also perform sensitivity analysis to assess the benefits from collaboration. Our results indicate that distance savings of 7–15 % can be achieved by collaborating at the entrance to the city. Carriers involved in intra-city collaboration can further save 3–15 % in total distance traveled, and also reduce their overall route times.     

An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles

The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the workday due to strict time limits on route duration (e.g., when perishable goods are transported). The routes are defined over customers with a revenue, a demand and a time window. Given a fixed-size fleet of vehicles, it might not be possible to serve all customers. Thus, the customers must be chosen based on their associated revenue minus the traveling cost to reach them. We introduce a branch-and-price approach to address this problem where lower bounds are computed by solving the linear programming relaxation of a set packing formulation, using column generation. The pricing subproblems are elementary shortest path problems with resource constraints. Computational results are reported on euclidean problems derived from well-known benchmark instances for the vehicle routing problem with time windows.     

A heuristic algorithm for the truckload and less-than-truckload problem

The delivery of goods from a warehouse to local customers is an important and practical problem of a logistics manager. In reality, we are facing the fluctuation of demand. When the total demand is greater than the whole capacity of owned trucks, the logistics managers may consider using an outsider carrier.Logistics managers can make a selection between a truckload (a private truck) and a less-than-truckload carrier (an outsider carrier). Selecting the right mode to transport a shipment may bring significant cost savings to the company.In this paper, we address the problem of routing a fixed number of trucks with limited capacity from a central warehouse to customers with known demand. The objective of this paper is developing a heuristic algorithm to route the private trucks and to make a selection of less-than-truckload carriers by minimizing a total cost function. Both the mathematical model and the heuristic algorithm are developed. Finally, some computational results and suggestions for future research are presented.     

A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers

The purpose of this article is to propose a perturbation metaheuristic for the vehicle routing problem with private fleet and common carrier (VRPPC). This problem consists of serving all customers in such a way that (1) each customer is served exactly once either by a private fleet vehicle or by a common carrier vehicle, (2) all routes associated with the private fleet start and end at the depot, (3) each private fleet vehicle performs only one route, (4) the total demand of any route does not exceed the capacity of the vehicle assigned to it, and (5) the total cost is minimized. This article describes a new metaheuristic for the VRPPC, which uses a perturbation procedure in the construction and improvement phases and also performs exchanges between the sets of customers served by the private fleet and the common carrier. Extensive computational results show the superiority of the proposed metaheuristic over previous methods.     

A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation

The current drive to reduce packaging waste has led many companies to consider the use of multi-trip containers or shippers in which to transport their products in order to reduce packaging waste. The efficiency of such systems obviously depends on selecting shipper dimensions in such a way as to ensure high volumetric utilisation. As is the case with many practical problems the efficiency/solution quality can be improved if problem specific information is used to enhance the operation of a meta-heuristic solution approach. The problem can be modelled as a p-median problem but is too large to be solved in reasonable time without further modification. Four such modifications, all based on properties of the physical problem, are introduced and incorporated into a hyperheuristic driven simulated annealing solution approach.     

海运服务链中的运力定价和空箱调运责任研究

本文研究了单个承运商和两个货运代理在双向港口间提供往返货运服务的航运服务链。由于港口间货运需求的内在不平衡,货运公司在多港口间的空箱调运会产生巨大的空箱调运费用。分别构建了承运商承担和承运商与货运代理共同承担空箱调运的数学模型,通过数学模型和数值算例分析了不同市场条件下的空箱调运责任和运力定价策略。研究发现承运商和货运代理是否采用定价策略来平衡需求取决于双向港口间货运市场的潜在需求差异。同时,承运商与货运代理的空箱调运分摊为非此即彼策略,当空箱调运成本大于某阈值时,承运商独自承担空箱调运责任;反之,货运代理承担空箱调运责任。而且货运代理承担模式增加整个海运链的利润,但进一步加剧空箱的不平衡状况。     

Optimal quoting of delivery time by a third party logistics provider: The impact of shipment consolidation and temporal pricing schemes

Increased competition in business environments requires that firms provide not only quality but also timely service with minimal cost. Offering a delivery-time guarantee may increase the demand for a product or service, or allow the firm to charge a price premium. This paper investigates the effects of different pricing schemes for a Third Party Logistics (3PL) provider. The 3PL tenders a consolidated load to a carrier that line-hauls over a certain origin–destination lane. In a price- and time-sensitive logistics market, we derive the optimal quotations that should be made for price and delivery-time, with the objective of maximizing the profit rate of the 3PL provider. We propose four easy-to-use temporal pricing schemes, and derive the corresponding optimal length of shipment consolidation cycles and the prices. Depending on the logistics market parameters, we show that charging according to an order’s time of arrival is not necessarily the best pricing scheme. Various managerial insights and numerical examples with sensitivity analysis are provided.     

THE LONG‐RUN INEFFICIENCY OF BLOCK‐RATE PRICING

ABSTRACT. In this paper we compare two regulation instruments, flat‐rate and increasing block‐rate pricing. The analysis applies to a competitive industry with free entry. Charge for irrigation water is a concrete example. It is shown that flat‐rate pricing leads to a first‐best social optimum, while with block‐rate pricing where the highest block set at the marginal cost, there is over production, firms are too small, and loss of economic surplus occurs. Moreover, first‐best is not implementable by increasing block‐rate pricing. This is in contrast to the commonly accepted view that block‐rate pricing is superior to flat‐rate pricing by allowing for income redistribution while preserving efficiency. Several second‐best situations are analyzed to show: 1) Block‐rate pricing with the highest block at the social marginal cost is optimal when the regulator must preserve the number of firms. 2) Water pricing alone cannot implement social optimum subject to a constant level of agricultural production. 3) Lobbying and political pressures, which force the regulator to sustain a constant average water price, result in optimal block‐rate pricing with the highest block below the social marginal cost.     

A DEA analysis of risk,cost, and revenues in insurance

Insurance companies have to take risk and cost into account when pricing car insurance policies that cover the risk of private use of cars. In this paper we use data from 80?000 car insurance policies in order to assess, once risk and cost have been taken into account, the combinations of risk that generate the highest returns for the company under existing pricing practices. We use data envelopment analysis (DEA) and frame the study within an analysis of experiments context. The results of DEA are interpreted in a multivariate statistical analysis context using factor analysis, and property fitting techniques. The impact of risk factors in the efficiency is explored by means of regression analysis with dummy variables. There are consequences for the pricing policy of the company.