Group for Research in Decision Analysis

Publications

Jean-François Cordeau

Articles

Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities
, , and
To appear in: INFORMS Journal on Computing, 2015 BibTeX reference
An exact algorithm for the capacitated arc routing problem with deadheading demand
, , and
Operations Research, 61, 315–327, 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
Heuristics for dynamic and stochastic routing in industrial shipping
, , , and
Computers & Operations Research, 40, 253–263, 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
Integrated operations planning and revenue management for rail freight transportation
, , and
Transportation Research Part B: Methodological, 46(1), 100–119, 2012 BibTeX reference
A branch-price-and-cut method for a ship routing and scheduling problem with split loads
, , , , and
Computers & Operations Research, 39(12), 3361–3375, 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
A parallel iterated Tabu search heuristic for vehicle routing problems
and
Computers & Operations Research, 39, 2033–2050, 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 two-echelon vehicle routing problems arising in city logistics
, , and
Computers & Operations Research, 39, 3215–3228, 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
Models and algorithms for the heterogeneous dial-a-ride problem with driver related constraints
, , , and
OR Spectrum, 34, 593–633, 2012 BibTeX reference
Robust inventory routing under demand uncertainty
, , and
Transportation Science, 46, 327–340, 2012 BibTeX reference
A large neighbourhood search heuristic for the aircraft and passenger recovery problem
, , , and
4OR, 9, 139–157, 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
Benders decomposition for large-scale uncapacitated hub location
, , and
Operations Research, 59, 1477–1490, 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
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
Stochastic uncapacitated hub location
, , and
European Journal of Operational Research, 212, 518–528, 2011 BibTeX reference
The dynamic uncapacitated hub location problem
, , and
Transportation Science, 45, 18–32, 2011 BibTeX reference
Scheduling technicians and tasks in a telecommunications company
, , , and
Journal of Scheduling, 13, 393–409, 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
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
, , and
Computers & Operations Research, 37, 970–980, 2010 BibTeX reference
Dynamic pickup and delivery problems
, , and
European Journal of Operational Research, 202, 8–15, 2010 BibTeX reference
The attractive traveling salesman problem
, , and
European Journal of Operational Research, 203, 59–69, 2010 BibTeX reference
The delivery man problem with time windows
, , and
Discrete Optimization, 7, 269–282, 2010 BibTeX reference
The dynamic multi-period vehicle routing problem
, , , and
Computers & Operations Research, 37, 1615–1623, 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
A Tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
, , and
Journal of Scheduling, 12, 3–16, 2009 BibTeX reference
Accelerating benders decomposition by local branching
, , , and
INFORMS Journal on Computing, 21, 333–345, 2009 BibTeX reference
Benders, metric and cutset inequalities for multicommodity capacitated network design
, , and
Computational Optimization and Applications, 42, 371–392, 2009 BibTeX reference
Branch-and-cut-and-price for the pickup and delivery problem with time windows
and
Transportation Science, 43, 267–286, 2009 BibTeX reference
Formulations and solution algorithms for a dynamic generalized assignment problem
, , , and
Computers & Operations Research, 36, 2670–2681, 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
Quality of service in dial-a-ride operations
, , and
Computers & Industrial Engineering, 56, 1721–1734, 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 branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times
, , and
Computers & Operations Research, 35, 2635–2655, 2008 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 dial-a-ride problem: Models and algorithms
and
Annals of Operations Research, 153(1), 29–46, 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
An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with lifo or fifo loading
, , and
INFOR, 45, 223–238, 2007 BibTeX reference
Étude comparative de divers modèles pour le problème de transport à la demande
, , and
INFOR, 45, 95–110, 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 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
Un algorithme de minimisation du transport à vide appliqué à l'industrie forestière
, , and
INFOR, 45, 41–47, 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
An integrated model for logistics network design
, , and
Annals of Operations Research, 144, 59–82, 2006 BibTeX reference
A branch-and-cut algorithm for the dial-a-ride problem
Operations Research, 54(3), 573–586, 2006 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
Un modèle pour la conception d'un réseau de distribution avec localisation, affectation et stocks
and
INFOR, 44, 1–18, 2006 BibTeX reference
A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
, , and
Computers & Operations Research, 31, 1451–1476, 2005 BibTeX reference
Maximizing the value of an earth observation satellite orbit
and
Journal of the Operational Research Society, 56, 962–968, 2005 BibTeX reference
Models and Tabu search heuristics for the Berth allocation problem
, , , and
Transportation Science, 39, 526–538, 2005 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
Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem
, , , and
Parallel Computing, 30, 377–387, 2004 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
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

Book chapters

Pickup and delivery problems for goods transportation
, , and
P. Toth, D. Vigo (eds.), Vehicle Routing: Problems, Methods and Applications, 2nd edition, SIAM, Philadelphia, 161–192, 2014 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
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