A rich vehicle routing problem dealing with perishable food: A case study

TOP

Volumn 22, Issue 2, 2014, Pages 489-508

  Amorim, Pedro ^a   Parragh, Sophie N ^b   Sperandio, Fabrício ^a   Almada Lobo, Bernardo ^a  

^a UNIVERSITY OF PORTO   (Portugal)

^b UNIVERSITY OF VIENNA   (Austria)

Author keywords

Adaptative large neighbourhood search; Decision support systems; OR in industry; Vehicle routing problem

Indexed keywords

EID: 84904152234     PISSN: 11345764     EISSN: 18638279     Source Type: Journal    
DOI: 10.1007/s11750-012-0266-4     Document Type: Article

References (23)

1. Ambrosino D, Sciomachen A (2006) A food distribution network problem: a case study. IMA J Manag Math 18(1): 33-53.
2. Amorim P, Meyr H, Almeder C, Almada-Lobo B (2011) Managing perishability in production-distribution planning: a discussion and review. Flex Serv Manuf J 1-25. doi: 10. 1007/s10696-011-9122-3.
3. Bitao P, Fei W (2010) Hybrid intelligent algorithm for vehicle routing problem with multiple time windows. In: 2010 international forum on information technology and applications. IEEE, New York, pp 181-184.
4. Chao IM, Golden B, Wasil E (1999) A computational study of a new heuristic for the site-dependent vehicle routing problem. INFOR 37(2): 319-336.
5. Chen HK, Hsueh CF, Chang MS (2009) Production scheduling and vehicle routing with time windows for perishable food products. Comput Oper Res 36(7): 2311-2319.
6. Cordeau J, Laporte G (2001) A tabu search algorithm for the site dependent vehicle routing problem with time windows. Inf Syst Oper Res 39(3): 292-298.
7. Doerner K, Gronalt M, Hartl R, Kiechle G, Reimann M (2008) Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows. Comput Oper Res 35(9): 3034-3048.
8. Faulin J (2003) Applying MIXALG procedure in a routing problem to optimize food product delivery. Omega 31(5): 387-395.
9. Gendreau M, Potvin J (2010) Handbook of metaheuristics, 2nd edn. Springer+Business Media, Berlin.
10. Hsu CI, Hung S, Li HC (2007) Vehicle routing problem with time-windows for perishable food delivery. J Food Eng 80: 465-475.
11. Instituto Nacional de Estatítica (2011) Estatísticas da produção industrial. http://www. ine. pt/xportal/xmain?xpid=INE&xpgid=ine_publicacoes&PUBLICACOESpub_boui=134140169&PUBLICACOESmodo=2.
12. Jansen D, Vorst G, Weert A (1998) Multi-compartment distribution in the catering supply chain. Int Trans Oper Res 5(6): 509-517.
13. Kovacs A, Parragh S N, Doerner K, Hartl R (2012) Adaptive large neighborhood search for service technician routing and scheduling problems. J Sched 15(5): 579-600.
14. Mullaseril P, Dror M, Leung J (1997) Split-delivery routeing heuristics in livestock feed distribution. J Oper Res Soc 48(2): 107-116.
15. Nag B, Golden B, Assad A (1998) Vehicle routing with site dependencies. In: Golden B, Assad A (eds) Vehicle routing: methods and studies. Elsevier, Amsterdam, pp 149-159.
16. Osvald A, Stirn L (2008) A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food. J Food Eng 85(2): 285-295.
17. Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34(8): 2403-2435.
18. Ropke S, Pisinger D (2006a) A unified heuristic for a large class of vehicle routing problems with backhauls. Eur J Oper Res 171(3): 750-775.
19. Ropke S, Pisinger D (2006b) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4): 455-472.
20. Savelsbergh M (1985) Local search in routing problems with time windows. Ann Oper Res 4(1): 285-305.
21. Solomon M (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2): 254-265.
22. Tarantilis C, Kiranoudis C (2001) A meta-heuristic algorithm for the efficient distribution of perishable foods. J Food Eng 50(1): 1-9.
23. Tarantilis C, Kiranoudis C (2002) Distribution of fresh meat. J Food Eng 51(1): 85-91.