Journal Article10.1057/JORS.2012.114
A hybrid simulated annealing and column generation approach for capacitated multicommodity network design
TL;DR: A hybrid simulated annealing (SA) and column generation (CG) algorithm for the path-based formulation of the capacitated multicommodity network design (PCMND) problem and is compared with the solutions of CPLEX solver and the best-known method in the literature under different time limits.
read more
Abstract: This paper presents a hybrid simulated annealing (SA) and column generation (CG) algorithm for the path-based formulation of the capacitated multicommodity network design (PCMND) problem. In the proposed method, the SA metaheuristic algorithm manages open and closed arcs. Several strategies for adding and dropping arcs are suggested and evaluated. For a given design vector in the proposed hybrid approach, the PCMND problem becomes a capacitated multicommodity minimum cost flow (CMCF) problem. The exact evaluation of the CMCF problem is performed using the CG algorithm. The parameter tuning is done by means of design of experiments approach. The performance of the proposed algorithm is evaluated by solving several benchmark instances. The results of the proposed algorithm are compared with the solutions of CPLEX solver and the best-known method in the literature under different time limits. Statistical analysis proves that the proposed algorithm is able to obtain better solutions.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
The Design and Analysis of Experiments
TL;DR: This book by a teacher of statistics (as well as a consultant for "experimenters") is a comprehensive study of the philosophical background for the statistical design of experiment.
15.2K
The Continuous-Time Service Network Design Problem.
TL;DR: An iterative refinement algorithm using partially time-expanded networks that solves continuous-time service network design problems and demonstrates that the algorithm not only solves problems but also obtains an optimal solution at each point in time.
174
The transit time constrained fixed charge multi-commodity network design problem
TL;DR: A detailed sensitivity analysis of the branch-and-price algorithm shows that longer transit times and an increased ratio of fixed charge to flow cost increase the difficulty of solving the problem whereas the arc capacity has less impact.
13
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
Mohammad Rahim Akhavan Kazemzadeh,Tolga Bektaş,Teodor Gabriel Crainic,Antonio Frangioni,Bernard Gendron,Enrico Gorgone +5 more
TL;DR: A Lagrangian matheuristic is developed that is competitive with the state-of-the-art heuristics from the literature and improves upon the linear programming relaxation bound for flow and knapsack relaxations.
9
References
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
46.9K
•Journal Article
The Design and Analysis of Experiments
TL;DR: This book by a teacher of statistics (as well as a consultant for "experimenters") is a comprehensive study of the philosophical background for the statistical design of experiment.
15.2K
•Book
Metaheuristics: From Design to Implementation
El-Ghazali Talbi
- 22 Jun 2009
TL;DR: This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling.
•Book
Linear Programming and Network Flows
Mokhtar S. Bazaraa,John J. Jarvis,Hanif D. Sherali +2 more
- 01 Jan 1977
TL;DR: This chapter discusses the complexity of the Simplex Algorithms and their applications in linear algebra, convex analysis, and Polyhedral Sets.
OR-Library: Distributing Test Problems by Electronic Mail
TL;DR: A system (OR-Library) that distributes test problems by electronic mail (e-mail) that has available test problems drawn from a number of different areas of operational research.
2K