Multi-period single-allocation hub location-routing: models and heuristic solutions
From MaRDI portal
Publication:6113308
DOI10.1016/j.ejor.2023.02.003MaRDI QIDQ6113308
Afaf Aloullal, Raca Todosijević, Francisco Saldanha-Da-gama
Publication date: 11 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Cites Work
- Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty
- A branch-and-cut algorithm for the hub location and routing problem
- Multi-period hub network design problems with modular capacities
- On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems
- On a fix-and-relax framework for a class of project scheduling problems
- A quadratic integer program for the location of interacting hub facilities
- Solution algorithms for the capacitated single allocation hub location problem
- On practical resource allocation for production planning and scheduling with period overlapping setups
- Restructuring of Swiss parcel delivery services
- Planning models for long-haul operations of postal and express shipment companies
- Routing and scheduling decisions in the hierarchical hub location problem
- On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon
- Variable neighborhood search: basics and variants
- Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- Perspectives on modeling hub location problems
- The capacitated directed cycle hub location and routing problem under congestion
- An efficient heuristic for a hub location routing problem
- Matheuristics. Algorithms and implementations
- Efficient algorithms for the uncapacitated single allocation p-hub median problem