Optimal fleet composition via dynamic programming and golden section search

DOI10.3934/JIMO.2011.7.875zbMath1230.90036OpenAlexW2317695745MaRDI QIDQ656446

Qun Lin, R. C. Loxton

Publication date: 18 January 2012

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2011.7.875

zbMATH Keywords

convex optimizationdynamic programmingfleet compositiongolden section method

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)

Related Items (5)

Simple heuristics for the multi-period fleet size and mix vehicle routing problem ⋮ A stochastic fleet composition problem ⋮ Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem ⋮ Approximate and exact formulas for the \((Q,r)\) inventory model ⋮ A heuristic algorithm for optimal fleet composition with vehicle routing considerations

This page was built for publication: Optimal fleet composition via dynamic programming and golden section search