Izvorni znanstveni članak
https://doi.org/10.17535/crorr.2015.0032
Finding an optimal seating arrangement for employees
Ninoslav Čerkez
orcid.org/0000-0003-1284-481X
; IN2 d.o.o., Zagreb, Hrvatska
Rebeka Čorić
orcid.org/0000-0002-2388-385X
; Odjel za matematiku, Sveučilište Josipa Jurja Strossmayera, Osijek, Hrvatska
Mateja Đumić
orcid.org/0000-0001-8980-6315
; Odjel za matematiku, Sveučilište Josipa Jurja Strossmayera, Osijek, Hrvatska
Domagoj Matijević
; Odjel za matematiku, Sveučilište Josipa Jurja Strossmayera, Osijek, Hrvatska
Sažetak
The paper deals with modelling a specifc problem called the Optimal Seating Arrangement (OSA) as an Integer Linear Program and demonstrated that the problem can be efficiently solved by combining branch-and-bound and cutting plane methods. OSA refers to a specific scenario that could possibly happen in a corporative environment, i.e. when a company endeavors to minimize travel costs when employees travel to an organized event. Each employee is free to choose the time to travel to and from an event and it depends on personal reasons. The paper differentiates between using different travel possibilities in the OSA problem, such as using company assigned or a company owned vehicles, private vehicles or using public transport, if needed. Also, a user-friendly web application was made and is available to the public for testing purposes.
Ključne riječi
Integer Linear Program; branch and bound; cutting plane method
Hrčak ID:
148271
URI
Datum izdavanja:
31.10.2015.
Posjeta: 2.178 *