https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Clemente_et_al_2017aClemente et al 2017a - Revision history2026-05-08T09:53:00ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Clemente_et_al_2017a&diff=207207&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 562675898 to Clemente et al 2017a2021-02-03T18:30:36Z<p>Scipediacontent moved page <a href="/public/Draft_Content_562675898" class="mw-redirect" title="Draft Content 562675898">Draft Content 562675898</a> to <a href="/public/Clemente_et_al_2017a" title="Clemente et al 2017a">Clemente et al 2017a</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 18:30, 3 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>Scipediacontenthttps://www.scipedia.com/wd/index.php?title=Clemente_et_al_2017a&diff=207206&oldid=prevScipediacontent: Created page with " == Abstract == This paper deals with a general Multi-Day Container Drayage Problem (MDCDP) that consists in assigning trucks to container transportation orders during severa..."2021-02-03T18:30:33Z<p>Created page with " == Abstract == This paper deals with a general Multi-Day Container Drayage Problem (MDCDP) that consists in assigning trucks to container transportation orders during severa..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
This paper deals with a general Multi-Day Container Drayage Problem (MDCDP) that consists in assigning trucks to container transportation orders during several days. To this aim, a Mixed Integer Linear Programming problem is formulated: the model describes real problems taking into account the orders to be planned for several days, the types of the containers and the rest periods of drivers. In order to address real scenarios, a heuristic algorithm based on the rolling horizon approach is proposed. Some randomly generated MDCDP instances validate the heuristic algorithm and a case study of real dimensions shows the effectiveness of the proposed solution technique.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [http://hdl.handle.net/11368/2926618 http://hdl.handle.net/11368/2926618]<br />
<br />
* [http://xplorestaging.ieee.org/ielx7/8244402/8256062/08256108.pdf?arnumber=8256108 http://xplorestaging.ieee.org/ielx7/8244402/8256062/08256108.pdf?arnumber=8256108],<br />
: [http://dx.doi.org/10.1109/coase.2017.8256108 http://dx.doi.org/10.1109/coase.2017.8256108]<br />
<br />
* [https://dblp.uni-trier.de/db/conf/case/case2017.html#ClementeFNSU17 https://dblp.uni-trier.de/db/conf/case/case2017.html#ClementeFNSU17],<br />
: [https://arts.units.it/handle/11368/2926618 https://arts.units.it/handle/11368/2926618],<br />
: [https://core.ac.uk/display/158823993 https://core.ac.uk/display/158823993],<br />
: [https://academic.microsoft.com/#/detail/2782578837 https://academic.microsoft.com/#/detail/2782578837]</div>Scipediacontent