Teodor Gabriel Crainic

According to our database1, Teodor Gabriel Crainic authored at least 141 papers between 1984 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Scheduled service network design with quality targets and stochastic travel times.
Eur. J. Oper. Res., 2021

Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and 'grey zone' customers arising in urban logistics.
Eur. J. Oper. Res., 2021

Integrating Resource Management in Service Network Design for Bike-Sharing Systems.
Transp. Sci., 2020

Introduction to the Special Section: Urban Freight Transportation and Logistics.
Transp. Sci., 2020

The Benders Dual Decomposition Method.
Oper. Res., 2020

Population-based risk equilibration for the multimode hazmat transport network design problem.
Eur. J. Oper. Res., 2020

Branch-and-Price-Based Algorithms for the Two-Echelon Vehicle Routing Problem with Time Windows.
Transp. Sci., 2019

Special issue on "Transportation and Logistics with Autonomous Technologies".
Int. Trans. Oper. Res., 2019

Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions.
INFORMS J. Comput., 2019

A Branch-and-Cut-and-Price algorithm for the Multi-trip Separate Pickup and Delivery Problem with Time Windows at Customers and Facilities.
Eur. J. Oper. Res., 2019

Parallel Metaheuristic Search.
Proceedings of the Handbook of Heuristics., 2018

Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems.
SIAM J. Optim., 2018

The load planning problem for double-stack intermodal trains.
Eur. J. Oper. Res., 2018

Simulation of intermodal freight transportation systems: a taxonomy.
Eur. J. Oper. Res., 2018

Special issue on: "Models and methods for the supply chain and logistics management".
EURO J. Transp. Logist., 2018

Scheduled service network design with resource acquisition and management.
EURO J. Transp. Logist., 2018

The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design.
EURO J. Comput. Optim., 2018

Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm.
Comput. Oper. Res., 2018

A Study on Travel Time Stochasticity in Service Network Design with Quality Targets.
Proceedings of the Computational Logistics - 9th International Conference, 2018

A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems.
Transp. Sci., 2017

Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design.
Transp. Sci., 2017

The Benders decomposition algorithm: A literature review.
Eur. J. Oper. Res., 2017

Introduction to the special issue on City Logistics.
EURO J. Transp. Logist., 2017

Multi-trip pickup and delivery problem with time windows and synchronization.
Ann. Oper. Res., 2017

The Impact of Combining Inbound and Outbound Demand in City Logistics Systems.
Proceedings of the 41st IEEE Annual Computer Software and Applications Conference, 2017

Service Network Design with Resource Constraints.
Transp. Sci., 2016

Modeling Demand Uncertainty in Two-Tier City Logistics Tactical Planning.
Transp. Sci., 2016

<i>Transportation Science</i> Special Issue on Freight Transportation and Logistics, Part II.
Transp. Sci., 2016

<i>Transportation Science</i> Special Issue on Freight Transportation and Logistics, Part I.
Transp. Sci., 2016

A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem.
Eur. J. Oper. Res., 2016

Logistics capacity planning: A stochastic bin packing formulation and a progressive hedging meta-heuristic.
Eur. J. Oper. Res., 2016

A Revenue Management Approach for Network Capacity Allocation of an Intermodal Barge Transportation System.
Proceedings of the Computational Logistics - 7th International Conference, 2016

Service Network Design of Bike Sharing Systems with Resource Constraints.
Proceedings of the Computational Logistics - 7th International Conference, 2016

Cutting-Plane Matheuristic for Service Network Design with Design-Balanced Requirements.
Transp. Sci., 2015

Parallel Local Search to schedule communicating tasks on identical processors.
Parallel Comput., 2015

Timing problems and algorithms: Time decisions for sequences of activities.
Networks, 2015

Strategic analysis of the dairy transportation problem.
J. Oper. Res. Soc., 2015

Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows.
INFOR Inf. Syst. Oper. Res., 2015

Time-window relaxations in vehicle routing heuristics.
J. Heuristics, 2015

Solution integration in combinatorial optimization with applications to cooperative search and rich vehicle routing.
J. Heuristics, 2015

An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: Application to the MDPVRP.
Eur. J. Oper. Res., 2015

A column generation approach for a multi-attribute vehicle routing problem.
Eur. J. Oper. Res., 2015

Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm.
Comput. Oper. Res., 2015

A branch-and-price approach for a multi-period vehicle routing problem.
Comput. Oper. Res., 2015

Service network design models for two-tier city logistics.
Optim. Lett., 2014

