A food distribution network problem: a case study
From MaRDI portal
Publication:5427787
DOI10.1093/imaman/dpl012zbMath1126.90061OpenAlexW2006951188MaRDI QIDQ5427787
Anna Sciomachen, Daniela Ambrosino
Publication date: 27 November 2007
Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imaman/dpl012
local searchmixed integer programmingheuristic algorithmdistribution networkcapacitated vehicle routing problem with split delivery
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (5)
An iterated local search heuristic for the split delivery vehicle routing problem ⋮ A rich vehicle routing problem dealing with perishable food: a case study ⋮ A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem ⋮ Vehicle routing problems with split deliveries ⋮ An adaptive memory algorithm for the split delivery vehicle routing problem
This page was built for publication: A food distribution network problem: a case study
