The Collection of Urban Recyclable Waste

8.5 Case Studies

8.5.2 The Collection of Urban Recyclable Waste

The next case is about the collection of recyclable waste in Portugal’s central coastal region. There are two central depots in which the waste of 1642 distinct

Table 8.7 FVRP Literature

Author(s) Year Type Algorithm

Cheng and Gen[131] 1995 VRPFTW Genetic algorithm Teodorovic and

Pavkovic[130]

1996 VRPFD Heuristic sweeping algorithm, rules of fuzzy arithmetic and fuzzy logic

Werners and Drawe [132]

2003 VRPF Fuzzy modeling based on mixed-integer linear programming

Kuo et al.[133] 2004 VRPFT Ant colony optimization

Sheng et al.[134] 2005 FVRP Compares fuzzy measure method with other programming methods

He and Xu[135] 2005 VRPFD Genetic algorithm

Zheng and Liu[136] 2006 VRPFT Fuzzy simulation, genetic algorithm Lin[137] 2008 VRPFTW Genetic algorithm (multiobjective) Erbao and Mingyong

[138]

2009 VRPFD Stochastic simulation Erbao and Mingyong

[139]

2010 OVRPFD Stochastic simulation

VRPFTW, VRPF with fuzzy time window; VRPFD, VRP with fuzzy demand; VRPFT, VRP with fuzzy travel time;

OVRPFD, OVRP with fuzzy demand.

collection sites is unloaded by five vehicles. Three types of waste must be carried separately. Because 70% of the operational cost is dedicated to the transportation, creating the best collection routes minimizes the total distance of vehicles with the restrictions in the vehicle’s capacity and route duration that must be managed in one work shift.

The problem is modeled as a PVRP and develops routes for every day of each month. This model is repeated in each month with 20 workdays and two work shifts in each day. It is noted that because the vehicles are busy about half the time with the exit and return trips to depots, a single route is created in one shift.

The problem is solved in three phases using heuristic algorithms. For each zone and for each work shift of each day, the decision variables are the type of waste, the sites, and the routes in which the waste must be collected[141].

References

[1] G.B. Dantzig, J.H. Ramser, The truck dispatching problem, Manag. Sci. 6 (1959) 80
91.

[2] G. Clark, J.V. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Oper. Res. 12 (1964) 568
581.

[3] J.K. Lenstra, A.H.G. Rinnooy Kan, Complexity of vehicle and scheduling problems, Networks 11 (2) (1981) 221
227.

[4] P. Toth, D. Vigo, The vehicle routing problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 2002.

[5] G. Laporte, Y. Nobert, M. Desrochers, Optimal routing under capacity and distance restrictions, Oper. Res. 33 (1985) 1050
1073.

[6] P. Toth, D. Vigo, A heuristic algorithm for the symmetric and asymmetric vehicle rout-ing problems with backhauls, Eur. J. Oper. Res. 113 (1999) 528
543.

[7] A. Hoff, I. Gribkovskaia, G. Laporte, A. Lokketangen, Lasso solution strategies for the vehicle routing problem with pickups and deliveries, Eur. J. Oper. Res. 192 (3) (2007) 755
766.

[8] G. Laporte, The vehicle routing problem: an overview of exact and approximate algo-rithms, Eur. J. Oper. Res. 59 (1992) 345
358.

[9] G.F. Cordeau, G. Laporte, A. Mercier, A unified Tabu search heuristic for vehicle rout-ing problems with time windows, J. Oper. Res. Soc. 52 (2001) 928
936.

[10] G. Berbeglia, J.F. Cordeau, I. Gribkovskaia, G. Laporte, Static pickup and delivery pro-blems: a classification scheme and survey, J. Spanish Soc. Stat. Oper. Res. 15 (2007) 1
31.

[11] S.N. Parragh, K.F. Doerner, R.F. Hartl, A survey on pickup and delivery problems.

Part I: transportation between customers and depot, J. Betriebswirtschaft 58 (1) (2008) 21
51.

[12] D. Sariklis, S. Powell, A heuristic method for the open vehicle routing problem, J. Oper. Res. Soc. 51 (5) (2000) 564
573.

[13] J. Brandao, A Tabu search algorithm for the open vehicle routing problem, Eur. J.

