An adaptive VNS algorithm for vehicle routing problems with intermediate stops
From MaRDI portal
Publication:2018107
DOI10.1007/S00291-014-0376-5zbMATH Open1311.90033OpenAlexW1989401248MaRDI QIDQ2018107FDOQ2018107
Authors: Michael Schneider, Andreas Stenger, Julian Hof 
Publication date: 10 April 2015
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-014-0376-5
Recommendations
- The periodic vehicle routing problem with intermediate facilities
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities
- A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities
- Variable neighborhood search for the stochastic and dynamic vehicle routing problem
Cites Work
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- A general heuristic for vehicle routing problems
- Variable neighborhood search: Principles and applications
- The periodic vehicle routing problem with intermediate facilities
- A variable neighborhood search heuristic for periodic routing problems
- The capacitated arc routing problem with refill points
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- Probabilistic diversification and intensification in local search for vehicle routing
- Waste collection vehicle routing problem with time windows
- Title not available (Why is that?)
- Computer Solutions of the Traveling Salesman Problem
- A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities
- The multi-depot vehicle routing problem with inter-depot routes
- The synchronized arc and node routing problem: application to road marking
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- On a periodic vehicle routing problem
- The locomotive fleet fueling problem
- Solving the aerial fleet refueling problem using group theoretic tabu search
- A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal
Cited In (22)
- A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- The role of operational research in green freight transportation
- A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation
- Waste collection inventory routing with non-stationary stochastic demands
- Solving vehicle routing problems with intermediate stops using VRPSolver models
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
- A path-based solution approach for the green vehicle routing problem
- Picker routing in the mixed-shelves warehouses of e-commerce retailers
- The green vehicle routing problem with capacitated alternative fuel stations
- Minimization of maximum lateness on parallel machines with a single server and job release dates
- A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations
- A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes
- A column generation tailored to electric vehicle routing problem with nonlinear battery depreciation
- Location‐routing problem: a classification of recent research
- A large neighbourhood search metaheuristic for the contagious disease testing problem
- Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities
- A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method
- A branch-and-price algorithm for a vehicle routing with demand allocation problem
- Systematic review of the latest scientific publications on the vehicle routing problem
- A greedy randomized adaptive search procedure for the orienteering problem with hotel selection
- Exact algorithms for electric vehicle-routing problems with time windows
This page was built for publication: An adaptive VNS algorithm for vehicle routing problems with intermediate stops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018107)
