A two-phase solution algorithm for the flexible periodic vehicle routing problem
From MaRDI portal
Publication:1654343
DOI10.1016/j.cor.2018.05.021zbMath1458.90054OpenAlexW2803928839WikidataQ129768937 ScholiaQ129768937MaRDI QIDQ1654343
Publication date: 8 August 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/123216
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Uses Software
Cites Work
- A library of local search heuristics for the vehicle routing problem
- On the capacitated vehicle routing problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- The flexible periodic vehicle routing problem
- Forty years of periodic vehicle routing
- A Hybrid Heuristic for an Inventory Routing Problem
- An Exact Algorithm for the Period Routing Problem
- The Period Vehicle Routing Problem and its Extensions
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- An improved heuristic for the period vehicle routing problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: A two-phase solution algorithm for the flexible periodic vehicle routing problem