Designing granular solution methods for routing problems with time windows
type: Item
instance of: scholarly article
title: Designing granular solution methods for routing problems with time windows
zbMATH Open document ID: 1380.90060
author: Peng Zhang
published in: European Journal of Operational Research
publication date: 2018-02-06T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6835145
zbMATH Keywords: metaheuristics
zbMATH Keywords: granular neighborhoods
zbMATH Keywords: vehicle routing
zbMATH Keywords: time windows
zbMATH Keywords: local search
describes a project that uses: METSlib
describes a project that uses: POPMUSIC
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.04.059
OpenAlex ID: W2300024838
cites work: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
cites work: A randomized granular tabu search heuristic for the split delivery vehicle routing problem
cites work: Adaptive granular local search heuristic for a dynamic vehicle routing problem
cites work: A reactive variable neighborhood search for the vehicle-routing problem with time windows
cites work: Q4532229
cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
cites work: Vehicle Routing
cites work: A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
cites work: An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
cites work: An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
cites work: Formulations and exact algorithms for the vehicle routing problem with time windows
cites work: Q4365135
cites work: The team orienteering problem with time windows: an LP-based granular variable neighborhood search
cites work: A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows
cites work: Active guided evolution strategies for large-scale vehicle routing problems with time windows
cites work: A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
cites work: A general heuristic for vehicle routing problems
cites work: The Vehicle Routing Problem with Time Windows Part I: Tabu Search
cites work: An Exchange Heuristic for Routeing Problems with Time Windows
cites work: A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
cites work: k-interchange procedures for local search in a precedence-constrained routing problem
cites work: An efficient implementation of local search algorithms for constrained routing problems
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: The vehicle-routing problem with time windows and driver-specific times
cites work: A note on the time travel approach for handling time windows in vehicle routing problems
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: POPMUSIC -- partial optimization metaheuristic under special intensification conditions
cites work: The granular tabu search and its application to the vehicle-routing problem
cites work: A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
cites work: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
DOI: 10.1016/J.EJOR.2017.04.059
description: scientific article; zbMATH DE number 6835145