Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
A tabu search procedure for multicommodity location/allocation with balancing requirements
Annals of Operations Research - Special issue on Tabu search
Tabu Search
A Survey of Optimization Models for Train Routing and Scheduling
Transportation Science
A Simplex-Based Tabu Search Method for Capacitated Network Design
INFORMS Journal on Computing
Composite Variable Formulations for Express Shipment Service Network Design
Transportation Science
Ship Routing and Scheduling: Status and Perspectives
Transportation Science
Design and Analysis of Experiments
Design and Analysis of Experiments
On graph-based characteristics of optimal overlay topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Study of Demand Stochasticity in Service Network Design
Transportation Science
Models for Evaluating and Planning City Logistics Systems
Transportation Science
A metaheuristic for stochastic service network design
Journal of Heuristics
Branch and Price for Service Network Design with Asset Management Constraints
Transportation Science
Branch and Price for Service Network Design with Asset Management Constraints
Transportation Science
Strategic Design and Analysis of a Relay Network in Truckload Transportation
Transportation Science
Tabu assisted guided local search approaches for freight service network design
Information Sciences: an International Journal
Improved Load Plan Design Through Integer Programming Based Local Search
Transportation Science
Hi-index | 0.00 |
This paper focuses on a generic model for service network design, which includes asset positioning and utilization through constraints on asset availability at terminals. We denote these relations as “design-balance constraints” and focus on the design-balanced capacitated multicommodity network design model, a generalization of the capacitated multicommodity network design model generally used in service network design applications. Both arc-and cycle-based formulations for the new model are presented. The paper also proposes a tabu search metaheuristic framework for the arc-based formulation. Results on a wide range of network design problem instances from the literature indicate the proposed method behaves very well in terms of computational efficiency and solution quality.