Bannière ESG Département de management et technologie
Mantech_08.jpg
Photo de Teodor Gabriel Crainic

Teodor Gabriel Crainic

Unité : Département de management et technologie

Poste : Professeur

Langues : Français / Anglais / Roumain

Courriel :

Téléphone : (514) 987-3000 poste 4848

Local : DS-3865

Domaines d'expertises

  • Transports, systèmes intelligents de transport
  • Logistique urbaine
  • Logistique et réseaux de valeur
  • Recherche opérationnelle
  • Synthèse des réseaux, tournées de véhicules

 

Informations générales

Cheminement académique

  • Aucune donnée disponible pour cette section.

Liens d’intérêt

Unités de recherche

  • Centre interuniversitaire de recherche sur les réseaux d'entreprise, la logistique et le transport (CIRRELT)

Projets de recherche en cours

  • Aucune donnée disponible pour cette section.

Partenaires (organismes, entreprises)

  • Aucune donnée disponible pour cette section.

Affiliations externes principales

  • Professer associé, département Informatique et recherche opérationnelle, Université de Montréal
Enseignement et supervision

Cours

Direction de thèses et de mémoires (Depuis 2006) et d’essais doctoraux (depuis 2014)

  • Langlois Caron, Justin. (2012). Stratégie de livraison directe dans une chaîne logistique internationale. (Mémoire de maîtrise). Université du Québec à Montréal. Récupéré d’Archipel, l’archive de publications électroniques de l’UQAM. http://www.archipel.uqam.ca/4650.

  • Trudeau, Arianne. (2008). Planification des tournées de véhicules pour l'approvisionnement de dépanneurs. (Mémoire de maîtrise). Université du Québec à Montréal. Récupéré d’Archipel, l’archive de publications électroniques de l’UQAM. http://www.archipel.uqam.ca/858.

  • Dubreuil, Julien. (2007). La logistique des terminaux portuaires de conteneurs. (Mémoire de maîtrise). Université du Québec à Montréal. Récupéré d’Archipel, l’archive de publications électroniques de l’UQAM. http://www.archipel.uqam.ca/4782.

  • FATTAH, MOUNIR. (1999). PLANIFICATION, GESTION ET ORGANISATION DES GARES DE TRIAGE. (Mémoire de maîtrise). Université du Québec à Montréal.

  • LECLERC, MARC. (1999). LE PROBLEME DES GRILLES-HORAIRES SCOLAIRES EN FORMATION PROFESSIONNELLE. (Mémoire de maîtrise). Université du Québec à Montréal.

  • Mountadir, Brahim. (1999). Les réseaux de distribution au détail: Etude d'un cas dans l'industrie du vêtement. (Mémoire de maîtrise). Université du Québec à Montréal.

  • DINIA, MOHAMMED KARIM. (1999). ETUDE SUR LE PROBLEME DES EFFETS CROISES DANS LE TRANSPORT DES MATIERES DANGEREUSES. (Mémoire de maîtrise). Université du Québec à Montréal.

Publications

Publications

Jin, J., Crainic, T.G. et Løkketangen, A. (2014). A cooperative parallel metaheuristic for the capacitated vehicle routing problem. Computers and Operations Research, 44, 33–41. http://dx.doi.org/10.1016/j.cor.2013.10.004.


Vidal, T., Crainic, T.G., Gendreau, M. et Prins, C. (2014). A unified solution framework for multi-attribute vehicle routing problems. European Journal of Operational Research, 234(3), 658–673. http://dx.doi.org/10.1016/j.ejor.2013.09.045.


Vidal, T., Crainic, T.G., Gendreau, M. et Prins, C. (2014). Implicit depot assignments and rotations in vehicle routing heuristics. European Journal of Operational Research, 237(1), 15–28. http://dx.doi.org/10.1016/j.ejor.2013.12.044.


Crainic, T.G., Hewitt, M. et Rei, W. (2014). Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design. Computers and Operations Research, 43(1), 90–99. http://dx.doi.org/10.1016/j.cor.2013.08.020.


Crainic, T.G. et Sgalambro, A. (2014). Service network design models for two-tier city logistics. Optimization Letters, 8(4), 1375–1387. http://dx.doi.org/10.1007/s11590-013-0662-1.


Triki, C., Oprea, S., Beraldi, P. et Crainic, T.G. (2014). The stochastic bid generation problem in combinatorial transportation auctions. European Journal of Operational Research, 236(3), 991–999. http://dx.doi.org/10.1016/j.ejor.2013.06.013.


