A bilevel particle swarm optimization algorithm for supply chain management problems

Studies in Computational Intelligence

Volumn 482, Issue , 2013, Pages 69-93

  Marinakis, Yannis ^a   Marinaki, Magdalene ^a  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84893068551     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-37838-6_3     Document Type: Article

References (60)

1. Ballou, R.H.: Business LogisticsManagement, Planning, Organizing and Controlling the Supply Chain, 4th edn. Prentice-Hall International, Inc. (1999).
2. Banks, A., Vincent, J., Anyakoha, C.: A review of particle swarm optimization. Part I: background and development. Natural Computing 6(4), 467-484 (2007). (Pubitemid 47629392)
3. Banks, A., Vincent, J., Anyakoha, C.: A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Natural Computing 7, 109-124 (2008). (Pubitemid 351234459)
4. Barreto, S., Ferreira, C., Paixao, J., Santos, B.S.: Using Clustering Analysis in a Capacitated Location-Routing Problem. European Journal of Operational Research 179 (3), 968-977 (2007). (Pubitemid 46038597)
5. Bodin, L., Golden, B.: Classification in vehicle routing and scheduling. Networks 11, 97-108 (1981).
6. Bodin, L., Golden, B., Assad, A., Ball, M.: The state of the art in the routing and scheduling of vehicles and crews. Computers and Operations Research 10, 63-212 (1983).
7. Christofides, N., Eilon, S.: An Algorithm for the Vehicle Dispatching Problem. Operational Research Quarterly 20, 309-318 (1969).
8. Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization. Wiley, Chichester (1979).
9. Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Management Science 6(1), 80-91 (1959).
10. Daskin, M.: Network and Discrete Location. Models, Algorithms and Applications. John Wiley and Sons, New York (1995).
11. Duhamel, C., Lacomme, P., Prins, C., Prodhon, C.: A Memetic Approach for the Capacitated Location Routing Problem. In: EU/MEeting 2008 - Troyes, France, October 23-24 (2008).
12. Duhamel, C., Lacomme, P., Prins, C., Prodhon, C.: A GRASP × ELS approach for the capacitated location-routing problem. Computers and Operations Research 37, 1912- 1923 (2010).
13. Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for vehicle routing. In: Golden, B., Bodin, L. (eds.) Proceedings of the International Workshop on Current and Future Directions in the Routing and Scheduling of Vehicles and Crews, pp. 109-124. Wiley and Sons (1979).
14. Fisher, M.L.: Vehicle routing. In: Ball, M.O., Magnanti, T.L., Momma, C.L., Nemhauser, G.L. (eds.) Network Routing, Handbooks in Operations Research and Management Science, vol. 8, pp. 1-33. North Holland, Amsterdam (1995).
15. Garfinkel, R., Nemhauser, G.: Integer Programming. John Wiley and Sons, New York (1972).
16. Gaskell, T.J.: Bases for Vehicle Fleet Scheduling. Operational Research Quarterly 18, 281-295 (1967).
17. Gendreau, M., Laporte, G., Potvin, J.Y.: Vehicle routing: modern heuristics. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local search in Combinatorial Optimization, pp. 311-336. Wiley, Chichester (1997).
18. Gendreau, M., Laporte, G., Potvin, J.Y.: Metaheuristics for the Capacitated VRP. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, Monographs on Discrete Mathematics and Applications, pp. 129-154. SIAM (2002).
19. Golden, B.L., Assad, A.A.: Vehicle Routing: Methods and Studies. North Holland, Amsterdam (1988).
20. Golden, B.L., Wasil, E.A., Kelly, J.P., Chao, I.M.: The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results. In: Crainic, T.G., Laporte, G. (eds.) Fleet Management and Logistics, pp. 33-56. Kluwer Academic Publishers, Boston (1998).
21. Golden, B.L., Raghavan, S., Wasil, E.: The Vehicle Routing Problem: Latest Advances and New Challenges. Springer LLC (2008).
22. Hansen, P., Mladenovic, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130, 449-467 (2001). (Pubitemid 32875304)
23. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of 1995 IEEE International Conference on Neural Networks, vol. 4, pp. 1942-1948 (1995).
24. Kennedy, J., Eberhart, R.: A discrete binary version of the particle swarm algorithm. In: Proceedings of 1997 IEEE International Conference on Systems Man and Cybernetics, vol. 5, pp. 4104-4108 (1997).
25. Kennedy, J., Eberhart, R., Shi, Y.: Swarm Intelligence.Morgan Kaufmann Publisher, San Francisco (2001).
26. Laporte, G., Semet, F.: Classical heuristics for the capacitated VRP. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, Monographs on Discrete Mathematics and Applications, pp. 109-128. SIAM (2002).
27. Laporte, G., Gendreau, M., Potvin, J.Y., Semet, F.: Classical and modern heuristics for the vehicle routing problem. International Transactions on Operations Research 7, 285- 300 (2000).
28. Marinakis, Y., Migdalas, A.: Heuristic solutions of vehicle routing problems in supply chain management. In: Pardalos, P.M., Migdalas, A., Burkard, R. (eds.) Combinatorial and Global Optimization, pp. 205-236. World Scientific Publishing Co. (2002).
29. Marinakis, Y., Migdalas, A., Pardalos, P.M.: Expanding neighborhood GRASP for the traveling salesman problem. Computational Optimization Applications 32, 231-257 (2005). (Pubitemid 41406908)
30. Marinakis, Y., Migdalas, A., Pardalos, P.M.: A hybrid Genetic-GRASP algorithm using langrangean relaxation for the traveling salesman problem. Journal of Combinatorial Optimization 10, 311-326 (2005). (Pubitemid 41660713)
31. Marinakis, Y., Migdalas, A., Pardalos, P.M.: A New Bilevel Formulation for the Vehicle Routing Problem and a Solution Method Using a Genetic Algorithm. Journal of Global Optimization 38, 555-580 (2007). (Pubitemid 46976745)
32. Marinakis, Y., Marinaki, M.: A Bilevel Genetic Algorithm for a Real Life Location Routing Problem. International Journal of Logistics: Research and Applications 11(1), 49-65 (2008).
33. Marinakis, Y., Marinaki, M.: A Particle Swarm Optimization Algorithm with Path Relinking for the Location Routing Problem. Journal of Mathematical Modelling and Algorithms 7(1), 59-78 (2008).
34. Marinakis, Y., Marinaki, M., Dounias, G.: Honey bees mating optimization algorithm for the vehicle routing problem. In: Krasnogor, N., Nicosia, G., Pavone, M., Pelta, D. (eds.) Nature Inspired Cooperative Strategies for Optimization, NICSO 2007. SCI, vol. 129, pp. 139-148. Springer, Heidelberg (2008).
35. Marinakis, Y., Marinaki, M., Dounias, G.: Honey bees mating optimization algorithm for large scale vehicle routing problems. Natural Computing 9, 5-27 (2010).
36. Marinakis, Y., Marinaki, M.: A Hybrid Genetic - Particle Swarm Algorithm for the Vehicle Routing Problem. Expert Systems with Applications 37, 1446-1455 (2010).
37. Marinakis, Y., Marinaki, M., Dounias, G.: A Hybrid Particle Swarm Optimization Algorithm for the Vehicle Routing Problem. Engineering Applications of Artificial Intelligence 23, 463-472 (2010.
38. Mester, D., Braysy, O.: Active guided evolution strategies for large scale capacitated vehicle routing problems. Computers and Operations Research 34, 2964-2975 (2007). (Pubitemid 46356733)
39. Migdalas, A.: Bilevel Programming in Traffic Planning: Models.Methods and Challenge Journal of Global Optimization 7, 381-405 (1995).
40. Migdalas, A., Pardalos, P.M.: Nonlinear Bilevel Problems With Convex Second Level Problem - Heuristics and Descent Methods. In: Du, D.-Z., et al. (eds.) Operations Research and its Application, pp. 194-204. World Scientific (1995).
41. Miller, T.: Hierarchical Operations and Supply Chain Planning. Springer, London (2001).
42. Min, H., Jayaraman, V., Srivastava, R.: Combined Location-Routing Problems: A Synthesis and Future Research Directions. European Journal of Operational Research 108, 1-15 (1998). (Pubitemid 128372582)
43. Nagy, G., Salhi, S.: Location-Routing: Issues, Models and Methods. European Journal of Operational Research 177, 649-672 (2007). (Pubitemid 44647670)
44. Or, I.: Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking. Ph. D. Thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL (1976).
45. Pereira, F.B., Tavares, J.: Bio-inspired Algorithms for the Vehicle Routing Problem. SCI, vol. 161. Springer, Heideberg (2008).
46. Perl, J., Daskin, M.S.: A Warehouse Location Routing Model. Transportation Research B 19, 381-396 (1985).
47. Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Computers and Operations Research 34, 2403-2435 (2007). (Pubitemid 46073431)
48. Poli, R., Kennedy, J., Blackwell, T.: Particle swarm optimization. An overview. Swarm Intelligence 1, 33-57 (2007).
49. Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31, 1985-2002 (2004). (Pubitemid 38728564)
50. Prins, C., Prodhon, C., Calvo, R.W.: Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR 4, 221-238 (2006).
51. Prins, C., Prodhon, C., Calvo, R.W.: AMemetic Algorithm with PopulationManagement (MA|PM) for the Capacitated Location-Routing Problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol. 3906, pp. 183-194. Springer, Heidelberg (2006). (Pubitemid 44019284)
52. Prins, C., Prodhon, C., Ruiz, A., Soriano, P., Calvo, R.W.: Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic. Transportation Science 41(4), 470-483 (2007).
53. Prins, C.: A GRASP × Evolutionary Local Search Hybrid for the Vehicle Routing Problem. In: Pereira, F.B., Tavares, J. (eds.) Bio-inspired Algorithms for the Vehicle Routing Problem. SCI, vol. 161, pp. 35-53. Springer, Heideberg (2008).
54. Reimann, M., Doerner, K., Hartl, R.F.: D-Ants: savings based ants divide and conquer the vehicle routing problem. Computers and Operations Research 31, 563-591 (2004). (Pubitemid 38098444)
55. Rochat, Y., Taillard, E.D.: Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1, 147-167 (1995).
56. Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: Proceedings of 1998 IEEE World Congress on Computational Intelligence, pp. 69-73 (1998).
57. Tarantilis, C.D.: Solving the vehicle routing problem with adaptive memory programming methodology. Computers and Operations Research 32, 2309-2327 (2005). (Pubitemid 40114318)
58. Tarantilis, C.D., Kiranoudis, C.T.: BoneRoute: An adaptive memory-based method for effective fleet management. Annals of Operations Research 115, 227-241 (2002). (Pubitemid 37132216)
59. Toth, P., Vigo, D.: The vehicle routing problem. Monographs on Discrete Mathematics and Applications. SIAM (2002).
60. Yu, V.F., Lin, S.W., Lee, W., Ting, C.J.: A simulated annealing heuristic for the capacitated location routing problem. Computers and Industrial Engineering 58, 288-299 (2010).