Heuristics and Metaheuristics for Fixed-Charge Network Design

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Heuristics and metaheuristics are widely used to tackle difficult network design problems. We first present fundamental concepts for the development of heuristic approaches, such as search spaces, neighborhoods, and populations of solutions. The main heuristic and metaheuristic solution methods are then introduced: constructive and Local Search heuristics, neighborhood-based metaheuristics, population-based methods, matheuristics, parallel meta- and matheuristics. The chapter focuses on the application of these methods to fixed-charge transportation and multicommodity capacitated fixed-charge network design problems. We also provide a historical perspective on the development of the field since the 1960’s, as well as a number of challenging research avenues for meta- and matheuristics for network design problems.

Cite

CITATION STYLE

APA

Crainic, T. G., & Gendreau, M. (2021). Heuristics and Metaheuristics for Fixed-Charge Network Design. In Network Design with Applications to Transportation and Logistics (pp. 91–138). Springer International Publishing. https://doi.org/10.1007/978-3-030-64018-7_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free