A heuristic method for the inventory routing problem with time windows
Authors:
- Shu-Chu LiuSLShu-Chu Liu
- Wei-Ting LeeWLWei-Ting Lee
- 1 September 2011
- journal article
- Published by Elsevier in Expert Systems with Applications
- Vol. 38 (10) , 13223-13231
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithmExpert Systems with Applications, 2009
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windowsDiscrete Optimization, 2008
- A unified tabu search algorithm for vehicle routing problems with soft time windowsJournal of the Operational Research Society, 2008
- A heuristic for the vehicle routing problem with due timesComputers & Industrial Engineering, 2008
- Inventory routing problems: a logistical overviewJournal of the Operational Research Society, 2007
- The real-time time-dependent vehicle routing problemTransportation Research Part E: Logistics and Transportation Review, 2006
- Vehicle routing problem with time windows and a limited number of vehiclesEuropean Journal of Operational Research, 2003
- A problem generator-solver heuristic for vehicle routing with soft time windowsOmega, 2003
- Vehicle dispatching with time-dependent travel timesEuropean Journal of Operational Research, 2003
- Local search in routing problems with time windowsAnnals of Operations Research, 1985