<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<meta name="Generator" content="Microsoft Word 15 (filtered medium)">
<style><!--
/* Font Definitions */
@font-face
{font-family:Wingdings;
panose-1:5 0 0 0 0 0 0 0 0 0;}
@font-face
{font-family:"Cambria Math";
panose-1:2 4 5 3 5 4 6 3 2 4;}
@font-face
{font-family:Calibri;
panose-1:2 15 5 2 2 2 4 3 2 4;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin:0in;
margin-bottom:.0001pt;
font-size:11.0pt;
font-family:"Calibri",sans-serif;}
h1
{mso-style-priority:9;
mso-style-link:"Heading 1 Char";
mso-margin-top-alt:auto;
margin-right:0in;
mso-margin-bottom-alt:auto;
margin-left:0in;
font-size:24.0pt;
font-family:"Times New Roman",serif;
font-weight:bold;}
h2
{mso-style-priority:9;
mso-style-link:"Heading 2 Char";
mso-margin-top-alt:auto;
margin-right:0in;
mso-margin-bottom-alt:auto;
margin-left:0in;
font-size:18.0pt;
font-family:"Times New Roman",serif;
font-weight:bold;}
h3
{mso-style-priority:9;
mso-style-link:"Heading 3 Char";
mso-margin-top-alt:auto;
margin-right:0in;
mso-margin-bottom-alt:auto;
margin-left:0in;
font-size:13.5pt;
font-family:"Times New Roman",serif;
font-weight:bold;}
a:link, span.MsoHyperlink
{mso-style-priority:99;
color:#0563C1;
text-decoration:underline;}
a:visited, span.MsoHyperlinkFollowed
{mso-style-priority:99;
color:#954F72;
text-decoration:underline;}
p
{mso-style-priority:99;
mso-margin-top-alt:auto;
margin-right:0in;
mso-margin-bottom-alt:auto;
margin-left:0in;
font-size:12.0pt;
font-family:"Times New Roman",serif;}
span.EmailStyle17
{mso-style-type:personal-compose;
font-family:"Calibri",sans-serif;
color:windowtext;}
span.Heading1Char
{mso-style-name:"Heading 1 Char";
mso-style-priority:9;
mso-style-link:"Heading 1";
font-family:"Times New Roman",serif;
font-weight:bold;}
span.Heading2Char
{mso-style-name:"Heading 2 Char";
mso-style-priority:9;
mso-style-link:"Heading 2";
font-family:"Times New Roman",serif;
font-weight:bold;}
span.Heading3Char
{mso-style-name:"Heading 3 Char";
mso-style-priority:9;
mso-style-link:"Heading 3";
font-family:"Times New Roman",serif;
font-weight:bold;}
p.app-checklist-bannercopy, li.app-checklist-bannercopy, div.app-checklist-bannercopy
{mso-style-name:app-checklist-banner__copy;
mso-margin-top-alt:auto;
margin-right:0in;
mso-margin-bottom-alt:auto;
margin-left:0in;
font-size:12.0pt;
font-family:"Times New Roman",serif;}
p.c-adlabel, li.c-adlabel, div.c-adlabel
{mso-style-name:c-ad__label;
mso-margin-top-alt:auto;
margin-right:0in;
mso-margin-bottom-alt:auto;
margin-left:0in;
font-size:12.0pt;
font-family:"Times New Roman",serif;}
.MsoChpDefault
{mso-style-type:export-only;
font-family:"Calibri",sans-serif;}
@page WordSection1
{size:8.5in 11.0in;
margin:1.0in 1.0in 1.0in 1.0in;}
div.WordSection1
{page:WordSection1;}
/* List Definitions */
@list l0
{mso-list-id:2707925;
mso-list-template-ids:1647242960;}
@list l0:level1
{mso-level-number-format:bullet;
mso-level-text:\F0B7;
mso-level-tab-stop:.5in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:Symbol;}
@list l0:level2
{mso-level-number-format:bullet;
mso-level-text:o;
mso-level-tab-stop:1.0in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:"Courier New";
mso-bidi-font-family:"Times New Roman";}
@list l0:level3
{mso-level-number-format:bullet;
mso-level-text:\F0A7;
mso-level-tab-stop:1.5in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:Wingdings;}
@list l0:level4
{mso-level-number-format:bullet;
mso-level-text:\F0A7;
mso-level-tab-stop:2.0in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:Wingdings;}
@list l0:level5
{mso-level-number-format:bullet;
mso-level-text:\F0A7;
mso-level-tab-stop:2.5in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:Wingdings;}
@list l0:level6
{mso-level-number-format:bullet;
mso-level-text:\F0A7;
mso-level-tab-stop:3.0in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:Wingdings;}
@list l0:level7
{mso-level-number-format:bullet;
mso-level-text:\F0A7;
mso-level-tab-stop:3.5in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:Wingdings;}
@list l0:level8
{mso-level-number-format:bullet;
mso-level-text:\F0A7;
mso-level-tab-stop:4.0in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:Wingdings;}
@list l0:level9
{mso-level-number-format:bullet;
mso-level-text:\F0A7;
mso-level-tab-stop:4.5in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:Wingdings;}
@list l1
{mso-list-id:1145245965;
mso-list-template-ids:-1279237318;}
@list l1:level1
{mso-level-number-format:bullet;
mso-level-text:\F0B7;
mso-level-tab-stop:.5in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:Symbol;}
@list l1:level2
{mso-level-number-format:bullet;
mso-level-text:o;
mso-level-tab-stop:1.0in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:"Courier New";
mso-bidi-font-family:"Times New Roman";}
@list l1:level3
{mso-level-number-format:bullet;
mso-level-text:\F0A7;
mso-level-tab-stop:1.5in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:Wingdings;}
@list l1:level4
{mso-level-number-format:bullet;
mso-level-text:\F0A7;
mso-level-tab-stop:2.0in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:Wingdings;}
@list l1:level5
{mso-level-number-format:bullet;
mso-level-text:\F0A7;
mso-level-tab-stop:2.5in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:Wingdings;}
@list l1:level6
{mso-level-number-format:bullet;
mso-level-text:\F0A7;
mso-level-tab-stop:3.0in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:Wingdings;}
@list l1:level7
{mso-level-number-format:bullet;
mso-level-text:\F0A7;
mso-level-tab-stop:3.5in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:Wingdings;}
@list l1:level8
{mso-level-number-format:bullet;
mso-level-text:\F0A7;
mso-level-tab-stop:4.0in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:Wingdings;}
@list l1:level9
{mso-level-number-format:bullet;
mso-level-text:\F0A7;
mso-level-tab-stop:4.5in;
mso-level-number-position:left;
text-indent:-.25in;
mso-ansi-font-size:10.0pt;
font-family:Wingdings;}
ol
{margin-bottom:0in;}
ul
{margin-bottom:0in;}
--></style><!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]-->
</head>
<body lang="EN-US" link="#0563C1" vlink="#954F72">
<div class="WordSection1">
<h1 style="margin-bottom:6.0pt"><span style="font-size:18.0pt">Optimization Letters Special Issue:
<o:p></o:p></span></h1>
<h1 style="margin-top:6.0pt"><span style="font-size:18.0pt">Computational Methods for Supply Chain and Logistics Planning Problems<o:p></o:p></span></h1>
<p>Advances in computing power combined with methodological developments hold promise for obtaining optimal or near-optimal solutions for large-scale optimization problems containing high degrees of uncertainty and complexity. The increased availability of
real-time and transactional data also provides opportunities to gain a deeper understanding of the behavior and properties of dynamic systems, and to develop models with greater fidelity.<o:p></o:p></p>
<p>Global supply chains are prime examples in this domain. They are prohibitively complex and dynamic, compounding existing challenges inherent in efficiently matching supply and demand. Recent world events have revealed the vulnerability of numerous supply
chains to external shocks and sources of uncertainty, which has led researchers in academia, with the support of government and industry initiatives, to rethink supply chain planning approaches in order to improve their performance and resilience. This requires
leveraging recent computational and methodological advances to address these emerging challenges for large-scale and integrated systems.<o:p></o:p></p>
<p>In light of these developments, this special issue is devoted to recent advances that leverage computational methods for dealing with high degrees of complexity and uncertainty to address complex supply chain and logistics problems. The goal of this issue
is to publish high-quality, concise articles with innovative developments that have the potential for application in practice. The objective is to disseminate the knowledge generated via novel computational methods in the supply chain and logistics planning
area.<o:p></o:p></p>
<p style="margin-bottom:6.0pt"><strong>Topics</strong><o:p></o:p></p>
<p style="margin-top:6.0pt">This special issue of Optimization Letters is open to all areas of computational methods, including exact and heuristic solution approaches, mainly focusing on problems in supply chain management and logistics planning. Topics of
interest include, but are not limited to:<o:p></o:p></p>
<ul type="disc">
<li class="MsoNormal" style="mso-margin-top-alt:auto;mso-margin-bottom-alt:auto;mso-list:l1 level1 lfo1">
<span style="font-family:"Times New Roman",serif">Approximate dynamic programming<o:p></o:p></span></li><li class="MsoNormal" style="mso-margin-top-alt:auto;mso-margin-bottom-alt:auto;mso-list:l1 level1 lfo1">
<span style="font-family:"Times New Roman",serif">Sample average approximation methods<o:p></o:p></span></li><li class="MsoNormal" style="mso-margin-top-alt:auto;mso-margin-bottom-alt:auto;mso-list:l1 level1 lfo1">
<span style="font-family:"Times New Roman",serif">AI/machine learning techniques, especially with the integration of optimization methods to speed up classical solution approaches, such as branch-and-cut, benders decomposition, column generation, etc.<o:p></o:p></span></li><li class="MsoNormal" style="mso-margin-top-alt:auto;mso-margin-bottom-alt:auto;mso-list:l1 level1 lfo1">
<span style="font-family:"Times New Roman",serif">Reinforcement learning<o:p></o:p></span></li><li class="MsoNormal" style="mso-margin-top-alt:auto;mso-margin-bottom-alt:auto;mso-list:l1 level1 lfo1">
<span style="font-family:"Times New Roman",serif">Parallel search algorithm development<o:p></o:p></span></li><li class="MsoNormal" style="mso-margin-top-alt:auto;mso-margin-bottom-alt:auto;mso-list:l1 level1 lfo1">
<span style="font-family:"Times New Roman",serif">Estimation methods for optimal solutions<o:p></o:p></span></li><li class="MsoNormal" style="mso-margin-top-alt:auto;mso-margin-bottom-alt:auto;mso-list:l1 level1 lfo1">
<span style="font-family:"Times New Roman",serif">Distributed optimization<o:p></o:p></span></li></ul>
<p style="margin-bottom:6.0pt"><strong>Submissions </strong><o:p></o:p></p>
<p style="margin-top:6.0pt">Manuscripts should be prepared using <a href="https://www.springer.com/gp/livingreviews/latex-templates">
Springer’s LaTeX macro package</a> and submitted through the journal's editorial manager
<a href="https://www.editorialmanager.com/optl">https://www.editorialmanager.com/optl</a>. Each manuscript will be peer-reviewed according to the editorial policy of
<em>Optimization Letters</em>. Articles should be original, unpublished, and not currently under consideration for publication elsewhere.<o:p></o:p></p>
<p>Please select <em>SI: CompSCL2023</em> for the article type when submitting your contribution. All papers will go through a regular peer review process.<br>
<br>
<o:p></o:p></p>
<p style="margin-bottom:6.0pt"><strong>Important Dates </strong><o:p></o:p></p>
<p style="margin-top:6.0pt">Submission Deadline: September 1, 2023.<br>
<br>
<strong><o:p></o:p></strong></p>
<p style="margin-bottom:6.0pt"><strong>Guest Editors </strong><o:p></o:p></p>
<ul style="margin-top:0in" type="disc">
<li class="MsoNormal" style="margin-top:6.0pt;mso-margin-bottom-alt:auto;mso-list:l0 level1 lfo2">
Joseph Geunes, Texas A&M University, College Station, TX<o:p></o:p></li><li class="MsoNormal" style="mso-margin-top-alt:auto;mso-margin-bottom-alt:auto;mso-list:l0 level1 lfo2">
Bahar Çavdar, Texas A&M University, College Station, TX<o:p></o:p></li><li class="MsoNormal" style="mso-margin-top-alt:auto;mso-margin-bottom-alt:auto;mso-list:l0 level1 lfo2">
Reem Khir, Purdue University, West Lafayette, IN<o:p></o:p></li></ul>
<p>For all information in one page kindly download the PDF below: <br>
<a href="https://resource-cms.springernature.com/springer-cms/rest/v1/content/25211120/data/v1" target="_blank">Call for Papers: Computational Methods for Supply Chain and Logistics Planning Problems</a><o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"><span style="font-size:8.0pt">Joseph Geunes<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:8.0pt">Professor and Marilyn and L. David Black Faculty Fellow<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:8.0pt">Associate Department Head for Graduate Affairs<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:8.0pt">Wm Michael Barnes ’64 Department of Industrial & Systems Engineering<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:8.0pt">Texas A&M University<o:p></o:p></span></p>
<p class="MsoNormal"><o:p> </o:p></p>
</div>
</body>
</html>