In this paper, based on the analysis of the time urgency in medicine relief demand and kinds of complexity in the early period after earthquake disasters, the problem about vehicle scheduling in the medicine dispatching process is studied. A mathematical model of vehicle scheduling in the medicine dispatching process is built, which objective function is to minimize the total transportation tim...

This contribution gives an introduction to an integrated vehicle routing and resource allocation problem. We refer to it as the Swap Trailer Problem and formulate the mathematical model. After the analysis of dynamic decision problems and the development of a framework for this problem, we highlight the dynamic aspect of the problem. Two different solution strategies are supposed. Special prope...

The purpose of this paper is to present a coalition based multi-agent model for the Vehicle Routing Problem with Time Windows, which is one of the most important ones in distribution and transportation. The VRPTW objective is to design least cost routes from one depot to a set of customers. A fleet of homogeneous vehicles performs the routes to serve all the customers, while respecting capacity...

Due to drops in orders and decreasing production rates, demand is declining seriously in many logistic sectors like e.g. air cargo, ship and less-than-truckload (LTL) transports. Hence, logistic companies are looking for new ways to improve their transportation network efficiency. On the operational level, costs depend mainly on planned delivery tours. In our current research project KolOptNet1...

This paper presents a 0-1 programming model aimed at obtaining the optimal inventory policy and transportation mode for maintenance spare parts of high-speed trains. To obtain the model parameters for occasionally-replaced spare parts, a demand estimation method based on the maintenance strategies of China's high-speed railway system is proposed. In addition, we analyse the shortage time using ...

Artificial Intelligent (AI) techniques make a great influence on real-world distribution operations due to the complexity and the difficulty of finding an optimal solution within the limited time frame. To bridge the gap between standard problems in distribution and the real world problems, in this research, the standard VRP problem is extended to Multi Depot Vehicle Routing Problem with Time W...

In this study, we present the problem of shipping a single-product from a single supply origin, through storage depots, to a single demand destination by trucks, ships, etc. and aim to minimize the sum of ordering, inventory and transportation costs over an infinite time horizon. We formulate the problem consisting of power-of-two (PoT ), stationary and nested replenishment policies for the mul...

In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...

We introduce the Synchronized Multi-Assignment Orienteering Problem (SMOP), a vehicle routing problem that requires jointly selecting set of jobs while synchronizing assignment and transportation agents to roles form ad-hoc teams at different job locations. Agents must be assigned only for which they are qualified. Each certain number in each role within time window contributes reward score if ...