Matches in SemOpenAlex for { <https://semopenalex.org/work/W4226184503> ?p ?o ?g. }
- W4226184503 endingPage "636" @default.
- W4226184503 startingPage "603" @default.
- W4226184503 abstract "Abstract This paper develops an optimization model for a sustainable closed-loop supply chain network with two conflicting objectives, namely, the minimization of the total logistic costs and the total amount of carbon emissions. The first objective relates to financial benefits, whereas the second represents the wider goal of guaranteeing cleaner air and hence a greener and healthier planet. The problem is first modelled as a mixed integer linear programming based-model. The aim is to determine the location of distribution centres and recycling centres, their respective numbers and the type of vehicles assigned to each facility. Vehicle type consideration, not commonly used in the literature, adds another dimension to this practical and challenging logistic problem. A matheuristic using compromise programming is put forward to tackle the problem. The proposed matheuristic is evaluated using a variety of newly generated datasets which produces compromise solutions that demonstrate the importance of an appropriate balance of both objective functions. The robustness analysis considering fluctuations in customer demand is assessed using Monte Carlo simulation. The results show that if the standard deviation of the demand falls within 10% of its average, the unsatisfied demand is insignificant, thus demonstrating the stability of supply chain configuration. This invaluable information is key towards helping senior management make relevant operational and strategic decisions that could impact on both the sustainability and the resilience of their supply chain networks." @default.
- W4226184503 created "2022-05-05" @default.
- W4226184503 creator A5021947145 @default.
- W4226184503 creator A5072213844 @default.
- W4226184503 creator A5086583051 @default.
- W4226184503 creator A5090820480 @default.
- W4226184503 date "2022-05-19" @default.
- W4226184503 modified "2023-09-25" @default.
- W4226184503 title "An efficient matheuristic algorithm for bi-objective sustainable closed-loop supply chain networks" @default.
- W4226184503 cites W1165617247 @default.
- W4226184503 cites W1732240353 @default.
- W4226184503 cites W1928912566 @default.
- W4226184503 cites W1967139445 @default.
- W4226184503 cites W1967536980 @default.
- W4226184503 cites W1971460755 @default.
- W4226184503 cites W1979609588 @default.
- W4226184503 cites W1980705845 @default.
- W4226184503 cites W1985780683 @default.
- W4226184503 cites W1988423736 @default.
- W4226184503 cites W1990398792 @default.
- W4226184503 cites W2013139512 @default.
- W4226184503 cites W2020833085 @default.
- W4226184503 cites W2022473658 @default.
- W4226184503 cites W2024938364 @default.
- W4226184503 cites W2025888999 @default.
- W4226184503 cites W2029470983 @default.
- W4226184503 cites W2029501158 @default.
- W4226184503 cites W2032987931 @default.
- W4226184503 cites W2034602924 @default.
- W4226184503 cites W2043572920 @default.
- W4226184503 cites W2048620347 @default.
- W4226184503 cites W2049623382 @default.
- W4226184503 cites W2054557455 @default.
- W4226184503 cites W2060847066 @default.
- W4226184503 cites W2068979510 @default.
- W4226184503 cites W2076716258 @default.
- W4226184503 cites W2079204917 @default.
- W4226184503 cites W2082034461 @default.
- W4226184503 cites W2089575937 @default.
- W4226184503 cites W2091555994 @default.
- W4226184503 cites W2112850949 @default.
- W4226184503 cites W2124794447 @default.
- W4226184503 cites W2147336456 @default.
- W4226184503 cites W2163692899 @default.
- W4226184503 cites W2184075637 @default.
- W4226184503 cites W2189989409 @default.
- W4226184503 cites W2215985501 @default.
- W4226184503 cites W2282854823 @default.
- W4226184503 cites W2283878895 @default.
- W4226184503 cites W2336091294 @default.
- W4226184503 cites W2341823136 @default.
- W4226184503 cites W2346201682 @default.
- W4226184503 cites W2398518623 @default.
- W4226184503 cites W2521097351 @default.
- W4226184503 cites W2604470732 @default.
- W4226184503 cites W2611397379 @default.
- W4226184503 cites W2656640662 @default.
- W4226184503 cites W2735304974 @default.
- W4226184503 cites W2755872041 @default.
- W4226184503 cites W2762626604 @default.
- W4226184503 cites W2776454756 @default.
- W4226184503 cites W2805593105 @default.
- W4226184503 cites W2809528846 @default.
- W4226184503 cites W2810633249 @default.
- W4226184503 cites W2891364111 @default.
- W4226184503 cites W2894396149 @default.
- W4226184503 cites W2901419073 @default.
- W4226184503 cites W2906388240 @default.
- W4226184503 cites W2909909131 @default.
- W4226184503 cites W2912384136 @default.
- W4226184503 cites W2921524628 @default.
- W4226184503 cites W2928963724 @default.
- W4226184503 cites W2954337887 @default.
- W4226184503 cites W2982434621 @default.
- W4226184503 cites W2984662727 @default.
- W4226184503 cites W2991256307 @default.
- W4226184503 cites W2997752149 @default.
- W4226184503 cites W3028829297 @default.
- W4226184503 cites W3048694900 @default.
- W4226184503 cites W3119898870 @default.
- W4226184503 cites W3129752643 @default.
- W4226184503 cites W3158213741 @default.
- W4226184503 cites W4238363634 @default.
- W4226184503 doi "https://doi.org/10.1093/imaman/dpac003" @default.
- W4226184503 hasPublicationYear "2022" @default.
- W4226184503 type Work @default.
- W4226184503 citedByCount "1" @default.
- W4226184503 countsByYear W42261845032023 @default.
- W4226184503 crossrefType "journal-article" @default.
- W4226184503 hasAuthorship W4226184503A5021947145 @default.
- W4226184503 hasAuthorship W4226184503A5072213844 @default.
- W4226184503 hasAuthorship W4226184503A5086583051 @default.
- W4226184503 hasAuthorship W4226184503A5090820480 @default.
- W4226184503 hasBestOaLocation W42261845031 @default.
- W4226184503 hasConcept C104317684 @default.
- W4226184503 hasConcept C108713360 @default.
- W4226184503 hasConcept C11413529 @default.
- W4226184503 hasConcept C126255220 @default.