https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Baskan_2013a 2026-05-05T01:18:16Z Revision history for this page on the wiki MediaWiki 1.27.0-wmf.10 https://www.scipedia.com/wd/index.php?title=Baskan_2013a&diff=212410&oldid=prev 2021-02-12T13:32:06Z

<p>Scipediacontent moved page <a href="/public/Draft_Content_823341171" class="mw-redirect" title="Draft Content 823341171">Draft Content 823341171</a> to <a href="/public/Baskan_2013a" title="Baskan 2013a">Baskan 2013a</a></p> <table class="diff diff-contentalign-left" data-mw="interface"> <tr style='vertical-align: top;' lang='en'> <td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 13:32, 12 February 2021</td> </tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div> </td></tr></table>

Scipediacontent https://www.scipedia.com/wd/index.php?title=Baskan_2013a&diff=212409&oldid=prev 2021-02-12T13:32:01Z

<p>Created page with &quot; == Abstract == During the last two decades, Continuous Network Design Problem (CNDP) has received much more attention because of increasing trend of traffic congestion in ro...&quot;</p> <p><b>New page</b></p><div><br /> == Abstract ==<br /> <br /> 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. © 2013 Ozgur Baskan.<br /> <br /> Document type: Article<br /> <br /> == Full document ==<br /> &lt;pdf&gt;Media:Draft_Content_823341171-beopen358-7329-document.pdf&lt;/pdf&gt;<br /> <br /> <br /> == Original document ==<br /> <br /> The different versions of the original document can be found in:<br /> <br /> * [http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/21555 http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/21555] under the license https://creativecommons.org/licenses/by<br /> <br /> * [http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/7950 http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/7950]<br /> <br /> * [http://downloads.hindawi.com/journals/jam/2013/718015.pdf http://downloads.hindawi.com/journals/jam/2013/718015.pdf]<br /> <br /> * [http://dx.doi.org/10.1155/2013/718015 http://dx.doi.org/10.1155/2013/718015] under the license cc-by<br /> <br /> * [http://projecteuclid.org/euclid.jam/1394807369 http://projecteuclid.org/euclid.jam/1394807369]<br /> <br /> * [http://downloads.hindawi.com/journals/jam/2013/718015.pdf http://downloads.hindawi.com/journals/jam/2013/718015.pdf],<br /> : [http://downloads.hindawi.com/journals/jam/2013/718015.xml http://downloads.hindawi.com/journals/jam/2013/718015.xml],<br /> : [http://dx.doi.org/10.1155/2013/718015 http://dx.doi.org/10.1155/2013/718015]<br /> <br /> * [http://dx.doi.org/10.1155/2013/718015 http://dx.doi.org/10.1155/2013/718015],<br /> : [https://doaj.org/toc/1110-757X https://doaj.org/toc/1110-757X],<br /> : [https://doaj.org/toc/1687-0042 https://doaj.org/toc/1687-0042] under the license http://creativecommons.org/licenses/by/3.0/<br /> <br /> * [https://www.hindawi.com/journals/jam/2013/718015 https://www.hindawi.com/journals/jam/2013/718015],<br /> : [https://dblp.uni-trier.de/db/journals/jam/jam2013.html#Baskan13 https://dblp.uni-trier.de/db/journals/jam/jam2013.html#Baskan13],<br /> : [http://downloads.hindawi.com/journals/jam/2013/718015.pdf http://downloads.hindawi.com/journals/jam/2013/718015.pdf],<br /> : [https://core.ac.uk/display/26740420 https://core.ac.uk/display/26740420],<br /> : [http://projecteuclid.org/euclid.jam/1394807369 http://projecteuclid.org/euclid.jam/1394807369],<br /> : [https://doi.org/10.1155/2013/718015 https://doi.org/10.1155/2013/718015],<br /> : [https://www.airitilibrary.com/Publication/alDetailedMesh?DocID=P20160908001-201312-201609120001-201609120001-273-283-627 https://www.airitilibrary.com/Publication/alDetailedMesh?DocID=P20160908001-201312-201609120001-201609120001-273-283-627],<br /> : [https://academic.microsoft.com/#/detail/2013688526 https://academic.microsoft.com/#/detail/2013688526]</div>

Scipediacontent