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: Context (language use) & Vehicle routing problem. 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: Context (language use), Vehicle routing problem, Corporate governance, Heuristic (computer science), Computer science
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This note disproves the conjecture that for a connected graph G on n vertices and m edges with Szeged index Sz, Sz=mn^2/4 if and only if G is a regular bipartite graph and then proves a stronger result from which it follows that the equality holds.
Abstract: Khalifeh, Yousefi-Azari, Ashrafi and Wagner [M.K. Khalifeh, H. Yousefi-Azari, A.R. Ashrafi, S.G. Wagner, Some new results on distance-based graph invariants, European J. Combin. 30 (2009) 1149-1163] conjectured that for a connected graph G on n vertices and m edges with Szeged index Sz, Sz=mn^2/4 if and only if G is a regular bipartite graph. In this note, we disprove this conjecture and then prove a stronger result from which it follows that the equality holds if and only if G is a transmission-regular bipartite graph.
70 citations
••
TL;DR: Comparisons of the solution quality provided by these strategies to a more conventional approach were performed on randomly generated instances with static and dynamic travel times and different degrees of dynamism, and the results indicate the advantages of the strategies both in terms of lost requests and number of vehicles.
Abstract: We investigate the impact of two strategies for dynamic pickup and delivery problems on the quality of solutions produced by insertion heuristics: (a) a waiting strategy that delays the final assignment of vehicles to their next destination, and (b) a request buffering strategy that postpones the assignment of some non-urgent new requests to the next route planning. In this study, the strategies are tested in a constructive-deconstructive heuristic for the dynamic pickup and delivery problem with hard time windows and random travel times. Comparisons of the solution quality provided by these strategies to a more conventional approach were performed on randomly generated instances up to 100 requests with static and dynamic (time-dependent) travel times and different degrees of dynamism. The results indicate the advantages of the strategies both in terms of lost requests and number of vehicles.
70 citations
••
TL;DR: Based on 204 evaluations of consumers that participated in a laboratory experiment involving two Canadian Web sites in travel and online insurance, NetQual best fits the data and offers the highest explanatory power.
Abstract: Several measurement scales have been designed by both practitioners and researchers to evaluate perceptions of electronic service Quality. This article tests three of the main academically developed scales: Sitequal (Yoo & Donthu, 2001), Webqual 4 (Barnes & Vidgen, 2003) and EtailQ (Wolfinbarger & Gilly, 2003) and compares them against the scale ensuing from our research: NetQual (Bressolles, 2006). Based on 204 evaluations of consumers that participated in a laboratory experiment involving two Canadian Web sites in travel and online insurance, NetQual best fits the data and offers the highest explanatory power. Then the impact of nature of task and success or failure to complete the task on the evaluation process of electronic service quality and attitude toward the site is examined and discussed on over 700 respondents that navigated on six different Web sites.
70 citations
••
TL;DR: This paper proposes an adaptive service policy that aims at estimating the best time period to serve each request within its associated time window in order to reduce distribution costs.
70 citations
••
TL;DR: This survey paper aims to comprehensively review the existing literature on VRPBs, including models, exact and heuristic algorithms, variants, industrial applications and case studies, with an emphasis on the recent literature.
70 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 |