1
How to cite this paper
APA: Ocampo, E., Guimarães, F & Rendón, R. (2017). Introducing radiality constraints in capacitated location-routing problems. International Journal of Industrial Engineering Computations, 8(4), 441-452.
Chicago/Turabian: Ocampo, E., Guimarães, F & Rendón, R. 2017. "Introducing radiality constraints in capacitated location-routing problems." International Journal of Industrial Engineering Computations 8, no. 4 (2017): 441-452.
AMA: Ocampo, E., Guimarães, F & Rendón, R. Introducing radiality constraints in capacitated location-routing problems. International Journal of Industrial Engineering Computations. 2017;8(4):441-452.
References
Albareda-Sambola, M., Dı́az, J. A., & Fernández, E. (2005). A compact model and tight bounds for a combined location-routing problem. Computers & Operations Research, 32(3), 407-428.
Akca, Z., Berger, R. T., & Ralphs, T. K. (2009). A branch-and-price algorithm for combined location and routing problems under capacity restrictions. In Operations research and cyber-infrastructure (pp. 309-330). Springer US.
Augerat, P., Belenguer, J. M., Benavent, E., Corberán, A., Naddef, D., & Rinaldi, G. (1998). Computational results with a branch-and-cut code for the capacitated vehicle routing problem.
Barreto, S., Ferreira, C., Paixao, J., & Santos, B. S. (2007). Using clustering analysis in a capacitated location-routing problem. European Journal of Operational Research, 179(3), 968-977.
Belenguer, J. M., Benavent, E., Prins, C., Prodhon, C., & Calvo, R. W. (2011). A branch-and-cut method for the capacitated location-routing problem. Computers & Operations Research, 38(6), 931-941.
Berger, R. T., Coullard, C. R., & Daskin, M. S. (2007). Location-routing problems with distance constraints. Transportation Science, 41(1), 29-43.
Christofides, N., Mingozzi, A., & Toth, P. (1981). Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Mathematical Programming, 20(1), 255-282.
Christofides, N., & Eilon, S. (1969). An algorithm for the vehicle-dispatching problem. Journal of the Operational Research Society, 20(3), 309-318.
Chen, A. L., Yang, G. K., & Wu, Z. M. (2006). Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University-Science A, 7(4), 607-614.
Clarke, G., & Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4), 568-581.
Contardo, C., Cordeau, J. F., & Gendron, B. (2014). A GRASP+ ILP-based metaheuristic for the capacitated location-routing problem. Journal of Heuristics, 20(1), 1-38.
Cornuejols, G., & Harche, F. (1993). Polyhedral study of the capacitated vehicle routing problem. Mathematical Programming, 60(1-3), 21-52.
Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80-91.
Duhamel, C., Lacomme, P., Prins, C., & Prodhon, C. (2010). A GRASP× ELS approach for the capacitated location-routing problem. Computers & Operations Research, 37(11), 1912-1923.
Escobar, J. W., Linfati, R., & Toth, P. (2013). A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. Computers & Operations Research, 40(1), 70-79.
Escobar, J. W., Linfati, R., Toth, P., & Baldoquin, M. G. (2014). A hybrid granular tabu search algorithm for the multi-depot vehicle routing problem. Journal of Heuristics, 20(5), 483-509.
Fourer, R., Gay, D. M., & Kernighan, B. W. Ampl: a modeling language for mathematical programming. 2002. Duxbury Press.
Gendreau, M., Potvin, J. Y., Bräumlaysy, O., Hasle, G., & Løkketangen, A. (2008). Metaheuristics for the vehicle routing problem and its extensions: A categorized bibliography. In The vehicle routing problem: latest advances and new challenges (pp. 143-169). Springer US.
Hemmelmayr, V. C., Cordeau, J. F., & Crainic, T. G. (2012). An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Computers & Operations Research, 39(12), 3215-3228.
ILOG, S. (2008). CPLEX optimization subroutine library guide and reference. System v11. 0 User’s Guide.
Jansen, K. (1993). Bounds for the general capacitated routing problem. Networks, 23(3), 165-173.
Lavorato, M., Franco, J. F., Rider, M. J., & Romero, R. (2012). Imposing radiality constraints in distribution system optimization problems. IEEE Transactions on Power Systems, 27(1), 172-180.
Letchford, A. N., & Salazar-González, J. J. (2016). Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem. European Journal of Operational Research, 251(1), 74-84.
Magnanti, T. L., Monma, C. L., & Nemhauser, G. L. (1995). Network routing (Vol. 8). M. O. Ball (Ed.). Amsterdam: North-Holland.
Melechovský, J., Prins, C., & Calvo, R. W. (2005). A metaheuristic to solve a location-routing problem with non-linear costs. Journal of Heuristics, 11(5-6), 375-391.
Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulation of traveling salesman problems. Journal of the ACM (JACM), 7(4), 326-329.
Nagy, G., & Salhi, S. (2007). Location-routing: Issues, models and methods. European Journal of Operational Research, 177(2), 649-672.
Prado, R. S., Silva, R. C. P., Neto, O. M., Guimarães, F. G., Sanches, D. S., London, J. B. A., & Delbem, A. C. (2014). Differential evolution using ancestor tree for service restoration in power distribution systems. Applied Soft Computing, 23, 498-508.
Prodhon, C. (2011). A hybrid evolutionary algorithm for the periodic location-routing problem. European Journal of Operational Research, 210(2), 204-212.
Prins, C. (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research, 31(12), 1985-2002.
Prins, C., Prodhon, C., Ruiz, A., Soriano, P., & Wolfler Calvo, R. (2007). Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science, 41(4), 470-483.
Ralphs, T. K., Kopman, L., Pulleyblank, W. R., & Trotter, L. E. (2003). On the capacitated vehicle routing problem. Mathematical Programming, 94(2), 343-359.
Salhi, S., & Rand, G. K. (1989). The effect of ignoring routes when locating depots. European journal of operational research, 39(2), 150-156.
Ting, C. J., & Chen, C. H. (2013). A multiple ant colony optimization algorithm for the capacitated location routing problem. International Journal of Production Economics, 141(1), 34-44.
Toth, P., & Tramontani, A. (2008). An integer linear programming local search for capacitated vehicle routing problems. In The Vehicle Routing Problem: Latest Advances and New Challenges (pp. 275-295). Springer US.
Toth, P., & Vigo, D. (Eds.). (2014). Vehicle routing: problems, methods, and applications. Society for Industrial and Applied Mathematics.
Yu, B., Yang, Z. Z., & Yao, B. (2009). An improved ant colony optimization for vehicle routing problem. European Journal of Operational Research, 196(1), 171-176.
Akca, Z., Berger, R. T., & Ralphs, T. K. (2009). A branch-and-price algorithm for combined location and routing problems under capacity restrictions. In Operations research and cyber-infrastructure (pp. 309-330). Springer US.
Augerat, P., Belenguer, J. M., Benavent, E., Corberán, A., Naddef, D., & Rinaldi, G. (1998). Computational results with a branch-and-cut code for the capacitated vehicle routing problem.
Barreto, S., Ferreira, C., Paixao, J., & Santos, B. S. (2007). Using clustering analysis in a capacitated location-routing problem. European Journal of Operational Research, 179(3), 968-977.
Belenguer, J. M., Benavent, E., Prins, C., Prodhon, C., & Calvo, R. W. (2011). A branch-and-cut method for the capacitated location-routing problem. Computers & Operations Research, 38(6), 931-941.
Berger, R. T., Coullard, C. R., & Daskin, M. S. (2007). Location-routing problems with distance constraints. Transportation Science, 41(1), 29-43.
Christofides, N., Mingozzi, A., & Toth, P. (1981). Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Mathematical Programming, 20(1), 255-282.
Christofides, N., & Eilon, S. (1969). An algorithm for the vehicle-dispatching problem. Journal of the Operational Research Society, 20(3), 309-318.
Chen, A. L., Yang, G. K., & Wu, Z. M. (2006). Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University-Science A, 7(4), 607-614.
Clarke, G., & Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4), 568-581.
Contardo, C., Cordeau, J. F., & Gendron, B. (2014). A GRASP+ ILP-based metaheuristic for the capacitated location-routing problem. Journal of Heuristics, 20(1), 1-38.
Cornuejols, G., & Harche, F. (1993). Polyhedral study of the capacitated vehicle routing problem. Mathematical Programming, 60(1-3), 21-52.
Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80-91.
Duhamel, C., Lacomme, P., Prins, C., & Prodhon, C. (2010). A GRASP× ELS approach for the capacitated location-routing problem. Computers & Operations Research, 37(11), 1912-1923.
Escobar, J. W., Linfati, R., & Toth, P. (2013). A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. Computers & Operations Research, 40(1), 70-79.
Escobar, J. W., Linfati, R., Toth, P., & Baldoquin, M. G. (2014). A hybrid granular tabu search algorithm for the multi-depot vehicle routing problem. Journal of Heuristics, 20(5), 483-509.
Fourer, R., Gay, D. M., & Kernighan, B. W. Ampl: a modeling language for mathematical programming. 2002. Duxbury Press.
Gendreau, M., Potvin, J. Y., Bräumlaysy, O., Hasle, G., & Løkketangen, A. (2008). Metaheuristics for the vehicle routing problem and its extensions: A categorized bibliography. In The vehicle routing problem: latest advances and new challenges (pp. 143-169). Springer US.
Hemmelmayr, V. C., Cordeau, J. F., & Crainic, T. G. (2012). An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Computers & Operations Research, 39(12), 3215-3228.
ILOG, S. (2008). CPLEX optimization subroutine library guide and reference. System v11. 0 User’s Guide.
Jansen, K. (1993). Bounds for the general capacitated routing problem. Networks, 23(3), 165-173.
Lavorato, M., Franco, J. F., Rider, M. J., & Romero, R. (2012). Imposing radiality constraints in distribution system optimization problems. IEEE Transactions on Power Systems, 27(1), 172-180.
Letchford, A. N., & Salazar-González, J. J. (2016). Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem. European Journal of Operational Research, 251(1), 74-84.
Magnanti, T. L., Monma, C. L., & Nemhauser, G. L. (1995). Network routing (Vol. 8). M. O. Ball (Ed.). Amsterdam: North-Holland.
Melechovský, J., Prins, C., & Calvo, R. W. (2005). A metaheuristic to solve a location-routing problem with non-linear costs. Journal of Heuristics, 11(5-6), 375-391.
Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulation of traveling salesman problems. Journal of the ACM (JACM), 7(4), 326-329.
Nagy, G., & Salhi, S. (2007). Location-routing: Issues, models and methods. European Journal of Operational Research, 177(2), 649-672.
Prado, R. S., Silva, R. C. P., Neto, O. M., Guimarães, F. G., Sanches, D. S., London, J. B. A., & Delbem, A. C. (2014). Differential evolution using ancestor tree for service restoration in power distribution systems. Applied Soft Computing, 23, 498-508.
Prodhon, C. (2011). A hybrid evolutionary algorithm for the periodic location-routing problem. European Journal of Operational Research, 210(2), 204-212.
Prins, C. (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research, 31(12), 1985-2002.
Prins, C., Prodhon, C., Ruiz, A., Soriano, P., & Wolfler Calvo, R. (2007). Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science, 41(4), 470-483.
Ralphs, T. K., Kopman, L., Pulleyblank, W. R., & Trotter, L. E. (2003). On the capacitated vehicle routing problem. Mathematical Programming, 94(2), 343-359.
Salhi, S., & Rand, G. K. (1989). The effect of ignoring routes when locating depots. European journal of operational research, 39(2), 150-156.
Ting, C. J., & Chen, C. H. (2013). A multiple ant colony optimization algorithm for the capacitated location routing problem. International Journal of Production Economics, 141(1), 34-44.
Toth, P., & Tramontani, A. (2008). An integer linear programming local search for capacitated vehicle routing problems. In The Vehicle Routing Problem: Latest Advances and New Challenges (pp. 275-295). Springer US.
Toth, P., & Vigo, D. (Eds.). (2014). Vehicle routing: problems, methods, and applications. Society for Industrial and Applied Mathematics.
Yu, B., Yang, Z. Z., & Yao, B. (2009). An improved ant colony optimization for vehicle routing problem. European Journal of Operational Research, 196(1), 171-176.