A 0/1 integer programming model for the office space allocation problem

QR Code

A 0/1 integer programming model for the office space allocation problem

We propose a 0/1 integer programming model to tackle the office space allocation (OSA) problem which refers to assigning room space to a set of entities (people, machines, roles, etc.), with the goal of optimising the space utilisation while satisfying a set of additional requirements. In the propos...

Full description

Bibliographic Details
Main Authors:	Ulker, Ozgr, Landa-Silva, Dario
Format:	Article
Published:	Elsevier 2010
Subjects:	space planning problem formulation mathematical programming exact algorithms
Online Access:	https://eprints.nottingham.ac.uk/35596/

Similar Items

Designing difficult office space allocation problem instances with mathematical programming
by: Ulker, Ozgur, et al.
Published: (2011)

Evolutionary local search for solving the office space allocation problem
by: Ulker, Ozgur, et al.
Published: (2012)

Extended decomposition for mixed integer programming to solve a workforce scheduling and routing problem
by: Laesanklang, Wasakorn, et al.
Published: (2015)

Computational study for workforce scheduling and routing problems
by: Castillo-Salazar, J. Arturo, et al.
Published: (2014)

Office space allocation by using mathematical programming and meta-heuristics
by: Ulker, Ozgur
Published: (2013)

Nature of real-world multi-objective vehicle routing with evolutionary algorithms
by: Castro-Gutierrez, Juan, et al.
Published: (2011)

Decomposition techniques with mixed integer programming and heuristics for home healthcare planning
by: Laesanklang, Wasakorn, et al.
Published: (2017)

Mixed integer programming with decomposition to solve a workforce scheduling and routing problem
by: Laesanklang, Wasakorn, et al.
Published: (2015)

Lookahead policy and genetic algorithm for solving nurse rostering problems
by: Shi, Peng, et al.
Published: (2018)

Metaheuristic and Multiobjective Approaches for Space Allocation
by: Landa Silva, Jesus Dario
Published: (2003)

Mixed integer programming with decomposition for workforce scheduling and routing with time-dependent activities constraints
by: Laesanklang, Wasakorn, et al.
Published: (2016)

An agent based modelling approach for the office space allocation problem
by: Dediu, Alexandra, et al.
Published: (2018)

An exact penalty function method for nonlinear mixed discrete programming problems
by: Changjun, Y., et al.
Published: (2013)

Models, solution methods and threshold behaviour for the teaching space allocation problem
by: Beyrouthy, Camille
Published: (2008)

A new exact penalty method for semi-infinite programming problems
by: Lin, Qun, et al.
Published: (2014)

A two-stage stochastic mixed-integer program modelling and hybrid solution approach to portfolio selection problems
by: He, Fang, et al.
Published: (2014)

The capacity-C torch problem
by: Backhouse, Roland, et al.
Published: (2015)

Diversity-based adaptive genetic algorithm for a workforce scheduling and routing problem
by: Algethami, Haneen, et al.
Published: (2017)

Dynamic programming with approximation function for nurse scheduling
by: Shi, Peng, et al.
Published: (2016)

Optimizing tree planting areas through integer programming and improved genetic algorithm
by: Md Badarudin, Ismadi
Published: (2012)

Multi-stage hyper-heuristics for optimisation problems
by: Kheiri, Ahmed
Published: (2014)

A study of genetic operators for the Workforce Scheduling and Routing Problem
by: Algethami, Haneen, et al.
Published: (2015)

Exploiting structure in integer programs
by: Mareček, Jakub
Published: (2012)

Workforce scheduling and routing problems: literature survey and computational study
by: Castillo-Salazar, J. Arturo, et al.
Published: (2016)

An exact penalty method for free terminal time optimal control problem with continuous inequality constraints
by: Jiang, Canghua, et al.
Published: (2012)

The implementation of case formulation by probation officers: service user and carer views
by: Brown, Susan, et al.
Published: (2016)

Towards an efficient API for optimisation problems data
by: Pinheiro, Rodrigo Lankaites, et al.
Published: (2016)

Towards an efficient API for optimisation problems data
by: Pinheiro, Rodrigo Lankaites, et al.
Published: (2016)

Evolutionary multi-objective optimization algorithms with probabilistic representation based on pheromone trails
by: Li, Hui, et al.
Published: (2010)

Solving single and bi-objective surgery scheduling problems using local search heuristic
by: Ab Rashid, Nur Shafiqah
Published: (2021)

Heuristic algorithms for routing problems.
by: Chong, Yen N.
Published: (2001)

An investigation of heuristic decomposition to tackle workforce scheduling and routing with time-dependent activities constraints
by: Laesanklang, Wasakorn, et al.
Published: (2016)

An investigation of heuristic decomposition to tackle workforce scheduling and routing with time-dependent activities constraints
by: Laesanklang, Wasakorn, et al.
Published: (2017)

A study of evolutionary multiobjective algorithms and their application to knapsack and nurse scheduling problems
by: Le, Khoi Nguyen
Published: (2011)

Selected pursuit and evasion differential game problems in Hilbert space
by: Ja'afaru, Abbas Badakaya
Published: (2012)

Functional programming and non-distributivity in pathfinding problems
by: Saenz Carrasco, Juan Carlos
Published: (2016)

Iterative methods for solving split common fixed point problems in Hilbert spaces
by: Mohammed, Lawan Bulama
Published: (2016)

A Genetic Algorithm for a Workforce Scheduling and Routing Problem
by: Algethami, Haneen, et al.
Published: (2016)

Distributed proximal-gradient methods for convex optimization with inequality constraints
by: Li, J., et al.
Published: (2014)

An optimized test case generation technique for enhancing state-sensitivity partitioning
by: Sultan, Ammar Mohammed Dawood
Published: (2017)