The two echelon open location routing problem: Mathematical model and hybrid heuristic
| Autor: | Amirsaman H. Bajgiran, Matthew E. H. Petering, Khosro Pichka, Xiaohang Yue, Jaejin Jang |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Mathematical optimization
021103 operations research General Computer Science Location routing Computer science Heuristic (computer science) Heuristic 0211 other engineering and technologies General Engineering ComputerApplications_COMPUTERSINOTHERSYSTEMS 02 engineering and technology Set (abstract data type) Flow (mathematics) 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing |
| Zdroj: | Computers & Industrial Engineering. 121:97-112 |
| ISSN: | 0360-8352 |
| DOI: | 10.1016/j.cie.2018.05.010 |
| Popis: | Multi echelon distribution systems have become more common in recent years. This paper addresses the two echelon open location routing problem (2E-OLRP) which is a variant of the two echelon location routing problem (2E-LRP). This problem seeks to find a minimum-cost set of vehicle routes that do not return to the depot in the first echelon and do not return to satellites in the second echelon due to the presence of individual contractors and third party logistics (3PL) providers. In spite of the large amount of research on LRPs, the 2E-OLRP has received very little attention. Three flow-based mixed-integer linear programs and a hybrid heuristic algorithm are proposed to deal with this problem. Extensive experiments evaluate the effectiveness of these methods. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect