A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints

Friesz, Terry L.; Hsun-jung Cho; Mehta, Nihal J.; Tobin, Roger L.; Anandalingam, G.
February 1992
Transportation Science;Feb92, Vol. 26 Issue 1, p18
Academic Journal
The equilibrium network design problem can be formulated as a mathematical program with variational inequality constraints. We know this problem is nonconvex; hence, it is difficult to solve for a globally optimal solution. In this paper we propose a simulated annealing algorithm for the equilibrium network design problem. We demonstrate the ability of this algorithm to determine a globally optimal solution for two different networks. One of these describes an actual city in the midwestern United States.


Related Articles

  • Development of Heterogeneous Parallel Genetic Simulated Annealing Using Multi-Niche Crowding. Wang, Z. G.; Rahman, M.; Wong, Y. S.; Neo, K. S. // International Journal of Computational Intelligence;2007, Vol. 3 Issue 1, p55 

    In this paper, a new hybrid of genetic algorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from local optima. The concept of hierarchical parallel GA is employed to parallelize GSA for the optimization of...

  • Proximal-like contraction methods for monotone variational inequalities in a unified framework I: Effective quadruplet and primary methods. He, Bingsheng; Liao, Li-Zhi; Wang, Xiang // Computational Optimization & Applications;Mar2012, Vol. 51 Issue 2, p649 

    Approximate proximal point algorithms (abbreviated as APPAs) are classical approaches for convex optimization problems and monotone variational inequalities. To solve the subproblems of these algorithms, the projection method takes the iteration in form of u= P[ u− α d]. Interestingly,...

  • Performance Analysis of Cyclical Simulated Annealing Algorithms. Jacobson, Sheldon; Hall, Shane; McLay, Laura; Orosz, Jeffrey // Methodology & Computing in Applied Probability;Jun2005, Vol. 7 Issue 2, p183 

    Generalized hill climbing (GHC) algorithms provide a framework for modeling local search algorithms for addressing intractable discrete optimization problems. Measures for assessing the finite-time performance of GHC algorithms have been developed using this framework, including the expected...

  • A population-based hybrid ant system for quadratic assignment formulations in facility layout design. Ramkumar, A. S.; Ponnambalam, S. G.; Jawahar, N. // International Journal of Advanced Manufacturing Technology;Jan2010, Vol. 44 Issue 5/6, p548 

    The facility layout design problem is an extensively studied research problem and belongs to nonpolynomial hard (NP-hard) combinatorial optimization problem. Quadratic assignment problem (QAP) is one of the formulations that is investigated for facility layout design because of its wide...

  • Research on Combination Optimization of Parameters and Character Choice for SVM Based on Simulated Annealing and Improved QPSO. Li Wanling; Liu Yaozhou; Deng Daquan // Applied Mechanics & Materials;2014, Issue 556-562, p3384 

    In order to improve the classification accuracy of SVM, combination optimization of parameters and character choice for SVM was proposed. Improved QPSO algorithm was researched on in this paper. At the same time, simulated annealing and improved QPSO algorithm was adopted to train SVM in this...

  • A Multi-objective Genetic Algorithm for Reliability Optimization Problem. Kishor, Amar; Yadav, Shiv Prasad; Kumar, Surendra // International Journal of Performability Engineering;Apr2009, Vol. 5 Issue 3, p227 

    This paper considers the allocation of maximum reliability to a complex system. while minimizing the cost of the system, a type of multi-objective optimization problem (MOOP). Multi-objective Evolutionary Algorithms (MOEAs) have been shown in the last few years as powerful techniques to solve...

  • Optimization of continuous-time production planning using hybrid genetic algorithms-simulated annealing. Ganesh, K.; Punniyamoorthy, M. // International Journal of Advanced Manufacturing Technology;Jul2005, Vol. 26 Issue 1/2, p148 

    Evolutionary algorithms are stochastic search methods that mimic the principles of natural biological evolution to produce better and better approximations to a solution and have been used widely for optimization problems. A general problem of continuous-time aggregate production planning for a...

  • Liquid Phase Stability via Global Optimization. Rodrigues, Vânia; Pereira, Ana I.; Ferreira, Olga; Pinho, Simão P. // AIP Conference Proceedings;9/30/2010, Vol. 1281 Issue 1, p991 

    In this work, the Penalty Stretched Simulated Annealing Method and the Multilocal Branch and Bound method were applied to identify the stationary points of the tangent plane distance function defined for the Gibbs energy. The classic excess Gibbs energy Non Random Two Liquid model was used for...

  • On Approximate KKT Condition and its Extension to Continuous Variational Inequalities. Haeser, Gabriel; Schuverdt, María Laura // Journal of Optimization Theory & Applications;Jun2011, Vol. 149 Issue 3, p528 

    In this work, we introduce a necessary sequential Approximate-Karush-Kuhn-Tucker (AKKT) condition for a point to be a solution of a continuous variational inequality, and we prove its relation with the Approximate Gradient Projection condition (AGP) of Gárciga-Otero and Svaiter. We also prove...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics