3 Presentations

• 
  03:30 PM - 03:55 PM

  A Solution Framework for the Capacitated Multi-Commodity Fixed-Cost Network Design with Design-Balance Constraints

  • Vu Duc Minh, presenter, Université de Montréal
  • Teodor Gabriel Crainic, Université du Québec à Montréal
  • Michel Toulouse, Oklahoma State University

  We study a class of the capacitated multi-commodity fixed-cost network design where the design-balance constraints are included. We propose a solution framework which is based on tabu-search, path-relinking and a weighted intensification scheme. The computational results indicate that the framework performed well on bench-mark instances, and are competitive with CPLEX and the current state-of-art tabu-search solution method for this problem.

• 
  03:55 PM - 04:20 PM

  Capacitated Hub-and-Spoke Network Design with Stochastic Demand and Congestion

  • Navneet Vidyarthi, Concordia University
  • Satyaveer Chauhan, Concordia University
  • Nader Azizi, presenter, Concordia University

  In this talk, we present model and solution approaches for designing a capacitated single allocation hub-and-spoke network with stochastic demand and congestion. The problem is setup as a network of spatially distributed M/G/1 queues and modelled as nonlinear mixed interger program. We present computational results and insights.

• 
  04:20 PM - 04:45 PM

  Strategies for Designing Routes to Urban Garbage Collection

  • Marcos José Negreiros, presenter, State University of Ceará
  • Augusto Palhano, GRAPHVS Cons., Com., Rep. Ltda

  We consider three different routing design strategies to urban garbage collection: Route-First-Cluster-Second, Cluster-First-Route-Second and Route-Cluster-Route. The first strategy has been studied by the literature, and applies this concept by aggregating required street segments after designing a great route. This approach does not consider that the departure place of vehicles and disposal site are in different location, than intermediate facilities and the network are not considered before routing. The second approach is more susceptible to the practical design of different origin-destination routes, but needs more preparation in the stage of clustering the street segments to be covered. Finally the third, although more related to most recent CARP methodologies and costs normaly less, it has difficulties in the real life absorption by the managers and drivers. We show these strategies applied in routing over urban garbage collection street networks for the city of Fortaleza/CE, Brazil. We verify that for the different contexts (type of the street network, distribution of the garbage across the area) the design of the routes can achieve interesting results in presence of balanced or non balanced routes.