An Efficient Matheuristic for the Multicommodity Fixed-Charge Network Design Problem
Overview & Synopsis
In this paper we study the Multicommodity Fixed-Charge Network Design problem. We propose an Iterative linear programming-based heuristic for solving this NP hard problem. The proposed heuristics have been tested on the benchmark instances from the literature. The quality of solutions obtained by each of them has been disclosed comparing them with corresponding solutions of the current state-of-the-art heuristics, i.e., Cycle-Based Evolutionary algorithms.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | An Efficient Matheuristic for the Multicommodity Fixed-Charge Network Design Problem |
|---|---|
| Author / Organization | Bernard Gendron, Said Hanafi, Raca Todosijević |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2016 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-221302 |
| Original Source Link | Visit Source Page on hal.science » |