A MILP approach combined with clustering to solve a special petrol station replenishment problem

DOI10.1007/s10100-023-00849-1MaRDI QIDQ6536482

Z. Horváth, Bálint Psenák, Tamás Hajba, Dániel Heitz

Publication date: 13 May 2024

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

clusteringvehicle routingpetrol station replenishmentmixed integer linear problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• A heuristic for the multi-period petrol station replenishment problem
• The petrol station replenishment problem with time windows
• Solving a fuel delivery problem by heuristic and exact approaches.
• Heuristics for the multi-depot petrol station replenishment problem with time windows
• The truck dispatching problem
• Petrol delivery tanker assignment and routing: a case study in Hong Kong
• An exact algorithm for the petrol station replenishment problem

Related Items (1)

Optimization methods and algorithms

This page was built for publication: A MILP approach combined with clustering to solve a special petrol station replenishment problem