A heuristic algorithm for optimal fleet composition with vehicle routing considerations

DOI10.1080/10556788.2015.1062890zbMath1344.90009OpenAlexW2265249259MaRDI QIDQ2815505

Elham Mardaneh, Qun Lin, R. C. Loxton

Publication date: 29 June 2016

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11937/37868

zbMATH Keywords

dynamic programmingvehicle routingcross entropyfleet compositiongolden section method

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Dynamic programming (90C39)

Uses Software

• CPLEX

Cites Work

• A stochastic fleet composition problem
• Optimal fleet composition via dynamic programming and golden section search
• Industrial aspects and literature survey: fleet composition and routing
• Optimization of computer simulation models with rare events
• An improved heuristic for the period traveling salesman problem
• The cross-entropy method for combinatorial and continuous optimization
• Incorporating vehicle into the vehicle routing fleet composition problem
• Solving the vehicle routing problem with stochastic demands using the cross-entropy method
• Column generation based heuristic for tactical planning in multi-period vehicle routing
• A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
• A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions

This page was built for publication: A heuristic algorithm for optimal fleet composition with vehicle routing considerations