Vidal, T., Crainic, T.G., Gendreau, M. et Prins, C. (2013). A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Computers and Operations Research, 40(1), 475–489. http://dx.doi.org/10.1016/j.cor.2012.07.018.


Rahimi-Vahed, A., Crainic, T.G., Gendreau, M. et Rei, W. (2013). A path relinking algorithm for a multi-depot periodic vehicle routing problem. Journal of Heuristics, 19(3), 497–524. http://dx.doi.org/10.1007/s10732-013-9221-2.


Abrache, J., Crainic, T.G., Gendreau, M. et Aouam, T. (2013). A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods. INFOR, 51(1), 2–14. http://dx.doi.org/10.3138/infor.51.1.2.


Errico, F., Crainic, T.G., Malucelli, F. et Nonato, M. (2013). A survey on planning semi-flexible transit systems: Methodological issues and a unifying framework. Transportation Research Part C: Emerging Technologies, 36, 324–338. http://dx.doi.org/10.1016/j.trc.2013.08.010.


Nguyen, P.K., Crainic, T.G. et Toulouse, M. (2013). A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows. European Journal of Operational Research, 231(1), 43–56. http://dx.doi.org/10.1016/j.ejor.2013.05.026.


Vu, D.M., Crainic, T.G. et Toulouse, M. (2013). A three-phase matheuristic for capacitated multi-commodity fixed-cost network design with design-balance constraints. Journal of Heuristics, 19(5), 757–795. http://dx.doi.org/10.1007/s10732-013-9225-y.


Lai, M., Crainic, T.G., Di Francesco, M. et Zuddas, P. (2013). An heuristic search for the routing of heterogeneous trucks with single and double container loads. Transportation Research Part E: Logistics and Transportation Review, 56, 108–118. http://dx.doi.org/10.1016/j.tre.2013.06.001.


Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N. et Rei, W. (2012). A hybrid genetic algorithm for multi-depot and periodic vehicle routing problems. Operations Research, 60(3), 611–624. http://dx.doi.org/10.1287/opre.1120.1048.


Jin, J., Crainic, T.G. et Lokketangen, A. (2012). A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems. European Journal of Operational Research, 222(3), 441–451. http://dx.doi.org/10.1016/j.ejor.2012.05.025.


Hemmelmayr, V.C., Cordeau, J.-F. et Crainic, T.G. (2012). An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics. Computers and Operations Research, 39(12), 3215–3228. http://dx.doi.org/10.1016/j.cor.2012.04.007.


Crainic, T.G., Errico, F., Malucelli, F. et Nonato, M. (2012). Designing the master schedule for demand-adaptive transit systems. Annals of Operations Research, 194(1), 151–166. http://dx.doi.org/10.1007/s10479-010-0710-5.


Contardo, C., Hemmelmayr, V. et Crainic, T.G. (2012). Lower and upper bounds for the two-echelon capacitated location-routing problem. Computers and Operations Research, 39(12), 3185–3199. http://dx.doi.org/10.1016/j.cor.2012.04.003.
Notes: December 2012


Davidović, T. et Crainic, T.G. (2012). MPI Parallelization of Variable Neighborhood Search. Electronic Notes in Discrete Mathematics, 39, 241–248. http://dx.doi.org/10.1016/j.endm.2012.10.032.


Thapalia, B.K., Wallace, S.W., Kaut, M. et Crainic, T.G. (2012). Single source single-commodity stochastic network design. Computational Management Science, 9(1), 139–160. http://dx.doi.org/10.1007/s10287-010-0129-0.


Thapalia, B.K., Crainic, T.G., Kaut, M. et Wallace, S.W. (2012). Single-commodity network design with random edge capacities. European Journal of Operational Research, 220(2), 394–403. http://dx.doi.org/10.1016/j.ejor.2012.01.026.


Baldi, M.M., Crainic, T.G., Perboli, G. et Tadei, R. (2012). The generalized bin packing problem. Transportation Research Part E: Logistics and Transportation Review, 48(6), 1205–1220. http://dx.doi.org/10.1016/j.tre.2012.06.005.


Andersen, J., Christiansen, M., Crainic, T.G. et Grønhaug, R. (2011). Branch and price for service network design with asset management constraints. Transportation Science, 45(1), 33–49. http://dx.doi.org/10.1287/trsc.1100.0333.


