New lower bounds for the vehicle routing problem with simultaneous pickup and delivery

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

Volumn 6049 LNCS, Issue , 2010, Pages 276-287

  Subramanian, Anand ^a   Uchoa, Eduardo ^a   Ochi, Luiz Satoru ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

Commodity flow formulations; Simultaneous pickup and delivery; Vehicle routing

Indexed keywords

BENCH-MARK PROBLEMS; BRANCH-AND-CUT; CAPACITATED VEHICLE ROUTING PROBLEM; COMMODITY FLOW; LOWER BOUNDS; OPEN PROBLEMS; OPTIMAL SOLUTIONS; PICKUP AND DELIVERY; SIMULTANEOUS PICKUP AND DELIVERY; VEHICLE ROUTING PROBLEMS;

PICKUPS; ROUTING ALGORITHMS; STRAIN MEASUREMENT;

VEHICLES;

EID: 78650668078     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13193-6_24     Document Type: Conference Paper

References (13)

1. Min, H.: The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Research 23(5), 377-386 (1989).
2. Dell'Amico, M., Righini, G., Salani, M.: A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transportation Science 40(2), 235-247 (2006).
3. Angelelli, E., Mansini, R.: A branch-and-price algorithm for a simultaneous pick-up and delivery problem. In: Quantitative Approaches to Distribution Logistics and Supply Chain Management, pp. 249-267. Springer, Heidelberg (2002).
4. Dethloff, J.: Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum 23, 79-96 (2001).
5. Montané, F.A.T., Galvão, R.D.: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers & Operations Research 33(3), 595-619 (2006).
6. Baldacci, R., Hadjiconstantinou, E., Mingozzi, A.: An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Operations Research 52(5), 723-738 (2004).
7. Lysgaard, J.: A package of separation routines for the capacited vehicle routing problem. Technical report (2003), http://www.asdb.dk/~lys.
8. Toth, P., Vigo, D.: Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Applied Mathematics 123, 487-512 (2002).
9. Gavish, B., Graves, S.: The traveling salesman problem and related problems. Working Paper (1979).
10. Gouveia, L.: A result on projection for the vehicle routing problem. European Journal of Operational Research 85, 610-624 (1995).
11. Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming 100, 423-445 (2004).
12. Salhi, S., Nagy, G.: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. Journal of the Operational Research Society 50, 1034-1042 (1999).
13. 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. Computers & Operations Research (to appear, 2010).