Mutation ant colony algorithm of milk-run vehicle routing problem with fastest completion time based on dynamic optimization

DOI10.1155/2013/418436zbMath1264.90021OpenAlexW2083172154WikidataQ58921580 ScholiaQ58921580MaRDI QIDQ1956054

Publication date: 13 June 2013

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/418436

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

A two-phase heuristic algorithm for the common frequency routing problem with vehicle type choice in the milk run ⋮ A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost ⋮ Research on coordination and optimization of order allocation and delivery route planning in take-out system ⋮ Modeling multilevel supplier selection problem based on weighted-directed network and its solution

Cites Work

Solving a vehicle routing problem by balancing the vehicles time utilization.

This page was built for publication: Mutation ant colony algorithm of milk-run vehicle routing problem with fastest completion time based on dynamic optimization