Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery

Optimization Letters

Volumn 7, Issue 7, 2013, Pages 1569-1581

  Subramanian, Anand ^a,b   Uchoa, Eduardo ^b   Pessoa, Artur Alves ^b   Ochi, Luiz Satoru ^b  

^a FEDERAL UNIVERSITY OF PARAÍBA   (Brazil)

^b FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

Column generation; Cutting planes; Simultaneous pickup and delivery; Vehicle routing

Indexed keywords

COLUMN GENERATION; CUTTING PLANES; PICKUP AND DELIVERY; SIMULTANEOUS PICKUP AND DELIVERIES; VEHICLE ROUTING PROBLEMS;

BENCHMARKING; NETWORK ROUTING; VEHICLE ROUTING;

ROUTING ALGORITHMS;

EID: 84884675204     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-012-0570-9     Document Type: Article

References (15)

1. Berbeglia, G., Cordeau, J. F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. Top 15, 1-31 (2007).
2. Christofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Program. 20, 255-282 (1981).
3. Dell'Amico, M., Righini, G., Salani, M.: A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transp. Sci. 40(2), 235-247 (2006).
4. Dethloff, J.: Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektr. 23, 79-96 (2001).
5. Fukasawa, R., Longo, H., Lysgaard, J., de Aragão, P. M., Reis, M., Uchoa, E., Werneck, R. F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Program. 106, 491-511 (2006).
6. Gajpal, Y., Abad, P.: An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup. Comput. Oper. Res. 36(12), 3215-3223 (2009).
7. Lysgaard, J.: A package of separation routines for the capacited vehicle routing problem. Technical report. www. hha. dk/lys/CVRPSEP. htm (2003).
8. Lysgaard, J., Letchford, A. N., Eglese, R. W.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100, 423-445 (2004).
9. Montané, F. A. T., Galvão, R. D.: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comput. Oper. Res. 33(3), 595-619 (2006).
10. Salhi, S., Nagy, G.: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J. Oper. Res. Soc. 50, 1034-1042 (1999).
11. Subramanian, A., Drummond, L. M. A., Bentes, C., Ochi, L. S., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37(11), 1899-1911 (2010).
12. Subramanian, A., Uchoa, E., Ochi, L. S.: New lower bounds for the vehicle routing problem with simultaneous pickup and delivery. In: Proceedings of the 9th International Symposium on Experimental Algorithms (SEA). Lecture Notes in Computer Science, pp. 276-287 (2010).
13. Subramanian, A., Uchoa, E., Ochi, L. S.: New lower bounds for the vehicle routing problem with simultaneous pickup and delivery. Technical Report 01/10, UFF, Niterói, Brazil (2010).
14. Subramanian, A., Uchoa, E., Pessoa, A. A., Ochi, L. S.: Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery. Oper. Res. Lett. 39(5), 338-341 (2011).
15. Zachariadis, E. E., Kiranoudis, C. T.: A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries. Expert Syst. Appl. 38(3), 2717-2726 (2011).