A Column Generation Heuristic for a Dynamic Generalized Assignment Problem (Articolo in rivista)

Type
Label
  • A Column Generation Heuristic for a Dynamic Generalized Assignment Problem (Articolo in rivista) (literal)
Anno
  • 2009-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1016/j.cor.2008.11.022 (literal)
Alternative label
  • Moccia Luigi; Cordeau Jean-François; Monaco M. Flavia; Sammarra Marcello (2009)
    A Column Generation Heuristic for a Dynamic Generalized Assignment Problem
    in Computers & operations research; Pergamon-Elsevier Science Ltd., Oxford (Regno Unito)
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Moccia Luigi; Cordeau Jean-François; Monaco M. Flavia; Sammarra Marcello (literal)
Pagina inizio
  • 2670 (literal)
Pagina fine
  • 2681 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 36 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali
  • 12 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
  • 9 (literal)
Note
  • Scopu (literal)
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Istituto di calcolo e reti ad alte prestazioni - CNR, TER-ENETEC Tecnologie per gli Usi Finali dell'Energia - ENEA e Dipartimento di Elettronica, Informatica e Sistemistica - Università della Calabria; Canada Research Chair in Logistics and Transportation and CIRRELT - HEC Montréal; Dipartimento di Elettronica, Informatica e Sistemistica- Università della Calabria; Dipartimento di Elettronica, Informatica e Sistemistica- Università della Calabria (literal)
Titolo
  • A Column Generation Heuristic for a Dynamic Generalized Assignment Problem (literal)
Abstract
  • This paper studies the dynamic generalized assignment problem (DGAP) which extends the well-known generalized assignment problem by considering a discretized time horizon and by associating a starting time and a finishing time with each task. Additional constraints related to warehouse and yard management applications are also considered. Three linear integer programming formulations of the problem are introduced. The strongest one models the problem as an origin-destination integer multi-commodity flow problem with side constraints. This model can be solved quickly for instances of small to moderate size. However, because of its computer memory requirements, it becomes impractical for larger instances. Hence, a column generation algorithm is used to compute lower bounds by solving the linear program (LP) relaxation of the problem. This column generation algorithm is also embedded in a heuristic aimed at finding feasible integer solutions. Computational experiments on large-scale instances show the effectiveness of the proposed approach. (literal)
Editore
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Editore di
Insieme di parole chiave di
data.CNR.it