Oper. Res. 157 (2004) 552
564.

[14] M. Syslo, N. Deo, J. Kowaklik, Discrete Optimization Algorithms with Pascal Programs, Prentice Hall, Englewood Cliffs, NJ, 1983.

[15] F. Li, B. Golden, E. Wasil, The open vehicle routing problem: algorithms, large scale test problems, and computational results, Comput. Oper. Res. 34 (10) (2007) 2918
2930.

[16] P.P. Repoussis, C.D. Tarantilis, G. Ioannou, The open vehicle routing problem with time windows, J. Oper. Res. Soc. 58 (3) (2007) 355
367.

[17] A.N. Letchford, J. Lysgaard, R.W. Eglese, A branch and cut algorithm for the capaci-tated open vehicle routing problem, J. Oper. Res. Soc. 58 (12) (2007) 1642
1651.

[18] D. Aksen, Z. Ozyurt, N. Aras, The open vehicle routing problem with driver nodes and time deadlines, J. Oper. Res. 132 (2007) 760
768.

[19] K. Fleszar, I.H. Osman, K.S. Hindi, A variable neighborhood search algorithm for the open vehicle routing problem, Eur. J. Oper. Res. 195 (3) (2009) 803
809.

[20] U. Derigs, K. Reuter, A simple and efficient tabu search heuristic for solving the open vehicle routing problem, J. Oper. Res. Soc. 60 (12) (2008) 1658
1669.

[21] I.D. Giosa, I.L. Tansini, I.O. Viera, New assignment algorithms for the multi-depot vehicle routing problem, J. Oper. Res. Soc. 53 (2002) 977
984.

[22] B. Crevier, J.F. Cordeau, G. Laporte, The multi-depot vehicle routing problem with inter-depot routes, Eur. J. Oper. Res. 176 (2) (2007) 756
773.

[23] E. Angelelli, M.G. Speranza, The periodic vehicle routing problem with intermediate facilities, Eur. J. Oper. Res. 137 (2002) 233
247.

[24] M. Wasner, G. Zapfel, An integrated multi-depot hub-location vehicle routing model for network planning of parcel service, Int. J. Prod. Econ. 90 (2004) 403
419.

[25] M. Polacek, R.F. Hartl, K.F. Doerner, M. Reimann, A variable neighborhood search for the multi depot vehicle routing problem with time windows, J. Heurist. 10 (2004) 613
627.

[26] G. Nagi, S. Salhi, Heuristic algorithms for the single and multiple depot vehicle routing problems with pickups and deliveries, Eur. J. Oper. Res. 162 (2005) 126
141.

[27] W. Ho, G.T.S. Ho, P. Ji, H.C.W. Lau, A hybrid genetic algorithm for the multi-depot vehicle routing problem, Eng. Appl. Artif. Intell. 21 (4) (2008) 548
557.

[28] R. Chunyu, W. Xiaobo, Study on improved hybrid genetic algorithm for multi-depot vehicle routing problem with backhauls, AICI 2 (2009) 347
350.

[29] B. Yu, Z.Z. Yang, J.X. Xie, A parallel improved ant colony optimization for multi-depot vehicle routing problem, J. Oper. Res. Soc. 62 (1) (2011) 183
188.

[30] P. Sombuntham, V. Kachitvichayanukul, A particle swarm optimization algorithm for multi-depot vehicle routing problem with pickup and delivery requests, Lecture Notes in Engineering and Computer Science 2182 (2010) 1998
2003.

[31] S. Salhi, M. Sari, D. Saidi, N. Touati, Adaptation of some vehicle fleet mix heuristics, Omega 20 (1992) 653
660.

[32] E.D. Taillard, A heuristic column generation method for the heterogeneous fleet VRP, RAIRO Oper. Res. 33 (1999) 1
14.

[33] N.A. Wassan, I.H. Osman, Tabu search variants for the mix fleet vehicle routing prob-lem, J. Oper. Res. Soc. 53 (2002) 768
782.

[34] B. Golden, S. Assad, L. Levy, F. Gheysens, The fleet size and mix vehicle routing problem, Comput. Oper. Res. 11 (1) (1984) 49
66.

[35] F. Gheysens, B. Golden, A. Assad, A comparison of techniques for solving the fleet size and mix vehicle routing problems, OR Spectrum 6 (1984) 207
216.

[36] F. Gheysens, B. Golden, A. Assad, A new heuristic for determining fleet size and com-position, Math. Program. 42 (1986) 234
242.

[37] S. Salhi, G.K. Rand, Incorporating vehicle routing into the vehicle fleet composition problem, Eur. J. Oper. Res. 66 (1993) 313
330.

[38] Y. Rochat, F. Semet, A tabu search approach for delivering pet food and flour in Switzerland, J. Oper. Res. Soc. 45 (1994) 1233
1246.

[39] I. Osman, S. Salhi, Local search strategies for the vehicle fleet mix problem, in:

V.J. Rayward-Smith, I.H. Osman, C.R. Reeves, G.D. Smith (Eds.), Modern Heuristic Search Methods, Wiley, New York, 1996, pp. 131
153.

[40] F.H. Liu, S.Y. Shen, The fleet size and mix vehicle routing problem with time win-dows, J. Oper. Res. 50 (7) (1999) 721
732.

[41] J. Renaud, F. Boctor, A sweep-based algorithm for the fleet size and mix vehicle rout-ing problem, Eur. J. Oper. Res. 140 (2002) 618
628.

[42] W. Dullaert, G.K. Janssens, K. Sorensen, B. Vernimmen, New heuristics for the fleet size and mix vehicle routing problem with time windows, J. Oper. Res. Soc. 53 (2002) 1232
1238.

[43] C.D. Tarantilis, D. Diakoulaki, C.T. Kiranoudis, Combination of geographical informa-tion system and efficient routing algorithms for real life distribuinforma-tion operainforma-tions, Eur. J.

Oper. Res. 152 (2004) 437
453.

[44] Monaci M. Dell’Amico, C. Pagani, D. Vigo, Heuristic approaches for the fleet size and mix vehicle routing problem with time windows, Transport. Sci. 4 (2006) 516
526.

[45] P. Belfiore, L. Favero, Scatter search for the fleet size and mix vehicle routing problem with time windows, Cent. Eur. J. Oper. Res. 15 (4) (2007) 351.

[46] O. Braysy, W. Dullaert, G. Hasle, D. Mester, M. Gendreau, An effective multi-restart deterministic annealing metaheuristic for the fleet size and mix vehicle routing problem with time windows, Transport. Sci. 42 (3) (2008) 371
386.

[47] Y.H. Lee, J.I. Kim, K.H. Kang, K.H. Kim, A heuristic for vehicle fleet mix problem using tabu search and set partitioning, J. Oper. Res. Soc. 59 (6) (2008) 833
841.

[48] J. Brandao, A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem, Eur. J. Oper. Res. 195 (3) (2009) 716
728.

[49] O. Braysy, P.P. Porkka, W. Dullaert, P.P. Repoussis, C.D. Tarantilis, A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows, Expert Syst. Appl. 36 (4) (2009) 8460
8475.

[50] S. Liu, M. Haung, H. Ma, An effective genetic algorithm for the fleet size and mix vehicle routing problems, Transport. Res. E Logist. Transport. Rev. 45 (2009) 434
445.

[51] P.P. Repoussis, C.D. Tarantilis, Solving the fleet size and mix vehicle routing problem with time windows via adaptive memory programming, Transport. Res. C Emerg.

Tech. 8 (5) (2009) 695
712.

[52] M. Dror, P. Trudeau, Savings by split delivery routing, Transport. Sci. 23 (1989) 141
145.

[53] M. Gendreau, M. Feillet, P. Dejax, C. Gueguen, Vehicle routing with time windows and split deliveries, Technical Paper 2006
851, Laboratoire d’Informatique d’Avignon, 2006.

[54] M. Jin, K. Liu, R.O. Bowden, A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem, Int. J. Prod. Econ. 105 (2007) 228
242.

[55] S.C. Ho, D. Haugland, A Tabu search heuristic for the vehicle routing problem with time windows and split deliveries, Oper. Res. 31 (2004) 1947
1964.

[56] S. Song, K. Lee, G. Kim, A practical approach to solving a newspaper logistic problem using a digital map, Comput. Ind. Eng. 43 (2002) 315
330.

[57] C. Archetti, A. Hertz, M.G. Speranza, A Tabu search algorithm for the split delivery vehicle routing problem, Transport. Sci. 40 (2006) 64
73.

[58] M. Gendreau, G. Laporte, R. Seguin, Stochastic vehicle routing, Eur. J. Oper. Res.

88 (1) (1996) 3
12.

[59] C.G. Lee, M. Epelman, C.C. White, A shortest path approach to the multiple-vehicle routing with split picks-up, Transport. Res. B Meth. 40 (2006) 265
284.

[60] V. Campos, A. Corberan, E. Mota, A scatter search algorithm for the split delivery vehicle routing problem, in: C. Cotta, J van Hemert (Eds.), Evolutionary Computation in Combinatorial Optimization, Lecture Notes in Computer Science, 4446, Springer, Berlin, 2007, pp. 121
129.

[61] S. Chen, B. Golden, E. Wasil, The split delivery vehicle routing problem: applications, algorithms, test problems and computational results, Networks 49 (2007) 318
328.

[62] Y. Nakao, H. Nagamochi, A DP-based heuristic algorithm for the discrete split delivery vehicle routing problem, J. Adv. Mech. Des. Syst. Manuf. 1 (2) (2007) 217
226.

[63] C. Archetti, M.W.P. Savelsbergh, M.G. Speranza, An optimization-based heuristic for the split delivery vehicle routing problem, Transport. Sci. 42 (2008) 22
31.

[64] N. Suthikarnnarunai, A sweep algorithm for the mix fleet vehicle routing problem, Proceedings of the International Multi Conference of Engineers and Computer Scientists, Hong Kong, 2008.

[65] U. Derings, B. Li, U. Vogel, Local search-based metaheuristics for the split delivery vehicle routing problem, J. Oper. Res. Soc. 61 (9) (2009) 1356
1364.

[66] M.C. Bolduc, G. Laporte, J. Renaud, F.F. Boctor, A Tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars, Eur. J. Oper.

Res. 202 (2010) 122
130.

[67] R.F. Aleman, X. Zhang, R.R. Hill, An adaptive memory algorithm for the split delivery vehicle routing problem, J. Heurist. 16 (2010) 441
473.

[68] L. Moreno, M.P. Aragao, E. Uchoa, Improved lower bounds for the split delivery vehi-cle routing problem, Oper. Res. Lett. 38 (4) (2010) 302
306.

[69] D. Gulczynski, B. Golden, E. Wasil, The split delivery vehicle routing problem with minimum delivery amounts, Transport. Res. E Logist. Transport. Rev. 46 (2010) 612
626.

[70] P. Francis, K. Smilowitz, Modeling techniques for periodic vehicle routing problems, Transport. Res. B 40(10) (2006) 872
884.

[71] V.C. Hemmelmayr, K.F. Doerner, R.F. Hartl, A variable neighborhood search heuristic for periodic routing problems, Eur. J. Oper. Res. 195 (3) (2009) 791
802.

[72] C. Delgado, M. Laguna, J. Pacheco, Minimizing labor requirements in a periodic vehi-cle loading problem, Comput. Optim. Appl. 32 (3) (2005) 299
320.

[73] N. Belanger, G. Desaulniers, F. Soumis, J. Desrosiers, Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues, Eur. J. Oper.

Res. 175 (3) (2006) 1754
1766.

[74] J. Alegre, M. Laguna, J. Pacheco, Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts, Eur. J. Oper. Res. 179 (2007) 736
746.

[75] F. Alonso, M.J. Alvarez, J.E. Beasley, A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions, J. Oper. Res.

Soc. 59 (2008) 963
976.

[76] S. Pirkwieser, G.R. Raidl, A variable neighborhood search for the periodic vehicle rout-ing problem with time windows, Proceedrout-ings of the 9th EU/Meetrout-ing on Metaheuristics for Logistics and Vehicle Routing, Troyes, France, 2008.

[77] S. Pirkwieser, G.R. Raidl, A column generation approach for the periodic vehicle rout-ing problem with time windows, Proceedings of the International Network Optimization Conference, Pisa, Italy, 2009.

