A heuristic method for the minimum toll booth problem

Authors:
Lihui Bai;Donald W. Hearn;Siriphong Lawphongpanich
Affiliations:
College of Business Administration, Valparaiso University, Valparaiso, USA 46383;Center for Applied Optimization, Industrial and Systems Engineering Department, University of Florida, Gainesville, USA 32611-6595;Center for Applied Optimization, Industrial and Systems Engineering Department, University of Florida, Gainesville, USA 32611-6595
Venue:
Journal of Global Optimization
Year:
2010

Citing 8
Cited 0

Linear programming and network flows (2nd ed.)

Linear programming and network flows (2nd ed.)
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Multiway Cuts in Directed and Node Weighted Graphs

ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Decomposition techniques for the minimum toll revenue problem

Networks
Dynamic Slope Scaling Procedure and Lagrangian Relaxation with Subproblem Approximation

Journal of Global Optimization
Adaptive dynamic cost updating procedure for solving fixed charge network flow problems

Computational Optimization and Applications
Combinatorial Benders Cuts for the Minimum Tollbooth Problem

Operations Research
A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the toll pricing problem in which the objective is to minimize the number of required toll facilities in a traffic network. The problem is shown to be NP-hard. To obtain a solution in a reasonable time, an effective metaheuristic algorithm is developed. The algorithm uses a local search technique in which the neighborhood function employs the dynamic slope scaling procedure to deal with the fixed charge nature of the objective function. Numerical results from 50 randomly generated and three real networks are reported.