Network Design for Express Shipment Delivery
Computational Optimization and Applications
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
A Survey of Optimization Models for Train Routing and Scheduling
Transportation Science
Multimodal Express Package Delivery: a Service Network Design Application
Transportation Science
Composite Variable Formulations for Express Shipment Service Network Design
Transportation Science
Branch and Price for Service Network Design with Asset Management Constraints
Transportation Science
| Hi-index | 0.00 |
This paper proposes a three-phase matheuristic solution strategy for the capacitated multi-commodity fixed-cost network design problem with design-balance constraints. The proposed matheuristic combines exact and neighbourhood-based methods. Tabu search and restricted path relinking meta-heuristics cooperate to generate as many feasible solutions as possible. The two meta-heuristics incorporate new neighbourhoods, and computationally efficient exploration procedures. The feasible solutions generated by the two procedures are then used to identify an appropriate part of the solution space where an exact solver intensifies the search. Computational experiments on benchmark instances show that the proposed algorithm finds good solutions to large-scale problems in a reasonable amount of time.