Search

This article studies a single-location inventory model with random leadtimes. Inventory is replenished by a single supplier who, at the time a replenishment order is received, knows exactly when the order will be delivered. In other words, the supplier knows the leadtime for every replenishment order. Suppose the single-location inventory system is managed by a retailer. The objective of this article is to quantify the value of the information about leadtimes to the retailer. This is achieved by considering and comparing the performances of two scenarios whether or not the supplier shares his leadtime information with the retailer. Numerical evidence suggests that the value of leadtime information can be significant.

The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. To the best of our knowledge, this paper presents one of the first metaheuristic approaches for the traveling repairman problem.

This survey paper presents a review of the recent heuristic and metaheuristic solution techniques for different extensions of the well-known capacitated Vehicle Routing Problem (VRP) that are related to the demand type. Among the discussed topics are VRP with backhauls, pickup and delivery problems, dial-a-ride problems, period- and inventory routing, time window constraints, split deliveries as well as dynamic and stochastic routing problems. An introduction to each extension is provided and the recent heuristic and metaheuristic solution methods are shortly described. For earlier approaches, we refer to previous survey articles. The Vehicle Routing Problem (VRP) is one of the most well-known combinatorial optimization problems, and holds a central place in distribution management and logistics. The objective of the VRP is to deliver or supply a set of customers with known demands on minimum-cost vehicle routes originating and terminating at a central depot. Motivated by significant practical importance as well as considerable computational difficulty, there has been a huge amount of research on different practical extensions of the VRP. The purpose of this two-part survey is to review the recent heuristic and metaheuristic solution methods for different multi-vehicle variants of the VRP. We concentrate on papers written in 1995 or after that. For earlier methods, we refer to previous survey papers. This second part focuses on extensions related to demand side, i.e., the customer.

This survey paper reviews the recent heuristic and metaheuristic solution methods for the well-known capacitated vehicle routing problem and arc routing problem as well as several extensions of the basic problems related to the supply side. Among the discussed extensions are time dependent travel times, multiple use of vehicles, tactical fleet size and mix problem and location-allocation routing. An introduction is provided for each topic and recent heuristic and metaheuristic solution techniques are briefly discussed. For earlier approaches, we refer to previous survey articles. The Vehicle Routing Problem (VRP) is one of the most well-known combinatorial optimization problems, and holds a central place in distribution management and logistics. The objective of the VRP is to deliver or supply a set of customers with known demands on minimum-cost vehicle routes originating and terminating at a central depot. Motivated by significant practical importance as well as considerable computational difficulty, there has been a huge amount of research on VRP and its different practical extensions. The purpose of this two-part survey is to review the recent heuristic solution methods for different multi-vehicle variants of the VRP. We focus on papers written in 1995 or after that. For earlier methods, we refer to previous survey papers. This first part reviews the methods for the basic capacitated vehicle routing problem and arc routing problem, as well as different supply side related extensions such as the fleet size and mix determination and the location of the support facilities. Extensions related to the demand side are discussed in the second part of this survey