Crainic, T.G., Perboli, G., Rei, W. et Tadei, R. (2011). Efficient lower bounds and heuristics for the variable cost and size bin packing problem. Computers and Operations Research, 38(11), 1474–1482. http://dx.doi.org/10.1016/j.cor.2011.01.001.


Crainic, T.G., Mancini, S., Perboli, G. et Tadei, R. (2011). Multi-start heuristics for the two-Echelon vehicle routing problem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6622 LNCS, 179–190. http://dx.doi.org/10.1007/978-3-642-20364-0_16.


Crainic, T.G., Fu, X., Gendreau, M., Rei, W. et Wallace, S.W. (2011). Progressive hedging-based metaheuristics for stochastic network design. Networks, 58(2), 114–124. http://dx.doi.org/10.1002/net.20456.


Thapalia, B.K., Crainic, T.G., Kaut, M. et Wallace, S.W. (2011). Single-commodity network design with stochastic demand and multiple sources and sinks. INFOR, 49(3), 193–211. http://dx.doi.org/10.3138/infor.49.3.193.


Boccia, M., Crainic, T.G., Sforza, A. et Sterle, C. (2010). A metaheuristic for a two echelon location-routing problem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6049 LNCS, 288–301. http://dx.doi.org/10.1007/978-3-642-13193-6_25.


Hoff, A., Lium, A.-G., Løkketangen, A. et Crainic, T.G. (2010). A metaheuristic for stochastic service network design. Journal of Heuristics, 16(5), 653–679. http://dx.doi.org/10.1007/s10732-009-9112-8.


Bekta̧s, T., Chouman, M. et Crainic, T.G. (2010). Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints. Networks, 55(3), 171–180. http://dx.doi.org/10.1002/net.20362.


Bauer, J., Bektaş, T. et Crainic, T.G. (2010). Minimizing greenhouse gas emissions in intermodal freight transport: An application to rail service design. Journal of the Operational Research Society, 61(3), 530–542. http://dx.doi.org/10.1057/jors.2009.102.


Lium, A.-G., Crainic, T.G. et Wallace, S.W. (2009). A study of demand stochasticity in service network design. Transportation Science, 43(2), 144–157. http://dx.doi.org/10.1287/trsc.1090.0265.


Bektaş, T., Crainic, T.G. et Morency, V. (2009). Improving the performance of rail yards through dynamic reassignments of empty cars. Transportation Research Part C: Emerging Technologies, 17(3), 259–273. http://dx.doi.org/10.1016/j.trc.2008.11.003.


Crainic, T.G., Gendreau, M. et Potvin, J.-Y. (2009). Intelligent freight-transportation systems: Assessment and the contribution of operations research. Transportation Research Part C: Emerging Technologies, 17(6), 541–557. http://dx.doi.org/10.1016/j.trc.2008.07.002.


Pedersen, M.B., Crainic, T.G. et Madsen, O.B.G. (2009). Models and tabu search metaheuristics for service network design with asset-balance requirements. Transportation Science, 43(2), 158–177. http://dx.doi.org/10.1287/trsc.1080.0234.


Crainic, T.G., Ricciardi, N. et Storchi, G. (2009). Models for evaluating and planning city logistics systems. Transportation Science, 43(4), 432–454. http://dx.doi.org/10.1287/trsc.1090.0279.


Andersen, J., Crainic, T.G. et Christiansen, M. (2009). Service network design with asset management: Formulations and comparative analyses. Transportation Research Part C: Emerging Technologies, 17(2), 197–207. http://dx.doi.org/10.1016/j.trc.2008.10.005.


Andersen, J., Crainic, T.G. et Christiansen, M. (2009). Service network design with management and coordination of multiple fleets. European Journal of Operational Research, 193(2), 377–389. http://dx.doi.org/10.1016/j.ejor.2007.10.057.


Di Francesco, M., Crainic, T.G. et Zuddas, P. (2009). The effect of multi-scenario policies on empty container repositioning. Transportation Research Part E: Logistics and Transportation Review, 45(5), 758–770. http://dx.doi.org/10.1016/j.tre.2009.03.001.


Crainic, T.G., Perboli, G. et Tadei, R. (2009). TS2PACK: A two-level tabu search for the three-dimensional bin packing problem. European Journal of Operational Research, 195(3), 744–760. http://dx.doi.org/10.1016/j.ejor.2007.06.063.


