A multiphase approach to the period routing problem

DOI10.1002/net.3230210704zbMath0743.90044OpenAlexW2003890550MaRDI QIDQ3984280

Dave Gribbin, Roberta S. Russell

Publication date: 27 June 1992

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230210704

zbMATH Keywords

interchange heuristicdesign of effective vehicle routesgeneralized network approximationmultiphase approachperiod routingsurrogate traveling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (16)

The periodic vehicle routing problem with driver consistency ⋮ A variable neighborhood search heuristic for periodic routing problems ⋮ Column generation based heuristic for tactical planning in multi-period vehicle routing ⋮ Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm ⋮ Routing problems: A bibliography ⋮ Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts ⋮ A set-covering based heuristic algorithm for the periodic vehicle routing problem ⋮ Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem ⋮ The Period Vehicle Routing Problem and its Extensions ⋮ Factory gate pricing: an analysis of the Dutch retail distribution ⋮ An exact solution framework for a broad class of vehicle routing problems ⋮ Forty years of periodic vehicle routing ⋮ The periodic Vehicle routing problem: classification and heuristic ⋮ Fast local search algorithms for the handicapped persons transportation problem ⋮ The periodic vehicle routing problem with intermediate facilities ⋮ A period vehicle routing case study

This page was built for publication: A multiphase approach to the period routing problem