An exponential (matching based) neighborhood for the vehicle routing problem

Journal of Combinatorial Optimization

Volumn 15, Issue 2, 2008, Pages 179-190

  Angel, Eric ^a   Bampis, Evripidis ^a   Pascual, Fanny ^a  

^a UNIVERSITY OF EVRY   (France)

Author keywords

Exponential neighborhood; Local search; Matching; Vehicle routing problem

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; CUSTOMER SATISFACTION; POLYNOMIALS; VEHICLE ROUTING;

CUSTOMERS' DEMANDS; EXPONENTIAL NEIGHBORHOOD; LOCAL SEARCH;

PROBLEM SOLVING;

EID: 37749021180     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-007-9075-3     Document Type: Article

References (15)

1. Aarts E, Lenstra JK (1997) Local search in combinatorial optimization. Wiley, New York
2. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, New York
3. Ahuja RK, Ergun Ö, Orlin JB, Punnen AP (2002) A survey of very large-scale neighborhood search techniques. Discret Appl Math 123:75-102
4. Angel E, Bampis E, Pascual F, Warnier J (2006) Restricted matchings and efficient exploration of an exponential neighborhood for the vehicle routing problem. Technical Report IBISC RR 2006-01, IBISC, Université d'Evry Val d'Essonne, France
5. Congram RK, Potts CN, van de Velde SL (2002) An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS J Comput 14(1):52-67
6. Deineko VG, Woeginger GJ (2000) A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. Math Program Ser A 87:519-542
7. Ergun O, Orlin JB, Feldman AS (2002) Creating very large scale neighborhoods out of smaller ones by compounding moves: a study on the vehicle routing problem. MIT Sloan Working Paper No. 4393-02, October 2002
8. Garey MR, Johnson DS (1979) Computers and intractability. A guide to the theory of NP-completeness. Freeman, San Francisco
9. Gutin G (1999) Exponential neighbourhood local search for the traveling salesman problem. Comput Oper Res 26:313-320. Special issue on the traveling salesman problem
10. Gutin G, Yeo A, Zverovitch A 2002 Exponential neighborhoods and domination analysis for the TSP. In Gutin G, Punnen AP (eds) Traveling salesman problem and its variations. Kluwer, Dordrecht, pp 223-256
11. Hurink J (1999) An exponential neighborhood for a one-machine batching problem. OR Spectr 21(4):461-476
12. Itai A, Rodeh M, Tanimoto SL (1978) Some matching problems for bipartite graphs. J ACM 25:517-525
13. Thompson PM, Psaraftis HN (1993) Cyclic transfer algorithms for multivehicle routing and scheduling problems. Oper Res 41:935-946
14. Toth P, Vigo D (2001) The vehicle routing problem. SIAM, Philadelphia
15. Xu J, Kelly JP (1996) A network flow-based tabu search heuristic for the vehicle routing problem. Transport Sci 30:379-393