HEC Montréal

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.

A resource-based analysis of IT sourcing

Abstract: This paper studies the relationships between the choice of a sourcing mode for information systems, the value of the resources used in systems development activities and the presence of those resources at a sufficient level within the firm. The objective is to better understand the factors underlying the decision to keep the development of an information system inside the firm or to entrust it to an outside partner. A sourcing model is proposed using the resource-based theory. A case study is used to illustrate the concepts included in the research model. Data from this case illustrate how the model could be used to predict the appropriate sourcing mode, given the availability of the necessary resources and their strategic value.

New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows

Abstract: The vehicle routing problem with time windows VRPTW consists of finding least-cost vehicle routes to satisfy the demands of customers that can be visited within specific time windows. We introduce two enhancements for the exact solution of the VRPTW by branch-price-and-cut BPC. First, we develop a sharper form of the limited-memory subset-row inequalities by representing the memory as an arc subset rather than a node subset. Second, from the elementary inequalities introduced by Balas in 1977, we derive a family of inequalities that dominate them. These enhancements are embedded into an exact BPC algorithm that includes state-of-the-art features such as bidirectional labeling, decremental state-space relaxation, completion bounds, variable fixing, and route enumeration. Computational results show that these enhancements are particularly effective for the most difficult instances and that our BPC algorithm can solve all 56 Solomon instances with 100 customers and 51 of 60 Gehring and Homberger instances with 200 customers. The online appendix is available at https://doi.org/10.1287/ijoc.2016.0744 .