A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands

Secomandi, Nicola

doi:10.1287/opre.49.5.796.10608

Cited by 172 publications

(128 citation statements)

References 17 publications

Supporting

Mentioning

125

Contrasting

Unclassified

Order By: Relevance

“…Yang et al [22] proposed a strategy for splitting the a priori tour allowing the restocking before a stockout, when this is profitable. Secomandi [23,24,25] analyzed different possibilities for applying dynamic programming to this problem. Teodorović and Pavković [26] and Gendreau et al [27] tackled the VRPSD using metaheuristic approaches.…”

Section: Literature Overviewmentioning

confidence: 99%

Out-of-the-Box and Custom Implementation of Metaheuristics. A Case Study: The Vehicle Routing Problem with Stochastic Demand

Pellegrini

Birattari

2011

Intelligent Computational Optimization in Engineering

View full text Add to dashboard Cite

Abstract. Metaheuristics are a class of effective algorithms for optimization problems. A basic implementation of a metaheuristic typically requires rather little development effort. With a significantly larger investment in the design, implementation, and fine-tuning, metaheuristics can often produce state-of-the-art results. According to the amount of development effort, we say that an implementation of a metaheuristic is either an out-of-the-box version or a custom one. The possibility of implementing metaheuristics in such a flexible way is one of the major strengths of these algorithms. Nonetheless, it also hides some possible catches. In particular, it should be noticed that results obtained with out-of-the-box implementations cannot be always generalized to custom ones, and vice versa. The goal of this analysis is to stress that these two ways of using metaheuristics are different. As a case study, we focus on the vehicle routing problem with stochastic demand and on five among the most successful metaheuristics-namely, tabu search, simulated annealing, genetic algorithms, iterated local search, and ant colony optimization. We show that the relative performance of these algorithms strongly varies whether one considers out-of-the-box implementations or custom ones, in which the parameters are accurately fine-tuned. Moreover, we underline the relevance of clearly stating the framework in which the results reported in the literature have been obtained. To this aim, we consider also an implementation of the same algorithms as described in the literature.

show abstract

Section: Literature Overviewmentioning

confidence: 99%

Out-of-the-Box and Custom Implementation of Metaheuristics. A Case Study: The Vehicle Routing Problem with Stochastic Demand

Pellegrini

Birattari

2011

Intelligent Computational Optimization in Engineering

View full text Add to dashboard Cite

show abstract

“…Besides the conventional stochastic programming framework, a Markov decision process for single stage and multistage stochastic models were introduced to investigate the VRPSD in [17,16]. More recently, a re-optimization type routing policy for the VRPSD was introduced by [41]. The VRP with stochastic customers (VRPSC), in which customers with deterministic demands and a probability p i of being present, and the VRP with stochastic customers and demands (VRPSCD), which combines the VRPSC and VRPSD, first appeared in the literature of [29,27,28].…”

Section: Svrps With Stochastic Customers and Demandsmentioning

confidence: 99%

The Stochastic Vehicle Routing Problem for Minimum Unmet Demand

Shen

Ordóñez

Dessouky

2009

Springer Optimization and Its Applications

View full text Add to dashboard Cite

Summary. In this paper, we are interested in routing vehicles to minimize unmet demand with uncertain demand and travel time parameters. Such a problem arises in situations with large demand or tight deadlines, so that routes that satisfy all demand points are difficult or impossible to obtain. An important application is the distribution of medical supplies to respond to large-scale emergencies, such as natural disasters or terrorist attacks. We present a chance constrained formulation of the problem that is equivalent to a deterministic problem with modified demand and travel time parameters, under mild assumptions on the distribution of stochastic parameters; and relate it with a robust optimization approach. A tabu heuristic is proposed to solve this MIP and simulations are conducted to evaluate the quality of routes generated from both deterministic and chance constrained formulations. We observe that chance constrained routes can reduce the unmet demand by around 2%-6% for moderately tight deadline and total supply constraints.

show abstract

“…The problem described above can be modeled as a Vehicle Routing Problem with Stochastic Demand (VRPSD) as the amount of solid waste is stochastic and may be presented in a complete graph [7] and Secomandi, [9,10] . Let the set of nodes be {0, 1,…,n}.…”

Section: Problemmentioning

confidence: 99%

Ant Colony Optimization for Solving Solid Waste Collection Scheduling Problems

Ismail¹,

Loh²

2009

J. of Mathematics and Statistics

View full text Add to dashboard Cite

Problem statement: Southern Waste Management environment (SWM environment) is a company responsible for the collection and disposal of solid waste for the city of Johor Bahru, a city with over one million populations. The company is implementing an integrated solid waste management system where it involved in the optimization of resources to ensure the effectiveness of its services. Formulating this real life problem into vehicle routing problem with stochastic demand model and using some designed algorithms to minimize operation cost of solid waste management. Approach: The implementation of Ant Colony Optimization (ACO) for solving solid waste collection problem as a VRPSD model was described. A set of data modified from the well known 50 customers problems were used to find the route such that the expected traveling cost was minimized. The total cost was minimized by adopting a preventive restocking policy which was trading off the extra cost of returning to depot after a stock-out with the cost of returning depot for restocking before a stock-out actually occurs. For comparison purposes, Simulated Annealing (SA) was used to generate the solution under the same condition. Results: For the problem size with 12 customers with vehicle capacity 10 units, both algorithms obtained the same best cost which is 69.4358 units. But the percentage deviations of averages from the associated best cost are 0.1322 and 0.7064 for ACS and SA. The results indicated that for all demand ranges, proposed ACO algorithm showed better performance than SA algorithm. Conclusion: SA was able to obtain good solutions for small ranges especially small size of problem. For ACS, it is always provide good results for all tested ranges and problems sizes of the tested problem.

show abstract

A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands

Cited by 172 publications

References 17 publications

Out-of-the-Box and Custom Implementation of Metaheuristics. A Case Study: The Vehicle Routing Problem with Stochastic Demand

Out-of-the-Box and Custom Implementation of Metaheuristics. A Case Study: The Vehicle Routing Problem with Stochastic Demand

The Stochastic Vehicle Routing Problem for Minimum Unmet Demand

Ant Colony Optimization for Solving Solid Waste Collection Scheduling Problems

Contact Info

Product

Resources

About