Scheduled Service Network Design for Freight Rail Transportation.
Oper. Res., 2014

A hybrid generational genetic algorithm for the periodic vehicle routing problem with time windows.
J. Heuristics, 2014

Implicit depot assignments and rotations in vehicle routing heuristics.
Eur. J. Oper. Res., 2014

A unified solution framework for multi-attribute vehicle routing problems.
Eur. J. Oper. Res., 2014

The stochastic bid generation problem in combinatorial transportation auctions.
Eur. J. Oper. Res., 2014

A cooperative parallel metaheuristic for the capacitated vehicle routing problem.
Comput. Oper. Res., 2014

Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design.
Comput. Oper. Res., 2014

Branch-and-price and beam search algorithms for the Variable Cost and Size Bin Packing Problem with optional items.
Ann. Oper. Res., 2014

A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods.
INFOR Inf. Syst. Oper. Res., 2013

A three-phase matheuristic for capacitated multi-commodity fixed-cost network design with design-balance constraints.
J. Heuristics, 2013

A path relinking algorithm for a multi-depot periodic vehicle routing problem.
J. Heuristics, 2013

Heuristics for multi-attribute vehicle routing problems: A survey and synthesis.
Eur. J. Oper. Res., 2013

A tabu search for Time-dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows.
Eur. J. Oper. Res., 2013

A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows.
Comput. Oper. Res., 2013

A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems.
Oper. Res., 2012

Single-commodity network design with random edge capacities.
Eur. J. Oper. Res., 2012

A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems.
Eur. J. Oper. Res., 2012

MPI Parallelization of Variable Neighborhood Search.
Electron. Notes Discret. Math., 2012

An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics.
Comput. Oper. Res., 2012

Lower and upper bounds for the two-echelon capacitated location-routing problem.
Comput. Oper. Res., 2012

Single source single-commodity stochastic network design.
Comput. Manag. Sci., 2012

Designing the master schedule for demand-adaptive transit systems.
Ann. Oper. Res., 2012

Branch and Price for Service Network Design with Asset Management Constraints.
Transp. Sci., 2011

Progressive hedging-based metaheuristics for stochastic network design.
Networks, 2011

Single-Commodity Network Design with Stochastic Demand and Multiple Sources and Sinks.
INFOR Inf. Syst. Oper. Res., 2011

Efficient lower bounds and heuristics for the variable cost and size bin packing problem.
Comput. Oper. Res., 2011

Multi-start Heuristics for the Two-Echelon Vehicle Routing Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2011

An efficient metaheuristic for multi-dimensional multi-container packing.
Proceedings of the IEEE Conference on Automation Science and Engineering, 2011

Comparaison de différentes formulations de conception de réseaux pour un problème de transport de fret avec gestion de véhicules.
Stud. Inform. Univ., 2010

Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints.
Networks, 2010

Minimizing greenhouse gas emissions in intermodal freight transport: an application to rail service design.
J. Oper. Res. Soc., 2010

A metaheuristic for stochastic service network design.
J. Heuristics, 2010

Special issue on recent advances in metaheuristics.
J. Heuristics, 2010

A Metaheuristic for a Two Echelon Location-Routing Problem.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Models and Tabu Search Metaheuristics for Service Network Design with Asset-Balance Requirements.
Transp. Sci., 2009

A Study of Demand Stochasticity in Service Network Design.
Transp. Sci., 2009

Models for Evaluating and Planning City Logistics Systems.
Transp. Sci., 2009

Guest Editorial - Focused Issue on Freight Transportation.
Transp. Sci., 2009

TS<sup>2</sup>PACK: A two-level tabu search for the three-dimensional bin packing problem.
Eur. J. Oper. Res., 2009

Service network design with management and coordination of multiple fleets.
Eur. J. Oper. Res., 2009

Multi-thread integrative cooperative optimization for rich combinatorial problems.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

A concurrent evolutionary approach for rich combinatorial optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Extreme Point-Based Heuristics for Three-Dimensional Bin Packing.
INFORMS J. Comput., 2008

National Planning Models and Instruments.
INFOR Inf. Syst. Oper. Res., 2008

A multilevel tabu search algorithm for the feature selection problem in biomedical data.
Comput. Math. Appl., 2008

J. Math. Model. Algorithms, 2007

Computing the asymptotic worst-case of bin packing lower bounds.
Eur. J. Oper. Res., 2007

New bin packing fast lower bounds.
Comput. Oper. Res., 2007

Correlations in Stochastic Programming: a Case from Stochastic Service Network Design.
Asia Pac. J. Oper. Res., 2007