Oduntan, I.O., Toulouse, M., Baumgartner, R., Bowman, C., Somorjai, R. et Crainic, T.G. (2008). A multilevel tabu search algorithm for the feature selection problem in biomedical data. Computers and Mathematics with Applications, 55(5), 1019–1033. http://dx.doi.org/10.1016/j.camwa.2006.12.098.


Crainic, T.G. et Toulouse, M. (2008). Explicit and emergent cooperation schemes for search algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5313 LNCS, 95–109. http://dx.doi.org/10.1007/978-3-540-92695-5_8.


Crainic, T.G., Perboli, G. et Tadei, R. (2008). Extreme point-based heuristics for three-dimensional bin packing. INFORMS Journal on Computing, 20(3), 368–384. http://dx.doi.org/10.1287/ijoc.l070.0250.


Crainic, T.G., Di Francesco, M. et Zuddas, P. (2008). Multi-scenario policies for maritime repositioning problems under data shortage. International Conference on Harbour, Maritime and Multimodal Logistics Modelling and Simulation, 1, 134–138.

Openurl imagette


Crainic, T.G. et Florian, M. (2008). National planning models and instruments. INFOR, 46(4), 299–308. http://dx.doi.org/10.3138/infor.46.4.299.


Crainic, T.G. (2008). Parallel solution methods for vehicle routing problems. Operations Research/ Computer Science Interfaces Series, 43, 171–198. http://dx.doi.org/10.1007/978-0-387-77778-8_8.


Crainic, T.G. et Gendreau, M. (2007). A Scatter Search heuristic for the Fixed-Charge Capacitated Network Design problem. Operations Research/ Computer Science Interfaces Series, 39, 25–40.

Openurl imagette


Abrache, J., Crainic, T.G., Gendreau, M. et Rekik, M. (2007). Combinatorial auctions. Annals of Operations Research, 153(1), 131–164. http://dx.doi.org/10.1007/s10479-007-0179-z.


Crainic, T.G., Perboli, G., Pezzuto, M. et Tadei, R. (2007). Computing the asymptotic worst-case of bin packing lower bounds. European Journal of Operational Research, 183(3), 1295–1303. http://dx.doi.org/10.1016/j.ejor.2005.07.032.


Lium, A.-G., Crainic, T.G. et Wallace, S.W. (2007). Correlations in stochastic programming: A case from stochastic service network design. Asia-Pacific Journal of Operational Research, 24(2), 161–179. http://dx.doi.org/10.1142/S0217595907001206.


Crainic, T.G., Perboli, G., Pezzuto, M. et Tadei, R. (2007). New bin packing fast lower bounds. Computers and Operations Research, 34(11), 3439–3457. http://dx.doi.org/10.1016/j.cor.2006.02.007.


Crainic, T.G., Li, Y. et Toulouse, M. (2006). A first multilevel cooperative algorithm for capacitated multicommodity network design. Computers and Operations Research, 33(9), 2602–2622. http://dx.doi.org/10.1016/j.cor.2005.07.015.


Davidović, T. et Crainic, T.G. (2006). Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems. Computers and Operations Research, 33(8), 2155–2177. http://dx.doi.org/10.1016/j.cor.2005.01.005.


Crainic, T.G., Di Chiara, B., Nonato, M. et Tarricone, L. (2006). Tackling electrosmog in completely configured 3G networks by parallel cooperative meta-heuristics. IEEE Wireless Communications, 13(6), 34–40. http://dx.doi.org/10.1109/MWC.2006.275196.


Le Bouthillier, A. et Crainic, T.G. (2005). A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Computers and Operations Research, 32(7), 1685–1708. http://dx.doi.org/10.1016/j.cor.2003.11.023.


Bourbeau, B., Crainic, T.G., Gendreau, M. et Robert, J. (2005). Design for optimized multi-lateral multi-commodity markets. European Journal of Operational Research, 163(2), 503–529. http://dx.doi.org/10.1016/j.ejor.2003.07.022.


Crainic, T.G., Malucelli, F., Nonato, M. et Guertin, F. (2005). Meta-heuristics for a class of demand-responsive transit systems. INFORMS Journal on Computing, 17(1), 10–24. http://dx.doi.org/10.1287/ijoc.1030.0051.


