A LP-based heuristic for a time-constrained routing problem

European Journal of Operational Research

Volumn 173, Issue 1, 2006, Pages 120-124

  Avella, Pasquale ^a   D'Auria, Bernardo ^b   Salerno, Saverio ^b  

^a UNIVERSITY OF SANNIO   (Italy)

^b UNIVERSITY OF SALERNO   (Italy)

Author keywords

Column and row generation; Set packing; Time constrained routing

Indexed keywords

CONSTRAINT THEORY; HEURISTIC METHODS; RELAXATION PROCESSES; WORLD WIDE WEB;

COLUMN-AND-ROW GENERATION; SET PACKING; SET PACKING PROBLEM; TIME CONSTRAINED ROUTING;

PROBLEM SOLVING;

EID: 33646083682     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.09.055     Document Type: Article

References (13)

1. Agarwal Y., Mathur K., and Salkin H.M. A set-partitioning-based exact algorithm for the vehicle routing problem. Networks 19 (1989) 731-749
2. Ascheuer N., Fischetti M., and Grotschel M. Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming A 90 3 (2001) 475-506
3. Atamturk A., Nemhauser G.L., and Saverlsbergh M.W.P. Conflict graphs in solving integer programming problems. European Journal of Operational Research 121 (2000) 40-55
4. Avella P., Boccia M., and Sforza A. Solving a fuel delivery problem by heuristic and exact approaches. European Journal of Operations Research 152 1 (2004) 170-179
5. P. Avella, A. Sassano, I. Vasil'Ev, Computational experience with large scale p-Median problems, Technical Report 20/02 DIS-Universitá di Roma "La Sapienza", 2003, electronic version available at www.optimization-online.org.
6. Bramel J., and Simchi-Levi D. On the effectiveness of set partitioning formulations for the vehicle routing problem. Operations Research 45 (1997) 295-301
7. Cplex Reference Manual, Release 9.0, ILOG, 2004.
8. Desrosiers J., Dumas Y., Solomon M.M., and Soumis F. Time constrained routing and scheduling in network routing. In: Ball M.O., Magnanti T.L., Monma C.L., and Nemhauser G.L. (Eds). Handbooks in OR&MS, vol. 8 (1995), Elsevier 35-139
9. Hoffman K.L., and Padberg M. Solving airline crew scheduling problems by branch-and-cut. Management Science 39 6 (1993) 657-682
10. Kelly J.P., and Xu J. A set-partitioning-based heuristic for the vehicle routing problem. INFORMS Journal on Computing 11 (1999) 161-172
11. Kindervater G., Lenstra J.K., and Saverlsbergh M.W.P. Parallel local search for the time-constrained traveling salesman. European Journal of Operational Research 33 (1988) 65-81
12. Saverlsbergh M.W.P. Local search in routing problems with time windows. Annals of Operations Research 4 (1985) 285-305
13. P. Toth, D. Vigo, The vehicle routing problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 2002.