https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Blanco_et_al_2003aBlanco et al 2003a - Revision history2026-07-27T05:55:33ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Blanco_et_al_2003a&diff=181993&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 485737636 to Blanco et al 2003a2021-01-21T12:46:15Z<p>Scipediacontent moved page <a href="/public/Draft_Content_485737636" class="mw-redirect" title="Draft Content 485737636">Draft Content 485737636</a> to <a href="/public/Blanco_et_al_2003a" title="Blanco et al 2003a">Blanco et al 2003a</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 12:46, 21 January 2021</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttps://www.scipedia.com/wd/index.php?title=Blanco_et_al_2003a&diff=181992&oldid=prevScipediacontent: Created page with " == Abstract == Heuristic methods are specially well suited to solve combinatorial problems. One of these problems is the distribution of petroleum products through oil pipel..."2021-01-21T12:46:12Z<p>Created page with " == Abstract == Heuristic methods are specially well suited to solve combinatorial problems. One of these problems is the distribution of petroleum products through oil pipel..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
Heuristic methods are specially well suited to solve combinatorial problems. One of these problems is the distribution of petroleum products through oil pipelines networks. In this paper the problem is stated and solved using a multiobjective and constraint evolutionary optimization algorithm. Several objective functions has been defined to express the goals of the solutions as well as the preferences among them. Some constraints are included as hard objective functions and some has been evaluated through a repairing function to avoid infeasible solutions. An example of working is given.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [https://eprints.ucm.es/25936 https://eprints.ucm.es/25936]<br />
<br />
* [http://xplorestaging.ieee.org/ielx5/8826/27939/01247757.pdf?arnumber=1247757 http://xplorestaging.ieee.org/ielx5/8826/27939/01247757.pdf?arnumber=1247757],<br />
: [http://dx.doi.org/10.1109/etfa.2003.1247757 http://dx.doi.org/10.1109/etfa.2003.1247757]<br />
<br />
* [https://eprints.ucm.es/25936 https://eprints.ucm.es/25936],<br />
: [https://dblp.uni-trier.de/db/conf/etfa/etfa2003-1.html#CruzAHPB03 https://dblp.uni-trier.de/db/conf/etfa/etfa2003-1.html#CruzAHPB03],<br />
: [http://eprints.sim.ucm.es/25936 http://eprints.sim.ucm.es/25936],<br />
: [https://academic.microsoft.com/#/detail/1556389106 https://academic.microsoft.com/#/detail/1556389106]</div>Scipediacontent