Estimation of interregional input–output table using hybrid algorithm of the RAS method and real-coded genetic algorithm

In this paper, we propose a method for improving the accuracy of the estimation of interregional input–output tables, by combining the RAS method and the real-coded Genetic Algorithm (GA); these are simple representative methods for the estimation of an interregional input–output table. By comparing the performance evaluation results obtained using the proposed method, the RAS method, and Simulated Annealing, we verified that the combination of the genetic algorithm and the RAS method can enhance the estimation accuracy of an interregional input–output table. In addition, performance is further enhanced by adjusting GA parameters.     

Combinatorial clock-proxy exchange for carrier collaboration in less than truck load transportation

A carrier collaboration problem in less-than-truck load transportation is considered, where multiple carriers exchange their pickup and delivery requests in order to improve their operational efficiency. We extend the clock-proxy auction proposed by Ausubel et al. (2006) to a combinatorial clock-proxy exchange for the problem. This mechanism combines the price discovery of the clock exchange designed based on Lagrangian relaxation with the efficiency of the proxy exchange determined based on the information observed in the clock phase. Numerical experiments on randomly generated instances demonstrate the necessity of the proxy phase and the effectiveness of the clock-proxy exchange.     

A MILP model for planning the trips of dynamic positioned tankers with variable travel time

The transportation of the crude oil produced in offshore oilfields to onshore terminals is performed by vessels, known as shuttle tankers. Scheduling shuttle-tanker operations entails solving complex problems to ensure a timely offloading of the platforms, taking into account several logistics and inventory constraints. This work proposes a new MILP formulation that advances previous works by considering variable travel time between platforms and terminals. The combination of the MILP formulation with an optimization solver constitutes a decision-support tool to aid engineers reach optimal decisions for a planning horizon. To handle large-scale instances, rolling-horizon and relax-and-fix strategies are proposed.     

A robust inventory routing policy under inventory inaccuracy and replenishment lead-time

In this paper, we study an inventory routing problem under replenishment lead-time and inventory inaccuracy, which exist extensively in distribution systems for fresh products, but are often ignored in existing research. To solve the problem, a robust inventory routing policy is developed in three steps. At first, we propose the methods of updating the probability of the current net inventory and predicting those in future periods. For each candidate route, we develop a Robust TQL Algorithm to optimize the replenishment time, replenishment quantity and replenishment stage length. Finally, a genetic algorithm-based method is developed to optimize the delivery route.     

An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem

This problem involves optimizing product collection and redistribution from production locations to a set of processing plants over a planning horizon. This horizon consists of several days, and the collection-redistribution is performed on a repeating daily basis. A single routing plan must be prepared for the whole horizon, taking into account the seasonal variations in the supply. We model the problem using a sequence of periods, each corresponding to a season. We propose an adaptive large-neighborhood search with several specifically designed operators and features. The results show the excellent performance of the algorithm in terms of solution quality and computational efficiency.     

Arc routing problems to restore connectivity of a road network

After a disaster, restoring accessibility in the affected area is critical for response operations. We study two arc routing problems for clearing blocked roads. The first problem minimizes the time to reconnect the road network, while the second maximizes the total benefit gained by reconnecting network components within a time limit. For each problem, we develop a mixed integer programming formulation and two versions of a heuristic algorithm. We conduct computational experiments on Istanbul data and instances adapted from the literature. The heuristics achieve near-optimal or optimal solutions quickly in most of the tested instances.     

A Brief Survey of Modern Optimization for Statisticians

Modern computational statistics is turning more and more to high‐dimensional optimization to handle the deluge of big data. Once a model is formulated, its parameters can be estimated by optimization. Because model parsimony is important, models routinely include non‐differentiable penalty terms such as the lasso. This sober reality complicates minimization and maximization. Our broad survey stresses a few important principles in algorithm design. Rather than view these principles in isolation, it is more productive to mix and match them. A few well‐chosen examples illustrate this point. Algorithm derivation is also emphasized, and theory is downplayed, particularly the abstractions of the convex calculus. Thus, our survey should be useful and accessible to a broad audience.     

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.     

Benefits of in-vehicle consolidation in less than truckload freight transportation operations

Researchers and public agencies have proposed consolidation policies as an alternative to increase truck payload utilization and mitigate externalities produced by freight transportation. Understanding and enhancing the economic mechanisms that lead to freight consolidation can ease the implementation of these strategies, increase profits for shippers and carriers, and reduce freight-related negative externalities. An important mechanism that has recently been studied for cost reduction in the freight industry is combinatorial auctions. In these auctions, a shipper invites a set of carriers to submit bids for freight lane contracts. Carriers can bid for individual lanes or bundles of them according to their operational characteristics. These bids are constructed considering direct shipments (Truckload operations) and several biding advisory models have been proposed for this purpose. However, there are economies of scale that can be achieved if shipments are consolidated inside vehicles, which have not been explored in the construction of competitive bids. This paper investigates such benefits and provides insights on the competitiveness and challenges associated to the development of consolidated bids (suitable for Less-Than-Truckload operations). Consolidated bids are constructed using a multi-commodity one-to-one pickup-and-delivery vehicle routing problem that is solved using a branch-and-price algorithm. The numerical experiment shows that non-consolidated bids are dominated by consolidated bids, which implies that this type of operation can increase the likelihood of a carrier to win auctioned lanes, while increasing its profits margins over truckload companies (non-consolidated bids), and keeping the reported benefits that combinatorial auctions represent for shippers.     

提升算法对传统车险索赔频率建模模型的改进——基于我国五省交强险保单数据

广义线性模型作为非寿险定价的经典模型,在非寿险定价中得到了广泛的应用。近年来,以提升算法为代表的机器学习算法在保险领域取得了很好的效果,为保险产品定价提供了一种新的选择。本文将提升算法思想分别融入到回归树模型和广义线性模型(GLM)中去,用得到的新模型对我国车险索赔频率进行预测建模分析,并与传统的回归树模型和GLM进行比较。结果表明,加入提升算法后传统车险索赔频率建模模型的效果得到了很大的改善,并且在不存在过拟合的前提下,随着模型深度和迭代次数的增加,模型的效果也在不断优化。