A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation

DOI10.1016/j.cor.2019.04.018zbMath1458.90051OpenAlexW2940663005WikidataQ127967299 ScholiaQ127967299MaRDI QIDQ2003563

Enrico Bartolini, J. Andelmin

Publication date: 9 July 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.04.018

zbMATH Keywords

multigraphvehicle routinglocal searchalternative fuel vehicles

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (9)

A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations ⋮ A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction ⋮ The electric vehicle routing problem with shared charging stations ⋮ A matheuristic algorithm for the pollution and energy minimization traveling salesman problems ⋮ A theoretical and computational study of green vehicle routing problems ⋮ A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations ⋮ Modelling and multi-criteria analysis of the sustainability dimensions for the green vehicle routing problem ⋮ The green vehicle routing problem with capacitated alternative fuel stations ⋮ Instance generation framework for green vehicle routing

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Routing a mixed fleet of electric and conventional vehicles
• The electric fleet size and mix vehicle routing problem with time windows and recharging stations
• A hybrid algorithm for a class of vehicle routing problems
• A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
• A general heuristic for vehicle routing problems
• The vehicle routing problem. Latest advances and new challenges.
• Two routing problems with the limitation of fuel
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Probabilistic diversification and intensification in local search for vehicle routing
• An adaptive VNS algorithm for vehicle routing problems with intermediate stops
• Multi-start methods for combinatorial optimization
• The Truck Dispatching Problem
• A Parallel Algorithm for the Vehicle Routing Problem
• Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
• Two exact algorithms for the distance-constrained vehicle routing problem
• A survey of simulated annealing as a tool for single and multiobjective optimization
• ROUTING A VEHICLE WITH THE LIMITATION OF FUEL
• On the Distance Constrained Vehicle Routing Problem
• An Exchange Heuristic for Routeing Problems with Time Windows
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation