Grouping Genetic Algorithms pp 141-159 | Cite as
Fleet Size and Mix Vehicle Routing: A Multi-Criterion Grouping Genetic Algorithm Approach
Abstract
The need for efficient transportation is ever increasing in every society over the globe. Transportation costs account for a significant percentage of the total cost of a product. Strong global competition continues to aggravate the demand for higher efficiency, high quality of service, timeliness, reactivity, and cost-effectiveness in transportation. It is therefore important to optimize vehicle routing in order to provide cost-effective services to customers and to maintain the momentum of the business in the long term. Multiple criteria such as routing cost and workload balancing should be considered. This chapter considers the fleet size and mix vehicle routing problem (FSMVRP), where the fleet size and its composition are to be determined. A multi-criterion grouping genetic algorithm (GGA) with unique grouping genetic operators is presented and tested on benchmark problems. Comparative computational results show that GGA is competitive in multi-criterion decision making.
Keywords
Fleet size and mix Vehicle routing Multi-criterion decision making Genetic algorithms Grouping genetic algorithm LogisticsReferences
- Ai J, Kachitvichyanukul V (2009) Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Comput Ind Eng 56:380–387CrossRefGoogle Scholar
- Avci M, Topaloglu S (2016) A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery. Expert Syst Appl 53:160–171CrossRefGoogle Scholar
- Brandao J (2008) A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. Eur J Oper Res 195(3):716–728CrossRefMATHGoogle Scholar
- Braysey O, Gendreau M (2005) Vehicle routing problems with time windows, Part I: Route construction and local search algorithms. Transp Sci 39(1):104–118CrossRefGoogle Scholar
- Choi E, Tcha DW (2007) A column generation approach to the heterogeneous fleet vehicle routing problem. Comput Oper Res 34:2080–2095CrossRefMATHGoogle Scholar
- Christiansen M, Fagerholt K, Ronen D, Nygreen B (2007) Maritime transportation. In: Barnhart C, Laporte G (eds) Handbook in operations research and management science. Elsevier, Amsterdam, pp 189–284Google Scholar
- Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581CrossRefGoogle Scholar
- Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manage Sci 6:80–91MathSciNetCrossRefMATHGoogle Scholar
- Desrochers M, Verhoog TW (1991) A new heuristic for the fleet size and mix vehicle routing problem. Comput Oper Res 18:263–274CrossRefMATHGoogle Scholar
- Engevall S, Gothe-Lundgren M, Varbrand P (2004) The heterogeneous vehicle routing game. Transp Sci 38:71–85CrossRefMATHGoogle Scholar
- Erdogan S, Miller-Hooks E (2012) A green vehicle routing problem. Transp Res Part E 48:100–114CrossRefGoogle Scholar
- Fisher M, Jaikumar R (1981) A generalized assignment heuristic for vehicle routing. Networks 11:109–124MathSciNetCrossRefGoogle Scholar
- Gendreau M, Laporte G, Musaraganyi C, Taillard ED (1999) A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comput Oper Res 26:1153–1173CrossRefMATHGoogle Scholar
- Gillett B, Miller L (1974) A heuristic for the vehicle dispatching problem. Oper Res 22:340–349CrossRefMATHGoogle Scholar
- Golden B, Assad A, Levy L, Gheysens F (1984) The fleet size and mix vehicle routing problem. Comput Oper Res 11:49–66CrossRefMATHGoogle Scholar
- Hoff A, Andersson H, Christiansen M, Hasle G, Løkketangen A (2010) Industrial aspects and literature survey: fleet composition and routing. Comput Oper Res 37:2041–2061MathSciNetCrossRefMATHGoogle Scholar
- Koç Ç, Bektaş T, Jabali O, Laporte G (2015) A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows. Comput Oper Res 64:11–27MathSciNetCrossRefGoogle Scholar
- Koç Ç, Bektaş T, Jabali O, Laporte G (2016) The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm. Eur J Oper Res 248(1):33–51MathSciNetCrossRefGoogle Scholar
- Lima CMRR, Goldbarg MC, Goldbarg EFG (2004) A memetic algorithm for the heterogeneous fleet vehicle routing problem. Electron Notes Discrete Math 18:171–176MathSciNetCrossRefMATHGoogle Scholar
- Lima FMS, Pereira DSD, Conceição SV, Nunes NTR (2016) A mixed load capacitated rural school bus routing problem with heterogeneous fleet: algorithms for the Brazilian context. Expert Syst Appl 56:320–334. Available online 17 March 2016Google Scholar
- Liu S, Huang W, Ma H (2009) An effective genetic algorithm for the fleet size and mix vehicle routing problems. Transp Res Part E 45:434–445CrossRefGoogle Scholar
- Moghadam BF, Seyedhosseini SM (2010) A particle swarm approach to solve vehicle routing problem with uncertain demand: a drug distribution case study. Int J Ind Eng Comput 1:55–66Google Scholar
- Mutingi M, Mbohwa C (2012b) Enhanced group genetic algorithm for the heterogeneous fixed fleet vehicle routing problem. IEEE international conference on industrial engineering and engineering management, Hong Kong, 10–13 Dec 2012, pp 207–2011Google Scholar
- Mutingi M, Mbohwa C (2014) A Fuzzy-based particle swarm optimization approach for task assignment in home healthcare. South African J Ind Eng 25(3):84–95Google Scholar
- Mutingi M, Mbohwa C (2016) Fuzzy grouping genetic algorithm for homecare staff scheduling. In: Mutingi M and Mbohwa C (ed) Healthcare Staff Scheduling: Emerging Fuzzy Optimization Approaches, 1st edn. CRC Press, Taylor & Francis, New York, 119–136Google Scholar
- Ochi LS, Vianna DS, Drummond LM, Victor AO (1998) A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet. Future Gener Comput Syst 14:285–292CrossRefGoogle Scholar
- Osman S, Salhi S (1996) Local search strategies for the vehicle fleet mix problem. In: Rayward-Smith VJ, Osman IH, Reeves CR, Smith GD (eds) Modern heuristic search methods. Wiley, New York, pp 131–153CrossRefGoogle Scholar
- Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31:1985–2002MathSciNetCrossRefMATHGoogle Scholar
- Renaud J, Boctor FF (2002) A sweep-based algorithm for the fleet size and mix vehicle routing problem. Eur J Oper Res 140:618–628MathSciNetCrossRefMATHGoogle Scholar
- Salhi S, Rand GK (1993) Incorporating vehicle routing into the vehicle fleet composition problem. Eur J Oper Res 66:313–330CrossRefMATHGoogle Scholar
- Taillard ED (1999) A heuristic column generation method for the heterogeneous fleet VRP. RAIRO 33:1–34MathSciNetCrossRefMATHGoogle Scholar
- Tarantilis CD, Kiranoudis CT, Vassiliadis VS (2004) A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Eur J Oper Res 152:148–158MathSciNetCrossRefMATHGoogle Scholar
- Toth P, Vigo D (2012) The vehicle routing problem, SIAM monograph on discrete mathematics and applications. SIAM, Philadelphia, PAGoogle Scholar
- Wang X, Gloden B, Wasil E (2008) Using a genetic algorithm to solve the generalized orienteering problem. In: Golden B, Raghavan S, Wasil E (eds) The vehicle routing problem: latest advances and new challenges. Springer, Berlin, 263–274Google Scholar
- Wang Z, Li Y, Hu X (2015) A heuristic approach and a for the heterogeneous multi-type fleet vehicle routing problem with time windows and an incompatible loading constraint. Comput Ind Eng 89:162–176CrossRefGoogle Scholar
- Wassan NA, Osman IH (2002) Tabu search variants for the mix fleet vehicle routing problem. J Oper Res Soc 53:768–782CrossRefMATHGoogle Scholar
- Yaman H (2006) Formulations and valid inequalities for the heterogeneous vehicle routing problem. Math Program 106:365–390MathSciNetCrossRefMATHGoogle Scholar