Split-delivery routeing heuristics in livestock feed distribution

DOI10.1057/PALGRAVE.JORS.2600338zbMath0888.90109OpenAlexW2074845101MaRDI QIDQ4367022

Joseph Y.-T. Leung, Moshe Dror, Paul A. Mullaseril

Publication date: 8 June 1998

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

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

zbMATH Keywords

heuristicfeed distributionsplit-delivery capacitated rural postman problemtime windows on arcs

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Case-oriented studies in operations research (90B90)

Related Items (13)

A tabu search heuristic for the vehicle routing problem with time windows and split deliveries ⋮ An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems ⋮ Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery ⋮ Integer linear programming models for a cement delivery problem ⋮ Arc routing problems: A review of the past, present, and future ⋮ A rich vehicle routing problem dealing with perishable food: a case study ⋮ Crossover iterated local search for SDCARP ⋮ A randomized granular tabu search heuristic for the split delivery vehicle routing problem ⋮ The Split Delivery Vehicle Routing Problem: A Survey ⋮ A column generation approach for the split delivery vehicle routing problem ⋮ Vehicle routing problems with split deliveries ⋮ An adaptive memory algorithm for the split delivery vehicle routing problem ⋮ Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil

This page was built for publication: Split-delivery routeing heuristics in livestock feed distribution