Cuckoo search with Lévy flights for reconstruction of outline curves of computer fonts with rational Bézier curves

2016 ◽  
Author(s):  
Andres Iglesias ◽  
Akemi Galvez
Keyword(s):  
Cuckoo Search ◽  
Bezier Curves ◽  
Bézier Curves ◽  
Lévy Flights ◽  
Rational Bézier Curves ◽  
Levy Flights

Polynomial approximation of rational Bézier curves with constraints

2011 ◽  
Vol 59 (4) ◽  
pp. 607-622 ◽  
Author(s):  
Stanisław Lewanowicz ◽  
Paweł Woźny ◽  
Paweł Keller
Keyword(s):  
Polynomial Approximation ◽  
Bezier Curves ◽  
Bézier Curves ◽  
Rational Bézier Curves

scholarly journals Determining Optimal Link Capacity Expansions in Road Networks Using Cuckoo Search Algorithm with Lévy Flights

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Ozgur Baskan
Keyword(s):  
Traffic Congestion ◽  
Road Network ◽  
Search Algorithm ◽  
Road Networks ◽  
Cuckoo Search ◽  
User Equilibrium ◽  
Network Design Problem ◽  
Lévy Flights ◽  
Link Capacity ◽  
Levy Flights

During the last two decades, Continuous Network Design Problem (CNDP) has received much more attention because of increasing trend of traffic congestion in road networks. In the CNDP, the problem is to find optimal link capacity expansions by minimizing the sum of total travel time and investment cost of capacity expansions in a road network. Considering both increasing traffic congestion and limited budgets of local authorities, the CNDP deserves to receive more attention in order to use available budget economically and to mitigate traffic congestion. The CNDP can generally be formulated as bilevel programming model in which the upper level deals with finding optimal link capacity expansions, whereas at the lower level, User Equilibrium (UE) link flows are determined by Wardrop’s first principle. In this paper, cuckoo search (CS) algorithm with Lévy flights is introduced for finding optimal link capacity expansions because of its recent successful applications in solving such complex problems. CS is applied to the 16-link and Sioux Falls networks and compared with available methods in the literature. Results show the potential of CS for finding optimal or near optimal link capacity expansions in a given road network.

Sign in / Sign up

Export Citation Format

Share Document