Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
From MaRDI portal
Publication:439376
DOI10.1016/J.EJOR.2011.09.023zbMATH Open1244.90034OpenAlexW2087450241MaRDI QIDQ439376FDOQ439376
Authors: 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
Recommendations
- A variable neighborhood search for the generalized vehicle routing problem with stochastic demands
- A Vehicle Routing Problem with Stochastic Demand
- Variable neighborhood search for the stochastic and dynamic vehicle routing problem
- Computational Approaches to Stochastic Vehicle Routing Problems
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
Approximation methods and heuristics in mathematical programming (90C59) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)
Cites Work
- Optimization by simulated annealing
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
- 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
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- Stochastic vehicle routing problem with restocking
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
- Challenges and Advances in A Priori Routing
- Title not available (Why is that?)
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Recent advances on two-dimensional bin packing problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
- Solving the vehicle routing problem with stochastic demands using the cross-entropy method
- A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
- New optimality cuts for a single-vehicle stochastic routing problem
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- An Improved Petal Heuristic for the Vehicle Routeing Problem
- 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
- Fast Algorithms for Geometric Traveling Salesman Problems
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
- The column-circular, subsets-selection problem: Complexity and solutions
- Extensions of the Petal Method for Vehicle Routeing
- Computational Approaches to Stochastic Vehicle Routing Problems
Cited In (15)
- Robust optimisation approach for vehicle routing problems with uncertainty
- An inverse robust optimisation approach for a class of vehicle routing problems under uncertainty
- An exponential (matching based) neighborhood for the vehicle routing problem
- A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands
- 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
- Faster rollout search for the vehicle routing problem with stochastic demands and restocking
- A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands
- On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands
- Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand
- The Vehicle Routing Problem with Stochastic Demands and Split Deliveries
- A variable neighborhood search for the generalized vehicle routing problem with stochastic demands
- A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
Uses Software
This page was built for publication: Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439376)