[78] S. Pirkwieser, R. Gunther, Boosting a variable neighborhood search for the periodic vehicle routing problem with time windows by ILP techniques, Proceedings of the 8th Metaheuristic International Conference (MIC 2009), Hamburg, Germany, 2009.

[79] M. Gendreau, G. Laporte, R. Segiun, An exact algorithm for the vehicle routing prob-lem with stochastic demands and customers, Transport. Sci. 29 (1995) 143
155.

[80] F.A. Tillman, The multiple terminal delivery problem with probabilistic demands, Transport. Sci. 3 (1969) 192
204.

[81] C.H. Christiansen, J. Lysgaard, A branch-and-price algorithm for the capacitated vehi-cle routing problem with stochastic demands, Oper. Res. Lett. 35 (2009) 773
781.

[82] B.L. Golden, W.R. Stewart Jr., Vehicle routing with probabilistic demands, in:

D. Hogben, D. Fife (Eds.), Computer Science and Statistics: Tenth Annual Symposium on the Interface, NBS Special Publication 503, National Bureau of Standards, Washington, DC, 1978.

[83] B.L. Golden, J.R. Yee, A framework for probabilistic vehicle routing, Am. Inst. Ind.

Eng. Trans. 11 (1979) 109
112.

[84] J.R. Yee, B.L. Golden, A note on determining operating strategies for probabilistic vehicle routing, Nav. Res. Logist. Q. 27 (1980) 159
163.

[85] W.R. Stewart Jr., B.L. Golden, A chance-constrained approach to the stochastic vehicle routing problem, in: G. Boseman, J. Vora, Proceedings of 1980 Northeast AIDS Conference, Philadelphia, 1980, pp. 33
35.

[86] W.R. Stewart, New algorithms for deterministic and stochastic vehicle routing pro-blems, Ph.D. Thesis, Report No. 81-009, University of Maryland at College Park, MD, 1981.

[87] L.D. Bodin, B.L. Golden, A.A. Assad, M.O. Ball, Routing and scheduling of vehicles and crews: the state of the art, Comput. Oper. Res. 10 (1983) 69
211.

[88] W.R. Stewart, B.L. Golden, Stochastic vehicle routing: a comprehensive approach, Eur.

J. Oper. Res. 14 (1983) 371
385.

[89] A. Jezequel, Probabilistic vehicle routing problems, M.Sc. Dissertation, Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge, MA, 1985.

[90] M. Dror, P. Trudeau, Stochastic vehicle routing with modified savings algorithm, Eur.

J. Oper. Res. 23 (1986) 228
235.

[91] P. Jaillet, Stochastic routing problems, in: G. Andreatta, F. Mason, P. Serafini (Eds.), Stochastics in Combinatorial Optimization, World Scientific, New Jersey, 1987.

[92] D.J. Bertsimas, Probabilistic combinatorial optimization problems. Ph.D. Thesis, Report No. 193, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, 1988.

[93] P. Jaillet, A.R. Odoni, The probabilistic vehicle routing problem, in: B.L. Golden, A.A.

Assad (Eds.), Vehicle Routing: Methods and Studies, North-Holland, Amsterdam, 1988.

[94] G. Laporte, F.V. Louveattx, H. Mercure, Models and exact solutions for a class of sto-chastic location-routing problems, Eur. J. Oper. Res. 39 (1989) 71
78.

[95] C.D.J. Waters, Vehicle-scheduling problems with uncertainty and omitted customers, J. Oper. Res. Soc. 40 (1989) 1099
1108.

[96] M. Dror, G. Laporte, P. Trudeau, Vehicle routing with stochastic demands: properties and solution frameworks, Transport. Sci. 23 (1989) 166
176.

[97] G. Laporte, F.V. Louveaux, Formulations and bounds for the stochastic capacitated vehicle routing problem with uncertain supplies, Economic Decision-Making: Games, Econometrics and Optimization. Contribution in Honour of Dreze JH, in: J. Gabzewicz, J.F. Richard, L. Wolsey (Eds.), Elsevier Science, North Holland, Amsterdam, 1990, pp. 443
455.

[98] D.J. Bertsimas, P. Jaillet, A.R. Odoni, A priori optimization, Oper. Res. 38 (1990) 1019
1033.

