A Combined Simulated Annealing and Tabu Search Strategy to Solve a Network Design Problem with Two Classes of Users
Total Page:16
File Type:pdf, Size:1020Kb
Copyright Warning & Restrictions The copyright law of the United States (Title 17, United States Code) governs the making of photocopies or other reproductions of copyrighted material. Under certain conditions specified in the law, libraries and archives are authorized to furnish a photocopy or other reproduction. One of these specified conditions is that the photocopy or reproduction is not to be “used for any purpose other than private study, scholarship, or research.” If a, user makes a request for, or later uses, a photocopy or reproduction for purposes in excess of “fair use” that user may be liable for copyright infringement, This institution reserves the right to refuse to accept a copying order if, in its judgment, fulfillment of the order would involve violation of copyright law. Please Note: The author retains the copyright while the New Jersey Institute of Technology reserves the right to distribute this thesis or dissertation Printing note: If you do not wish to print this page, then select “Pages from: first page # to: last page #” on the print dialog screen The Van Houten library has removed some of the personal information and all signatures from the approval page and biographical sketches of theses and dissertations in order to protect the identity of NJIT graduates and faculty. ASAC A COMIE SIMUAE AEAIG A AU SEAC SAEGY O SOE A EWOK ESIG OEM WI WO CASSES O USES y Qieg e g A methodology to solve a transportation network design problem (TCNDP) with two classes of users (passenger cars and trucks) is developed. Given an existing highway system, with a capital investment budget constraint, the methodology selects the best links to be expanded by an extra lane by considering one of three types of traffic operations: exclusive for passenger cars, exclusive for trucks, and for both passenger cars and trucks such that the network total user equilibrium (UE) travel time is minimized. The problem is formulated as an NP-hard combinatorial nonlinear integer programming problem. The classical branch and bound methodology for the integer programming problem is very inefficient in solving this computationally hard problem. A combined simulated annealing and tabu search strategy (SA-TABU), was developed which is shown to perform in a robust and efficient manner in solving five networks ranging from 36 to 332 links. A comprehensive heuristic evaluation function (HEF), a core for the heuristic search strategy, was developed which can be adjusted to the characteristics of the problem and the search strategy used. It is composed of three elements: the link volume to capacity ratio, the historical contribution of the link to the objective function, and a random variable which resembles the error term of the HEF. The principal characteristics of the SA-TABU are the following: HEF, Markov chain length, "temperature" dropping rate and the tabu list length. Sensitivity analysis was conducted in identifying the best parameter values of the main components of the SA-TABU. Sufficiently "good" solutions were found in all the problems within a rather short computational time. The solution results suggest that in most of the scenarios, the shared lane option, passenger cars and trucks, was found to be the most favored selection. Expanding approximately 10% of the links, results in a very high percentage improvement ranging from 73% to 97% for the five test networks. A COMIE SIMUAE AEAIG A AU SEAC SAEGY O SOE A EWOK ESIG OEM WI WO CASSES O USES y Qieg eg A isseaio Sumie o e acuy o ew esey Isiue o ecoogy i aia uime o e equiemes o e egee o oco o iosoy i asoaio Ieisciiay ogam i asoaio May 199 Copyright © 1997 by Qifeng Zeng ALL RIGHTS RESERVED APPROVAL PAGE A COMBINED SIMULATED ANNEALING AND TABU SEARCH STRATEGY TO SOLVE A NETWORK DESIGN PROBLEM WITH TWO CLASSES OF USERS Qifeng Zeng Dr. Kyriacos C. Mouskos, Dissertation Adviser Date Assistant Professor of Civil and Environmental Engineering, NJIT Dr. Athanassios K. Bladikas, Committee Member Date Associate Professor of Industrial and Manufacturing Engineering, NJIT Di. Norbert Op nheim, Committee Member fj‘te Pkofessor of Civil Engineering_ City University of New York Dr. Louis J. FignatarolCommittee Member Date Executive Director of Institute for Transportation, NJIT Dr. Lazar N. Spasovic, Committee Member Date Associate Professor of Management, NJIT BIOGRAPHICAL SKETCH Author: Qifeng Zeng Degree: Doctor of Philosophy in Transportation Date: May 1998 Undergraduate and Graduate Education: • Doctor of Philosophy in Transportation, New Jersey Institute of Technology, Newark, NJ, 1998 • Master of Science in Transportation, The City College of New York, New York, NY, 1992 • Bachelor of Science in Civil Engineering, Southeast University, NanJing, P.R.China, 1988 Major: Transportation Presentations and Publications: Q. Zeng and K. C. Mouskos, "Simulated Annealing Heuristic Search Strategy to Solve a Two Classes of Users Transportation Network Design Problem," Presented at INFORMS Conference, Dallas, Texas, Fall 1997. K. C. Mouskos and Q. Zeng, "A Simulated Annealing Heuristic Search Strategy for the User Equilibrium Transportation Network Design Problem," Present at INFORMS Conference, Washington, D. C., Spring 1996. This thesis is dedicated to My Parent, Zeng, Xiang Jian and Zheng, Shu Xiu, and my wife, Chan, Mei Mei ACKNOWLEDGMENT I would like to express my sincere appreciation to my supervisor Dr. Kyriacos C. Mouskos for his continuous support, guidance, and friendship throughout my Ph.D. study and research work. Special thanks to Dr. Louis J. Pignataro, for his supervision and recommendation for the funding of this study, and Dr. Norbert Oppenheim, whose encouragement and recommendation brought me to NJIT Ph.D. program. I would also like to extend my appreciation to Dr. Athanassios Bladikas and Dr. Lazar N. Spasovic for their advice and supports. Finally, I would like to extend my gratitude to my classmates in NJIT transportation program. vi TABLE OF CONTENTS Chapter Page 1. INTRODUCTION 1 1.1 Overview of Current Urban Transportation System and Network Design Problem. 1 1.2 Overview of the Problem Structure and Methodology 4 1.3 Motivation and Objectives 6 1.4 Overview of this Dissertation 9 2. LITERATURE REVIEW 11 2.1 Transportation Network Design 11 2.1.1 Bilevel Programming 13 2.1.2 Branch and Bound Algorithm 16 2.1.3 Heuristics Search Strategies and Network Design 18 2.2 Traffic Assignment Models and Formulations 21 2.2.1 Wardrop (1952) Principles 21 2.2.2 Variational Inequality Theory 22 2.2.3 Single Class User Equilibrium Assignment Model 23 2.2.4 Two Classes User Equilibrium Assignment Mathematical Formulation 25 2.3 Heuristic Search Strategies 28 2.3.1 Simulated Annealing 28 2.3.2 Tabu Search Strategy 34 vii TABLE OF CONTENTS (Continued) Chapter Page 3. FORMULATION OF TWO CLASSES OF USERS EQUILIBRIUM TRANSPORTATION NETWORK DESIGN PROBLEM (TCNDP) ADDRESSED IN THIS STUDY 39 4. CHARACTERISTICS OF THE TRAFFIC ASSIGNMENT PROCEDURE USED IN THE TCNDP 44 4.1 Review of Traffic Assignment Algorithm 44 4.1.1 Frank-Wolfe Algorithm (Convex Combination Method) 44 4.1.2 Diagonalization Algorithm for Two Classes of Users Traffic Assignment 46 4.2 Travel Cost Functions 48 4.2.1 Link Travel Cost Function 48 4.2.1.1 BPR Single Class Travel Cost Function 48 4.2.1.2 Two Classes of Users Link Travel Cost Functions 49 4.2.2 Link Travel Cost Functions (LTCF) Used in this Study 50 4.3 Numerical Experiment of Diagonalization Algorithm 61 4.4 Numerical Experiment of Diagonalization Algorithm on Five Test Networks 69 4.4.1 Five Test Networks 70 4.4.2 Test of Convergence and Convergence Rate with Number of Internal Iteration 76 4.4.3 Test of Network Flow Equilibrium and Distribution Pattern 83 viii TABLE OF CONTENTS (Continued) Chapter Page 5. DEVELOPMENT OF THE COMBINED SIMULATED ANNEALING AND TABU SEARCH STRATEGY (SA-TABU) 94 5.1 General Background of the Combined Simulated Annealing and Tabu Search Algorithm in This Study 94 5.2 Heuristics Based Combined Simulated Annealing and Tabu Search 96 5.2.1 Type of Moves 97 5.2.2 Heuristic Evaluation Function (HEF) 100 5.2.3 Search Strategy 103 5.3 General Procedure of the Heuristic Based Simulated Annealing and Tabu Search Strategy (SA-TABU). 104 5.4 Implementation of the SA-TABU Search Strategy 113 5.4.1 Main Program (Figure 5.4.1-5 4 2) 113 5.4.2 Subroutines 122 6. NUMERICAL EXPERIMENTS OF THE SA-TABU SEARCH STRATEGY 136 6.1 Overview of the Numerical Experiment 136 6.2 Test Networks 139 6.3 Numerical Results of the SA-TABU Search Strategy in Solving the SCNDP 141 6.4 Numerical Experiments of the SA-TABU Search Strategy in Solving the TCNDP Problem 154 6.5 Sensitivity Analysis of the Key Components of the SA-TABU Search Strategy. 167 ix TABLE OF CONTENTS (Continued) Chapter Page 6.5.1 Sensitivity Study on Markov Chain Length and Control Parameter 168 6.5.2 Sensitivity Analysis on Tabu List Length 179 6.5.3 Sensitivity Analysis on Heuristic Evaluation Functions (HEF) 182 7. TWO CLASSES OF USERS NETWORK DESIGN PROBLEM STUDY 185 7.1 Study of the Characteristics of the TCNDP 185 7.2 The Experimental Results of the Network Design Solutions 194 8. CONCLUSION AND FUTURE RESEARCH 205 8.1 Summary 205 8.2 Conclusions 209 8.2.1 TCNDP Characteristics 209 8.2.2 Characteristics of the SA-TABU Search Strategy and the Traffic Assignment 211 8.3 Future Research 213 REFERENCES 216 LIST OF TABLES Table Page 4.2.1 Volume/Delay Functions (Florian et.al. 1976) 51 4.3.1 Iteration of the Diagonalization Procedure for the Example 64 4.3.2 Iterations of the Streamlined Algorithm Procedure