HEC Montréal, Canada, May 2 - 4, 2011
2011 Optimization Days
HEC Montréal, Canada, 2 — 4 May 2011
WA6 Transport / Transportation
May 4, 2011 10:30 AM – 12:10 PM
Chaired by Jacques Renaud
10:30 AM - 10:55 AM
A Reputation-Based Model for Transportation Auctions
We propose a reputation-based model for winner determination problem in transportation procurement auctions where the allocation of long-term contracts to carriers is decided with respect to both bid ask prices and carriers reputation. The objective is to manage the trade-of between transport costs and the quality of service during operations. Computational results obtained by our model prove the importance of considering reputation in transportation auctions while selecting winning carriers.
10:55 AM - 11:20 AM
A Survey on Maritime Fleet Size and Mix Problems
This talk presents a survey on maritime fleet size and mix problems. A typical, though simplified, version of the problem, is presented, including a mathematical formulation. The literature is surveyed and open research questions are discussed. The effect of including uncertainty is illustrated in the example problem.
11:20 AM - 11:45 AM
An Efficient Heuristic Approach for Fast Courier Fleet Management
Fast courier services are provided by very specialized transportation companies to move letters and parcels within a given urban area in very short time. This paper focuses on the operations of a Quebec City’s company which performs daily around 1 000 requests. We developed a system which able us to evaluate the quality of the dispatching process. We also provide insights on the global improvements that may be obtained if a closer collaboration would be done with the major clients.
11:45 AM - 12:10 PM
Self-Imposed Time Windows in Vehicle Routing Problems
Self-Imposed Time Windows (SITW) occur when a logistics service provider quotes a delivery time window to his customers. We incorporate SITW within the framework of the Vehicle Routing Problem (VRP). We propose a heuristic solution approach combining a LP model with a tabu search procedure.