An adaptive VNS algorithm for vehicle routing problems with intermediate stops

DOI10.1007/S00291-014-0376-5MaRDI QIDQ2018107zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

electric vehiclesvehicle routingrefuelingintermediate stopsrecharging

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

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

• scientific article; zbMATH DE number 1452993 (Why is no real title available?)
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• A general heuristic for vehicle routing problems
• A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities
• A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A variable neighborhood search heuristic for periodic routing problems
• Active-guided evolution strategies for large-scale capacitated vehicle routing problems
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Computer Solutions of the Traveling Salesman Problem
• On a periodic vehicle routing problem
• Probabilistic diversification and intensification in local search for vehicle routing
• Solving the aerial fleet refueling problem using group theoretic tabu search
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• The capacitated arc routing problem with refill points
• The locomotive fleet fueling problem
• The multi-depot vehicle routing problem with inter-depot routes
• The periodic vehicle routing problem with intermediate facilities
• The synchronized arc and node routing problem: application to road marking
• Variable neighborhood search: Principles and applications
• Waste collection vehicle routing problem with time windows

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
• A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
• Solving vehicle routing problems with intermediate stops using VRPSolver models
• 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
• A more efficient cutting planes approach for 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 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
• A large neighbourhood search metaheuristic for the contagious disease testing problem
• Location‐routing problem: a classification of recent research
• 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)