Groupe d’études et de recherche en analyse des décisions

Publications

Jean-François Cordeau

Articles

A unified decomposition matheuristic for assembly, production and inventory routing
, et
À paraître dans : INFORMS Journal on Computing, 2018 référence BibTeX
A unified decomposition matheuristic for assembly, production and inventory routing
, et
À paraître dans : INFORMS Journal on Computing, 2018 référence BibTeX
Solving the vessel routing and scheduling problem at a Canadian maritime transportation company
et
À paraître dans : INFOR, 2017 référence BibTeX
An exact algorithm for the capacitated arc routing problem with deadheading demand
, et
Operations Research, 61, 315–327, 2013 référence BibTeX
Combining multicriteria analysis and Tabu search for dial-a-ride problems
, , et
Transportation Research Part B: Methodological, 52, 1–16, 2013 référence BibTeX
Heuristics for dynamic and stochastic routing in industrial shipping
, , et
Computers & Operations Research, 40, 253–263, 2013 référence BibTeX
Improved lower bounds and exact algorithm for the capacitated arc routing problem
, et
Mathematical Programming, 137, 409–452, 2013 référence BibTeX
Long-haul vehicle routing and scheduling with working hour rules
, et
Transportation Science, 47, 81–107, 2013 référence BibTeX
Integrated operations planning and revenue management for rail freight transportation
, et
Transportation Research Part B: Methodological, 46(1), 100–119, 2012 référence BibTeX
A branch-price-and-cut method for a ship routing and scheduling problem with split loads
, , , et
Computers & Operations Research, 39(12), 3361–3375, 2012 référence BibTeX
A hybrid Tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
, et
INFORMS Journal on Computing, 24, 343–355, 2012 référence BibTeX
A parallel iterated Tabu search heuristic for vehicle routing problems
et
Computers & Operations Research, 39, 2033–2050, 2012 référence BibTeX
Accelerating Benders decomposition with heuristic master problem solutions
, , et
Pesquisa Operacional, 32, 3–19, 2012 référence BibTeX
An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
, et
Computers & Operations Research, 39, 3215–3228, 2012 référence BibTeX
An incremental Tabu search heuristic for the generalized vehicle routing problem with time windows
, et
Journal of the Operational Research Society, 63, 232–244, 2012 référence BibTeX
Models and algorithms for the heterogeneous dial-a-ride problem with driver related constraints
, , et
OR Spectrum, 34, 593–633, 2012 référence BibTeX
Robust inventory routing under demand uncertainty
, et
Transportation Science, 46, 327–340, 2012 référence BibTeX
A large neighbourhood search heuristic for the aircraft and passenger recovery problem
, , et
4OR, 9, 139–157, 2011 référence BibTeX
An integer l-shaped algorithm for the dial-a-ride problem with stochastic customer delays
, et
Discrete Applied Mathematics, 159, 883–895, 2011 référence BibTeX
Benders decomposition for large-scale uncapacitated hub location
, et
Operations Research, 59, 1477–1490, 2011 référence BibTeX
Designing a home-to-work bus service in a metropolitan area
, , et
Transportation Research Part B: Methodological, 45, 1710–1726, 2011 référence BibTeX
Modeling and solving a multimodal routing problem with flexible-time and scheduled services
, , , et
Networks, 57, 53–68, 2011 référence BibTeX
Optimizing yard assignment in an automative transshipment terminal
, , et
European Journal of Operational Research, 215, 149–160, 2011 référence BibTeX
Stochastic uncapacitated hub location
, et
European Journal of Operational Research, 212, 518–528, 2011 référence BibTeX
The dynamic uncapacitated hub location problem
, et
Transportation Science, 45, 18–32, 2011 référence BibTeX
Scheduling technicians and tasks in a telecommunications company
, , et
Journal of Scheduling, 13, 393–409, 2010 référence BibTeX
A branch-and-cut algorithm for the non-preemptive capacitated swapping problem
, et
Discrete Applied Mathematics, 158, 1599–1614, 2010 référence BibTeX
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with lifo loading
, , et
Networks, 55, 46–59, 2010 référence BibTeX
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
, et
Computers & Operations Research, 37, 970–980, 2010 référence BibTeX
Dynamic pickup and delivery problems
, et
European Journal of Operational Research, 202, 8–15, 2010 référence BibTeX
The attractive traveling salesman problem
, et
European Journal of Operational Research, 203, 59–69, 2010 référence BibTeX
The delivery man problem with time windows
, et
Discrete Optimization, 7, 269–282, 2010 référence BibTeX
The dynamic multi-period vehicle routing problem
, , et
Computers & Operations Research, 37, 1615–1623, 2010 référence BibTeX
The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
, , et
Mathematical Programming, Series A, 121, 269–305, 2010 référence BibTeX
A Tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
, et
Journal of Scheduling, 12, 3–16, 2009 référence BibTeX
Accelerating benders decomposition by local branching
, , et
INFORMS Journal on Computing, 21, 333–345, 2009 référence BibTeX
Benders, metric and cutset inequalities for multicommodity capacitated network design
, et
Computational Optimization and Applications, 42, 371–392, 2009 référence BibTeX
Branch-and-cut-and-price for the pickup and delivery problem with time windows
et
Transportation Science, 43, 267–286, 2009 référence BibTeX
Formulations and solution algorithms for a dynamic generalized assignment problem
, , et
Computers & Operations Research, 36, 2670–2681, 2009 référence BibTeX
Models and branch-and-cut algorithms for the steiner tree problem with revenues, budget and hop constraints
, et
Networks, 53, 141–159, 2009 référence BibTeX
Quality of service in dial-a-ride operations
, et
Computers & Industrial Engineering, 56, 1721–1734, 2009 référence BibTeX
The pickup and delivery traveling salesman problem with first-in-first-out loading
, et
Computers & Operations Research, 36, 1800–1808, 2009 référence BibTeX
Vehicle routing with cross-docking
, , , et
Journal of the Operational Research Society, 60, 1708–1718, 2009 référence BibTeX
A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times
, et
Computers & Operations Research, 35, 2635–2655, 2008 référence BibTeX
A Tabu search heuristic for the generalized minimum spanning tree problem
, et
European Journal of Operational Research, 191, 306–319, 2008 référence BibTeX
A two-level simulated annealing algorithm for efficient dissemination of electronic content
, , et
Journal of the Operational Research Society, 59, 1557–1567, 2008 référence BibTeX
An iterated local search heuristic for the logistics network design problem with single assignment
, et
International Journal of Production Economics, 113(2), 626–640, 2008 référence BibTeX
Exact algorithms for the joint object placement and request routing problem in content distribution networks
, , et
Computers & Operations Research, 35, 3860–3884, 2008 référence BibTeX
Fast heuristics for the steiner tree problem with revenues, budget and hop constraints
, et
European Journal of Operational Research, 190, 68–78, 2008 référence BibTeX
Iterated Tabu search for the car sequencing problem
, et
European Journal of Operational Research, 191(3), 945–956, 2008 référence BibTeX
A heuristic for the multi-satellite, multi-orbit and multi-user management of earth observation satellites
, , , et
European Journal of Operational Research, 177(2), 750–762, 2007 référence BibTeX
A Tabu search heuristic for the quay crane scheduling problem
, , et
Journal of Scheduling, 10(4-5), 327–336, 2007 référence BibTeX
An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with lifo or fifo loading
, et
INFOR, 45, 223–238, 2007 référence BibTeX
Étude comparative de divers modèles pour le problème de transport à la demande
, et
INFOR, 45, 95–110, 2007 référence BibTeX
Models and a branch-and-cut algorithm for pickup and delivery problems with time windows
, et
Networks, 49, 258–272, 2007 référence BibTeX
Static pickup and delivery problems: A classiffication scheme and survey
, , et
TOP, 15, 1–31, 2007 référence BibTeX
The multi-depot vehicle routing problem with inter-depot routes
, et
European Journal of Operational Research, 176(2), 756–773, 2007 référence BibTeX
The service allocation problem at the Gioia Tauro Maritime Terminal 
, , et
European Journal of Operational Research, 176(2), 1167–1184, 2007 référence BibTeX
Un algorithme de minimisation du transport à vide appliqué à l'industrie forestière
, et
INFOR, 45, 41–47, 2007 référence BibTeX
Une heuristique de recherche avec tabous pour la conception de riseaux de distribution de contenu électronique
, , et
INFOR, 45, 175–195, 2007 référence BibTeX
Variable neighbourhood search for the pickup and delivery traveling salesman problem with LIFO loading
, et
INFORMS Journal on Computing, 19(4), 618–632, 2007 référence BibTeX
An integrated model for logistics network design
, et
Annals of Operations Research, 144, 59–82, 2006 référence BibTeX
A branch-and-cut algorithm for the dial-a-ride problem
Operations Research, 54(3), 573–586, 2006 référence BibTeX
A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
, , et
Naval Research Logistics, 53, 45–59, 2006 référence BibTeX
A memetic heuristic for the generalized quadratic assignment problem
, , et
INFORMS Journal on Computing, 18(4), 433–443, 2006 référence BibTeX
Un modèle pour la conception d'un réseau de distribution avec localisation, affectation et stocks
et
INFOR, 44, 1–18, 2006 référence BibTeX
A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
, et
Computers & Operations Research, 31, 1451–1476, 2005 référence BibTeX
Maximizing the value of an earth observation satellite orbit
et
Journal of the Operational Research Society, 56, 962–968, 2005 référence BibTeX
Models and Tabu search heuristics for the Berth allocation problem
, , et
Transportation Science, 39, 526–538, 2005 référence BibTeX
Improved Tabu search algorithm for the handling of route duration constraints in vehicle-routing problems with time windows
, et
Journal of the Operational Research Society, 55(5), 542–546, 2004 référence BibTeX
Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem
, , et
Parallel Computing, 30, 377–387, 2004 référence BibTeX
A Tabu search heuristic for the static multivehicle dial-a-ride problem
et
Transportation Research Part B: Methodological, 37(6), 579–594, 2003 référence BibTeX
The dial-a-ride problem (DARP): Variants, modeling issues and algorithms
et
4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies , 1, 89–101, 2003 référence BibTeX

