Optimization approach for multi-period fuel replenishment

Engineering Journal

Volumn 20, Issue 5, 2016, Pages 239-261

  Charusakwong, Narongkorn ^a   Lohatepanont, Manoj ^a  

^a CHULALONGKORN UNIVERSITY   (Thailand)

Author keywords

Exact algorithm; Heuristic approach; Multi period fuel replenishment planning problem; Petroleum products; Transportation unit cost

Indexed keywords

EID: 84997418930     PISSN: 01258281     EISSN: None     Source Type: Journal    
DOI: 10.4186/ej.2016.20.5.239     Document Type: Article

References (22)

1. G. G. Brown and G.Q. Graves, “Real-time dispatch of petroleum tank trucks,” Manag. Sci., vol. 27, no. 1, pp. 19–32, 1981.
2. D. Ronen, “Dispatching petroleum products,” Oper. Res., vol. 43, no. 3, pp. 379–387, 1995.
3. F. B. Abdelaziz, C. Roucairol, and C. Bacha, “Deliveries of liquid fuels to SNDP gas stations using vehicles with multiple compartments,” in Proc. The 2002 IEEE International Conference on Systems, Man and Cybernetics, Yasmine Hammamet, Tunisia, 2002, pp. 478–483.
4. P. Avella, M. Boccia, and A. Sforza, “Solving a fuel delivery problem by heuristic and exact approaches,” Eur. J. Oper. Res., vol. 152, pp. 170–179, 2004.
5. A. Lobel, “Vehicle scheduling in public transit and Lagrangean pricing,” Manag. Sci., vol. 44, no. 12-1, pp. 1637–1649, 1998.
6. F. Cornillier, F. F. Boctor, G. Laporte, and J. Renaud, “An exact algorithm for the petrol station replenishment problem,” J. Oper. Res. Soc., vol. 59, no. 5, pp. 607–615, 2008.
7. F. Cornillier, F. F. Boctor, G. Laporte, and J. Renaud, “A heuristic for the multi-period petrol station replenishment problem,” Eur. J. Oper. Res., vol. 191, pp. 295–305, 2008.
8. F. Cornillier, F. F. Boctor, G. Laporte, and J. Renaud, “The petrol station replenishment problem with time windows,” Comput. Oper. Res., vol. 36, pp 919–935, 2009.
9. D. Popovic, N. Bjelic, and G. Radivojevic, “Simulation approach to analyse deterministic IRP solution of the stochastic fuel delivery problem,” Procedia Soc. Behav. Sci., vol. 20, pp. 273–282, 2011.
10. P. Hanczar, “A fuel distribution problem – application of new multi-item inventory routing formulation,” Procedia Soc. Behav. Sci., vol. 54, pp. 726–735, 2012.
11. F. Cornillier, F. F. Boctor, and J. Renaud, “Heuristics for the multi-depot petrol station replenishment problem with time windows,” Eur. J. Oper. Res., vol. 220, pp. 361–369, 2012.
12. D. Popovic, M. Vidovic, and G. Radivojevic, “Variable neighborhood search heuristic for the inventory routing problem in fuel delivery,” Expert Syst. Appl., vol. 39, no. 18, pp. 13390–13398, 2012.
13. M. Vidovic, D. Popovic, and B. Ratkovic, “Mixed integer and heuristics model for the inventory routing problem in fuel delivery,” Int. J. Prod. Econ., vol. 147, pp. 593–604, 2014.
14. G. Laporte, “The vehicle routing problem: An overview of exact and approximate algorithms,” Eur. J. Oper. Res., vol. 59, pp. 345–358, 1992.
15. L. Lovasz, “On the ratio of optimal integral and fractional covers,” Discrete Math., vol. 13, no. 4, pp. 383–390, 1975.
16. K. E. Rosing, C. S. Revelle, and H. Rosing-Vogelaar, “The p-median and its linear programming relaxation: An approach to large problems,” J. Oper. Res. Soc., vol. 30, no. 9, pp. 815–823, 1979.
17. H. P. Benson, “An all-linear programming relaxation algorithm for optimizing over the efficient set,” J. Global Optim., vol. 1, no. 1, pp. 83–104, 1991.
18. F. A. Al-Khayyal, “Generalized bilinear programming: Part I. Models, applications and linear programming relaxation,” Eur. J. Oper. Res., vol. 60, no. 3, pp. 306–314, 1992.
19. L. Gouveia, “Multicommodity flow models for spanning trees with hop constraints,” Eur. J. Oper. Res., vol. 95, no. 1, pp. 178–190, 1996.
20. F. A. Chudak and D. S. Hochbaum, “A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine,” Oper. Res. Lett., vol. 25, no. 5, pp. 199–204, 1999.
21. S. Weber, C. Schnorr, and J. Hornegger, “A linear programming relaxation for binary tomography with smoothness priors,” Electron. Notes Discrete Math., vol. 12, pp. 243–254, 2003.
22. T. Schoenemann, F. Kahl, and D. Cremers, “Curvature regularity for region-based image segmentation and inpainting: A linear programming relaxation,” in Proc. The 2009 IEEE 12th International Conference on Computer Vision, Kyoto, Japan, 2009, pp. 17–23.