This short note on the Traffic Assignment Problem (TAP) provides the relevant information on test problems previously used in the literature to facilitate benchmarking CitationTechnical report, Ordecsys, 2008.ArticleDownload View PDF
abstract CitationIn Proceeding of the International Conference: Mathematical Methods in Economics, Virt 2004, pp. 101-108, ISBN 80-8078-012-9ArticleDownload View PDF
The transportation paradox is related to the classical transportation problem. For certain instances of this problem an increase in the amount of goods to be transported may lead to a decrease in the optimal total transportation cost. Even though the paradox has been known since the early days of linear programming, it has got very … Read more
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have various capacities and fixed costs. The columns in the formulation are associated to $q$-routes, a relaxation of capacitated elementary routes that makes the pricing problem solvable in pseudo-polynomial time. Powerful new families of cuts are also proposed, … Read more
The United States Postal Service (USPS) delivers more than 200 billion items per year. Transporting these items in a timely and cost-efficient way is a key issue if USPS is to meet its service and financial goals. The Highway Corridor Analytic Program (HCAP) is a tool that aids transportation analysts in identifying cost saving opportunities … Read more
This paper deals with the so-called transportation problem of linear stochastic fractional programming, and emphasizes the wide applicability of LSFP. The transportation problem, received this name because many of its applications involve in determining how to optimally transport goods. However, some of its applications (e.g., production scheduling) actually have nothing to do with transportation. The … Read more
Hayrapetyan, Tardos and Wexler recently introduced a framework to study the impact of collusion in congestion games on the quality of Nash equilibria. We adopt their framework to network games and focus on the well established price of anarchy as a measure of this impact. We first investigate nonatomic network games with coalitions. For this … Read more
The traffic assignment problem with elastic demands can be formulated as an optimization problem, whose objective is sum of a congestion function and a disutility function. We propose to use a variant of the Analytic Center Cutting Plane Method to solve this problem. We test the method on instances with different congestion functions (linear with … Read more
We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first four based on Miller-Tucker-Zemlin constraints and the last two based on flows. We compare the linear programming bounds of these formulations. We derive valid inequalities and lift … Read more
We study the route-guidance system proposed by Jahn, Möhring, Schulz and Stier-Moses (2004) from a theoretical perspective. This approach computes a traffic pattern that minimizes the total travel time subject to user constraints, which ensure that routes suggested to users are not much longer than shortest paths. We show that when distances are measured with … Read more