|
First author |
Title |
Session |
|
Albareda, E. Molina, C. Simón, A. Alonso |
Capacitated Vehicle
Assignment-Routing Problem with Due Dates |
Fr.2.a |
|
Albareda, E. Fernández, G. Laporte |
The Capacitated and Distance
Constrained Plant Location Problem |
Fr.3.a |
|
Alessandri, S. Sacone, S. Siri |
Optimal control of maritime
container terminals for tactical-operational planning |
Fr.1.b |
|
Andersen, T.G. Crainic,
M. Christiansen |
Optimizing intermodal transfers
|
Fr.2.b |
|
Angelelli, M.
W. P. Savelsbergh, M.G. Speranza |
A Dynamic Multi-Period Routing Problem |
We.4.a |
|
Aráoz, E. Fernández, C. Franquesa, O. Meza |
Prize-collecting Arc Routing
Problems and Extensions |
Tu.3.a |
|
Archetti, L. Bertazzi, G. Laporte,
M.G. Speranza |
A Branch-and-Cut Algorithm for a Vendor
Managed Inventory-Routing Problem |
We.2.a |
|
Archetti, M.W.P. Savelsbergh, M.G. Speranza |
Worst-Case Analysis for |
Th.2.a |
|
Baldacci, A. Mingozzi |
Lower Bounds and an Exact Method for
the Capacitated Vehicle Routing Problem |
Th.2.a |
|
Barceló, H. Grzybowsca, S. Pardo |
Vehicle Routing and Scheduling
Models, Simulation and City Logistics |
We.1.b |
|
Barnhart, L. Marla |
Network-Based Resource Allocation
Problems Under Uncertainty |
Tu.2.a |
|
Belenguer, E. Benavent, C. Prins,
C. Prodhon, R. Wolfler-Calvo |
A Cutting Plane method for the
Capacitated Location-Routing Problem |
Tu.2.a |
|
Berger, C. Bierwirth |
A Coordination Model for
Transportation Networks |
We.2.b |
|
Bertazzi |
Analysis of Direct Shipping
Policies in an Inventory Routing Problem with Time Discretization |
We.2.a |
|
Bilegan, T.G. Crainic, M. Gendreau |
Intermodal Freight Transportation Demand Estimation using Neural Networks |
Fr.2.b |
|
Boulanger, F. Semet |
A heuristic method for solving a
hazardous waste collection routing problem |
We.3.b |
|
Boulanger, F.
Semet, P. Vaca |
An integrated bicriteria
model and a heuristic approach for a hazardous wastes transportation problem |
We.3.b |
|
Bozkaya, B. Cao |
A Heuristic Approach to Planning
Service Technician Operations for a Utility Company |
Fr.1.a |
|
Bregman, G.
Ghiani, E. Manni, A. Quaranta, R. Musmanno |
Real-time Fleet Management in the
Courier Industry |
Th.2.b |
|
Brotcorne, P. Marcotte, M. Wiart |
A Bilevel
Approach for the Hazardous Materials Routing Problem |
We.3.b |
|
Campbell, D.
Vandenbussche, W. Hermann |
Routing for Relief Efforts |
Th.1.a |
|
Campetella, G. Lulli, U. Pietropaoli,
N. Ricciardi |
Freight Service Design for an Italian
Railways Company |
We.2.b |
|
Cappanera, G. De Pascale, M.G.
Scutellà |
Color-coding heuristic approaches for the balanced path problem |
Th.1.b |
|
Cardeneo |
Structure Guided Local Search for
Vehicle Routing Problems |
Fr.1.a |
|
Cartenì, S. De Luca |
A discrete event simulation model
for a container terminal |
Fr.1.b |
|
Castelli, R. Pesenti, W. Ukovich |
Cargo revenue management: capacity
inventory control when demand is not independent |
We.4.b |
|
Chouman, T.G. Crainic, B. Gendron,
E. Naudin |
Exact Methods for Multicommodity Capacitated Fixed Charge Network Design |
Th.1.b |
|
Christiansen, K. Fagerholt, Ø. Haugen, E. H. Lund |
Complex ship routing and
scheduling |
We.4.b |
|
Cordeau, M. Iori, G. Laporte,
J.J. Salazar |
Branch-and-Cut for the Pickup and
Delivery Traveling Salesman Problem with LIFO
Loading |
Tu.4.a |
|
Crainic, G. Perboli, R. Tadei |
Extreme-Point-Based Heuristics for
Three-Dimensional Packing Problems |
Fr.1.b |
|
Del Pia,
C. Filippi |
A Variable Neighborhood Descent
Algorithm for a Real Waste Collection Problem with |
Tu.1.a |
|
Desaulniers,
A. Hertz, A.S. Pepin, G. Dereu |
Comparison of Heuristic Approaches
for the Multi-Depot Vehicle Scheduling Problem |
Fr.1.a |
|
Di Francesco,
A. Manca, A. Olivo, P. Zuddas |
Optimal Management of Empty
Containers |
Tu.2.b |
|
Doerner, R.F. Hartl, V.
Hemmelmayr, M.W.P. Savelsbergh |
Delivery Strategies for Periodic
Blood Products Supplies |
We.4.a |
|
Douma, P.C. Schuur |
Applying revenue management to
real-time transportation planning |
Tu.3.b |
|
Drexl |
The Vehicle Routing Problem with
Trailers and Transshipments |
Th.2.b |
|
Erera, J.C. Morales, M.W.P. Savelsbergh |
Robust Optimization for Empty
Repositioning Problems |
Th.2.b |
|
Flatberg, G.
Hasle, O. Kloster, E. Nilssen, A. Riise, M. Smedsrud |
Abstraction and Aggregation
Techniques for Solving Real-life, Huge-Scale Vehicle Routing Problems |
Fr.2.a |
|
Fligliozzi |
An Incentive Compatible Dynamic Mechanisms
for Carrier Collaboration |
Tu.3.b |
|
Gabrielli, A. Guidazzi, M.A. Boschetti,
M. Roffilli, V. Maniezzo |
Practical Origin-Destination
traffic flow estimation |
We.1.b |
|
Gendreau, M.
Tagmouti, J.Y. Potvin |
Arc Routing Problems with Time-Dependent
Service Costs |
Tu.1.a |
|
Gentile, D. Vigo |
A Demand Model for Freight
Movements in City Logistics Applications |
Tu.4.b |
|
Giesen, H.S. Mahmassani, P.
Jaillet |
Real-Time Strategies for the
Online Inventory Routing Problem |
We.2.a |
|
González-Velarde, R.
Martí |
Robust Capacitated International
Sourcing Problem |
Fr.3.a |
|
Grellier, P.
Dejax, N. Jussien, Z. Lu |
Column Generation and Constraint
Programming for solving an Inventory Routing Problem in the Reverse Logistics
Context |
We.2.a |
|
Gribkovskaia,
O. Halskau, G. Laporte, M. Vlcek |
General Solutions to the Single
Vehicle Routing Problem with Pickups and Deliveries |
We.1.a |
|
Hernández, S. Peeta, |
Single Freight Carrier
Collaboration Problem |
Tu.2.b |
|
Hoff, A. Lokketangen,
T.G. Crainic, A.G. Lium |
Stochastic Service Network Design:
Solving Large Instances Using Metaheuristics |
Th.1.b |
|
Irnich |
A Unified Modelling and Solution
Framework for Vehicle Routing and Local Search based Metaheuristics |
We.1.a |
|
Johnson, S. Woehlk |
Using Column Generation to Solve
Capacitated Arc Routing with Time Windows |
Tu.3.a |
|
Jorgensen, A.
Larsen, O.B.G. Madsen |
Analisis and Comparison of Typical Models within Supply Chain Management |
Tu.1.b |
|
Kallehauge |
Formulations and exact approaches
for the vehicle routing problem with time windows |
Th.1.a |
|
Kallehauge,
J. Larsen, O.B.G. Madsen, M. Solomon |
Recent advances in the Vehicle
Routing Problem with Time Windows |
Th.1.a |
|
Korsvik, K.
Fagerholt, G. Brønmo |
Ship scheduling with flexible
cargo quantities: A heuristic solution approach |
We.4.b |
|
Labadi, P. Lacomme,
C. Prins |
A memetic
algorithm with population management for the heterogeneous fleet VRP |
Fr.1.a |
|
Lacomme, M.C.
Mourão, A.C. Nunes, C. Prins |
Heuristic method for the
sectoring-arc routing problem |
Tu.1.a |
|
Laguna, J. Pacheco |
A Tabu Search Method for Solving
an Urban Transport Model |
We.3.a |
|
Landete, A. Marín |
A reduced formulation for the multiple
allocation p-hub location problem |
Fr.3.a |
|
Letchford, J. Lysgaard, R.W. Eglese |
A Branch-and-Cut algorithm for the
Capacitated Open Vehicle Routing Problem |
Th.2.a |
|
Li, P.B. Mirchandani,
D. Borenstein |
Real-time Schedule Recovery under Vehicle
Breakdown |
Th.2.b |
|
Lium, T.G. Crainic, S.W. Wallace |
Stochastic network design – is
there a practical way forward? |
Th.1.b |
|
Lombardo, V. Recagno, M. Paolucci, S. Sacone, S. Siri |
Operational planning of long-haul intermodal freight transportation |
Tu.2.b |
|
Lozano, J.P. Antún, F. Granados, V.
Torres, G. Londoño, A. Zamarripa |
Multiple vehicle flow estimation
for determining freight corridors in |
We.2.b |
|
Ma, E. Hadjiconstantinou |
Determining optimal flows in
sea-land intermodal transport |
Fr.2.b |
|
Maniezzo, R. Baldacci |
Exact Solutions of mixed CARP
instances |
Tu.3.a |
|
Mansini, M. Pelizzari, R.W.
Calvo |
The Tour Orienteering Problem with
Time Windows |
Tu.4.a |
|
Mattfeld |
The Allocation of Storage Space
for Transshipment inVehicle
Distribution |
Fr.1.b |
|
Meisel, C. Bierwirth |
Integrated |
Fr.1.b |
|
Mes, M.C.
Van der Heijden |
|
We.3.a |
|
Montemanni,
J. Barta, L.M. Gambardella |
An exact algorithm for the robust
travelling salesman problem with interval data |
Tu.4.a |
|
Morales, A.L.
Erera, M.W.P. Savelsbergh |
A Robust Optimization Framework
for the Vehicle Routing Problem with Uncertain Demands and Duration
Constraints |
Fr.2.a |
|
Nikolakopoulos, H. Sarimveis |
A Heuristic approach to the
Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery |
We.1.a |
|
Nowak, O. Ergun,
C. White |
Pickup and Delivery with |
We.1.a |
|
Özyurt, D. Aksen |
Solving the Time Constrained
Multi-Depot Location-Routing Problem with Lagrangian
Relaxation |
Tu.2.a |
|
Pankratz, H. Gehring |
Preference elicitation in
combinatorial reverse auctions for collaborative transportation planning |
Tu.3.b |
|
Petersen |
Solving a Pickup and Delivery
Problem with Sequencing Constraints |
We.1.a |
|
Quak |
Distribution strategies under
urban freight policy pressure |
Tu.4.b |
|
Raa, W. Dullaert |
A new start with a cyclic
distribution strategy |
Fr.3.b |
|
Riera-Ledesma, J.J. Salazar |
Solving a School Bus Routing
Problem |
We.3.a |
|
Righini, M. Salani |
Decremental state space relaxation algorithms for the orienteering problem with time
windows |
Tu.4.a |
|
Ríos-Mercado, E.
Fernández |
A GRASP for a |
Tu.2.a |
|
Rodney, A. Soper,
C. Walshaw |
Multilevel Refinement for the
Vehicle Routing Problem |
Fr.2.a |
|
Rodríguez, J.J. Salazar |
Solving a Network Design Problem |
Th.1.b |
|
Ropke, J.F. Cordeau |
Branch-and-Cut-and-Price for the
Pickup and Delivery Problem with Time Windows |
Th.2.a |
|
Russo, A.
Vitetta, C. Rindone, F. Cirianni |
Schedule based approach for
maritime freight services |
We.4.b |
|
Russo, V. Assumma |
An aggregated system of transport
models for the mediterranean free trade zone |
We.4.b |
|
San Miguel, D. Monje, S. Úbeda,
F. Faulín |
Optimising Environmental Routes
using ALGACEA-3 |
Fr.1.a |
|
Sibbesen |
An optimization model for
positioning containers in marine terminals |
Tu.2.b |
|
Sibel Salman, K. Viswanath,
S. Peeta |
Strengthening the Links of a Stochastic
Network for Disaster Response |
Fr.3.b |
|
Simón, F. Cano, S. Cano,
A. Felipe |
An initial solution generating
algorithm for the Vehicle Routing Problem with Time Windows |
Th.1.a |
|
Smilowitz, P. Francis, M. Tzur |
Flexibility and Complexity in Periodic
Distribution Problems |
We.4.a |
|
Stickel, B. Seidl, K. Furmans |
A Composite Heuristic for the
Vehicle Routing Problem with Time Windows and Time-Varying Travel Timess |
Th.1.a |
|
Taniguchi, T. Yamada and N.
Ando |
Modelling vehicle routing and scheduling
with uncertainty of travel times |
We.1.b |
|
Taniguchi, T. Yamada, D. Tamagawa |
Multi-agent modelling for city
logistics |
Tu.4.b |
|
Thomas |
Waiting Strategies for
Anticipating Customer Service Requests at Known Customer Locations |
We.3.a |
|
Thompson, K. Hassall |
Vehicle Routing and Scheduling for
City Logistics |
We.1.b |
|
Thorson, J. Holguín-Veras |
The Integrative Freight Market
Simulation: Algorithmic Solutions |
We.2.b |
|
Tricoire, N. Bostel, P. Dejax,
P. Guez |
A Branch and Price approach for
the multiperiod service routing problem with time
windows |
We.4.a |
|
Van Duin |
Modeling Intermodal Networks |
Fr.2.b |
|
Verter, M. Verma, M. Gendreau |
A Tactical Planning Model for the Railroad
Transportation of Hazardous Materials |
We.3.b |
|
Wang, B.L.Golden,
E. Wasil |
Solving the Concave Cost Supply
Scheduling Problem Using a Genetic Algorithm |
Tu.1.b |
|
Yamada, E. Taniguchi |
Framework of Freight Transport Network
Design for City Logistics |
Tu.4.b |
|
Zeimpekis, G.M. Giaglis, |
Dynamic Incident Handling in Urban
Freight Distributions |
We.1.b |