VRP

Main Resources Benchmarks Projects Bibliography

Electronically available papers

In case you have other electronically available papers than listed on this page, please send an email.

Ahmed, S. (2003). Parallel Tabu Search for a Pickup and Delivery Problem Under Track Contention. Presented at the Symposium on Parallel Computing, University of Manitoba, U.S.A.
Archetti, C., A. Hertz and M.G. Speranza (2003). A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Les Cahiers du GERAD G-2003-18. Group for Research in Decision Analysis, Montreal, Canada.
Amberg, A., W. Domschke and S. Voss (2000). Multiple Center Capacitated Arc Routing Problems: A Tabu Search Algorithm using Capacitated Trees. European Journal of Operational Research 124, 360-376.
Amberg, A. and Stefan Voss (2002). A Hierarchical Relaxations Lower Bound for the Capacitated Arc Routing Problem. In Proceedings of the 35th Hawaii International Conference on System Sciences.
Anderson,D., E. Anderson, N. Lesh, J. Marks, B. Mirtich, D. Ratajczak and K. Ryall (2000). Human-Guided Simple Search. In Proceedings of Seventeenth National Conference on Artificial Intelligence. AAAI Press, Menlo Park, CA, USA, 209-216.
Antes, J. and U. Derigs (1995). A New Parallel Tour Construction Algorithm for the Vehicle Routing Problem with Time Windows. Working Paper, Department of Economics and Computer Science, University of Köln, Germany.
Applegate, D., W. Cook, S. Dash and A. Rohe (2002) . Solution of a Min-Max Vehicle Routing Problem. Working Paper, Algorithms and Optimization Department, ATT Labs. INFORMS Journal on Computing 14, 132-143.
Archetti, C., R. Mansini and M.G. Speranza (2001). The Split Delivery Vehicle Routing Problem with Small Capacity. To Appear in Transportation Science.
Attanasio, A., J.-F. Cordeau, G. Ghiani and G. Laporte (2003). Parallel Tabu Search Heuristics for the Dynamic Multi-Vehicle Dial-a-Ride Problem. Working paper, University of Calabria, Italy.
Bachem, A., W. Hochstättler and M. Malich (1996). The Simulated Trading Heuristic for Solving Vehicle Routing Problems. Discrete Applied Mathematics 65, 47-72.
Badeau, P., M. Gendreau, F. Guertin, J.-Y. Potvin and E. Taillard (1997). A Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows. Transportation Research - C 5, 109-122.
B ard, J.F., G. Kontoravdis and G. Yu (2002). A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows. Transportation Science 36:2, 250-269.
Bartling, U. and H. Mühlenbein (1997). Optimization of Large Scale Parcel Distribution Systems by the Breeder Genetic Algorithm. In Proceedings of Seventh International Conference on Genetic Algorithms (ICGA-97), Morgan Kaufmann, 473-480.
Beasley, J.E. and E.M. Nascimento (1996). The Vehicle Routing-Allocation Problem: A Unifying Framework. Top 4, 65-86.
Beasley, J.E. (1997). OR-Notes: Vehicle Routing. Introductory notes in Operations Research, Imperial College, Management School, London, England.
Beck, J.C., P. Prosser and E. Selensky (2002). On the Reformulation of Vehicle Routing Problems and Scheduling Problems. In Proceedings of SARA 2002, Symposium on Abstraction, Reformulation and Approximation, Springer, LNCS 2371, 282-289.
Beck, J.C., P. Prosser and E. Selensky (2003). Vehicle Routing and Job Shop Scheduling: What's the difference? In Proceedings of the 13th International Conference on Automated Planning & Scheduling, Trento (Italy), June 9-13 2003.
Belangue, J.M., E. Benavent and M.C. Martinez (2001). RutaRep: A Computer Package to Design Dispatching Routes in the Meat Industry. Technical Report TR07-2001, Department of Statistics and Operations Research, University of Valencia, Spain.
Bent, R. and P. Van Hentenryck (2001) . A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows. To Appear in Transportation Science.
Berger, J. and M. Barkaoui (2002). A Memetic Algorithm for the Vehicle Routing Problem with Time Windows. Presented at the 7th International Command and Control Research and Technology Symposium.
Bertsimas, D. and D. Simchi-Levi (1996). The New Generation of Vehicle Routing Research: Robust Algorithms Addressing Uncertainty. Operations Research 44, 286-304.
Bianchi, L. (2000). Notes on Dynamic Vehicle Routing - The State of Art. Technical Report, IDSIA-05-01, IDSIA, Switzerland.
Blasum, U. and W. Hochstättler (2000). Application of the Branch and Cut Method to the Vehicle Routing Problem. Technical Report zaik2000-386, Centre of Applied Computer Science, University of Cologne, Germany.
Bracca, J., J. Bramel and D. Simchi-Levi (1994). A Computerized Approach to the New York City School Bus Routing Problem. IIE Transactions 29, 693-702.
Bramel, J. and D. Simchi-Levi (1992). Probabilistic Analysis and Practical Algorithms for the Vehicle Routing Problem with Time Windows. Operations Research 44, 501-509.
Bramel, J. and D. Simchi-Levi (1995). A Location Based Heuristic for General Routing Problems. Operations Research 43, 649-660.
Bramel, J. and D. Simchi-Levi (1997). On the Effectiveness of Set Partioning Formulations for the Vehicle Routing Problem. Operations Research 45, 295-301.
Bräysy, O. (1999). A New Algorithm for the Vehicle Routing Problem with Time Windows Based on the Hybridization of a Genetic Algorithm and Route Construction Heuristics. Proceedings of the University of Vaasa , Research papers 227.
Bräysy, O., J. Berger and M. Barkaoui (2000). A New Hybrid Evolutionary Algorithm for the Vehicle Routing Problem with Time Windows. Presented at the Route 2000 Workshop, Skodsborg, Denmark.
Bräysy, O. (2001). Genetic Algorithms for the Vehicle Routing Problem with Time Windows. Arpakannus 1, 33-38 (special issue on Bioinformatics and Genetic Algorithms).
Bräysy, O. and M. Gendreau (2001). Genetic Algorithms for the Vehicle Routing Problem with Time Windows. Internal Report STF42 A01021, SINTEF Applied Mathematics, Department of Optimisation, Oslo, Norway.
Bräysy, O. and M. Gendreau (2002). Tabu Search Heuristics for the Vehicle Routing Problem with Time Windows. Top 10:2, 211-238.
Bräysy, O. and M. Gendreau (2003) . Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms. To Appear in Transportation Science.
Bräysy, O. and M. Gendreau (2003) . Vehicle Routing Problem with Time Windows, Part II: Metaheuristics. To Appear in Transportation Science.
Bräysy, O., M. Gendreau and W. Dullaert (2003). Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows. To Appear in Journal of Heuristics.
Bräysy, O., G. Hasle and W. Dullaert (2003). A Multi-Start Local Search Algorithm for the Vehicle Routing Problem with Time Windows. European Journal of Operational Research 159 (2004) 586-605.
Bräysy, O., G. Hasle, J. Berger and M. Barkaoui (2003). Systematic Diversification Metaheuristic for the Vehicle Routing Problem with Time Windows. Working Paper, SINTEF Applied Mathematics, Department of Optimization, Norway.
Bullnheimer, B., R.F. Hartl and C. Strauss (1997). An Improved Ant System Algorithm for the Vehicle Routing Problem. Presented at the Sixth Viennese workshop on Optimal Control, Dynamic Games, Nonlinear Dynamics and Adaptive Systems, Vienna (Austria), May 21-23, 1997.
Bullnheimer, B., R.F. Hartl and C. Strauss (1999) . Applying the Ant System to the Vehicle Routing Problem. In: Voss S et al., editors. Meta-heuristics: advances and trends in local search paradigms for optimization. Boston: Kluwer
Burchett, D. and E. Campion (2002). Mix Fleet Vehicle Routing Problem - An Application of Tabu Search in the Grocery Delivery Industry. Research Paper, University of Canterbury, New Zealand.
Campbell, A., L. Clarke, A. Kleywegt and M. Savelsbergh (1997). The Inventory Routing Problem. In Fleet Management and Logistics, Crainic and G. Laporte (eds.). Kluwer Academic Publishers, 95-113.
Campbell, A., M. Savelsbergh and L. Clarke (2002). Inventory Routing in Practice. In The Vehicle Routing Problem , P.Toth and D.Vigo (eds.), SIAM monographs on discrete mathematics and applications, 309-330.
Caseau, Y. and F. Laburthe (1998). A Fast Heuristic for Large Routing Problems. Presented at IFORS 98.
Chalasani, P. and R. Motwani (1995). Approximating Capacitated Routing and Delivery Problems. SIAM Journal on Computing 28, 2133-2149.
Charikar, M. and B. Raghavachari (1998). The Finite Capacity Dial-A-Ride Problem. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS), November 1998.
Charikar, M., S. Khuller and B. Raghavachari (2001). Algorithms for Capacitated Vehicle Routing. SIAM Journal on Computing 31, 665-682.
Cheung, R.K.M. and W.B. Powell (1996). Models and Algorithms for Distribution Problems with Uncertain Demands. Transportation Science 30, 43-59.
Christiansen, M., K. Fagerholt and D. Ronen (2003). Ship Routing and Scheduling - Status and Trends. Accepted for publication in Transportation Science.
Chuin, L.H. and D.S. Vei Ming (1998). An Efficient Technique for Routing of Vehicles Reactively. In Proceedings of 8th ITSA Annual Meeting and Exposition , Detroit, Michigan, May 1998.
Coffman Jr., E.G. and P.W. Shor (1990). An Asymptotic Probabilistic Analysis of Vehicle Routing. Memorandum, AT&T Bell Labs.
Cook, W. and J.L. Rich (1999). A Parallel Cutting-Plane Algorithm for the Vehicle Routing Problem with Time Windows. Technical Report TR99-04. Department of Computational and Applied Mathematics, Rice University, USA.
Corberan, A., E. Fernandez, M. Lagunay and R. Marti (2000). Heuristic Solutions to the Problem of Routing School Buses with Multiple Objectives. Technical Report TR08-2000, Department of Statistics and Operations Research, University of Valencia, Spain.
Cordeau, J.-F., G. Desaulniers, J. Desrosiers, M.M. Solomon and F. Soumis (2001). The VRP with Time Windows. In The Vehicle Routing Problem, Paolo Toth and Daniele Vigo (eds), SIAM Monographs on Discrete Mathematics and Applications, 157-193.
Cordeau, J.-F., G. Laporte and A. Mercier (2003). An Improved Tabu Search Algorithm for the Handling of Route Duration Constraints in Vehicle Routing Problems with Time Windows. Working Paper, University of Montreal, Canada.
Cordone R. and R. Wolfler-Calvo (2001). A Heuristic for the Vehicle Routing Problem with Time Windows. Journal of Heuristics 7, 107-129.
Cortez, E., R. Meek and J. Koger (1994). GIS to Support Vehicle Routing in Public Education. Working Paper, Information Technology Division, Los Angeles Unified School District.
Cousineau-Ouimet, K. (2002). A Tabu Search Heuristic for the Inventory Routing Problem. Presented at the 37th Annual ORSNZ conference, Auckland, New Zealand.
Crino, J.R., J.T. Moore, J.W. Barnes and W.P. Nanry (2003). Solving the Theater Distribution Vehicle Routing and Scheduling Problem Using Group Theoretic Tabu Search. To Appear in Mathematical and Computer Modeling.
Czech, Z. and P. Czarnas (2002). Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows. In Proceedings of 10th Euromicto Workshop on Parallel Distributed and Network-Based Processing, Canary Islands, Spain, 376-383.
De Backer, B. and V. Furnon (1997). 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.
De Jong, C., G. Kant and A. Van Vliet (1997). Efficient Implementations of the Savings Method for the Vehicle Routing Problem with Time Windows. Manuscript, Department of Computer Science, Utrecht University, Holland.
De Jong, C., G. Kant and A. Van Vliet (1996). On Finding Minimal Route Duration in the Vehicle Routing Problem with Multiple Time Windows. Manuscript, Department of Computer Science, Utrecht University, Holland.
De Paepe, W. (2002). Complexity Results and Competitive Analysis for Vehicle Routing Problems. PhD Thesis, Technical University of Eindhoven, Netherlands.
Derigs, U., M. Kabath and M. Zils (1998). Adaptive Genetic Algorithms: A New Approach for Solving Nonstandard Vehicle Routing Problems Efficiently. In Operations Research Proceedings 1997, P. Kischka, H.-W. Lorenz, U. Derigs, W. Domschke, P. Kleinschmidt, R. Möhring (eds.), 539-544.
Desaulniers, G., M. Hickman (2003). Public Transit. Les Cahiers du GERAD G-2003-77. Group for Research in Decision Analysis, Montreal, Canada.
Desrochers, M., C.V. Jones, J.K. Lenstra, M.W.P. Savelsbergh and L. Stougie (1998). Towards a Model and Algorithm Management System for Vehicle Routing and Scheduling Problems. Decision Support Systems Journal 25, 109-133.
Diaz, A., V. Vazquez and G. Wainer (2001). Vehicle Routing in Cell-Devs Models of Urban Traffic. In Proceedings of European Simulation Symposium. Marseille, France.
Doerner, K., M. Gronalt, R.F. Hartl and M. Reimann (2000). Time Constrained Full Truckload Transportation: Optimizing Fleet Size and Vehicle Movements. Working Paper, Department of Management Science, University of Vienna, Austria.
Doerner, K., R.F. Hartl and M. Reimann (2000). Ant Colony Optimization applied to the Pickup and Delivery Problem. Working Paper, Department of Management Science, University of Vienna, Austria.
Doerner, K., R.F. Hartl and M. Reimann (2001). A hybrid ACO algorithm for the Full Truckload Transportation Problem. Working Paper, Department of Management Science, University of Vienna, Austria.
Donati A. V., Montemanni R., Casagrande N., Rizzoli A. E., Gambardella L. M. (2003). Time Dependent Vehicle Routing Problem with Multi a Ant Colony System. Technical Report IDSIA-17-03.
Donati A. V. , Montemanni R. , Gambardella L. M., Rizzoli A. E. (2003). Integration of a Robust Shortest Path Algorithm with a Time Dependent Vehicle Routing Model and Applications. Technical Report IDSIA 08-03, presented at CIMSA 2003
Dullaert, W. and O. Bräysy (2003). Routing with Relatively few Customers per Route. Top 11:2, 325-336.
Duncan, T. (1995). Experiments in the Use of Neighbourhood Search Techniques for Vehicle Routing. Working paper, Artificial Intelligence Applications Institute, University of Edinburgh, Scotland.
Eklund, P.W., S. Kirkby and S. Pollitt (1996). A Dynamic Multi-source Dijkstra's Algorithm for Vehicle Routing. Australian and New Zealand Conference on Intelligent Information Systems. IEEE Press, 329-333.
El-Sherbeny, N.A., J. Teghem and D. Tuyttens (2002). A Multi-objective Routing Problem Solved by Simulated Annealing. Working Paper, University of Tours, France.
Erera, A. and C. Daganzo (2003). A Dynamic Scheme for Stochastic Vehicle Routing. Working paper. Georgia Institute of Technology, U.S.A.
Fawcett, J. and P. Robinson (2000). Adaptive Routing for Road Traffic. IEEE Computer Graphics and Applications 20(3), 46-53.
Ferreira, C.E. and M. Loparic (1997). A Branch-and-Cut Algorithm for a Vehicle Routing Problem with Capacity and Time Constraints. Working paper, Department of Computer Science, Institute of Mathematics and Statistics, University of Sao Paulo, Brasil.
Gambardella L.M. (2000). Vehicle Routing Problems. Short Course, Technical University of Eindhoven.
Gambardella L. M., Rizzoli A. E., Oliviero F., Casagrande N., Donati A. V., Montemanni R., Lucibello E. (2003). Ant Colony Optimization for Vehicle Routing in Advanced Logistic Systems. Presented at MAS2003, Bereggi (Italy).
Gambardella, L.M., E. Taillard and G. Agazzi (1999). MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. In New Ideas in Optimization , D. Corne, M. Dorigo and F. Glover (eds.), 63-76, McGraw-Hill, London.
Gehring, H. and J. Homberger (1999). A Parallel Hybrid Evolutionary Metaheuristic for the Vehicle Routing Problems with Time Windows. In Proceedings of EUROGEN99 - Short Course on Evolutionary Algorithms in Engineering and Computer Science, Reports of the Department of Mathematical Information Technology, Series A. Collections, No. A 2/1999, K. Miettinen, M. Mäkelä and J. Toivanen (eds), 57-64, University of Jyväskylä, Finland.
Gelogullari, C.A. (2001). An Exact Algorithm for the Vehicle Routing Problem with Backhauls. Thesis Presentation, Bilkent University, Turkey.
Gendreau, M., G. Laporte and J.-Y. Potvin (1998). Metaheuristics for the Vehicle Routing Problem. Les Cahiers du Gerad G-98-52, Group for Research in Decision Analysis, Montreal, Canada.
Giaglis, G. M., Minis, I.,Tatarakis, A., Zeimpekis, V. (2004), Minimizing Logistics Risk through Real-Time Vehicle Routing and Mobile Technologies: Research To-Date and Future Trends. International Journal of Physical Distribution and Logistics Management, Vol 34, No. 9, pp. 749-764.
Golden, B., G. Laporte and E. Taillard (1997). An Adaptive Memory Heuristic for a Class of Vehicle Routing Problems with Minmax Objective. Computers & Operations Research 24, 445-452.
Greistorfer, P. (2002). A Tabu Scatter Search Metaheuristic for the Arc Routing Problem. Working Paper, Karl-Franzens-Universität, Austria.
Gribkovskaia, I., Halskau, O., Bugge, M., Kim, N. (2002) Models for Pick-Up and Deliveries from Depots with Lasso Solutions. Working Paper, Molde University College, Norway.
Gronalt, M., R.F. Hartl and M. Reimann (2002). New Savings Based Algorithms for Time Constrained Pickup and Delivery of Full Truckloads. To Appear in European Journal of Operational Research.
Guan, D.J. and X. Zhu (1998). Multiple Capacity Vehicle Routing on Paths. SIAM Journal on Discrete Mathematics 11, 590-602.
Hajri-Gabouj, S. and S. Darmoul (2003). A Hybrid Evolutionary Approach for a Vehicle Routing Problem with Double Time Windows for the Depot and Multiple Use of Vehicles. Studies in Informatics and Control 12:4, 253-268.
Hall, R.W. and J.G. Partyka (2000). On the Road to Service. OR/MS Today, August 2000, 26-35.
Hamacher, A. and C. Moll (1996). A New Heuristic for Vehicle Routing with Narrow Time Windows. In Operations Research Proceedings 1996, Selected papers of the symposium (SOR`96), Braunschweig, Germany, September 3-6, U. Derigs, W. Gaul, R H. Möhring and K.-P. Schuster (eds), 301-306, Springer Verlag, New York.
Hauptmeier, D., S.O. Krumke and J. Rambau (2000). The Online Dial-a-Ride Problem under Reasonable Load. Theoretical Computer Science , to appear.
Hauptmeier, D., S.O. Krumke, J. Rambau and H.-C. Wirth (2001). Euler is Standing in Line, Dial-a-Ride Problems with Precedence Constraints. Discrete Applied Mathematics 113, 87-107.
Hertz, A. (2002). Recent Trends in Arc Routing. Working Paper, GERAD, University of Montreal, Canada.
Hjorring, C. (1995). The Vehicle Routing Problem and Local Search Metaheuristics, Chapter 2, PhdThesis, Departement of Engineering Science, The University of Auckland.
Ho, S.C. and D. Haugland (2002). A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows and Split Deliveries. Working Paper, Department of Informatics, University of Bergen, Norway.
Homberger, J. and H. Gehring (1999). Two Evolutionary Metaheuristics for the Vehicle Routing Problems with Time Windows. INFOR 37, 297-318.
Hvattum, L.M. (2003). A Heuristic Solution Method for a Stochastic Vehicle Routing Problem. Presented at the Seminar of Optimization Group, Bekkjarvik.
Ibaraki, T., S. Imahori, M. Kubo, T. Masuda, T. Uno and M. Yagiura (2003). Effective Local Search Algorithms for Routing and Scheduling Problems with General Time Window Constraints. To Appear in Transportation Science.
Ichoua S., Gendreau M., Potvin J.-Y. (2003). Vehicle Dispatching With Time-Dependent Travel Times. European Journal of Operational Research 144, 379-396.
Irnich, S. (2000). A Multi-Depot Pickup and Delivery Problem with a Single Hub and Heterogenous Vehicles. European Journal of Operational Research 122, 310-328.
Jacobs-Blecha, C. and M. Goetschalckx (1998). The Vehicle Routing Problem with Backhauls: Properties and Solution Algorithms. Working Paper, School of Industrial and Systems Engineering, Georgia Institute of Technology, USA.
Jaillet, P., J.F. Bard, L. Huang and M. Dror (2001). Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework. To Appear in Tranportation Science.
Jih, W.-R. and J. Hsu (1999). Dynamic Vehicle Routing Using Hybrid Genetic Algorithms. In Proceedings of the 1999 IEEE International Conference on Robotics & Automation, 453-458.
Kallehauge, B., J. Larsen and O.B.G. Madsen (2001). Lagrangean Duality Applied on Vehicle Routing with Time Windows, Experimental Results. Technical Report IMM-TR-2001-9.
Kara, I., G. Laporte and T. Bektas (2003). A Note on the Lifted Miller-Tucker-Zemlin Subtour Elimination Constraints for the Capacitated Vehicle Routing Problem. Les Cahiers du GERAD G-2003-12. Group for Research in Decision Analysis, Montreal, Canada.
Kilby, P., P. Prosser and P. Shaw (1997) . Guided Local Search for the Vehicle Routing Problem. In META-HEURISTICS Advances and Trends in Local Search Paradigms for Optimization , S. Voss, S. Martello, I.H. Osman and C. Roucairol (eds.), Kluwer Academic Publishers, Boston, 473-486.
Kilby, P., P. Prosser and P. Shaw (1998). Dynamic VRPs: A Study of Scenarios. Report APES-06-1998, Computing Science, Glasgow University, Scotland.
Kim, S., M.E. Lewis and C.C. White III (2003). Optimal Vehicle Routing with Real-time Traffic Information. Working Paper, University of Michigan, U.S.A.
Kindervater, G.A.P. and M.W.P. Savelsbergh (1997). Vehicle Routing 2: Handling Edge Exchanges In Local Search in Combinatorial Optimization, E.H.L Aarts and J.K. Lenstra (eds.), Wiley, Chichester, 337-360.
Kindervater, G.A.P., J.K. Lenstra and M.W.P. Savelsbergh (1989). Parallel Local Search for the Time-Constrained Traveling Salesman Problem. Discussion Paper 82, Faculty of Economics, Erasmus University, Rotterdam, Holland.
Kleywegt, A.J., V.S. Nori and M.W.P. Savelsbergh (2002). The Stochastic Inventory Routing Problem with Direct Deliveries. Transportation Science 36, 94-118.
Kleywegt, A.J., V.S. Nori and M.W.P. Savelsbergh (2002). Dynamic Programming Approximations for a Stochastic Inventory Routing Problem. Working paper, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, USA.
Kohout, R. and K. Erol (1999). In-Time Agent-Based Vehicle Routing with a Stochastic Improvement Heuristic. In Proceedings Sixteenth National Conference on Artificial Intelligence . AAAI Press, Menlo Park, USA, 864-869.
Kopher, H. and J. Schönberger (2002). Interactive Solving of Vehicle Routing and Scheduling Problems: Basic Concepts and Qualification of Tabu Search Approaches. In Proceedings of 35th Hawaii International Conference on System Sciences.
Kroon, R. and L. Rothkrantz (2002). Dynamic Vehicle Routing using Ant Based Control. Research Presentation, Delft University of Technology, Netherlands.
Lacomme, P, C. Prins and M. Sevaux (2003). Multiobjective Capacitated Arc Routing Problem. In Proceedings of 2nd International Conference on Evolutionary Multi-Criterion Optimization, Faro, Portugal, 8-11 April 2003, 550-564.
Laporte, G. and F.V. Louveaux (1998). Solving Stochastic Routing Problems with the Integer L-shaped Method. In Fleet Management and Logistics , T.G. Crainic and G. Laporte (eds.), Kluwer Academic Publishers, Boston, 159-167.
Laporte, G., M. Gendreau, J.-Y. Potvin and F. Semet (2000). Classical and Modern Heuristics for the Vehicle Routing Problem. International Transaction in Operational Research 7, 285-300.
Larsen, J. (1999). Parallelization of the Vehicle Routing Problem with Time Windows. Ph.D. thesis, Institute of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark.
Larsen, J. (1999). Vehicle Routing with Time Windows - Finding Optimal Solutions Efficiently. Working Paper, Institute of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark.
Larsen, A. (2000). The Dynamic Vehicle Routing Problem. PhD thesis, Technical University of Denmark, Lyngby, Denmark.
Lau, H.C. and Q.Z. Liu (1999). Collaborative Model and Algorithms for Supporting Real-Time Distribution Logistics Systems. Working paper, School of Computing, National University of Singapore, Singapore.
Lau, H.C., M. Sim and K.M. Teo (2003). Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles. European Journal of Operational Research 148, 559-569.
Lee, C.-G., M.A. Epelman, C.C. White III and Y.A. Bozer (2003). A Shortest Path Approach to the Multiple-Vehicle Routing Problem with Split Pick-Ups. Working Paper, University of Toronto, Canada.
Liu, Q., H.C. Lau, D. Seah and S. Chong (1998). An Efficient Near-Exact Algorithm for Large-Scale Vehicle Routing with Time Windows. In Proceedings of the 5th World Congress on ITS , Korea, October 1998.
Liu, F.-H. and S.-Y. Shen (1999). A Method for Vehicle Routing Problem with Multiple Vehicle Types and Time Windows. In Proceedings of Natural Science Council 23, 526-536.
Louis, S.J., X. Yin and Z.Y. Yuan (1999). Multiple Vehicle Routing with Time Windows Using Genetic Algorithms. Working Paper, University of Nevada, Reno, USA.
Malca, F. and F. Semet (2003). A Tabu Search Heuristic for the Pickup and Delivery Problem with Time Windows and a Fized Size Fleet. Working Paper, University of Valenciennes, France.
Mester, D. and O. Bräysy (2003). Active Guided Evolution Strategies for Large Scale Vehicle Routing Problems with Time Windows. To Appear in Computers & Operations Research.
Moin, N.H. (2002). Hybrid Genetic Algorithms for Vehicle Routing Problem with Time Windows. International Journal of the Computer, the Internet and Management 10.
Montemanni R., Gambardella L. M., Rizzoli A. E., Donati A. V. (2002). A new algorithm for a Dynamic Vehicle Routing Problem based on Ant Colony System. Tech. Rep. IDSIA-23-02, presented at ODYSSEUS 2003.
Muslea, I. (1997). The Very Offline k-Vehicle Routing Problem in Trees. In Proceedings of 17th International Conference of the Chilean Computer Science Society. IEEE Press, Los Alamitos, 155-163.
Mutapcic, A., K. Mohajer and B. Sroub (2003). Real-Time Vehicle Routing Using the Estimation-Pruning (EP) Algorithm, Database,GPS, and GIS Technologies. Working Paper, Stanford University, U.S.A.
Nanry, W.P. and J.W. Barnes (2000). Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search. Transportation Research, Part B 34, 107-121.
Ochi, L.S., D.S. Vianna, L.M. Drummond and A.O. Victor (1998). A Parallel Evolutionary Algorithm for the Vehicle Routing Problem with Heterogeneous Fleet. In Proceedings of First Workshop on Biologically Inspired Solutions to Parallel Processing Problems.
Pedroso, J.P. (1997). Niche search: An Application to the Manhattan Newspaper Problem. Discussion Paper 9765, Center for Operations Research and Econometrics, Université Catholique de Louvain, Belgium.
Pedroso, J.P. (1998). Niche Search: An Application in Vehicle Routing. In Proceedings of IEEE International Conference on Evolutionary Computation, volume 1, Anchorage, Alaska.
Pereira, F., J. Tavares, P. Machado and E. Costa (2002). GVR: a New Genetic Representation for the Vehicle Routing Problem. In Proceedings of AICS 2002, M. O'Neil et all (Eds.), 95-102.
Poot, A., G. Kant and A.P.M Wagelmans (1999). A Savings Based Method for Real-life Vehicle Routing Problems. Economic Institute Report 166, Economic Institute, Erasmus University, Rotterdam.
Potvin, J.-Y. and D. Dube (1994). Improving a Vehicle Routing Heuristic through Genetic Search. In Proceedings of the First IEEE Conference on Evolutionary Computation, Orlando, USA, 194-199.
Potvin, J.-Y. and S. Bengio (1996). The Vehicle Routing Problem with Time Windows - Part II: Genetic Search. ORSA Journal on Computing 8, 165-172.
Prins, C. and S. Bouchenoua (2002). A Memetic Algorithm Solving the VRP, the CARP and General Routing Problems with Nodes, Edges and Arcs. Presented at the Third Workshop on Memetic Algorithms, Granada, Spain.
Prosser, P. and P. Shaw (1996) . Study of Greedy Search with Multiple Improvement Heuristics for Vehicle Routing Problems. Working Paper, University of Strathclyde, Glasgow, Scotland.
Rabiej, D.R. (2000). Greedy Random: A Novel Algorithm for Vehicle Routing Optimization. Working Paper, Mattawan High School, U.S.A.
Ralphs, T.K., L. Kopman, W.R. Pulleyblank and L.E. Trotter Jr. (2003) . On the Capacitated Vehicle Routing Problem. Mathematical Programming 94, 343-.
Ralphs, T., J. Hartman and M. Galati (2001). Capacitated Vehicle Routing and Some Related Problems. Presentation. Department of Industrial and Systems Engineering, Rutgers University, NJ.
Ralphs, T.K. and J.C. Hartman (2001). Capacitated Node Routing Problems. Working Paper, Department of Industrial and Systems Engineering, Lehigh University, PA.
Ralphs, T.K. (2003). Parallel Branch and Cut for Capacitated Vehicle Routing. Parallel Computing 29, 607-.
Redekar, G.A. (2003). MDVRP in a Dynamic and Competitive Setting. Research Presentation, Indian Institute of Technology, Madras.
Rego, C. and C. Roucairol (1995). Using Tabu Search for Solving a Dynamic Multi-Terminal Truck Dispatching Problem. European Journal of Operational Research 83, 411-429.
Rego, C. (2001). Node Ejection Chains for the Vehicle Routing Problem: Sequential and Parallel Algorithms. Parallel Computing 27, 201-222.
Reiman, M.I., R. Rubio and L.M. Wein (1999). Heavy Traffic Analysis of the Dynamic Stochastic Inventory-Routing Problem. Transportation Science 33:4, 361-380.
Reimann, M., K. Doerner and R.F. Hartl (2003). Analyzing a Unified Ant System for the VRP and Some of its Variants. To appear in Applications of Evolutionary Computing.
Rich, J. (1999). A Computational Study of Vehicle Routing Applications. PhD thesis, Department of Computational and Applied Mathematics, Rice University, Houston, USA.
Righini, G. (2000) Approximation algorithms for the vehicle routing problem with pick-up and delivery. Note del Polo - Ricerca 33, Polo Didattico e di Ricerca di Crema, Universita degli Studi di Milano, Luglio.
Rivers, C. (1999). Dynamic Coordination in Vehicle Routing. Presented in The 34th Annual Conference of the Operational Research Society of New Zealand, 10-11 December 1999, University of Waikato, Hamilton, New Zealand.
Rizzoli A. E., Casagrande N. , Donati A. V., Gambardella L. M., Lepori D., Montemanni R. , Pina P., Zaffalon M. (2003). Planning and optimization of vehicle routes for fuel oil distribution. Presented at MODSIM 2003, Townsville (Australia).
Rochat, Y. and E. Taillard (1995). Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics 1, 147-167.
Rousseau, L.-M., M. Gendreau and G. Pesant (1999). Using Constraint-based Operators with Variable Neighborhood Search to Solve the Vehicle Routing Problem with Time Windows. Presented at the CP-AI-OR'99 Workshop, February 25.-26., University of Ferrara, Italy
Savelsbergh, M.W.P. and M. Sol (1995). The General Pickup and Delivery Problem. Transportation Research 29, 17-29.
Savelsbergh, M.W.P. and M. Sol (1998). DRIVE: Dynamic Routing of Independent Vehicles. Operations Research 46, 474-490.
Savelsbergh, M.W.P. and A.M. Campbell (2002). Consumer Direct Grocery Initiatives. Presented at the Workshop on Travel and Transportation, University of Minnesota, U.S.A.
Savelsbergh, M.W.P. (2002). Vehicle Routing and Scheduling. Presented at the IMA workshop, September 9-13 2002, University of Minnesota, U.S.A.
Selensky, E. (2002). Shop Scheduling Reformulation of Vehicle Routing. Research Presentation, Glasgow University.
Shaw, P. (1997). A new Local Search Algorithm Providing High Quality Solutions to Vehicle Routing Problems. Working Paper, Department of Computer Science, University of Strathclyde, Glasgow, Scotland.
Shaw, P. (1998). Using Constraint Programming and Local Search Methods to solve Vehicle Routing Problems. In Principles and Practice of Constraint Programming - CP98, Lecture Notes in Computer Science, M. Maher and J.-F. Puget (eds), Springer-Verlag, New York, 417-431.
Taillard, E. (1999). Heuristic Column Generation Method for the heterogenous VRP. Recherche-Operationnelle 33, 1-14.
Taillard, E., G. Laporte and M. Gendreau (1996). Vehicle Routeing with Multiple Use of Vehicles. Journal of the Operational Research Society 47, 1065-1070.
Taillard, E., P. Badeau, M. Gendreau, F. Guertin and J.-Y. Potvin (1997). A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows. Transportation Science 31, 170-186.
Tan, K.C., L.H. Lee and K.Q. Zhu (2000). Heuristics for VRPTW. Presented at the 6th AI and Math Conference, Fort Lauderdale, Florida, January 5-7, 2000.
Tan, K.C., L.H. Lee and K.Q. Zhu (2001). Heuristic Methods for Solving VRPTW. Artificial Intelligence in Engineering, 281-295.
Tansini, L., M. Urquhart and O. Viera (2001). Comparing Assignment algorithms for the Multi-Depot VRP. Technical Report, University of Montevideo, Uruquay.
Tavares, J., F.B. Pereira, P. Machado and E. Costa (2003). On the Influence of GVR in Vehicle Routing. In Proceedings of the 2003 ACM Symposium On Applied Computing, Melbourne, Florida, 9-13 March, 2003, 753-758.
Vacic, V. (2002). Vehicle Routing Problem with Time Windows. Project Report, University of Bridgeport.
Vianna, D.S., L.S. Ochi and L.M. Drummond (1999). A Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem. In Proceedings of the 1999 Workshop on Biologically Inspired Solutions to Parallel Processing Problems.
Vural, A.V. (2004). A GA Based Meta-Heuristic for the Capacitated Vehicle Routing Problem with Simultaneous Pickup and Deliveries. Thesis presentation, Sabanci University.
Wahle,J., O. Annen, C. Schuster, L. Neubert and M. Schreckenberg (2000). A Dynamic Route Guidance System Based on Real Traffic Data. European Journal of Operational Research 131-132, 74-80.
Wassan, N. (2003). A Reactive Tabu Search for the Vehicle Routing Problem. Working Paper, University of Kent, U.K.
Yang, J., P. Jaillet and H.S. Mahmassani (2002) . Real-Time Multi-Vehicle Truckload Pick-up and Delivery Problems. To Appear in Transportation Science.
Zhu, K.Q. and K.-L. Ong (2000). A Reactive Method for Real Time Dynamic Vehicle Routing Problems. In Proceedings of 12th IEEE Internationals Conference on Tools with Artificial Intelligence. IEEE Computing Society, Los Alamitos, USA, 176-180.
Zhu, K.Q. (2000). Heuristics Methods for Vehicle Routing Problem with Time Windows. B. Eng. Thesis, Department of Electrical Engineering, National University of Singapore, Singapore.
Özaydin, E. (2003). Capacitated Vehicle Routing Problem with Time Windows. Thesis presentation, Sabanci University.

Created 11 February 2002 by hfr

Last Update March 19 2004 by olb