<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
<PublisherName>OICC Press</PublisherName>
<JournalTitle>Fuzzy Optimization and Modeling Journal (FOMJ)</JournalTitle>
<Issn>2676-7007</Issn>
<Volume>5</Volume>
<Issue>2</Issue>
<PubDate PubStatus="epublish">
<Year>2024</Year>
<Month>06</Month>
<Day>29</Day>
</PubDate>
</Journal>
<ArticleTitle>Mutiobjective Optimization Strategy for Solving Interval-valued Fuzzy Constrained Shortest Path Problems</ArticleTitle>
<VernacularTitle></VernacularTitle>
<FirstPage>82</FirstPage>
<LastPage>95</LastPage>
<ELocationID EIdType="doi">10.71808/FOMJ.2024.1130564</ELocationID>
<Language>EN</Language>
<AuthorList>
<Author>
<FirstName>Maryam</FirstName>
<LastName>Nikbakht</LastName>
<Affiliation>Department of Mathematics,
Payame Noor University,
P.O.Box 19395-3697, Tehran,
Iran.</Affiliation>
<Identifier Source="ORCID"></Identifier>
</Author>
</AuthorList>
<PublicationType>Journal Article</PublicationType>
<History>
<PubDate PubStatus="received">
<Year>2024</Year>
<Month>06</Month>
<Day>29</Day>
</PubDate>
</History>
<Abstract>The constrained shortest path (CSP) problem is one of the most used and tangible applications of network flow problems that aside from its straightforward application is arised as auxiliary problems in flight planning, tail assignment problem in aircraft scheduling and crew rostering problems, among others. The objective of the CSP problem is to determine a minimum cost path between two specified nodes that the traversal time of the path does not exceed from a specified time. Conventional CSP problem generally assumes that the weights of arc costs and times are defined by real variables, though these values are unpredictable due to some uncontrollable factors. The present study formulates a CSP problem when values of arc costs and times are interval-valued triangular fuzzy numbers and proposes a multi-objective optimization strategy to obtain the efficient solution of the resulting problem. The applicability of the proposed approach is illustrated through an example dealing with wireless sensor networks</Abstract>
<ObjectList>
<Object Type="keyword">
<Param Name="value">Constrainted Shortest Path</Param>
</Object>
<Object Type="keyword">
<Param Name="value">Interval-valued Fuzzy Number</Param>
</Object>
<Object Type="keyword">
<Param Name="value">Multiobjective Optimization</Param>
</Object>
</ObjectList>
</Article>
</ArticleSet>