liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
An integer programming column generation principlefor heuristic search methods
Nanjing University of Science and Technology, School of Automation.
Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska fakulteten.ORCID-id: 0000-0003-2094-7376
Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska fakulteten.ORCID-id: 0000-0002-2081-2888
2019 (engelsk)Inngår i: International Transactions in Operational Research, ISSN 0969-6016, E-ISSN 1475-3995, Vol. 27, nr 1, s. 665-695Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

There is an increasing interest in integrating column generation and heuristic approaches to efficiently solve large-scale discrete optimisation problems. We contribute in this direction. Based on the insights from Lagrangian duality theory, we present an auxiliary problem that can be used for finding near-optimal solutions to a discrete column-oriented model. The structure of this auxiliary problem makes it suitable for being addressed with a heuristic search method involving column generation. To this end, we suggest a large neighbourhood search strategy where the repair step is to solve a column generation type subproblem. The suggested search strategy and mathematical models involved need to be tailored to the problem structure. To illustrate important design options and computational behaviour, four applications are studied: bin packing, generalised assignment, a resource allocation problem and the fixed-charge transportation problem.

sted, utgiver, år, opplag, sider
Wiley-Blackwell, 2019. Vol. 27, nr 1, s. 665-695
Emneord [en]
integer programming; column generation; metaheuristics; matheuristics; large neighbourhood search
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-148910DOI: 10.1111/itor.12521ISI: 000478733800029OAI: oai:DiVA.org:liu-148910DiVA, id: diva2:1222521
Merknad

Funding agencies:  Research School in Interdisciplinary Mathematics at Linkoping University; 1035 Equipment Pre-Research Field Foundation of China [61403120401]; Center for Industrial Information Technology (CENIIT) at Linkoping University [16.05]

Tilgjengelig fra: 2018-06-21 Laget: 2018-06-21 Sist oppdatert: 2019-09-09

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Søk i DiVA

Av forfatter/redaktør
Larsson, TorbjörnRönnberg, Elina
Av organisasjonen
I samme tidsskrift
International Transactions in Operational Research

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 97 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf