Simulated annealing for the blood pickup routing problem

DOI10.6186/IJIMS.2016.27.4.1MaRDI QIDQ5377769zbMATH OpenOpenAlexFDO

Authors Titi Iswari, Vincent F. Yu, Anna Maria Sri Asih

Publication date 27 May 2019

Full work available at URL http://ir.lib.ntust.edu.tw/handle/987654321/67461

zbMATH Keywords

blood pickupsimulated annealingspoilage timetime windowvehicle routing problem

Mathematics Subject Classification ID

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

Recommendations

• Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
• Optimization of blood sample collection with timing and quality constraints
• Mathematical programming formulations and metaheuristics for biological sample transportation problems in healthcare
• Selective vehicle routing for a mobile blood donation system
• Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem

Cited in

(2)

• VRP with interdependent time windows -- a case study for the Austrian Red Cross blood program
• A non-clustered approach to platelet collection routing problem

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Simulated annealing for the blood pickup routing problem

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