Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
From MaRDI portal
Publication:439376
DOI10.1016/j.ejor.2011.09.023zbMath1244.90034MaRDI QIDQ439376
Justin C. Goodson, Jeffrey W. Ohlmann, Barrett W. Thomas
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.09.023
90C15: Stochastic programming
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Variable neighborhood search for the stochastic and dynamic vehicle routing problem, A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order, On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows, A multi-space sampling heuristic for the vehicle routing problem with stochastic demands, Partial-route inequalities for the multi-vehicle routing problem with stochastic demands, Faster rollout search for the vehicle routing problem with stochastic demands and restocking, A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands, Robust optimisation approach for vehicle routing problems with uncertainty, An inverse robust optimisation approach for a class of vehicle routing problems under uncertainty, A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands
Uses Software
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Recent advances on two-dimensional bin packing problems
- New optimality cuts for a single-vehicle stochastic routing problem
- A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
- Analysis of a rollout approach to sequencing problems with stochastic routing applications
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- The column-circular, subsets-selection problem: Complexity and solutions
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- Solving the vehicle routing problem with stochastic demands using the cross-entropy method
- Stochastic Vehicle Routing Problem with Restocking
- A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Challenges and Advances in A Priori Routing
- A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Fast Algorithms for Geometric Traveling Salesman Problems
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- An Improved Petal Heuristic for the Vehicle Routeing Problem
- Computational Approaches to Stochastic Vehicle Routing Problems
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
- Extensions of the Petal Method for Vehicle Routeing
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Vehicle Routing Problem with Stochastic Demand
