A path-based solution approach for the green vehicle routing problem

DOI10.1016/j.cor.2018.10.019zbMath1458.90064OpenAlexW2899155604MaRDI QIDQ1634062

Ferdinando Pezzella, Simona Mancini, Ornella Pisacane, Maurizio Bruglieri

Publication date: 17 December 2018

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

Full work available at URL: http://hdl.handle.net/11311/1125639

zbMATH Keywords

mixed integer linear programmingvehicle routing problemalternative fuel vehiclesdominance rules

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Related Items (14)

The time-dependent shortest path and vehicle routing problem ⋮ A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations ⋮ Time-dependent multi-depot green vehicle routing problem with time windows considering temporal-spatial distance ⋮ The consistent electric-vehicle routing problem with backhauls and charging management ⋮ Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand ⋮ A matheuristic algorithm for the pollution and energy minimization traveling salesman problems ⋮ Partial linear recharging strategy for the electric fleet size and mix vehicle routing problem with time windows and recharging stations ⋮ A theoretical and computational study of green vehicle routing problems ⋮ Solving vehicle routing problems with intermediate stops using VRPSolver models ⋮ A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations ⋮ Electric vehicle routing problem with time-dependent waiting times at recharging 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

• VRP

Cites Work

• Path based algorithms for metro network design
• An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem
• A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem
• A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges
• An adaptive VNS algorithm for vehicle routing problems with intermediate stops
• Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking
• A variable neighborhood search branching for the electric vehicle routing problem with time windows
• Vehicle Routing
• Selected Topics in Column Generation

This page was built for publication: A path-based solution approach for the green vehicle routing problem