[99] C. Bastian, A.H.G. Rinnooy Kan, The stochastic vehicle routing problem revisited, Eur. J. Oper. Res. 56 (1992) 407
412.

[100] W.C. Benton, M.D. Rossetti, The vehicle scheduling problem with intermittent cus-tomer demands, Comput. Oper. Res. 19 (1992) 521
531.

[101] M. Dror, Vehicle routing with uncertain demands: stochastic programming and its cor-responding TSP solution, Eur. J. Oper. Res. 64 (1992) 432
441.

[102] G. Laporte, F.V. Louveaux, H. Mercure, The vehicle routing problem with stochastic travel times, Transport. Sci. 26 (1992) 161
170.

[103] P. Trudeau, M. Dror, Stochastic inventory routing: route design with stock outs and route failure, Transport. Sci. 26 (1992) 171
184.

[104] D.J. Bertsimas, A vehicle routing problem with stochastic demand, Oper. Res.

40 (1992) 574
585.

[105] M. Dror, G. Laporte, F.V. Louveaux, Vehicle routing with stochastic demands and restricted failures, Math. Method Oper. Res. 37 (3) (1993) 273
283.

[106] B. Bouzaiene-Ayari, M. Dror, G. Laporte, Vehicle routing with stochastic demands and split deliveries, Found. Comput. Decision Sci. 18 (1993) 63
69.

[107] G. Laporte, F.V. Louveaux, The integer L-shaped method for stochastic integer pro-grams with complete recourse, Oper. Res. Lett. 13 (1993) 133
142.

[108] N. Secomandi, Exact and heuristic dynamic programming algorithms for the vehicle routing problem with stochastic demands. Ph.D. thesis, Department of Decision and Information Sciences, University of Houston, Houston, TX, 1998.

[109] C. Hjorring, J. Holt, New optimality cuts for a single-vehicle stochastic routing prob-lem, Ann. Oper. Res. 86 (1999) 569
584.

[110] W. Yang, K. Mathur, R.H. Ballou, Stochastic vehicle routing problem with restocking, Transport. Sci. 34(1) (2000) 99
112.

[111] N. Secomandi, A rollout policy for the vehicle routing problem with stochastic demands, Oper. Res. 49(5) (2001) 796
802.

[112] G. Laporte, F. Louveaux, L.V. Hamme, An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands, Oper. Res. 50 (2002) 415
423.

[113] H. Markovic, I. Cavar, T. Caric, Using data mining to forecast uncertain demands in stochastic vehicle routing problem, 13th International Symposium on Electronics in Transport (ISEP), Slovenia, 2005, pp. 1
6.

[114] K. Chepuri, T. Homem de Mello, Solving the vehicle routing problem with stochastic demands using the cross entropy method, Ann. Oper. Res. 134 (2005) 153
181.

[115] M. Dessouky, F. Ordonez, H. Jia, Z. Shen, Rapid distribution of medical supplies, Int.

Ser. Oper. Res. Manag. Sci. 91 (2006) 309
338.

[116] C. Novoa, R. Berger, J. Linderoth, R. Storer, A Set-Partitioning-Based Model for the Stochastic Vehicle Routing Problem, Technical Report 06T-008, Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, 2006.

[117] A. Ak, A.L. Erera, A paired-vehicle recourse strategy for the vehicle-routing problem with stochastic demands, Transport. Sci. 41(2) (2007) 222
237.

[118] K.C. Tan, C.Y. Cheong, C.K. Goh, Solving multi objective vehicle routing problem with stochastic demand via evolutionary computation, Eur. J. Oper. Res. 177 (2007) 813
839.

[119] D. Haugland, S.C. Ho, G. Laporte, Designing delivery districts for the vehicle routing problem with stochastic demands, Eur. J. Oper. Res. 180 (2007) 997
1010.

[120] F. Sungur, F. Ordonez, M.M. Dessouky, A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty, Inst. Ind. Eng. Trans.

40 (5) (2008) 509
523.

[121] H. Jula, M.M. Dessouky, P. Ioannou, Truck route planning in non-stationary stochastic networks with time-windows at customer locations, IEEE Trans. Intell. Transport Syst. 9 (2008) 97
110.

