Heuristics and Metaheuristics for Fixed-Charge Network Design

Teodor Gabriel Crainic () and Michel Gendreau ()
Additional contact information
Teodor Gabriel Crainic: Université du Québec à Montréal
Michel Gendreau: Polytechnique Montréal

Chapter Chapter 4 in Network Design with Applications to Transportation and Logistics, 2021, pp 91-138 from Springer

Abstract: 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.

Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-64018-7_4

Ordering information: This item can be ordered from
http://www.springer.com/9783030640187

DOI: 10.1007/978-3-030-64018-7_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().