Combinatorial auctions.
Ann. Oper. Res., 2007

Explicit and Emergent Cooperation Schemes for Search Algorithms.
Proceedings of the Learning and Intelligent Optimization, Second International Conference, 2007

A Scatter Search Heuristic for the Fixed-Charge Capacitated Network Design Problem.
Proceedings of the Metaheuristics, 2007

Chapter 8 Intermodal Transportation.
Proceedings of the Transportation, 2007

Tackling electrosmog in completely configured 3G networks by parallel cooperative meta-heuristics.
IEEE Wirel. Commun., 2006

The single-node dynamic service scheduling and dispatching problem.
Eur. J. Oper. Res., 2006

Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems.
Comput. Oper. Res., 2006

A first multilevel cooperative algorithm for capacitated multicommodity network design.
Comput. Oper. Res., 2006

Meta-Heuristics for a Class of Demand-Responsive Transit Systems.
INFORMS J. Comput., 2005

A Guided Cooperative Search for the Vehicle Routing Problem with Time Windows.
IEEE Intell. Syst., 2005

Design for optimized multi-lateral multi-commodity markets.
Eur. J. Oper. Res., 2005

Models for bundle trading in financial markets.
Eur. J. Oper. Res., 2005

A cooperative parallel meta-heuristic for the vehicle routing problem with time windows.
Comput. Oper. Res., 2005

Economies of Scale in Empty Freight Car Distribution in Scheduled Railways.
Transp. Sci., 2004

Systemic behavior of cooperative search algorithms.
Parallel Comput., 2004

On the design of fault-tolerant logical topologies in wavelength-routed packet networks.
IEEE J. Sel. Areas Commun., 2004

Cooperative Parallel Variable Neighborhood Search for the <i>p</i>-Median.
J. Heuristics, 2004

A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design.
J. Heuristics, 2004

A new bidding framework for combinatorial e-auctions.
Comput. Oper. Res., 2004

Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design.
Ann. Oper. Res., 2004

Design issues for combinatorial auctions.
4OR, 2004

Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design.
Oper. Res., 2003

Parallel Strategies for Meta-Heuristics.
Proceedings of the Handbook of Metaheuristics, 2003

Performance testing of a negotiation platform.
Inf. Softw. Technol., 2002

Introduction to the Special Issue on Parallel Meta-Heuristics.
J. Heuristics, 2002

Cooperative Parallel Tabu Search for Capacitated Network Design.
J. Heuristics, 2002

Bundle-based relaxation methods for multicommodity capacitated fixed charge network design.
Discret. Appl. Math., 2001

Design of fault-tolerant logical topologies in wavelength-routed optical IP networks.
Proceedings of the Global Telecommunications Conference, 2001

Global optimization properties of parallel cooperative search algorithms: A simulation study.
Parallel Comput., 2000

Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem.
Parallel Comput., 2000

A Simplex-Based Tabu Search Method for Capacitated Network Design.
INFORMS J. Comput., 2000

Service network design in freight transportation.
Eur. J. Oper. Res., 2000

Self-organization in cooperative tabu search algorithms.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998

Toward a Taxonomy of Parallel Tabu Search Heuristics.
INFORMS J. Comput., 1997

A parallel branch-and-bound algorithm for multicommodity location with balancing requirements.
Comput. Oper. Res., 1997

Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements.
Ann. Oper. Res., 1996

Parallel Branch-and-Branch Algorithms: Survey and Synthesis.
Oper. Res., 1994

Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements.
Transp. Sci., 1993

Dynamic and Stochastic Models for the Allocation of Empty Containers.
Oper. Res., 1993

A tabu search procedure for multicommodity location/allocation with balancing requirements.
Ann. Oper. Res., 1993

Design of Regular Intercity Driver Routes for the LTL Motor Carrier Industry.
Transp. Sci., 1992

An interactive graphic approach for the integrated design of intercity transportation timetables and vehicle operations.
Comput. Oper. Res., 1992

Shortest path algorithms: A computational study with the C programming language.
Comput. Oper. Res., 1991

A Multimode Multiproduct Network Assignment Model for Strategic Planning of Freight Flows.
Transp. Sci., 1990

A Model for the Strategic Planning of National Freight Transportation by Rail.
Transp. Sci., 1990

Survey Paper - A Review of Empty Flows and Fleet Management Models in Freight Transportation.
Transp. Sci., 1987

A Tactical Planning Model for Rail Freight Transportation.
Transp. Sci., 1984