Heuristics for Two-Dimensional Bin-Packing Problems

Autor: Tak Ming Chan, J. M. Valério de Carvalho, Elsa Silva, Filipe Pereira e Alvelos

Publikováno v: Intelligent Systems ISBN: 9781315218427

This paper proposes a heuristic with stochastic neighborhood structures (SNS) to solve two-stage and three-stage two-dimensional guillotine bin packing and cutting stock problems. A solution is represented as a sequence of items which are packed into

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc964245569fb7ff79a51af8dedc77bb
https://doi.org/10.1201/9781315218427-27

Skewed general variable neighborhood search for the location routing scheduling problem

Autor: Cláudio Alves, Saïd Hanafi, Bruna Ramos, Bassem Jarboui, J. M. Valério de Carvalho, Rita Macedo, Nenad Mladenović

Publikováno v: Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Computers and Operations Research
Computers and Operations Research, 2015, 61, pp.143-152. ⟨10.1016/j.cor.2015.03.011⟩
Computers and Operations Research, Elsevier, 2015, 61, pp.143-152. ⟨10.1016/j.cor.2015.03.011⟩
MIC'2015, The 11th edition of the Metaheuristics International Conference
MIC'2015, The 11th edition of the Metaheuristics International Conference, Jun 2015, Agadir, Morocco. pp.143-152, ⟨10.1016/j.cor.2015.03.011⟩

The integrated location routing scheduling problem is a variant of the well-known location routing problem. The location routing problem consists in selecting a set of depots to open and in building a set of routes from these depots, to serve a set o

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eee8a3641846a12fd669cea72cff226e
https://doi.org/10.1016/j.cor.2015.03.011

An integer programming model for the Minimum Interval Graph Completion Problem

Autor: J. M. Valério de Carvalho, Isabel Cristina Lopes

Publikováno v: Electronic Notes in Discrete Mathematics. 36:583-590

The minimum interval graph completion problem consists of, given a graph G = ( V , E ) , finding a supergraph H = ( V , E ∪ F ) that is an interval graph, while adding the least number of edges | F | . We present an integer programming formulation

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::3a942bd04b54fdc50660d5a4c6209204
https://doi.org/10.1016/j.endm.2010.05.074

Theoretical investigations on maximal dual feasible functions

Autor: Cláudio Alves, Jürgen Rietz, J. M. Valério de Carvalho

Publikováno v: Operations Research Letters. 38:174-178

Dual feasible functions are used to get valid inequalities and lower bounds for integer linear problems. In this paper, we provide a simpler proof for maximality, and we describe new results concerning the extremality of functions from the literature

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::9e676ce4a7b9a414d8c5bbc16c206788
https://doi.org/10.1016/j.orl.2010.01.002

Solving a Multiprocessor Problem by Column Generation and Branch-and-price

Autor: J. M. Valério de Carvalho, António J.S.T. Duarte

Publikováno v: IFAC Proceedings Volumes. 43:34-39

This work presents an algorithm for solving exactly a scheduling problem with identical parallel machines and malleable tasks, subject to arbitrary release dates and due dates. The objective is to minimize a function of late work and setup costs. A t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::db056dcb63997efe4842209bde24ef78
https://doi.org/10.3182/20100908-3-pt-3007.00010