A genetic algorithm for a green vehicle routing problem
From MaRDI portal
Publication:1742204
DOI10.1016/J.ENDM.2018.01.008zbMath1392.90019OpenAlexW2790461374MaRDI QIDQ1742204
Paula Carroll, Stefano Mauceri, Fabiano Pallonetto, Paulo Roberto de Oliveira da Costa
Publication date: 11 April 2018
Full work available at URL: http://hdl.handle.net/10197/8702
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)
Related Items (4)
A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations ⋮ A novel computing stochastic algorithm to solve the nonlinear singular periodic boundary value problems ⋮ Distance-based adaptive large neighborhood search algorithm for green-PDPTW ⋮ A model-based evolutionary algorithm for home health care scheduling
Uses Software
Cites Work
- Exact algorithms for routing problems under vehicle capacity constraints
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Optimal Routing under Capacity and Distance Restrictions
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Combinatorial optimization and green logistics
- Unnamed Item
- Unnamed Item
This page was built for publication: A genetic algorithm for a green vehicle routing problem