Group for Research in Decision Analysis

Publications

Gilbert Laporte

Articles

A flexible natural formulation for the network design problem with vulnerability constraints
, , and
To appear in: INFORMS Journal on Computing, 2018 BibTeX reference
Vehicle routing and location-routing with intermediate stops: A review
, , , and
To appear in: Transportation Science, 2017 BibTeX reference
Battery degradation and behavior modeling for electric vehicles
, , , and
Transportation Research Part B: Methodological, 103, 158–187, 2017 BibTeX reference
Passenger flow connectivity in collective transportation line networks
, , , and
International Journal of Complex Systems in Science, 3(1), 1–10, 2013 BibTeX reference
An exact algorithm for the capacitated arc routing problem with deadheading demand
, , and
Operations Research, 61, 315–327, 2013 BibTeX reference
Analysis of an exact algorithm for the vessel speed optimization problem
, , , and
Networks, 62(2), 132–135, 2013 BibTeX reference
Combining multicriteria analysis and Tabu search for dial-a-ride problems
, , , and
Transportation Research Part B: Methodological, 52, 1–16, 2013 BibTeX reference
Improved lower bounds and exact algorithm for the capacitated arc routing problem
, , and
Mathematical Programming, 137, 409–452, 2013 BibTeX reference
Long-haul vehicle routing and scheduling with working hour rules
, , and
Transportation Science, 47, 81–107, 2013 BibTeX reference
Optimal location and capability of oil spill response facilities for the south coast of Newfoundland
, , and
Omega, 41, 856–867, 2013 BibTeX reference
Rapid transit network design for optimal cost and origin-destination demand capture
, , , and
Computers & Operations Research, 40(12), 3000–3009, 2013 BibTeX reference
Rich routing problems arising in supply chain management
, , and
European Journal of Operational Research, 224, 435–448, 2013 BibTeX reference
The exact solution of several classes of inventory-routing problems
and
Computers & Operations Research, 40, 558–564, 2013 BibTeX reference
The orienteering problem with variable profits
and
Networks, 61, 104–116, 2013 BibTeX reference
The synchronized arc and node routing problem: Application to road marking
, , and
Computers & Operations Research, 40, 1708–1715, 2013 BibTeX reference
A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
, , and
TOP, 20, 99–118, 2012 BibTeX reference
A branch-and-cut algorithm for the preemptive swapping problem
, , and
Networks, 59, 387–399, 2012 BibTeX reference
A comparison of three metaheuristics for the workover rig routing problem
, , and
European Journal of Operational Research, 220, 28–36, 2012 BibTeX reference
A continuous approximation model for the fleet composition problem
, , and
Transportation Research Part B: Methodological, 46, 1591–1606, 2012 BibTeX reference
A generic branch-and-cut algorithm for multi-objective optimization problems: Application to the multi-modal traveling salesman problem
, , and
INFORMS Journal on Computing, 24, 554–564, 2012 BibTeX reference
A hybrid Tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
, , and
INFORMS Journal on Computing, 24, 343–355, 2012 BibTeX reference
Accelerating Benders decomposition with heuristic master problem solutions
, , , and
Pesquisa Operacional, 32, 3–19, 2012 BibTeX reference
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
and
Computers & Operations Research, 39, 728–735, 2012 BibTeX reference
An adaptive large neighborhood search heuristic for the pollution - routing problem
, , and
European Journal of Operational Research, 223, 346–359, 2012 BibTeX reference
An incremental Tabu search heuristic for the generalized vehicle routing problem with time windows
, , and
Journal of the Operational Research Society, 63, 232–244, 2012 BibTeX reference
Automatic aircraft cargo load planning
, , and
Journal of the Operational Research Society, 63, 1271–1283, 2012 BibTeX reference
Districting for routing with stochastic customers
, , and
EURO Journal on Transportation and Logistics, 1, 67–85, 2012 BibTeX reference
Passenger and pilot risk minimization in offshore helicopter transportation
, , , and
Omega, 40, 584–593, 2012 BibTeX reference
Synchronized arc routing for snow plowing operations
, , and
Computers & Operations Research, 39, 1432–1440, 2012 BibTeX reference
The pipeline and valve location problem
and
European Journal of Industrial Engineering, 6, 301–321, 2012 BibTeX reference
The travelling salesman problem with draft limits
, , , and
Computers & Operations Research, 39, 2161–2167, 2012 BibTeX reference
The undirected m-capacitate peripatetic salesman problem
, , and
European Journal of Operational Research, 223, 637–643, 2012 BibTeX reference
The vehicle routing problem with stochastic demands and split deliveries
, , and
INFOR, 50(2), 59–71, 2012 BibTeX reference
Designing robust rapid transit networks with alternative routes
, , , and
Journal of Advanced Transportation, 45, 54–65, 2011 BibTeX reference
Planning rapid transit networks
, , , and
Socio-Economic Planning Sciences, 45, 95–104, 2011 BibTeX reference
A branch-and-cut algorithm for the minimum labeling hamiltonian cycle problem and two variants
, , and
Computers & Operations Research, 38, 1534–1542, 2011 BibTeX reference
A comparative analysis of several vehicle emission models for freight transportation
, , and
Transportation Research Part D: Transport and Environment, 16, 347–357, 2011 BibTeX reference
A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
, , and
Computers & Operations Research, 38, 1109–1116, 2011 BibTeX reference
A large neighbourhood search heuristic for the aircraft and passenger recovery problem
, , , and
4OR, 9, 139–157, 2011 BibTeX reference
A large scale neighbourhood search heuristic for ship routing and scheduling with split loads
, , and
Computers & Operations Research, 38, 474–483, 2011 BibTeX reference
A multidimensional shooting algorithm for the two-facility location-allocation problem with dense demand
, , and
Computers & Operations Research, 38, 450–463, 2011 BibTeX reference
An integer l-shaped algorithm for the dial-a-ride problem with stochastic customer delays
, , and
Discrete Applied Mathematics, 159, 883–895, 2011 BibTeX reference
Designing a home-to-work bus service in a metropolitan area
, , , and
Transportation Research Part B: Methodological, 45, 1710–1726, 2011 BibTeX reference
Minimum cost path problems with relays
and
Computers & Operations Research, 38, 165–173, 2011 BibTeX reference
Modeling and solving a multimodal routing problem with flexible-time and scheduled services
, , , , and
Networks, 57, 53–68, 2011 BibTeX reference
Optimizing yard assignment in an automative transshipment terminal
, , , and
European Journal of Operational Research, 215, 149–160, 2011 BibTeX reference
The capacitated vehicle routing problem with stochastic demands and time windows
, , and
Computers & Operations Research, 38, 1775–1783, 2011 BibTeX reference
Tramp ship routing and scheduling with speed optimization
, , and
Transportation Research Part C: Emerging Technologies, 19, 853–865, 2011 BibTeX reference
Scheduling technicians and tasks in a telecommunications company
, , , and
Journal of Scheduling, 13, 393–409, 2010 BibTeX reference
A continuous analysis framework for the solution of location-allocation problems with dense demand
, , and
Computers & Operations Research, 37, 123–136, 2010 BibTeX reference
A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
, , , and
European Journal of Operational Research, 206(2), 341–349, 2010 BibTeX reference
The traveling salesman problem, the vehicle routing problem, and their impact on combinatorial optimization
International Journal of Strategic Decision Sciences, 1, 82–92, 2010 BibTeX reference
A branch-and-cut algorithm for the non-preemptive capacitated swapping problem
, , and
Discrete Applied Mathematics, 158, 1599–1614, 2010 BibTeX reference
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with lifo loading
, , , and
Networks, 55, 46–59, 2010 BibTeX reference
A concise guide to the traveling salesman problem
Journal of the Operational Research Society, 61, 35–40, 2010 BibTeX reference
A game theory framework for the robust transportation network design
, , and
Transportation Research Part B: Methodological, 44, 447–459, 2010 BibTeX reference
A Tabu search heuristic for ship routing and scheduling
, , and
Journal of the Operational Research Society, 61, 594–603, 2010 BibTeX reference
A Tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
, , , and
European Journal of Operational Research, 202, 122–130, 2010 BibTeX reference
An adaptive large neighbourhood search heuristic for the capacitated arc routing problem with stochastic demands
, , and
Transportation Science, 44, 125–135, 2010 BibTeX reference
An ant colony heuristic for the arc routing problem with intermediate facilities under capacity and length restrictions
, , , and
Journal of Heuristics, 16, 211–233, 2010 BibTeX reference
An efficient algorithm for the steiner tree problem with revenue, bottleneck and hop objective functions
and
European Journal of Operational Research, 207, 45–49, 2010 BibTeX reference
Comments on: Routing problems with loading constraints
TOP, 18, 28–30, 2010 BibTeX reference
Dynamic transportation of patients in hospitals
, , , and
OR Spectrum, 32, 77–107, 2010 BibTeX reference
Heuristics for the mixed swapping problem
, , and
Computers & Operations Research, 37, 108–114, 2010 BibTeX reference
Optimizing hopping sequences in frequency hopping cellular networks
, , and
Engineering Optimization, 42, 33–44, 2010 BibTeX reference
Reducing fuel emissions by optimizing speed on shipping routes
, , and
Journal of the Operational Research Society, 61, 523–529, 2010 BibTeX reference
Scheduling ambulance crews for maximum coverage
, , , and
Journal of the Operational Research Society, 61, 543–550, 2010 BibTeX reference
Some applications of the generalized vehicle routing problem
, , and
Journal of the Operational Research Society, 61, 1072–1077, 2010 BibTeX reference
Supply chain management in Liege and Montreal
Spirit of Management, 8, page 44, 2010 BibTeX reference
The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
, , , and
Mathematical Programming, Series A, 121, 269–305, 2010 BibTeX reference
The traveling salesman problem with pickups, deliveries and handling costs
, , , and
Transportation Science, 44, 383–399, 2010 BibTeX reference
Fifty years of vehicle routing
Transportation Science, 43, 408–416, 2009 BibTeX reference
A branch-and-cut algorithm for the non-preemptive swapping problem
, , and
Naval Research Logistics, 56, 478–486, 2009 BibTeX reference
A comparative analysis of several asymmetric travelling salesman problem formulations
, , and
Computers & Operations Research, 36, 637–654, 2009 BibTeX reference
Business environment factors, incoterms selection, and export performance
, , and
Operations & Supply Chain Management, 2, 63–78, 2009 BibTeX reference
Heuristiques pour le problème du vendeur m-péripatétique
, , and
RAIRO (Recherche opérationnelle), 43, 13–26, 2009 BibTeX reference
Integration of operational policies into the design phase of a material handling system
and
International Journal of Advanced Operations Management, 1, 108–134, 2009 BibTeX reference
Lasso solution strategies for the vehicle routing problem with pickups and deliveries
, , , and
European Journal of Operational Research, 192, 755–766, 2009 BibTeX reference
Locating a metro line in a historical city centre: Application to Sevilla
, , , and
Journal of the Operational Research Society, 60, 1462–1466, 2009 BibTeX reference
Locational analysis: Highlights of growth to maturity
, , and
Journal of the Operational Research Society, 60(Supplement), page S140, 2009 BibTeX reference
Models and branch-and-cut algorithms for the steiner tree problem with revenues, budget and hop constraints
, , and
Networks, 53, 141–159, 2009 BibTeX reference
Partial integration of frequency allocation within antenna positioning in gms mobile networks
, , and
European Journal of Operational Research, 193, 541–555, 2009 BibTeX reference
Scenario tree based heuristics for stochastic inventory routing problems
, , and
INFORMS Journal on Computing, 21, 268–285, 2009 BibTeX reference
The capacity and distance constrained plant location problem
, , and
Computers & Operations Research, 36, 597–611, 2009 BibTeX reference
The petrol station replenishment problem with time windows
, , , and
Computers & Operations Research, 36, 919–935, 2009 BibTeX reference
The pickup and delivery traveling salesman problem with first-in-first-out loading
, , and
Computers & Operations Research, 36, 1800–1808, 2009 BibTeX reference
Vehicle routing with cross-docking
, , , , and
Journal of the Operational Research Society, 60, 1708–1718, 2009 BibTeX reference
A Tabu search heuristic for the generalized minimum spanning tree problem
, , and
European Journal of Operational Research, 191, 306–319, 2008 BibTeX reference
A two-level simulated annealing algorithm for efficient dissemination of electronic content
, , , and
Journal of the Operational Research Society, 59, 1557–1567, 2008 BibTeX reference
An iterated local search heuristic for the logistics network design problem with single assignment
, , and
International Journal of Production Economics, 113(2), 626–640, 2008 BibTeX reference
Exact algorithms for the joint object placement and request routing problem in content distribution networks
, , , and
Computers & Operations Research, 35, 3860–3884, 2008 BibTeX reference
Fast heuristics for the steiner tree problem with revenues, budget and hop constraints
, , and
European Journal of Operational Research, 190, 68–78, 2008 BibTeX reference
Iterated Tabu search for the car sequencing problem
, , and
European Journal of Operational Research, 191(3), 945–956, 2008 BibTeX reference
The maximum return-on-investment plant location problem with market share
, , , , and
Journal of the Operational Research Society, 59(3), 399–406, 2008 BibTeX reference
Exact and heuristic procedures for the material handling circular flow path design problem
, , and
European Journal of Operational Research, 176(2), 707–726, 2007 BibTeX reference
Improvements to the Or-opt heuristic for the symmetric traveling salesman problem 
, , and
Journal of the Operational Research Society, 58(3), 402–407, 2007 BibTeX reference
A heuristic for the multi-satellite, multi-orbit and multi-user management of earth observation satellites
, , , , and
European Journal of Operational Research, 177(2), 750–762, 2007 BibTeX reference
A Tabu search heuristic for the quay crane scheduling problem
, , , and
Journal of Scheduling, 10(4-5), 327–336, 2007 BibTeX reference
Heuristics and lower bounds for a stochastic location-routing problem
, , and
European Journal of Operational Research, 179, 940–955, 2007 BibTeX reference
Horizontal cooperation among freight carriers: Request allocation and profit sharing
, , , , and
Journal of the Operational Research Society, 1–9, 2007 BibTeX reference
Models and a branch-and-cut algorithm for pickup and delivery problems with time windows
, , and
Networks, 49, 258–272, 2007 BibTeX reference
Static pickup and delivery problems: A classiffication scheme and survey
, , , and
TOP, 15, 1–31, 2007 BibTeX reference
The bridges of Königsberg – A historical perspective
, , and
Networks, 49(3), 199–203, 2007 BibTeX reference
The multi-depot vehicle routing problem with inter-depot routes
, , and
European Journal of Operational Research, 176(2), 756–773, 2007 BibTeX reference
The service allocation problem at the Gioia Tauro Maritime Terminal 
, , , and
European Journal of Operational Research, 176(2), 1167–1184, 2007 BibTeX reference
Une heuristique de recherche avec tabous pour la conception de riseaux de distribution de contenu électronique
, , , and
INFOR, 45, 175–195, 2007 BibTeX reference
Variable neighbourhood search for the pickup and delivery traveling salesman problem with LIFO loading
, , and
INFORMS Journal on Computing, 19(4), 618–632, 2007 BibTeX reference
A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
, , , and
Naval Research Logistics, 53, 45–59, 2006 BibTeX reference
A memetic heuristic for the generalized quadratic assignment problem
, , , and
INFORMS Journal on Computing, 18(4), 433–443, 2006 BibTeX reference
A Tabu search algorithm for a routing and container loading problem
, , , and
Transportation Science, 40(3), 342–350, 2006 BibTeX reference
Antenna positioning in mobile telecommunication networks
, , and
INFOR, 44, 157–174, 2006 BibTeX reference
Designing an efficient method for tandem AGV network design problem using Tabu search
, , and
Applied Mathematics and Computation, 183(2), 1410–1421, 2006 BibTeX reference
Sélection et utilisation des Incoterms dans les entreprises exportatrices québécoises 
, , and
Logistique & Management, 14(1), 85–96, 2006 BibTeX reference
Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic
, , and
Transportation Science, 40(4), 421–438, 2006 BibTeX reference
Solving a vehicle routing problem arising in soft drink distribution
, , , and
Journal of the Operational Research Society, 57, 1045–1052, 2006 BibTeX reference
The black and white traveling salesman problem
, , and
Operations Research, 54(2), 366–378, 2006 BibTeX reference
The maximal expected coverage relocation problem for emergency vehicles
, , and
Journal of the Operational Research Society, 57(1), 22–28, 2006 BibTeX reference
The pickup and delivery problem with time windows and transshipmen
and
INFOR, 44(3), 217–227, 2006 BibTeX reference
Loop based facility planning and material handling
and
European Journal of Operational Research, 164, 1–11, 2005 BibTeX reference
A continuous model for multi-store competitive location
and
Operations Research, 53, 263–280, 2005 BibTeX reference
A practical algorithm for the shortest loop design problem in a block layout
, , and
International Journal of Production Research, 43, 1839–1887, 2005 BibTeX reference
An analytical approach to the facility location and capacity acquisition problem under demand uncertainty
and
Journal of the Operational Research Society, 56, 397–405, 2005 BibTeX reference
Branch-and-cut algorithms for the undirected m-peripatetic salesman problem
, , and
European Journal of Operational Research, 162, 700–712, 2005 BibTeX reference
Comments on "Towards a unified territorial design approach : Applications, algorighms and GIS integration" by Kalcsics, Nickel and Schröder
TOP, 13, 62–64, 2005 BibTeX reference
Efficient neighborhood search for the probabilistic pickup and delivery travelling salesman problem
, , , and
Networks, 45, 195–198, 2005 BibTeX reference
Locating median cycles in networks
, , , and
European Journal of Operational Research, 160, 457–470, 2005 BibTeX reference
Maximizing trip coverage in the location of a single rapid transit alignment
, , , and
Annals of Operations Research, 136, 49–63, 2005 BibTeX reference
Models and Tabu search heuristics for the Berth allocation problem
, , , and
Transportation Science, 39, 526–538, 2005 BibTeX reference
Scheduling and lot streaming in openshops with no-wait in process
, , , and
Naval Research Logistics, 52, 261–275, 2005 BibTeX reference
Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
, , , and
Journal of Mathematical Modelling and Algorithm, 3, 209–223, 2005 BibTeX reference
The Weber problem in a multi-storey building
, , and
INFOR, 43, 157–169, 2005 BibTeX reference
Solving the hierarchical chinese postman problem as a rural postman problem
, , , and
European Journal of Operational Research, 155, 40–50, 2004 BibTeX reference
A general multi-shift scheduling system
and
Journal of the Operational Research Society, 55(11), 1208–1217, 2004 BibTeX reference
Exact algorithms for the job sequencing and tool switching problem
, , and
IIE Transactions, 36(1), 37–45, 2004 BibTeX reference
A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
, , and
European Journal of Operational Research, 158, 793–795, 2004 BibTeX reference
A composite very large-scale neighborhood search algorithm for the vehicle routing problem
, , , and
Handbook of Scheduling: Algorithms, Models and Performance Analysis, page 49.1, 2004 BibTeX reference
Book Review: Randolph W. Hall (editor) Handbook of transportation science, Second edition, International Series in Operations Research and Management Science 56, Kluwer, Dordrecht 2003
Operations Research Letters, 32, 394–397, 2004 BibTeX reference
Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows
, , and
Transportation Research Part B: Methodological, 38(8), 669–685, 2004 BibTeX reference
Efficient heuristics for median cycle problems
, , and
Journal of the Operational Research Society, 55(2), 179–186, 2004 BibTeX reference
Heuristics and lower bounds for the bin packing problem with conflicts
, , and
Computers & Operations Research, 31, 347–358, 2004 BibTeX reference
Improved Tabu search algorithm for the handling of route duration constraints in vehicle-routing problems with time windows
, , and
Journal of the Operational Research Society, 55(5), 542–546, 2004 BibTeX reference
Location and pricing decisions of a multistore monopoly in a spatial market
and
Journal of Regional Science, 44(3), 489–515, 2004 BibTeX reference
Models and algorithms for the dynamic-demand joint replenishment problem
, , and
International Journal of Production Research, 42(13), 2667–2678, 2004 BibTeX reference
Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem
, , , and
Parallel Computing, 30, 377–387, 2004 BibTeX reference
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
, , and
Networks, 43(71), page 86, 2004 BibTeX reference
The ring star problem: Polyhedral analysis and exact algorithm
, , , and
Networks, 43(3), 177–189, 2004 BibTeX reference
Waiting strategies for the dynamic pickup and delivery problem with time windows
and
Transportation Research Part B: Methodological, 38(7), 635–655, 2004 BibTeX reference
Upper Bounds and Algorithms for the Maximum Cardinality Bin Packing Problem
, , and
European Journal of Operational Research, 149, 490–498, 2003 BibTeX reference
Ambulance location and relocation models
, , and
European Journal of Operational Research, 147, 451–468, 2003 BibTeX reference
A branch-and-cut algorithm for the undirected traveling purchaser problem
, , and
Operations Research, 51, 940–951, 2003 BibTeX reference
A Tabu search heuristic for the static multivehicle dial-a-ride problem
and
Transportation Research Part B: Methodological, 37(6), 579–594, 2003 BibTeX reference
Exact solution of the generalized routing problem through graph-transformations
and
Journal of the Operational Research Society, 54(8), 906–910, 2003 BibTeX reference
Generalized network design problems
, , and
European Journal of Operational Research, 148, 1–13, 2003 BibTeX reference
Heuristics for the black and white traveling salesman problem
, , and
Computers & Operations Research, 30, 75–85, 2003 BibTeX reference
Heuristics for the traveling purchaser problem
, , and
Computers & Operations Research, 30, 491–504, 2003 BibTeX reference
Real-time vehicle-routing: Solution concepts, algorithms and parallel computing strategies
, , , and
European Journal of Operational Research, 151(1), 1–11, 2003 BibTeX reference
Scheduling and lot streaming in flowshops with no-wait in process
, , , and
Journal of Scheduling, 6, 339–354, 2003 BibTeX reference
Solving a home-care districting problem in an urban setting
, , and
Journal of the Operational Research Society, 54(11), 1141–1147, 2003 BibTeX reference
The dial-a-ride problem (DARP): Variants, modeling issues and algorithms
and
4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies , 1, 89–101, 2003 BibTeX reference

Books

Introduction to logistics systems management
, , and
Wiley, Chichester, 455 pages, 2013 BibTeX reference
Introduzione alla Gestione dei Sistemi Logistici
, , and
Isedi, Torino, 450 pages, 2012 BibTeX reference
Political districting: Solving a multi-objective problem using Tabu search
, , , and
Kluwer, Boston, 250 pages, 2007 BibTeX reference
Transportation, Handbooks in operations research and management science
and
14, Elsevier, Amsterdam, 796 pages, 2007 BibTeX reference
Location analysis
, , and
Springer, Dordrecht, 349 pages, 2005 BibTeX reference
Introduction to logistics systems planning and control
and
Wiley, London, 352 pages, 2004 BibTeX reference

Book chapters

Green vehicle routing
, , and
H.N. Psaraftis (ed.), Green Transportation Logistics: The Quest for Win-Win Solutions, 226, Springer, 243–265, 2016 BibTeX reference
Introduction to location science
, , and
G. Laporte, S. Nickel, F. Saldanha da Gama (eds.), Location Science, Springer, 1–18, 2015 BibTeX reference
The design of rapid transit networks
and
G. Laporte, S. Nickel, F. Saldanha da Gama (eds.), Location Science, Springer, 581–594, 2015 BibTeX reference
Applications of the double standard model for ambulance location
, , , and
L. Bertazzi, M.G. Speranza and J.A.E.E. van Nunen, Innovations in Distribution Logistics, Springer, Berlin, 235–249, 2009 BibTeX reference
Stochastic vehicle routing problems
and
Encyclopedia of Optimization, Springer, Boston, 3829–3832, 2009 BibTeX reference
Recent models and algorithms for one-to-one pickup and delivery problems
, , and
B. L., Golden, S. Raghavan and E. A. Wasil, The Vehicle Routing: Latest Advances and Challenges, 43, 327–357, 2008 BibTeX reference
Transportation on demand
, , , and
C. Barnhart, G. Laporte (eds), Transportation, Handbooks in Operations Research and Management Science, 14, 429–466, 2007 BibTeX reference
Vehicle routing
, , , and
C. Barnhart, G. Laporte (eds), Transportation, Handbooks in Operations Research and Management Science, 14, 367–428, 2007 BibTeX reference
Recent Developments in Practical Examination Timetabling
and
Practice and Theory of Automated Timetabling II, Lectures Notes in Computer Science, 1408, Springer, 3–19, 2006 BibTeX reference
Modeling and optimization of vehicle routing and arc routing problems
and
G. Appa, L. Pitsoulis, H.P. Williams (eds.), Handbook on Modelling for Discrete Optimization, 151–191, 2006 BibTeX reference
Tabu Search Heuristics for the Vehicle Routing Problem
and
Eds Rego, C, Alidaee, B, Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, Kluwer, Boston, 145–163, 2005 BibTeX reference
New heuristics for the vehicle routing problem
, , , , and
Eds Langevin, A, Riopel, D, Logistics Systems: Design and Optimization, (9), Springer, New York, 279–297, 2005 BibTeX reference
Modeling and solving vehicle routing and arc routing problems
and
Eds Appa, G, Pitsoulis, l, Williams, HP, Handbook of Modeling and Discrete Optimization, Kluwer, Boston, 2005 BibTeX reference
Short-haul routing
, , , and
Eds Barnhart, C, Laporte, G, Handbooks in Operations Research and Management Science, Elsevier, Amsterdam, 2005 BibTeX reference
Transportation on demand
, , , and
Eds Barnhart, C, Laporte, G, Williams, HP, Handbooks in Operations Research and Management Science, Elsevier, Amsterdam, 2005 BibTeX reference

Proceedings

Vehicle routing and scheduling with cross-dock
, , and
IFORS 2014, Barcelone, Espagne, 2014 BibTeX reference
An adaptive large neighborhood search heuristic for a snow plowing problem with synchronized routes
, , and
Lecture Notes in Computer Science, 6701, Berlin, 406–411, 2011 BibTeX reference
An integrated methodology for the rapid transit network design problem
, , , and
Lecture Notes in Computer Science, Springer, 4539, Berlin, Allemagne, 187–199, 2007 BibTeX reference