Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Jonatas B. C. Chagas"'
Autor:
Markus Wagner, Jonatas B. C. Chagas
Publikováno v:
Optimization Letters. 16:2313-2331
We tackle the Thief Orienteering Problem (ThOP), an academic multi-component problem that combines two classical combinatorial problems, namely the Knapsack Problem and the Orienteering Problem. In the ThOP, a thief has a time limit to steal items th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f242b6927edd47414a1e50d0ab66c8ab
https://doi.org/10.1007/s11590-021-01824-y
https://doi.org/10.1007/s11590-021-01824-y
Autor:
Jonatas B. C. Chagas, Markus Wagner
Publikováno v:
Operations Research Letters. 48:708-714
The Thief Orienteering Problem (ThOP) is a multi-component problem that combines features of two classic combinatorial optimization problems: Orienteering Problem and Knapsack Problem. The ThOP is challenging due to the given time constraint and the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::336f81b6747cca9a6226a5e01eda5884
https://doi.org/10.1016/j.orl.2020.08.011
https://doi.org/10.1016/j.orl.2020.08.011
Autor:
Marcone Jamilson Freitas Souza, Jonatas B. C. Chagas, Markus Wagner, Julian Blank, Kalyanmoy Deb
Publikováno v:
Journal of Heuristics. 27:267-301
In this paper, we propose a method to solve a bi-objective variant of the well-studied traveling thief problem (TTP). The TTP is a multi-component problem that combines two classic combinatorial problems: traveling salesman problem and knapsack probl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3ffa02b4d72e07bdc5364866c67fbf3
https://doi.org/10.1007/s10732-020-09457-7
https://doi.org/10.1007/s10732-020-09457-7
Autor:
Ulisses Eduardo Ferreira da Silveira, Marcone Jamilson Freitas Souza, Jonatas B. C. Chagas, Andre Gustavo dos Santos
Publikováno v:
International Transactions in Operational Research. 27:112-137
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0073ece84a67d02842bafacb033bf1d0
https://doi.org/10.1111/itor.12623
https://doi.org/10.1111/itor.12623
Publikováno v:
Pesquisa Operacional para o Desenvolvimento. 11:159-182
Este trabalho tem seu foco em um problema real de planejamento de manutencao de longo prazo para uma planta de beneficiamento de minerio de ferro no Brasil. Este e um problema complexo de programacao de ordens de manutencao preventiva, para o qual e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee3b2c920c021587dbf3d34eac84aa31
https://doi.org/10.4322/podes.2019.012
https://doi.org/10.4322/podes.2019.012
Autor:
Jonatas B. C. Chagas, André L. S. Souza, Marcone Jamilson Freitas Souza, Puca Huachi Vaz Penna
Publikováno v:
Variable Neighborhood Search ISBN: 9783030449315
ICVNS
ICVNS
In this paper, we propose a simple heuristic algorithm based on the Variable Neighborhood Search (VNS), which combines with the Set Covering strategy in order to solve the Dial-a-Ride Problem (DARP). In this problem, customers must be served by a het
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da139fd5c3da5794d1b4453d7fbeec24
https://doi.org/10.1007/978-3-030-44932-2_4
https://doi.org/10.1007/978-3-030-44932-2_4
In this paper, we introduce the Double Traveling Salesman Problem with Partial Last-In-First-Out Loading Constraints (DTSPPL). It is a pickup-and-delivery single-vehicle routing problem, where all pickup operations must be performed before any delive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d79f2e9190a704da0d1723c7a4c3d44
https://hdl.handle.net/11380/1210717
https://hdl.handle.net/11380/1210717
Autor:
Markus Wagner, Jonatas B. C. Chagas
Publikováno v:
Computers & Operations Research. 138:105560
Many real-world optimization problems have multiple interacting components. Each of these can be an NP -hard problem, and they can be in conflict with each other, i.e., the optimal solution for one component does not necessarily represent an optimal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ccee4fdb22dcb10a9be0b23eed1d049b
https://doi.org/10.1016/j.cor.2021.105560
https://doi.org/10.1016/j.cor.2021.105560
Autor:
Puca Huachi Vaz Penna, Marcone Jamilson Freitas Souza, André L. S. Souza, Jonatas B. C. Chagas
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783030166564
ISDA (1)
ISDA (1)
We propose a heuristic algorithm based on the Late Acceptance Hill-Climbing metaheuristic for solving the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous Demand (DVRPMSHD). In this problem, customers must be served by a fleet of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db68252e6bcf1dedc09697ef8236d9c4
https://doi.org/10.1007/978-3-030-16657-1_71
https://doi.org/10.1007/978-3-030-16657-1_71
Publikováno v:
CEC
This paper introduces the Thief Orienteering Problem (ThOP), a multi-component problem that combines two classic combinatorial problems: Orienteering Problem (OP) and Knapsack Problem (KP). In this problem, a person (called the thief) carries a capac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ceac9680aaddbc7758c963305ef1619
https://doi.org/10.1109/cec.2018.8477853
https://doi.org/10.1109/cec.2018.8477853