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

DOI10.1016/J.COR.2019.04.018zbMATH Open1458.90051OpenAlexW2940663005WikidataQ127967299 ScholiaQ127967299MaRDI QIDQ2003563FDOQ2003563

Authors: J. Andelmin, Enrico Bartolini 

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

Recommendations

• A path-based solution approach for the green vehicle routing problem
• The green vehicle routing problem with capacitated alternative fuel stations
• Ant colony algorithm for routing alternate fuel vehicles in multi-depot vehicle routing problem
• A new mathematical programming model for the green vehicle routing problem
• A meta-heuristic for capacitated green vehicle routing problem

zbMATH Keywords

multigraphlocal searchvehicle routingalternative fuel vehicles

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• A matheuristic algorithm for the pollution and energy minimization traveling salesman problems
• A theoretical and computational study of green vehicle routing problems
• A path-based solution approach for the green vehicle routing problem
• The green vehicle routing problem with capacitated alternative fuel stations
• A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations
• 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 electric vehicle routing problem with shared charging stations
• A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction
• Instance generation framework for green vehicle routing

Uses Software

• Tabu search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003563)