A robust method for the VRPTW with multi-start simulated annealing and statistical analysis

Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007

Volumn , Issue , 2007, Pages 198-205

  De Oliveira, H C B ^a   Vasconcelos, G C ^a   Alvarenga, G B ^b   Mesquita, R V ^b   De Souza, M M ^a  

^a FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

^b FEDERAL UNIVERSITY OF LAVRAS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; LINEAR REGRESSION; PARAMETER ESTIMATION; ROUTING ALGORITHMS; SIMULATED ANNEALING; STATISTICAL METHODS; TRANSPORTATION CHARGES;

ROBUST METHOD; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW);

ROBUST CONTROL;

EID: 34548735223     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCIS.2007.367690     Document Type: Conference Paper

References (28)

1. G. B. Alvarenga. G. R. Mateus. A Two-Phase Genetic and Set Partitioning Approach for the Vehicle Routing Problem with Time Windows. Fourth International Conference on Hybrid Intelligent Systems (HIS04). IEEE Computer Society Press. (2004).
2. G. B. Alvarenga. A Hybrid algorithm for the static and dynamic vehicle routing problems with time Windows. PhD Thesis. Department of Science Computer. Federal University of Minas Gerais .Brazil (2005).
3. De Backer, B. and V. Furnon, "Meta-heuristics in Constraint Programming Experiments with Tabu Search on the Vehicle Routing Problem", presented at the Second International Conference on Metaheuristics (MIC'97), Sophia Antipolis, France (1997).
4. T. H. Cormen; C. E. Leiserson; R. L. Rivest: Introduction to algorithms. The MIT Press. (1999).
5. G. B. Dantzig. R. H. Ramser; The Truck Dispatching Problem Management Science. 6. 80 (1959).
6. E. Eiben; J. E. Smith. Introduction to Evolutionary Computing. Natural Computing Series. MIT Press. Springer. Berlin. (2003).
7. G.F.King; C.F. Mast; Excess Travel: Causes. Extent and Consequences; Transportation Research Record 1111. 126-134. (1997).
8. Kirkpatrick. S.. Gellat. D. Vecchi. M. P.. Optimizations by Simulated Annealing. Science v. 220. pp. 671-680. 1983.
9. J. Larsen; Parallelization of the vehicle routing problem with time windows. Phd Thesis. Department of Mathematical Modeling. Technical University of Denmark. (1999).
10. J. Lenstra; A. Rinnooy Kan; Complexity of vehicle routing and scheduling problems. Networks 11. 221-227. (1981).
11. H.C.B. de Oliveira. M.M. de Souza. G.B. Alvarenga. R.M.A. Silva. "An adaptation of a genetic algorithm for the vehicle routing problem with time windows". Infocomp Journal of Computer Science, pp. 51-58. (2004).
12. H.C.B. de Oliveira. G.C. Vasconcelos. G.B. Alvarenga. An evolutionary approach for the vehicle routing problem with time windows. XXXVII SBPO - Brazilian Symposium on Operations Research. Gramado - Brazil (2005).
13. Papadimitriou. C. H; Steiglitz. K. "Combinatorial Optimization - Algorithms and Complexity". Dover Publicationsm INC. (1982).
14. Stuart J. Russell and Peter Norvig. editors. Artificial Intelligence: A Modern Approach. Prentice Hall. 2003.
15. M. M. Solomon; Algorithms for the vehicle routing problem and scheduling problem with time window constraints. (1987).
16. S. R. Thangiah. I. H. Osman. T. Sun. Hybrid Genetic Algorithm Simulated Annealing and Tabu Search Methods for Vehicle Routing Problem with Time Windows. Technical Report 27. Computer Science Department. Slippery Rock University. (1994).
17. Y. Rouchat and E. D. Taillard; Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics 1. 147-167.(1995).
18. P. Shaw; Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. Principles and Practice of Constraint Programming - CP98. Lecture Notes in Computer Science. 417-431. M. Maher and J.-F.Puget (eds). Springer-Verlag (1998).
19. J. F. Cordeau. G. Laporte. and A. Mercier; A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows. Working Paper CRT-00-03. Centre for Research on Transportation. Montreal. Canada. (2000).
20. Kilby, P., P. Prosser and P. Shaw, "Guided Local Search for the Vehicle Routing Problem with Time Windows", in META- HEURISTICS Advances and Trends in Local Search Paradigms for Optimization, S. Voss, S. Martello, H. Osman and C. Roucairol (eds), 473-486, Kluwer Academic Publishers, Boston. (1999)
21. Riise, A., M. Stølevik, "Implementation of Guided Local Search for the Vehicle Routing Problem", SINTEF Internal report STF42 A99013, SINTEF Applied Mathematics, Norway. (1999)
22. Bräysy, O. and M. Gendreau. Metaheuristics for the Vehicle Routing Problem with Time Windows. Internal Report STF42 A01025, SINTEF Applied Mathematics, Department of Optimization, Norway. (2001)
23. Bräysy, O. and M. Gendreau, "Route Construction and Local Search Algorithms for the Vehicle Routing Problem with Time Windows", Internal Report STF42 A01024, STNTEF Applied Mathematics, Department of Optimisation, Norway. (2001)
24. Bräysy, O., W. Dullaert and M. Gendreau. Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows. Internal Report STF90 A04406, SINTEF ICT, Department of Optimization, Norway. (2004)
25. Chambers, J. M., Freeny, A., Heiberger, R. M. Analysis of variance; designed experiments. Chapter 5 of Statistical Models in S eds J. M. Chambers and T. J. Hastie, Wadsworth & Brooks/Cole. (1992).
26. Searle, S. R. Linear models. New York: J. Wiley. (1971).
27. Patrick Royston (1995) A Remark on Algorithm AS 181: The W Test for Normality. Applied Statistics, 44, 547-551. (1995).
28. T. Ibaraki, M. Kubo, T. Masuda, T. Uno and M. Yagiura, "Effective Local Search Algorithms for the Vehicle Routing Problem with General Time Windows," Working Paper, Department of Applied Mathematics and Physics, Kyoto University, Japan, (2001).