Harmony search algorithm for continuous network design problem with link capacity expansions

2013 ◽  
Vol 18 (1) ◽  
pp. 273-283 ◽  
Author(s):  
Ozgur Baskan
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Network Design Problem ◽  
Link Capacity

Park-and-Ride Network Design: A Goal Programming Approach

2014 ◽  
Vol 1030-1032 ◽  
pp. 2065-2068
Author(s):  
Xin Yuan Chen ◽  
Zhi Yuan Liu ◽  
Wei Deng
Keyword(s):  
Network Design ◽  
Goal Programming ◽  
Design Problem ◽  
Programming Model ◽  
Search Algorithm ◽  
Network Design Problem ◽  
Programming Approach ◽  
Multi Objective ◽  
Park And Ride ◽  
Upper Level

The paper addresses a park and ride network design problem in a bi-model transport network in a multi-objective decision making framework. A goal programming approach is adopted to solve the multi-objective park and ride network design problem. The goal programming approach considers the user-defined goals and priority structure, which are (i) traffic-efficient goal, (ii) total transit usage goal, (iii) spatial equity goal. This problem is formulated as a bi-level programming model. The upper level programming leads to minimize the deviation from stated goals in the context of a given priority ranking. While the lower level programming model is a modal split/traffic assignment model which is used to assess any given park and ride scheme. A heuristic tabu search algorithm is then adopted to solve this model.

Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows

2010 ◽  
Vol 56 (1) ◽  
pp. 41-48 ◽  
Author(s):  
Jakub Gładysz ◽  
Krzysztof Walkowiak
Keyword(s):  
Tabu Search ◽  
Network Design ◽  
Design Problem ◽  
Search Algorithm ◽  
Branch And Cut ◽  
Network Design Problem ◽  
Tabu Search Algorithm ◽  
Survivable Network Design ◽  
Network Cost ◽  
Survivable Network

Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast FlowsIn this work we focus on the problem of survivable network design for simultaneous unicast and anycast flows. This problem follows from the growing popularity of network services applying the anycast paradigm. The anycasting is defined as one-to-one-of-many transmission and is applied in Domain Name Service (DNS), peer-to-peer (P2P) systems, Content Delivery Networks (CDN). In this work we formulate two models that enables joint optimization of network capacity, working and backup connections for both unicast and anycast flows. The goal is to minimize the network cost required to protect the network against failures using the single backup path approach. In the first model we consider modular link cost, in the second we are given a set of link proposal and we must select only one of them. Because these problems are NP-hard, therefore optimal solutions of branch-and-bounds or branch-and-cut methods can be generated for relatively small networks. Consequently, we propose a new heuristic algorithm based on Tabu Search method. We present results showing the effectiveness the proposed heuristic compared against optimal results. Moreover, we report results showing that the use of anycast paradigm can reduce the network cost.

A hybrid harmony search algorithm for the spread spectrum radar polyphase codes design problem

2012 ◽  
Vol 39 (12) ◽  
pp. 11089-11093 ◽  
Author(s):  
Sergio Gil-López ◽  
Javier Del Ser ◽  
Sancho Salcedo-Sanz ◽  
Ángel M. Pérez-Bellido ◽  
José Marı´a Cabero ◽  
...  
Keyword(s):  
Spread Spectrum ◽  
Design Problem ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm

scholarly journals A Harmony Search Algorithm approach for optimizing traffic signal timings

2013 ◽  
Vol 25 (4) ◽  
pp. 349-358 ◽  
Author(s):  
Mauro Dell'Orco ◽  
Ozgur Baskan ◽  
Mario Marinelli
Keyword(s):  
Travel Time ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Network Design Problem ◽  
Hill Climbing ◽  
Upper Level ◽  
Path Flow Estimator ◽  
Equilibrium Network Design ◽  
The Hill

In this study, a bi-level formulation is presented for solving the Equilibrium Network Design Problem (ENDP). The optimisation of the signal timing has been carried out at the upper-level using the Harmony Search Algorithm (HSA), whilst the traffic assignment has been carried out through the Path Flow Estimator (PFE) at the lower level. The results of HSA have been first compared with those obtained using the Genetic Algorithm, and the Hill Climbing on a two-junction network for a fixed set of link flows. Secondly, the HSA with PFE has been applied to the medium-sized network to show the applicability of the proposed algorithm in solving the ENDP. Additionally, in order to test the sensitivity of perceived travel time error, we have used the HSA with PFE with various level of perceived travel time. The results showed that the proposed method is quite simple and efficient in solving the ENDP.

Sign in / Sign up

Export Citation Format

Share Document