Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
type: Item
instance of: scholarly article
title: Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
zbMATH Open document ID: 1430.90081
author: Dominik Goeke
published in: European Journal of Operational Research
publication date: 2019-06-27T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7074057
zbMATH Keywords: metaheuristics
zbMATH Keywords: green logistics
zbMATH Keywords: electric vehicle routing
zbMATH Keywords: partial recharging
describes a project that uses: VRP
describes a project that uses: SINTEF
MaRDI profile type: Publication
full work available at URL: j.ejor.2019.05.010
OpenAlex ID: W2945137226
cites work: Q4421940
cites work: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
cites work: A randomized granular tabu search heuristic for the split delivery vehicle routing problem
cites work: A variable neighborhood search branching for the electric vehicle routing problem with time windows
cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
cites work: A review of recent research on green road freight transportation
cites work: Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
cites work: The pickup and delivery problem with time windows
cites work: A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
cites work: Pickup and delivery problem with time windows: a new compact two-index formulation
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: Routing a mixed fleet of electric and conventional vehicles
cites work: A parallel algorithm for the vehicle routing problem
cites work: Industrial Vehicle Routing
cites work: The electric fleet size and mix vehicle routing problem with time windows and recharging stations
cites work: An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
cites work: A grouping genetic algorithm for the pickup and delivery problem with time windows
cites work: An Exchange Heuristic for Routeing Problems with Time Windows
cites work: Energy-Optimized Routing of Electric Vehicles in Urban Delivery Systems
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: The electric location routing problem with time windows and partial recharging
cites work: A note on the time travel approach for handling time windows in vehicle routing problems
cites work: Designing granular solution methods for routing problems with time windows
cites work: A hybrid algorithm for a class of vehicle routing problems
cites work: The granular tabu search and its application to the vehicle-routing problem
cites work: Improvement heuristics for the vehicle routing problem based on simulated annealing
cites work: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
cites work: A Solution Procedure for the Vehicle-Scheduling Problem Based on Iterative Route Improvement
DOI: 10.1016/J.EJOR.2019.05.010
description: scientific article; zbMATH DE number 7074057