Abrache, J., Crainic, T.G. et Gendreau, M. (2005). Models for bundle trading in financial markets. European Journal of Operational Research, 160(1), 88–105. http://dx.doi.org/10.1016/j.ejor.2003.06.022.


Crainic, T.G. (2005). Parallel computation, co-operation, tabu search. Operations Research/ Computer Science Interfaces Series, 30, 283–302.

Openurl imagette


Crainic, T.G., Gendron, B. et Hernu, G. (2004). A slope scaling/lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. Journal of Heuristics, 10(5), 525–545. http://dx.doi.org/10.1023/B:HEUR.0000045323.83583.bd.


Crainic, T.G., Ricciardi, N. et Storchi, G. (2004). Advanced freight transportation systems for congested urban areas. Transportation Research Part C: Emerging Technologies, 12(2), 119–137. http://dx.doi.org/10.1016/j.trc.2004.07.002.


Crainic, T.G., Gendreau, M., Hansen, P. et Mladenović, N. (2004). Cooperative parallel variable neighborhood search for the p-median. Journal of Heuristics, 10(3), 293–314. http://dx.doi.org/10.1023/B:HEUR.0000026897.40171.1a.


Abrache, J., Crainic, T.G. et Gendreau, M. (2004). Design issues for combinatorial auctions. 4OR, 2(1), 1–33. http://dx.doi.org/10.1007/s10288-004-0033-y.


Joborn, M., Crainic, T.G., Gendreau, M., Holmberg, K. et Lundgren, J.T. (2004). Economies of scale in empty freight car distribution in scheduled railways. Transportation Science, 38(2), 121–134. http://dx.doi.org/10.1287/trsc.1030.0061.


Nucci, A., Sansò, B., Crainic, T.G., Leonardi, E. et Marsan, M.A. (2004). On the design of fault-tolerant logical topologies in wavelength-routed packet networks. IEEE Journal on Selected Areas in Communications, 22(9), 1884–1895. http://dx.doi.org/10.1109/JSAC.2004.833887.


Ghamlouche, I., Crainic, T.G. et Gendreau, M. (2004). Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design. Annals of Operations Research, 131(1-4), 109–133. http://dx.doi.org/10.1023/B:ANOR.0000039515.90453.1d.


Toulouse, M., Crainic, T.G. et Sansó, B. (2004). Systemic behavior of cooperative search algorithms. Parallel Computing, 30(1), 57–79. http://dx.doi.org/10.1016/j.parco.2002.07.001.


Ghamlouche, I., Crainic, T.G. et Gendreau, M. (2003). Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Operations Research, 51(4), 655–667+674. http://dx.doi.org/10.1287/opre.51.4.655.16098.


Kuncyté, R., Laberge-Nadeau, C., Crainic, T.G. et Read, J.A. (2003). Organisation of truck-driver training for the transportation of dangerous goods in Europe and North America. Accident Analysis and Prevention, 35(2), 191–200. http://dx.doi.org/10.1016/S0001-4575(01)00103-8.


Rabbath, C.A., El Cadi, A.A., Abdonne, M., Lechevin, N., Lapierre, S. et Crainic, T. (2002). Automatic parallelization of electro-mechanical systems governed by ODEs. Transactions of the Canadian Society for Mechanical Engineering, 26(3), 347–365.

Openurl imagette


Crainic, T.G. et Gendreau, M. (2002). Cooperative parallel tabu search for capacitated network design. Journal of Heuristics, 8(6), 601–627. http://dx.doi.org/10.1023/A:1020325926188.


Hélou, C., Dssouli, R. et Crainic, T.-G. (2002). Performance testing of a negotiation platform. Information and Software Technology, 44(5), 313–330. http://dx.doi.org/10.1016/S0950-5849(01)00215-4.


Crainic, T.G., Frangioni, A. et Gendron, B. (2001). Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Applied Mathematics, 112(1-3), 73–99. http://dx.doi.org/10.1016/S0166-218X(00)00310-3.


Crainic, T.G., Dufour, G., Florian, M., Larin, D. et Leve, Z. (2001). Demand matrix adjustment for multimodal freight networks. Transportation Research Record, (1771), 140–147.

Openurl imagette


Crainic, T.G., Gendreau, M. et Farvolden, J.M. (2000). A Simplex-Based Tabu Search Method for Capacitated Network Design. INFORMS Journal on Computing, 12(3), 223–236.

Openurl imagette


