A MILP model and memetic algorithm for the Hub Location and Routing problem with distinct collection and delivery tours

•Solutions of Hub Location Routing Problems with distinct pickup and delivery tours.•MILP model finds solutions of small to medium size instances.•Memetic Algorithm obtains high quality solutions of large problems efficiently.•Sensitivity analysis proves robustness of MA and usefulness for decision-...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & industrial engineering Ročník 135; s. 105 - 119
Hlavní autori:	Yang, Xiao, Bostel, Nathalie, Dejax, Pierre
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.09.2019 Elsevier
Predmet:	Computer Science Hub Location-Routing Problem LTL transport Memetic algorithm Mixed integer programming model Operations Research Memetic algorithm Hub Location-Routing Problem LTL transport Mixed integer programming model
ISSN:	0360-8352, 1879-0550
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!