Livres

Chapitres de livre

Pickup and delivery problems for goods transportation
, et
P. Toth, D. Vigo (eds.), Vehicle Routing: Problems, Methods and Applications, 2nd edition, SIAM, Philadelphia, 161–192, 2014 référence BibTeX
Recent models and algorithms for one-to-one pickup and delivery problems
, et
B. L., Golden, S. Raghavan and E. A. Wasil, The Vehicle Routing: Latest Advances and Challenges, 43, 327–357, 2008 référence BibTeX
Transportation on demand
, , et
C. Barnhart, G. Laporte (eds), Transportation, Handbooks in Operations Research and Management Science, 14, 429–466, 2007 référence BibTeX
Vehicle routing
, , et
C. Barnhart, G. Laporte (eds), Transportation, Handbooks in Operations Research and Management Science, 14, 367–428, 2007 référence BibTeX
Modeling and optimization of vehicle routing and arc routing problems
et
G. Appa, L. Pitsoulis, H.P. Williams (eds.), Handbook on Modelling for Discrete Optimization, 151–191, 2006 référence BibTeX
Tabu Search Heuristics for the Vehicle Routing Problem
et
Eds Rego, C, Alidaee, B, Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, Kluwer, Boston, 145–163, 2005 référence BibTeX
New heuristics for the vehicle routing problem
, , , et
Eds Langevin, A, Riopel, D, Logistics Systems: Design and Optimization, (9), Springer, New York, 279–297, 2005 référence BibTeX
Modeling and solving vehicle routing and arc routing problems
et
Eds Appa, G, Pitsoulis, l, Williams, HP, Handbook of Modeling and Discrete Optimization, Kluwer, Boston, 2005 référence BibTeX
Short-haul routing
, , et
Eds Barnhart, C, Laporte, G, Handbooks in Operations Research and Management Science, Elsevier, Amsterdam, 2005 référence BibTeX
Transportation on demand
, , et
Eds Barnhart, C, Laporte, G, Williams, HP, Handbooks in Operations Research and Management Science, Elsevier, Amsterdam, 2005 référence BibTeX

Actes de conférence