Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand

DOI10.1016/J.EJOR.2011.09.023MaRDI QIDQ439376zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

simulated annealingheuristicslogisticsstochastic vehicle routingcyclic-order neighborhoods

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)

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

Cites work

• scientific article; zbMATH DE number 1302201 (Why is no real title available?)
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
• A Vehicle Routing Problem with Stochastic Demand
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
• A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
• A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
• A sweep-based algorithm for the fleet size and mix vehicle routing problem
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• An Improved Petal Heuristic for the Vehicle Routeing Problem
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• Analysis of a rollout approach to sequencing problems with stochastic routing applications
• Challenges and Advances in A Priori Routing
• Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
• Computational Approaches to Stochastic Vehicle Routing Problems
• Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
• Extensions of the Petal Method for Vehicle Routeing
• Fast Algorithms for Geometric Traveling Salesman Problems
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
• New optimality cuts for a single-vehicle stochastic routing problem
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Optimization by simulated annealing
• Recent advances on two-dimensional bin packing problems
• Reoptimization Approaches for the 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
• The column-circular, subsets-selection problem: Complexity and solutions
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks

Cited in

(15)

• The Vehicle Routing Problem with Stochastic Demands and Split Deliveries
• Robust optimisation approach for vehicle routing problems with uncertainty
• The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem
• Faster rollout search for the vehicle routing problem with stochastic demands and restocking
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
• A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
• A variable neighborhood search for the generalized vehicle routing problem with stochastic demands
• A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands
• 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
• 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
• Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand
• An exponential (matching based) neighborhood for the vehicle routing problem

Describes a project that uses

Uses Software

• Tabu search

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)