Παρακαλώ χρησιμοποιήστε αυτό το αναγνωριστικό για να παραπέμψετε ή να δημιουργήσετε σύνδεσμο προς αυτό το τεκμήριο:
https://hdl.handle.net/123456789/980| Τύπος: | Άρθρο σε επιστημονικό περιοδικό |
| Τίτλος: | An infeasible space exploring matheuristic for the production routing problem |
| Συγγραφέας: | [EL] Μανουσάκης, Ελευθέριος[EN] Manousakis, Eleftherios [EL] Κασαπίδης, Γρηγόριος[EN] Kasapidis, Grigorios [EL] Κυρανούδης, Χρήστος[EN] Kiranoudis, Christos [EL] Ζαχαριάδης, Εμμανουήλ[EN] Zachariadis, Emmanouil |
| Ημερομηνία: | 02/06/2021 |
| Περίληψη: | This paper proposes a novel matheuristic algorithm for solving the Production Routing Problem (PRP). The PRP is a hard-to-solve combinatorial optimization problem with numerous practical applications in the eld of freight transportation, logistics and supply chain management. A manufacturer is responsible for determining production decisions, as well as the timing and the quantity of replenishment services offered to a set of geographically dispersed customers over a multi-period time horizon. The problem calls for jointly optimizing the production, inventory, distribution and routing decisions. The paper provides a novel two-commodity ow formulation and proposes a two-phase infeasible space matheuristic algorithm for solving the examined problem. The rst phase deals with a relaxation of the problem to construct production-distribution plans. In the second phase, these are completed with routing information and optimized via a local search framework which oscillates between the feasible and the infeasible solution space. The framework is equipped with mixed integer programming components for restoring infeasibility and for diversifying the conducted search. Computational experiments demonstrate that the infeasibility space exploration signi cantly contributes to the quality of the fi nal solutions. The results obtained by the proposed matheuristic out-match the results of state-of-the-art approaches. More speci cally, 594 and 55 new best solutions out of 1440 and 90 instances of two well-established benchmark data sets of small-medium and large instances are reported, respectively. |
| Γλώσσα: | Αγγλικά |
| Σελίδες: | 18 |
| DOI: | doi.org/10.1016/j.ejor.2021.05.037 |
| ISSN: | 0377-2217 |
| Θεματική κατηγορία: | [EL] Επιστήμη Λήψης αποφάσεων[EN] Decision Sciences |
| Λέξεις-κλειδιά: | Transportation; Integrated routing problem; Production routing; Matheuristic; Infeasible space search |
| Κάτοχος πνευματικών δικαιωμάτων: | © 2021 Elsevier B.V. All rights reserved |
| Ηλεκτρονική διεύθυνση του τεκμηρίου στον εκδότη: | https://www.sciencedirect.com/science/article/pii/S0377221721004653 |
| Ηλεκτρονική διεύθυνση περιοδικού: | https://www.sciencedirect.com/journal/european-journal-of-operational-research |
| Τίτλος πηγής δημοσίευσης: | European Journal of Operational Research (EJOR) |
| Τεύχος: | 2 |
| Τόμος: | 298 |
| Σελίδες τεκμηρίου (στην πηγή): | 478-495 |
| Σημειώσεις: | This research is co-financed by Greece and the European Union (European Social Fund-ESF) through the Operational Programme ”Human Resources Development, Education and Lifelong Learning 2014-2020” in the context of the project ”Quantitative Decision Support Tools for the Combined Production, Inventory, Distribution and Routing Problem” (MIS 5049910). |
| Εμφανίζεται στις συλλογές: | Ερευνητικές ομάδες |
Αρχεία σε αυτό το τεκμήριο:
| Αρχείο | Περιγραφή | Σελίδες | Μέγεθος | Μορφότυπος | Έκδοση | Άδεια | |
|---|---|---|---|---|---|---|---|
| PRP_Matheuristic_Elsevier__Paper____R1__Major__Final (2).pdf | 968 kB | Adobe PDF | Του συγγραφέα (pre-refereeing) |  | Δείτε/ανοίξτε |