Institution
HEC Montréal
Education•Montreal, Quebec, Canada•
About: HEC Montréal is a education organization based out in Montreal, Quebec, Canada. It is known for research contribution in the topics: Vehicle routing problem & Corporate governance. The organization has 1221 authors who have published 5708 publications receiving 196862 citations. The organization is also known as: Ecole des Hautes Etudes Commerciales de Montreal & HEC Montreal.
Topics: Vehicle routing problem, Corporate governance, Heuristic (computer science), Context (language use), Monetary policy
Papers published on a yearly basis
Papers
More filters
••
30 Jan 2019TL;DR: This work proposes a recommender system for online communities based on a dynamic-graph-attention neural network, which dynamically infers the influencers based on users' current interests and can be efficiently fit on large-scale data.
Abstract: Online communities such as Facebook and Twitter are enormously popular and have become an essential part of the daily life of many of their users. Through these platforms, users can discover and create information that others will then consume. In that context, recommending relevant information to users becomes critical for viability. However, recommendation in online communities is a challenging problem: 1) users' interests are dynamic, and 2) users are influenced by their friends. Moreover, the influencers may be context-dependent. That is, different friends may be relied upon for different topics. Modeling both signals is therefore essential for recommendations. We propose a recommender system for online communities based on a dynamic-graph-attention neural network. We model dynamic user behaviors with a recurrent neural network, and context-dependent social influence with a graph-attention neural network, which dynamically infers the influencers based on users' current interests. The whole model can be efficiently fit on large-scale data. Experimental results on several real-world data sets demonstrate the effectiveness of our proposed approach over several competitive baselines including state-of-the-art models.
293 citations
••
TL;DR: A framework for modeling CO2 emissions in a time-dependent vehicle routing context is proposed and it is shown that limiting vehicle speeds is desired from a total cost perspective and that reducing emissions leads to reducing costs.
Abstract: Due to the growing concern over environmental issues, regardless of whether companies are going to voluntarily incorporate green policies in practice, or will be forced to do so in the context of new legislation, change is foreseen in the future of transportation management. Assigning and scheduling vehicles to service a pre-determined set of clients is a common distribution problem. Accounting for time-dependent travel times between customers, we present a model that considers travel time, fuel, and CO2 emissions costs. Specifically, we propose a framework for modeling CO2 emissions in a time-dependent vehicle routing context. The model is solved via a tabu search procedure. As the amount of CO2 emissions is correlated with vehicle speed, our model considers limiting vehicle speed as part of the optimization. The emissions per kilometer as a function of speed are minimized at a unique speed. However, we show that in a time-dependent environment this speed is sub-optimal in terms of total emissions. This occurs if vehicles are able to avoid running into congestion periods where they incur high emissions. Clearly, considering this trade-off in the vehicle routing problem has great practical potential. In the same line, we construct bounds on the total amount of emissions to be saved by making use of the standard VRP solutions. As fuel consumption is correlated with CO2 emissions, we show that reducing emissions leads to reducing costs. For a number of experimental settings, we show that limiting vehicle speeds is desired from a total cost perspective. This namely stems from the trade-off between fuel and travel time costs.
290 citations
••
TL;DR: In this paper, double-horizon based heuristics for the dynamic Pickup and Delivery Problem with Time Windows (PDPTW) were proposed for which future requests are not stochastically modelled or predicted.
Abstract: The dynamic Pickup and Delivery Problem with Time Windows (PDPTW) is faced by courier companies serving same-day pickup and delivery requests for the transport of letters and small parcels. This article focuses on the dynamic PDPTW for which future requests are not stochastically modelled or predicted. The standard solution methodology for the dynamic PDPTW is the use of a rolling time horizon as proposed by Psaraftis. When assigning a new request to a vehicle it may be preferable to consider the impact of a decision both on a short-term and on a long-term horizon. In particular, better managing slack time in the distant future may help reduce routing cost. This paper describes double-horizon based heuristics for the dynamic PDPTW. Computational results show the advantage of using a double-horizon in conjunction with insertion and improvement heuristics.
290 citations
••
TL;DR: In this paper, the authors present a multi-start local search heuristic to solve the problem of ship routing and scheduling with speed optimization, where speed on each sailing leg is introduced as a decision variable.
Abstract: Tramp shipping companies are committed to transport a set of contracted cargoes and try to derive additional revenue from carrying optional spot cargoes. Traditionally, models for ship routing and scheduling problems are based on fixed speed and a given fuel consumption rate for each ship. However, in real life a ship’s speed is variable within an interval, and fuel consumption per time unit can be approximated by a cubic function of speed. Here we present the tramp ship routing and scheduling problem with speed optimization, where speed on each sailing leg is introduced as a decision variable. We present a multi-start local search heuristic to solve this problem. To evaluate each move in the local search we have to determine the optimal speed for each sailing leg of a given ship route. To do this we propose two different algorithms. Extensive computational results show that the solution method solves problems of realistic size and that taking speed into consideration in tramp ship routing and scheduling significantly improves the solutions.
289 citations
••
TL;DR: In this paper, the authors provide tractable models for transportation scientists that will allow predicting the lifetime degradation and instantaneous charging and discharging behaviour of battery electric vehicles (BEV) batteries, which are used for goods distribution.
Abstract: The use of electric vehicles for goods distribution opens up a wide range of research problems. Battery electric vehicles (BEVs) operate on batteries that have a limited life, as well as specific charging and discharging patterns which need to be considered in the context of their use for goods distribution. While many transportation problems associated with the integration of freight electric vehicles in distribution management problems have been investigated, there is room for further research on specifically how to model battery degradation and behaviour in such problems. The aim of this paper is to provide tractable models for transportation scientists that will allow predicting the lifetime degradation and instantaneous charging and discharging behaviour of BEV batteries.
286 citations
Authors
Showing all 1262 results
Name | H-index | Papers | Citations |
---|---|---|---|
Danny Miller | 133 | 512 | 71238 |
Gilbert Laporte | 128 | 730 | 62608 |
Michael Pollak | 114 | 663 | 57793 |
Yong Yu | 78 | 523 | 26956 |
Pierre Hansen | 78 | 575 | 32505 |
Jean-François Cordeau | 71 | 208 | 19310 |
Robert A. Jarrow | 65 | 356 | 24295 |
Jacques Desrosiers | 63 | 173 | 15926 |
François Soumis | 61 | 290 | 14272 |
Nenad Mladenović | 54 | 320 | 19182 |
Massimo Caccia | 52 | 389 | 16007 |
Guy Desaulniers | 51 | 242 | 8836 |
Ann Langley | 50 | 161 | 15675 |
Jean-Charles Chebat | 48 | 161 | 9062 |
Georges Dionne | 48 | 421 | 7838 |