Toulouse, M., Crainic, T.G. et Thulasiraman, K. (2000). Global optimization properties of parallel cooperative search algorithms: A simulation study. Parallel Computing, 26(Amsterdam, Netherlands), 91–112. http://dx.doi.org/10.1016/S0167-8191(99)00097-6.


Crainic, T.G. (2000). Service network design in freight transportation. European Journal of Operational Research, 122(Amsterdam, Netherlands), 272–288. http://dx.doi.org/10.1016/S0377-2217(99)00233-7.


Gendron, B. et Crainic, T.G. (1997). A parallel branch-and-bound algorithm for multicommodity location with balancing requirements. Computers and Operations Research, 24(9), 829–847.

Openurl imagette


Crainic, T.G., Toulouse, M. et Gendreau, M. (1997). Toward a taxonomy of parallel tabu search heuristics. INFORMS Journal on Computing, 9(1), 61–72.

Openurl imagette


Crainic, T.G., Toulouse, M. et Gendreau, M. (1996). Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements. Annals of Operations Research, 63, 277–299.

Openurl imagette


Gendron, B. et Crainic, T.G. (1995). A branch-and-bound algorithm for depot location and container fleet management. Location Science, 3(1), 39–53.

Openurl imagette


Crainic, T.G., Toulouse, M. et Gendreau, M. (1995). Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements. OR Spektrum, 17(2-3), 113–123. http://dx.doi.org/10.1007/BF01719254.


Gendron, B. et Crainic, T.G. (1994). Parallel branch-and-bound algorithms: survey and synthesis. Operations Research, 42(Baltimore, MD, United States), 1042–1066.

Openurl imagette


Crainic, T.G., Delorme, L. et Dejax, P. (1993). A branch-and-bound method for multicommodity location with balancing requirements. European Journal of Operational Research, 65(3), 368–382.

Openurl imagette


Crainic, T.G., Gendreau, M., Soriano, P. et Toulouse, M. (1993). A tabu search procedure for multicommodity location/allocation with balancing requirements. Annals of Operations Research, 41(4), 359–383. http://dx.doi.org/10.1007/BF02023001.


Gédéon, C., Florian, M. et Crainic, T.G. (1993). Determining origin-destination matrices and optimal multiproduct flows for freight transportation over multimodal networks. Transportation Research Part B, 27(5), 351–368.

Openurl imagette


Crainic, T.G. et Delorme, L. (1993). Dual-ascent procedures for multicommodity location-allocation problems with balancing requirements. Transportation Science, 27(2), 90–101.

Openurl imagette


Crainic, T.G., Gendreau, M. et Dejax, P. (1993). Dynamic and stochastic models for the allocation of empty containers. Operations Research, 41(1), 102–126.

Openurl imagette


Crainic, T.G. et Roy, J. (1992). Design of regular intercity driver routes for the LTL motor carrier industry. Transportation Science, 26(4), 280–295.

Openurl imagette


Mondou, J.-F., Crainic, T.G. et Nguyen, S. (1991). Shortest path algorithms: A computational study with the C programming language. Computers and Operations Research, 18(8), 767–786.

Openurl imagette


Crainic, T.G., Florian, M. et Leal, J.-E. (1990). Model for the strategic planning of national freight transportation by rail. Transportation Science, 24(1), 1–24.

Openurl imagette


Guelat, J., Florian, M. et Crainic, T.G. (1990). Multimode multiproduct network assignment model for strategic planning of freight flows. Transportation Science, 24(1), 25–39.

Openurl imagette


Crainic, T.G., Dejax, P. et Delorme, L. (1989). Models for multimode multicommodity location problems with interdepot balancing requirements. Annals of Operations Research, 18(1), 277–302. http://dx.doi.org/10.1007/BF02097809.


Crainic, T.G. et Roy, J. (1988). OR tools for tactical freight transportation planning. European Journal of Operational Research, 33(3), 290–297.

Openurl imagette


Crainic, T.G. et Rousseau, J.-M. (1987). COLUMN GENERATION PRINCIPLE AND THE AIRLINE CREW SCHEDULING PROBLEM. INFOR: Information Systems and Operational Research, 25(2), 136–151.

Openurl imagette


Dejax, P.J. et Crainic, T.G. (1987). REVIEW OF EMPTY FLOWS AND FLEET MANAGEMENT MODELS IN FREIGHT TRANSPORTATION. Transportation Science, 21(4), 227–247.

