Analyzing a transportation problem with reliability under the shadowed environment | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Analyzing a transportation problem with reliability under the shadowed environment SHYAMAL KUMAR MONDAL, RAJ KUMAR BERA This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4117925/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 23 May, 2025 Read the published version in Operations Research Forum → Version 1 posted 16 You are reading this latest preprint version Abstract In today's market, sources are being pressurized to deliver the product in a reliable and cost effective manner. From this perspective, the aim of the present work is to model a transportation problem to transport items from some sources to various destinations by minimizing the cost with maximum reliability. Here, the considered reliability is called 'transportation reliability' and it refers to the probability of successfully transporting items over different routes. Also, system reliability has been for different type transportation problems. Due to the imprecise nature of unit transportation cost and transportation reliability, the model has been formulated in shadowed environment. To convert the uncertain model into a deterministic form, a weighted-based de-shadowed procedure has been established. Further, to find the most efficient pareto optimal solution, an algorithm has been developed. Finally, Some numerical examples are considered to illustrate the models in both crisp and shadowed environments numerically. Transportation problem Reliability Reliable transportation problem Shadowed set Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 23 May, 2025 Read the published version in Operations Research Forum → Version 1 posted Editorial decision: Revision requested 12 Aug, 2024 Reviews received at journal 06 Aug, 2024 Reviews received at journal 29 Jul, 2024 Reviews received at journal 23 Jul, 2024 Reviewers agreed at journal 04 Jul, 2024 Reviewers agreed at journal 04 Jul, 2024 Reviewers agreed at journal 04 Jul, 2024 Reviewers agreed at journal 03 Jul, 2024 Reviewers agreed at journal 03 Jul, 2024 Reviews received at journal 04 May, 2024 Reviewers agreed at journal 10 Apr, 2024 Reviewers agreed at journal 10 Apr, 2024 Reviewers invited by journal 09 Apr, 2024 Editor assigned by journal 17 Mar, 2024 Submission checks completed at journal 17 Mar, 2024 First submitted to journal 17 Mar, 2024 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-4117925","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":280639662,"identity":"75bf0a37-26f6-46a7-a899-afab7ff34a03","order_by":0,"name":"SHYAMAL KUMAR MONDAL","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABNUlEQVRIie2Rv0vDQBTHXxCqQ8D1SWzqn3AhcBTqH3NBMMsFBEE6FIlLukjmin+DEBA6HwSaJZD1RJGGDi4OVqUUCsWrFPyVDG6C9xmOe9z3w3uPA9Bo/iL4frZtAONMqNIIP7+KegVdpYS/U7xwHfiqVNG6PHeeZQ/9q34aCiNqN5MsK6evvXvY7gsjPfqpkLvctfgIg2HurRR0k5y71u7oGDBnkA4qFOTE4g2lCKVAjl4iOFjYYAASIDUrBhtwd8GX6NOiXCvFw2SBSwatGgUkp1YQIaNy1aWrFMnozjRiQGoUIg9POkGMzlCqLqyL7oV8pB0jZqajtqse7OD6ls/2W7Twy/ETOW3GhT+5mc+YbWdp+lI1GGyRj7vaGfYEwIZKmvV/tDn+1lfljHl1VqPRaP4nb3QRdIVD/BrbAAAAAElFTkSuQmCC","orcid":"","institution":"Vidyasagar University","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"SHYAMAL","middleName":"KUMAR","lastName":"MONDAL","suffix":""},{"id":280639663,"identity":"2b32e10f-773f-4516-87d2-4469f352f2c7","order_by":1,"name":"RAJ KUMAR BERA","email":"","orcid":"","institution":"Vidyasagar University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"RAJ","middleName":"KUMAR","lastName":"BERA","suffix":""}],"badges":[],"createdAt":"2024-03-17 16:29:15","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4117925/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4117925/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s43069-025-00469-2","type":"published","date":"2025-05-23T15:57:40+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":83460014,"identity":"abe39b41-46aa-465c-b8ed-6573eae72193","added_by":"auto","created_at":"2025-05-26 16:08:58","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":526521,"visible":true,"origin":"","legend":"","description":"","filename":"Manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4117925/v1_covered_fcceb2c2-927e-40dd-9b9d-a903522fc4b8.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Analyzing a transportation problem with reliability under the shadowed environment","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"
[email protected]","identity":"operations-research-forum","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [Operations Research Forum](https://link.springer.com/journal/43069)","snPcode":"43069","submissionUrl":"https://submission.nature.com/new-submission/43069/3","title":"Operations Research Forum","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Transportation problem, Reliability, Reliable transportation problem, Shadowed set","lastPublishedDoi":"10.21203/rs.3.rs-4117925/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4117925/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"In today's market, sources are being pressurized to deliver the product in a reliable and cost effective manner. From this perspective, the aim of the present work is to model a transportation problem to transport items from some sources to various destinations by minimizing the cost with maximum reliability. Here, the considered reliability is called 'transportation reliability' and it refers to the probability of successfully transporting items over different routes. Also, system reliability has been for different type transportation problems. Due to the imprecise nature of unit transportation cost and transportation reliability, the model has been formulated in shadowed environment. To convert the uncertain model into a deterministic form, a weighted-based de-shadowed procedure has been established. Further, to find the most efficient pareto optimal solution, an algorithm has been developed. Finally, Some numerical examples are considered to illustrate the models in both crisp and shadowed environments numerically.","manuscriptTitle":"Analyzing a transportation problem with reliability under the shadowed environment","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-03-20 01:18:01","doi":"10.21203/rs.3.rs-4117925/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2024-08-12T18:40:15+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-08-07T02:06:45+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-07-29T11:16:53+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-07-23T12:37:45+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"177593176779767916400184941227067964195","date":"2024-07-04T10:00:33+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"240165242753311254326192050358540223443","date":"2024-07-04T08:39:25+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"211519147104401466166228266691902322210","date":"2024-07-04T06:20:44+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"219467548397771411944400464880915842062","date":"2024-07-04T03:12:33+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"35691740731415289498676963557416773917","date":"2024-07-03T20:52:43+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-05-04T05:01:48+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"24b6e9a6-2cd9-49d0-bca4-49a42168963c","date":"2024-04-10T14:58:20+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"0d3aa27f-d062-46d8-987d-55505f66ff84","date":"2024-04-10T11:05:47+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2024-04-09T20:21:13+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2024-03-18T01:19:03+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2024-03-17T23:40:25+00:00","index":"","fulltext":""},{"type":"submitted","content":"Operations Research Forum","date":"2024-03-17T16:19:01+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"
[email protected]","identity":"operations-research-forum","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [Operations Research Forum](https://link.springer.com/journal/43069)","snPcode":"43069","submissionUrl":"https://submission.nature.com/new-submission/43069/3","title":"Operations Research Forum","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"0d8e202f-5f79-4fc1-bff4-37324dcee262","owner":[],"postedDate":"March 20th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[],"tags":[],"updatedAt":"2025-05-26T16:01:17+00:00","versionOfRecord":{"articleIdentity":"rs-4117925","link":"https://doi.org/10.1007/s43069-025-00469-2","journal":{"identity":"operations-research-forum","isVorOnly":false,"title":"Operations Research Forum"},"publishedOn":"2025-05-23 15:57:40","publishedOnDateReadable":"May 23rd, 2025"},"versionCreatedAt":"2024-03-20 01:18:01","video":"","vorDoi":"10.1007/s43069-025-00469-2","vorDoiUrl":"https://doi.org/10.1007/s43069-025-00469-2","workflowStages":[]},"version":"v1","identity":"rs-4117925","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4117925","identity":"rs-4117925","version":["v1"]},"buildId":"FbvkV6FR0MCFSLy54lSbu","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}
Text is read by the "Ask this paper" AI Q&A widget below.
Extraction quality varies by source — PMC NXML preserves structure
cleanly, OA-HTML may include some navigation residue, and OA-PDF can
have broken hyphenation. The publisher copy
(via DOI)
is the canonical version.