Trip packing in petrol stations replenishment

Omega

Volumn 39, Issue 1, 2011, Pages 86-98

  Boctor, Fayez F ^a   Renaud, Jacques ^a   Cornillier, Fabien ^b  

^a UNIVERSITÉ LAVAL   (Canada)

^b CENTRUM CATÓLICA GRADUATE BUSINESS SCHOOL   (Peru)

Author keywords

Heuristics; Mixed integer models; Trip packing; Vehicle scheduling

Indexed keywords

BENCHMARKING; FLEET OPERATIONS; GASOLINE;

HEURISTIC; MIXED INTEGER MODELS; NET REVENUE; NON-IDENTICAL; PACKING PROBLEMS; PETROL STATION REPLENISHMENTS; SUB-PROBLEMS; TRIP PACKING; VEHICLE SCHEDULING; WORKING TIME;

TRUCKS;

EID: 77953682955     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2010.03.003     Document Type: Article

References (28)

1. Cornillier F., Boctor F.F., Renaud J., Laporte G. A heuristic for the multi-period petrol station replenishment problem. European Journal of Operational Research 2008, 191:295-305.
2. Brandão J., Mercer A. A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. European Journal of Operational Research 1997, 100:180-191.
3. Brandão J., Mercer A. The multi-trip vehicle routing problem. Journal of the Operational Research Society 1998, 49:799-805.
4. Fleischmann B. The vehicle routing problem with multiple use of vehicles. Working Paper, Fachbereich Wirtschaftswissenschaften, Universität Hamburg; 1990.
5. Taillard E., Laporte G., Gendreau M. Vehicle routing with multiple use of vehicles. Journal of the Operational Research Society 1996, 47:1065-1070.
6. Golden B., Laporte G., Taillard E. An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. Computer and Operations Research 1997, 24:445-452.
7. Zhao Q.H., Wang S.Y., Lai K.K., Xia G.P. A vehicle routing problem with multiple use of vehicles. Advanced Modeling and Optimization 2002, 4:21-40.
8. Petch R., Salhi S. A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Applied Mathematics 2004, 133:69-92.
9. Olivera A., Viera O. Adaptive memory programming for the vehicle routing problem with multiple trips. Computers and Operations Research 2007, 34:28-47.
10. Coffman E., Garey M., Johnson D. Approximation algorithms for bin packing: a survey. Approximation algorithms for NP-hard problems 1996, 46-93. PWS Publishing, Boston. D. Hochbaum (Ed.).
11. Prins C. Efficient heuristics for the heterogeneous fleet multi-trip VRP with application to a large-scale real case. Journal of Mathematical Modelling and Algorithms 2002, 1:135-150.
12. Clarke G., Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 1964, 12:568-581.
13. Rochat Y., Taillard E. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1995, 1:147-167.
14. Taqa Allah D., Renaud J., Boctor F.F. Le problème d'approvisionnement des stations d'essence. Journal Européen des Systèmes Automatisés 2000, 34:11-33.
15. Malépart V., Boctor F.F., Renaud J., Labilois S. Nouvelles approches pour l'approvisionnement des stations d'essence. Revue Française de Gestion Industrielle 2003, 22:15-31.
16. Cornillier F., Boctor F.F., Laporte G., Renaud J. An exact algorithm for the petrol station replenishment problem. Journal of the Operational Research Society 2008, 59:607-615.
17. Cornillier F., Laporte G., Boctor F.F., Renaud J. The petrol station replenishment problem with time windows. Computers and Operations Research 2009, 36:919-935.
18. Garey M.R., Johnson D.S. Computers and tractability 1979, W.H. Freeman and Company, New York.
19. Sahni S., Gonzalez T. P-complete approximation problems. Journal of the Association of Computing Machinery 1976, 23:555-565.
20. Boctor F.F. Resource-constrained project scheduling by simulated annealing. International Journal of Production Research 1996, 34:2335-2351.
21. Jensen R.E. A dynamic programming algorithm for cluster analysis. Journal of the Operations Research Society of America 1969, 7:1034-1057.
22. Hubert L.J., Arabie P., Meulman J.J. Combinatorial data analysis: optimization by dynamic programming 2001, SIAM, Philadelphia.
23. Van Os B.J., Meulman J.J. Improving dynamic programming strategies for partitioning. Journal of Classification 2004, 21:207-230.
24. Doerner K.F., Gutjahr W.J., Hartl R.F., Strauss C., Stummer C. Nature-inspired mataheuristics for multiobjective activity crashing. Omega 2008, 36:1019-1037.
25. Yazgi Tütüncü G., Carreto C., Baker B.M. A visual interactive approach to classical and mixed vehicle routing problems with backhauls. Omega 2009, 37:138-154.
26. Chung J.W., Chand S.M., Choi I.C. A hybrid genetic algorithm for train sequencing in the Korean railways. Omega 2009, 37:555-565.
27. Barcia P., Jörnsten K. Improved Lagrangian decomposition: an application to the generalized assignment problem. European Journal of Operational Research 1990, 46:84-92.
28. Day J.M., Wright D., Schoenherr M., Vankataramanan M., Huston K. Improving routing and scheduling decisions at a distributor of industrial gases. Omega 2009, 37:227-237.