Heuristic algorithms for a multi-period multi-stop transportation planning problem

DOI10.1057/PALGRAVE.JORS.2601386MaRDI QIDQ4656719zbMATH OpenOpenAlexFDO

Authors

Publication date 14 March 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601386

zbMATH Keywords

column generationdistribution planninglogisticssimulated annealingvehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The period routing problem
• A heuristic algorithm for the multi-depot periodic vehicle routing problem
• A multiperiod traveling salesman problem: Heuristic algorithms
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A Heuristic for the Periodic Vehicle Routing Problem

Cited in

(3)

• Minimizing late deliveries in a truck loading problem
• A new algorithm for one-warehouse multi-retailer systems under stationary nested policy
• A heuristic approach to the multi-period multi-commodity transportation problem

This page was built for publication: Heuristic algorithms for a multi-period multi-stop transportation planning problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4656719)