Routing problems: A bibliography

This bibliography contains 500 references on four classical routing problems: the Traveling Salesman Problem, the Vehicle Routing Problem, the Chinese Postman Problem, and the Rural Postman Problem. References are presented alphabetically under a number of subheadings.     

Efficient Heuristics for the Heterogeneous Fleet Multitrip VRP with Application to a Large-Scale Real Case

The basic Vehicle Routing Problem (VRP) consists of computing a set of trips of minimum total cost, to deliver fixed amounts of goods to customers with a fleet of identical vehicles. Few papers address the case with several types of vehicles (heterogeneous fleet). Most of them assume an unlimited number of vehicles of each type, to dimension the fleet from a strategic point of view. This paper tackles the more realistic tactical or operational case, with a fixed number of vehicles of each type, and the optional possibility for each vehicle to perform several trips. It describes several heuristics, including a very efficient one that progressively merges small starting trips, while ensuring that they can be performed by the fleet. This heuristic seeks to minimize the number of required vehicles as a secondary objective. It outperforms classical VRP heuristics, can easily handle various constraints, and gives very good initial solutions for a tabu search method. The real case of a French manufacturer of furniture with 775 destination stores is presented.     

Dynamic routing in open queueing networks: Brownian models,cut constraints and resource pooling

We present an introductory review of recent work on the control of open queueing networks. We assume that customers of different types arrive at a network and pass through the system via one of several possible routes; the set of routes available to a customer depends on its type. A route through the network is an ordered set of service stations: a customer queues for service at each station on its route and then leaves the system. The two methods of control we consider are the routing of customers through the network, and the sequencing of service at the stations, and our aim is to minimize the number of customers in the system. We concentrate especially on the insights which can be obtained from heavy traffic analysis, and in particular from Harrison's Brownian network models. Our main conclusion is that in many respects dynamic routingsimplifies the behaviour of networks, and that under good control policies it may well be possible to model the aggregate behaviour of a network quite straightforwardly.Supported by SERC grant GR/F 94194.     

Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem

The probabilistic traveling salesman problem is a well known problem that is quite challenging to solve. It involves finding the tour with the lowest expected cost for customers that will require a visit with a given probability. There are several proposed algorithms for the homogeneous version of the problem, where all customers have identical probability of being realized. From the literature, the most successful approaches involve local search procedures, with the most famous being the 2-p-opt and 1-shift procedures proposed by Bertsimas [D.J. Bertsimas, L. Howell, Further results on the probabilistic traveling salesman problem, European Journal of Operational Research 65 (1) (1993) 68–95]. Recently, however, evidence has emerged that indicates the equations offered for these procedures are not correct, and even when corrected, the translation to the heterogeneous version of the problem is not simple. In this paper we extend the analysis and correction to the heterogeneous case. We derive new expressions for computing the cost of 2-p-opt and 1-shift local search moves, and we show that the neighborhood of a solution may be explored in O(n²) time, the same as for the homogeneous case, instead of O(n³) as first reported in the literature.     

Designing delivery districts for the vehicle routing problem with stochastic demands

This paper considers the problem of designing districts for vehicle routing problems with stochastic demands. In particular, demands are assumed to be uncertain at the time when the districts are made, and these are revealed only after the districting decisions are determined. Tabu search and multistart heuristics for this stochastic districting problem are developed and compared. Computational results show that tabu search is superior over multistart.     

Structure-reversibility and departure functions of queueing networks with batch movements and state dependent routing

We consider characterizations of departure functions in Markovian queueing networks with batch movements and state-dependent routing in discrete-time and in continuous-time. For this purpose, the notion of structure-reversibility is introduced, which means that the time-reversed dynamics of a queueing network corresponds with the same type of queueing network. The notion is useful to derive a traffic equation. We also introduce a multi-source model, which means that there are different types of outside sources, to capture a wider range of applications. Characterizations of the departure functions are obtained for any routing mechanism of customers satisfying a recurrent condition. These results give a unified view to queueing network models with linear traffic equations. Furthermore, they enable us to consider new examples as well as show limited usages of this kind of queueing networks. This revised version was published online in June 2006 with corrections to the Cover Date.     

基于GIS的河道、蓄滞洪区洪水演进动态可视化仿真研究

结合地理信息系统(GIS)技术和三维仿真图示技术,探讨了基于GIS的河道、蓄滞洪区洪水演进可视化仿真技术原理与方法,分析了洪水演进可视化模型的建立过程,设计出河道、蓄滞洪区洪水演进系统的总体结构及开发模式,并介绍了系统具体功能的实现.本仿真模型在实例中得到了成功的应用,可为防洪减灾决策提供快捷、直观形象的信息支持.     

Shortest expected delay routing for Erlang servers

The queueing problem with Poisson arrivals and two identical parallel Erlang servers is analyzed for the case of shortest expected delay routing. This problem may be represented as a random walk on the integer grid in the first quadrant of the plane. An important aspect of the random walk is that it is possible to make large jumps in the direction of the boundaries. This feature gives rise to complicated boundary behavior. Generating function approaches to analyze this type of random walk seem to be extremely complicated and have not been successful yet. The approach presented in this paper directly solves the equilibrium equations. It is shown that the equilibrium distribution of the random walk can be written as an infinite linear combination of products. This linear combination is constructed in a compensation procedure. The starting solutions for this procedure are found by solving the shortest expected delay problem with instantaneous jockeying. The results can be used for an efficient computation of performance criteria, such as the waiting time distribution and the moments of the waiting time and the queue lengths.     

Design of stochastic hitless‐prediction router by using the first exceed level theory

This paper deals with an enhanced hitless‐prediction router system that has the hitless‐restart capability with forecasting. Hitless‐restart means that the router can stay on the forwarding path and the network topology remains stable. But the major difficulty of the current hitless‐restart is that the router is always active to take the action, such as non‐stop forwarding (upgrade, maintenance and capacity expansion may be included as third party activities). Stochastic hitless‐prediction model gives the decision making factors that manage a router system more efficiently. An analogue of the first exceed level theory is applied for the restriction of the number of buffer size that is the router capacity. Analytically, tractable results are obtained by using a first exceed level process that enables us to determine the decision making factors such as recycle periods of the hitless‐prediction point to prevent a router shutdown. Copyright © 2005 John Wiley & Sons, Ltd.     

Cash flow optimization in delivery scheduling

The paper examines the inventory routing problem from the perspective of the present value of the cash flow associated with the distribution of a commodity such as propane. We analyze this problem for both deterministic and stochastic customer demands and validate our results on data from a real life distribution operation of propane. The analysis based on the present value of the cash flow indicates that optimization of propane deliveries based on efficiency/cost criteria alone will generate inferior solutions and it would be more advantageous for the company to set deliveries for a large percentage of the customers based on the present value of cash flow. In addition, in the case of stochastic demands, deliveries based on the cash flow consideration will tend to reduce the number of stockouts (i.e. improve both profit and service).