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: 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.

An optimization model for a real-time flight scheduling problem

Abstract: Although airlines plan aircraft routes and crew schedules in advance, perturbations occur everyday. As a result, flight schedules may become infeasible and would need to be updated. This Day of Operations Scheduling problem impacts the entire system of an airline as the decisions enforced are final. When perturbations are relatively small, the airline may be able to at least preserve the planned aircraft and crew itineraries. We propose a model that determines new flight schedules based on planned crew transfers, rest periods, passenger connections, and maintenance. Its dual is shown to be a network model, hence solvable in a real-time environment. In addition, it can be used in more sophisticated operational and planning systems.

Capitalization: A Cultural Guide

Abstract: What does it mean to turn something into capital? What does considering things as assets entail? What does the prevalence of an investor’s viewpoint require? What is this culture of valuation that asks that we capitalize on everything? How can we make sense of the traits, necessities and upshots of this pervasive cultural condition? This book takes the reader to an ethnographic stroll down the trail of capitalization. Start-up companies, research centers, consulting firms, state enterprises, investment banks, public administrations: the territory can certainly prove strange and disorienting at first sight, with its blurred boundaries between private appropriation and public interest, economic sanity and moral breakdown, the literal and the metaphorical, the practical and the ideological. The traveler certainly requires a resolutely pragmatist attitude, and a taste for the meanders of signification. But in all the sites in which we set foot in this inquiry we recognize a recurring semiotic complex: a scenario of valuation in which things signify by virtue of their capacity to become assets in the eye of an imagined investor. A ground-breaking anthropological investigation on the culture of contemporary capitalism, this work directs attention to the largely unexplored problem of capitalization and offers a critical resource for current debates on neoliberalism and financialization.

An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading

Abstract: This paper introduces an additive branch-and-bound algorithm for two variants of the pickup and delivery traveling salesman problem in which loading and unloading operations have to be performed either in a Last-In-First-Out (LIFO) or in a First-In-First-Out (FIFO) order. Two relaxations are used within the additive approach: the assignment problem and the shortest spanning r-arborescence problem. The quality of the lower bounds is further improved by a set of elimination rules applied at each node of the search tree to remove from the problem arcs that cannot belong to feasible solutions because of precedence relationships. The performance of the algorithm and the effectiveness of the elimination rules are assessed on instances from the literature.

The orienteering problem with variable profits

Abstract: This article introduces, models, and solves a generalization of the orienteering problem, called the the orienteering problem with variable profits (OPVP). The OPVP is defined on a complete undirected graph G = (V,E), with a depot at vertex 0. Every vertex i∈V \{0} has a profit pi to be collected, and an associated collection parameter αi∈[0, 1]. The vehicle may make a number of “passes,” collecting 100αi percent of the remaining profit at each pass. In an alternative model, the vehicle may spend a continuous amount of time at every vertex, collecting a percentage of the profit given by a function of the time spent. The objective is to determine a maximal profit tour for the vehicle, starting and ending at the depot, and not exceeding a travel time limit. © 2013 Wiley Periodicals, Inc. NETWORKS, 2013