[122] Z. Shen, F. Ordonez, M.M. Dessouky, The stochastic vehicle routing problem for min-imum unmet demand, Optim. Appl. 30 (4) (2009) 349
371.

[123] C.H. Christiansen, J. Lysgaard, A branch-and-price algorithm for the capacitated vehi-cle routing problem with stochastic demands, Oper. Res. Lett. 35 (2009) 773
781.

[124] N. Secomandi, F. Margot, Reoptimization approaches for the vehicle-routing problem with stochastic demands, Oper. Res. 57 (1) (2009) 214
230.

[125] C. Novoa, R. Storer, An approximate dynamic programming approach for the vehicle routing problem with stochastic demands, Eur. J. Oper. Res. 196 (2009) 509
515.

[126] X. Li, P. Tian, S.C.H. Leung, Vehicle routing problems with time windows and sto-chastic travel and service times: models and algorithm, Int. J. Prod. Econ. 125 (2010) 137
145.

[127] S.L. Smith, M. Pavone, F. Bullo, E. Frazzoli, Dynamic vehicle routing with priority classes of stochastic demands, SIAM J. Contr. Optim. 48 (5) (2010) 3224
3245.

[128] W. Rei, M. Gendreau, P. Soriano, A hybrid Monte Carlo local branching algorithm for the single vehicle routing problem with stochastic demands, Transport. Sci. 44 (1) (2010) 136
146.

[129] J.E. Mendoza, B. Castanier, C. Gueret, A.L. Medaglia, N. Velasco, A memetic algo-rithm for the multi-compartment vehicle routing problem with stochastic demands, Comput. Oper. Res. 37 (2010) 1886
1898.

[130] C. Teodorovic, G. Pavkovic, The fuzzy set theory approach to the vehicle routing problem when demand at nodes is uncertain, Fuzzy Sets Syst. 3 (1996) 307
317.

[131] R. Cheng, M. Gen, Vehicle routing problem with fuzzy due-time using genetic algo-rithms, J. Fuzzy Theory Sys. 7(5) (1995) 1050
1061.

[132] B. Werners, M. Drawe, Capacitated vehicle routing problem with fuzzy demand, Studies Fuzziness Soft Comput. 126 (2003) 317
336.

[133] R.J. Kue, C.Y. Chiu, Y.J. Lin, Integration of fuzzy theory and ant algorithm for vehi-cle routing problem with time window, Proceedings of the IEEE Annual Meeting of the Fuzzy Information[C] 2, 2004, pp. 925
930.

[134] H.M. Sheng, J.C. Wang, H.H. Haung, D.C. Yen, Fuzzy measure on vehicle routing problem of hospital materials, Expert Syst. Appl. 30(2) (2005) 367
377.

[135] Y. He, J. Xu, A class of random fuzzy programming model and its application to vehi-cle routing problem, World J. Model. Simulation 1 (2005) 3
11.

[136] Y.S. Zheng, B.D. Liu, Fuzzy vehicle routing model with credibility measure and its hybrid intelligent algorithm, Appl. Math. Comput. 176 (2006) 673
683.

[137] J.J. Lin, A GA-based multi-objective decision making for optimal vehicle transporta-tion, J. Inf. Sci. Eng. 24 (2008) 237
260.

[138] C. Erbao, L. Mingyong, A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands, J. Comput. Appl. Math. 231 (2009) 302
310.

[139] C. Erbao, L. Mingyong, The open vehicle routing problem with fuzzy demands, Expert Syst. Appl. 37 (2010) 2405
2411.

[140] C.D. Tarantilis, C.T. Kiranoudis, A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector, Eur. J. Oper. Res. 179 (2007) 806
822.

[141] J. Teixeira, A.P. Antunes, J.P. de Sousa, Recyclable waste collection planning—a case study, Eur. J. Oper. Res. 158 (2004) 543
554.

9 Packaging and Material Handling

Mahsa Parvini

Faculty of Industrial Engineering, Amirkabir University, Tehran, Iran

Learning Objectives in Material Handling and Packaging

G To learn material-handling (MH) principles

G To identify MH equipment

G To know the utilization of unit loads role in MH

G To know the MH designing systems process

G To identify the functions performed by packaging

G To identify labeling importance

G To know how packaging affects logistics activities