A Tabu search algorithm for the network pricing problem

Authors:
L. Brotcorne;F. Cirinei;P. Marcotte;G. Savard
Affiliations:
INRIA Lille Nord Europe, Parc Scientifique de la Haute Borne, 40 Avenue Halley, Bat A Park Plaza, 59650 Villeneuve D'Ascq, France;Expretio, 200 Laurier Street West, Suite 400, Montréal, QC, Canada H2T 2N8;CIRRELT, Département d'Informatique et de Recherche Opérationnelle, Université de Montréal C.P. 6128, Succursale Centre-Ville, Montréal, QC, Canada H3C 3J7;GERAD, Département de Mathématiques et de Génie Industriel, Ecole Polytechnique de Montréal C.P. 6079, Succursale Centre-Ville, Montréal, QC, Canada H3C 3A7
Venue:
Computers and Operations Research
Year:
2012

Citing 8
Cited 0

A bilevel model of taxation and its application to optimal highway pricing

Management Science
A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem

Transportation Science
A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network

Transportation Science
An approximation algorithm for Stackelberg network pricing

Networks
Tariff Optimization in Networks

INFORMS Journal on Computing
Network pricing problems: complexity, polyhedral study and solution approaches

Network pricing problems: complexity, polyhedral study and solution approaches
New formulations and valid inequalities for a bilevel pricing problem

Operations Research Letters
An exact algorithm for the network pricing problem

Discrete Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we propose an efficient Tabu Search procedure for solving the NP-hard network pricing problem. By exploiting the problem's features, the algorithm allows the near-optimal solution of problem instances that are out of reach of exact combinatorial methods.