Openurl imagette


Crainic, T.G. et Rousseau, J.-M. (1986). Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem. Transportation Research Part B, 20(3), 225–242.

Openurl imagette


Crainic, T.G. et Semet, F. (2013). Operations Research and Goods Transportation. Dans Applications of Combinatorial Optimization (p. 111–175). Vol. 3. John Wiley and Sons. http://dx.doi.org/10.1002/9781118600283.ch5.


Crainic, T.G. et Florian, M. (2013). Optimization Models for Transportation Systems Planning. Dans Applications of Combinatorial Optimization (p. 177–207). Vol. 3. John Wiley and Sons. http://dx.doi.org/10.1002/9781118600283.ch6.


Crainic, T.G., Le Cun, B. et Roucairol, C. (2006). Parallel Branch-and-Bound Algorithms. Dans Parallel Combinatorial Optimization (p. 1–28). John Wiley & Sons, Inc. http://dx.doi.org/10.1002/9780470053928.ch1.


Crainic, T.G. et Hail, N. (2005). Parallel Metaheuristics Applications. Dans Parallel Metaheuristics: A New Class of Algorithms (p. 447–494). John Wiley & Sons, Inc. http://dx.doi.org/10.1002/0471739383.ch19.


Crainic, T.G., Gendreau, M. et Potvin, J.-Y. (2005). Parallel Tabu Search. Dans Parallel Metaheuristics: A New Class of Algorithms (p. 289–313). John Wiley & Sons, Inc. http://dx.doi.org/10.1002/0471739383.ch13.


Perboli, G., Crainic, T.G. et Tadei, R. (2011). An efficient metaheuristic for multi-dimensional multi-container packing. Dans IEEE International Conference on Automation Science and Engineering. http://dx.doi.org/10.1109/CASE.2011.6042476.


Benjelloun, A., Crainic, T.G. et Bigras, Y. (2010). Towards a taxonomy of City Logistics projects. Dans Procedia – Social and Behavioral Sciences, 2. http://dx.doi.org/10.1016/j.sbspro.2010.04.032.


Crainic, T.G., Perboli, G., Mancini, S. et Tadei, R. (2010). Two-Echelon Vehicle Routing Problem: A satellite location analysis. Dans Procedia – Social and Behavioral Sciences, 2. http://dx.doi.org/10.1016/j.sbspro.2010.04.009.


Crainic, T.G., Crisan, G.C., Gendreau, M., Lahrichi, N. et Rei, W. (2009). Multi-thread integrative cooperative optimization for rich combinatorial problems. Dans IPDPS 2009 – Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium. http://dx.doi.org/10.1109/IPDPS.2009.5161124.


Wallace, S.W., Kaut, M., Crainic, T.G. et Lium, A.-G. (2007). Stochastics in discrete logistics models: What can we do? Dans IEEM 2007: 2007 IEEE International Conference on Industrial Engineering and Engineering Management. http://dx.doi.org/10.1109/IEEM.2007.4419320.


Crainic, T.G. et Florian, M. (2005). A note on computing shortest paths with logistic constraints. Dans Transportation and the Economy – Proceedings of the 10th International Conference of Hong Kong Society for Transportation Studies, HKSTS 2005.


Rabbath, C.A., Lechevin, N., Ait El Cadi, A., Lapierre, S.D., Abdoune, M. et Crainic, T. (2003). Heuristics-based Parallelization of a Class of Control Systems. Dans Proceedings of the American Control Conference, 3.


Nucci, A., Sansò, B., Crainic, T.G., Leonardi, E. et Ajmone Marsan, M. (2001). Design of fault-tolerant logical topologies in wavelength-routed optical IP networks. Dans Conference Record / IEEE Global Telecommunications Conference, 4.


Toulouse, M., Crainic, T.G., Sanso, B. et Thulasiraman, K. (1998). Self-organization in cooperative tabu search algorithms. Dans Anon (dir.). Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 3.


Crainic, T.G. (1984). COMPARISON OF TWO METHODS FOR TACTICAL PLANNING IN RAIL FREIGHT TRANSPORTATION.


Communications

Communications

  • Aucune donnée disponible pour cette section.
Réalisations

Réalisations

  • Aucune donnée disponible pour cette section.
Distinctions

Prix et distinctions

  • Aucune donnée disponible pour cette section.
Services à la collectivité

Services à la collectivité

Aucune donnée disponible pour cette section.