Designing difficult office space allocation problem instances with mathematical programming

QR Code

Designing difficult office space allocation problem instances with mathematical programming

Office space allocation (OSA) refers to the assignment of 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 constraints. In this paper, a mathematical programming approach is developed to model and...

Full description

Bibliographic Details
Main Authors:	Ulker, Ozgur, Landa-Silva, Dario
Format:	Conference or Workshop Item
Published:	Springer-Verlag 2011
Subjects:	Space planning problem formulation mathematical programming exact algorithms
Online Access:	https://eprints.nottingham.ac.uk/32608/

Similar Items

A 0/1 integer programming model for the office space allocation problem
by: Ulker, Ozgr, et al.
Published: (2010)

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

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

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

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

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

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)

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

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

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

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

A new exact penalty method for semi-infinite programming problems
by: Lin, Qun, 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)

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

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

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)

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

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

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

Computational studies of some fuzzy mathematical problems
by: Remias, Michael George
Published: (2012)

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

Mixed integer programming with decomposition for 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)

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

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

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)

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)

An outlook: parking space in the federal administration centre of Putrajaya / Irmawati Abdul Majid
by: Abdul Majid, Irmawati
Published: (2010)

Crossover control in selection hyper-heuristics: case studies using MKP and HyFlex
by: Drake, John H.
Published: (2014)

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

Public Spaces and Public Life in Perth: Report for the Government of Western Australia and the City of Perth.
by: Gehl, Jan.
Published: (1994)

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

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

Heuristic decomposition and mathematical programming for workforce scheduling and routing problems
by: Laesanklang, Wasakorn
Published: (2017)

Linear-pso with binary search algorithm for DNA motif discovery / Hazaruddin Harun
by: Harun, Hazaruddin
Published: (2015)