Speeding up logic-based benders' decomposition by a metaheuristic for a bi-level capacitated vehicle routing problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8457 LNCS, Issue , 2014, Pages 183-197

  Raidl, Günther R ^a   Baumhauer, Thomas ^a,b   Hu, Bin ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b SALZBURG RESEARCH   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING; ITERATIVE METHODS; NETWORK ROUTING; OPTIMIZATION; ROUTING ALGORITHMS;

BENDERS' DECOMPOSITIONS; CAPACITATED VEHICLE ROUTING PROBLEM; CONTINUOUS VARIABLES; HYBRID METAHEURISTICS; METAHEURISTIC; MIXED INTEGER PROGRAMMING; VARIABLE NEIGHBORHOOD SEARCH; VEHICLE ROUTING PROBLEMS;

HEURISTIC ALGORITHMS;

EID: 84903589938     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-07644-7_14     Document Type: Conference Paper

References (23)

1. Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4, 238-252 (1962)
2. Geoffrion, A.M.: Generalized Benders decomposition. Journal of Optimization Theory and Applications 10(4), 237-260 (1972)
3. Hooker, J.N., Ottosson, G.: Logic-based benders decomposition. Mathematical Programming 96, 33-60 (2003)
4. Hooker, J.N.: Planning and scheduling by logic-based Benders decomposition. Operations Research 55(3), 588-602 (2007)
5. Poojari, C.A., Beasley, J.E.: Improving Benders decomposition using a genetic algorithm. European Journal of Operational Research 199(1), 89-97 (2009)
6. Lai, M.C., Sohn, H.S., Tseng, T.L., Chiang, C.: A hybrid algorithm for capacitated plant location problem. Expert Systems with Applications 37(12), 8599-8605 (2010)
7. Lai, M.C., Sohn, H.S.: Using a genetic algorithm to solve the Benders master problem for capacitated plant location. In: Gao, S. (ed.) Bio-Inspired Computational Algorithms and Their Applications, pp. 405-420. InTech (2012)
8. Lai, M.C., Sohn, H.S., Tseng, T.L., Bricker, D.L.:A hybrid Benders/genetic algorithm for vehicle routing and scheduling problem. International Journal of Industrial Engineering 19(1), 33-46 (2012)
9. Rei, W., Cordeau, J.F., Gendreau, M., Soriano, P.: Accelerating Benders decomposition by local branching. INFORMS Journal on Computing 21(2), 333-345 (2008)
10. Zakeri, G., Philpott, A.B., Ryan, D.M.: Inexact cuts in Benders decomposition. SIAM Journal on Optimization 10(3), 643-657 (1999)
11. Perboli, G., Tadei, R., Vigo, D.: The two-echelon capacitated vehicle routing problem: Models and math-based heuristics. Transportation Science 45(3), 364-380 (2011)
12. Hemmelmayr, V.C., Cordeau, J.F., Crainic, T.G.: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Computers and Operations Research 39(12), 3215-3228 (2012)
13. Schwengerer, M., Pirkwieser, S., Raidl, G.R.: A variable neighborhood search approach for the two-echelon location-routing problem. In: Hao, J.-K., Middendorf, M. (eds.) EvoCOP 2012. LNCS, vol. 7245, pp. 13-24. Springer, Heidelberg (2012)
14. Crainic, T.G., Mancini, S., Perboli, G., Tadei, R.: Multi-start heuristics for the two-echelon vehicle routing problem. In: Hao, J.-K. (ed.) EvoCOP 2011. LNCS, vol. 6622, pp. 179-190. Springer, Heidelberg (2011)
15. Jacobsen, S.K., Madsen, O.B.G.: A comparative study of heuristics for a two-level routinglocation problem. European Journal of Operational Research 5(6), 378-387 (1980)
16. Boccia, M., Crainic, T., Sforza, A., Sterle, C.: A metaheuristic for a two echelon locationrouting problem. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 288-301. Springer, Heidelberg (2010)
17. Boccia, M., Crainic, T.G., Sforza, A., Sterle, C.: Location-routing models for designing a two-echelon freight distribution system. Technical Report CIRRELT-2011-06, University of Montreal (2011)
18. Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for vehicle routing. Networks 11(2), 109-124 (1981)
19. Boschetti,M.,Maniezzo, V.: Benders decomposition, Lagrangian relaxation and metaheuristic design. Journal of Heuristics 15, 283-312 (2009)
20. Yaman, H.: Formulations and valid inequalities for the heterogeneous vehicle routing problem. Mathematical Programming 106(2), 365-390 (2006)
21. Pirkwieser, S., Raidl, G.R.: A variable neighborhood search for the periodic vehicle routing problem with time windows. In: Prodhon, C., et al. (eds.) Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing, Troyes, France (2008)
22. Clarke, G.,Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12(4), 568-581 (1964)
23. Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research 24(11), 1097-1100 (1997)