Aristotle University Of Thessaloniki (AUTH)
Solution methods for complex supply chain network optimization problems
Abstract
dc:descriptionThe intertemporal integration of supply chain activities is crucial in developing sustained competitive advantage in the modern entrepreneurial environment. This integration refer to the simultaneous optimization of strategic, tactical and operational decisions in complex supply chain networks. Moreover, due to the fact that the supply chain activities emit pollutants, like carbon dioxide (CO2), increased socio-environmental concerns have shifted the focus to a balanced goal, which integrates economic, environmental and social goals. To achieve these goals, the solution of complex supply chain optimization problems is required. New advanced optimization techniques and tools must be developed to assist decision makers. This thesis studies and investigates new complex and integrated supply chain network optimization problems under economic and environmental. Efficient metaheuristic-based solution methods are developed for the solution of these problems to derive useful managerial insights. More specifically, a well-known combinatorial optimization problem which integrates strategic, tactical and operation decisions is the Location-Inventory-Routing Problem. Herein, several variants of this complex problem are addressed. Initially, a Location-Inventory-Routing Problem with Distribution Outsourcing is introduced to describe cases where the proprietary fleet of vehicles is either cost-inefficient or specific fleet of vehicles is required (i.e. customer-specific). Furthermore, a green variant of the Location-Inventory-Routing Problem, the Pollution-Location-Inventory-Routing Problem is addressed by considering both economic and environmental concerns. In this new problem, decisions related to fuel consumption and CO2 emissions are considered. Next, another green variant of the basic problem is proposed. This problem is called the Fleet Size and Mix Pollution Location Inventory Routing Problem and considers more realistic features, such as fleet composition and capacity planning decisions. Furthermore, a healthcare supply chain network optimization problem related to innovative CAR T-cell cancer therapies is modelled and investigated. In this, a novel network structure is proposed to manage challenges associated to the increased demand for these therapies. To obtain high-quality solutions of these problems in short computational times, several heuristic algorithms, based on the Variable Neighborhood Search metaheuristic framework, are proposed. Solution achieved using these methods are compared to the corresponding ones using state-of-the-art exact commercial solver, such as CPLEX. Extensive comparisons and numerical tests illustrate the efficiency of the proposed metaheuristic methods using key performance indicators.
Degree
thesis:*- Grantor dc:publisher
- Aristotle University Of Thessaloniki (AUTH)
- Year dc:date
- 2020
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Karakostas, Panagiotis
- Καρακώστας, Παναγιώτης
Subjects
dc:subject × 12- Εφοδιαστική αλυσίδα
- Συνδυαστική βελτιστοποίηση
- Αναζήτηση μεταβλητής γειτνίασης
- Μεθευρετικοί αλγόριθμοι
- Supply chain
- COMBINATORIAL OPTIMIZATION
- Variable neighborhood search
- Metaheuristic algorithms
- Επιστήμες Μηχανικού και Τεχνολογία
- Επιστήμη Χημικού Μηχανικού
- Engineering and Technology
- Chemical Engineering
Rights
dc:rights- Statement dc:rights
-
- BY_NC
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/47622