A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times
type: Item
instance of: scholarly article
title: A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times
zbMATH Open document ID: 1391.90074
published in: Computers \& Operations Research
publication date: 2018-07-12T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6902777
zbMATH Keywords: vehicle routing
zbMATH Keywords: time dependent travel times
zbMATH Keywords: multistart
zbMATH Keywords: set partitioning
author: S. Mancini
describes a project that uses: GRASP
MaRDI profile type: Publication
full work available at URL: j.cor.2017.06.021
OpenAlex ID: W2726929936
cites work: A multi-start random constructive heuristic for the container loading problem
cites work: An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
cites work: Greedy randomized adaptive search procedures
cites work: An annotated bibliography of GRASP – Part I: Algorithms
cites work: Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
cites work: Time-dependent routing problems: a review
cites work: Handbook of metaheuristics
cites work: An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
cites work: Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
cites work: Efficient modeling of travel in networks with time-varying link speeds
cites work: Vehicle dispatching with time-dependent travel times
cites work: A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
cites work: Vehicle routing under time-dependent travel times: the impact of congestion avoidance
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Vehicle routing and scheduling with time-varying data: A case study
cites work: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
cites work: A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
cites work: Multi-Start Methods
cites work: A way to optimally solve a time-dependent vehicle routing problem with time windows
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
DOI: 10.1016/J.COR.2017.06.021
description: scientific article; zbMATH DE number 6902777