Vehicle routing with arrival time diversification

DOI10.1016/j.ejor.2018.11.020zbMath1430.90091OpenAlexW2901079898WikidataQ128950862 ScholiaQ128950862MaRDI QIDQ1711450

Maaike Hoogeboom, Wout E. H. Dullaert

Publication date: 18 January 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://research.vu.nl/en/publications/75157af7-fb30-4d40-afe1-36ea8fe21e58

zbMATH Keywords

heuristicsroutingsecurity constraintsmultiple time windows

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

A concise guide to existing and emerging vehicle routing problem variants ⋮ The vehicle routing problem with arrival time diversification on a multigraph ⋮ Safe and secure vehicle routing: a survey on minimization of risk exposure ⋮ Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs ⋮ The hazardous orienteering problem ⋮ A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty

Uses Software

• VRP

Cites Work

• The \(k\)-dissimilar vehicle routing problem
• Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
• Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
• A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
• Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
• On finding dissimilar Pareto-optimal paths
• Heuristics for the multi-period orienteering problem with multiple time windows
• A powerful route minimization heuristic for the vehicle routing problem with time windows
• Designing granular solution methods for routing problems with time windows
• A heuristic approach to the overnight security service problem
• On finding dissimilar paths
• Path relinking for the vehicle routing problem
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows
• A biobjective decision model to increase security and reduce travel costs in the cash-in-transit sector
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• A unified tabu search heuristic for vehicle routing problems with time windows
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A unified tabu search algorithm for vehicle routing problems with soft time windows

This page was built for publication: Vehicle routing with arrival time diversification