An adaptive VNS algorithm for vehicle routing problems with intermediate stops

DOI10.1007/s00291-014-0376-5zbMath1311.90033OpenAlexW1989401248MaRDI QIDQ2018107

Julian Hof, Michael Schneider, Andreas Stenger

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

vehicle routingelectric vehiclesrefuelingintermediate stopsrecharging

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Related Items (19)

A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times ⋮ A path-based solution approach for the green vehicle routing problem ⋮ Picker routing in the mixed-shelves warehouses of e-commerce retailers ⋮ A large neighbourhood search metaheuristic for the contagious disease testing problem ⋮ 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 ⋮ Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities ⋮ Location‐routing problem: a classification of recent research ⋮ Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows ⋮ A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations ⋮ A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem ⋮ A branch-and-price algorithm for a vehicle routing with demand allocation problem ⋮ 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 ⋮ A greedy randomized adaptive search procedure for the orienteering problem with hotel selection ⋮ The green vehicle routing problem with capacitated alternative fuel stations ⋮ Waste collection inventory routing with non-stationary stochastic demands

Cites Work

• Unnamed Item
• The synchronized arc and node routing problem: application to road marking
• The locomotive fleet fueling problem
• A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal
• The multi-depot vehicle routing problem with inter-depot routes
• A general heuristic for vehicle routing problems
• Active-guided evolution strategies for large-scale capacitated vehicle routing problems
• The periodic vehicle routing problem with intermediate facilities
• Solving the aerial fleet refueling problem using group theoretic tabu search
• Probabilistic diversification and intensification in local search for vehicle routing
• A variable neighborhood search heuristic for periodic routing problems
• Waste collection vehicle routing problem with time windows
• The capacitated arc routing problem with refill points
• A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• On a periodic vehicle routing problem
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• Computer Solutions of the Traveling Salesman Problem
• Variable neighborhood search: Principles and applications

This page was built for publication: An adaptive VNS algorithm for vehicle routing problems with intermediate stops